A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Review on Peer-to-Peer Live Video Streaming Topology
2013
International Journal of Computer Applications
Preserved Fulltext
This paper talking about the simple concept of topology in p2p live video streaming and presents a review for p2p live video streaming topology, in this paper three main types of topology that most used ...
Peer-to-peer systems become a promising alternative for traditional server-client system to providing video streaming; the topology is the one of most important part of these systems. ...
Topology Name
Topology Based on
Additional Techniques
Optimized Algorithm
Mesh
Minimum-maximum k-means clustering. ...
doi:10.5120/11573-6881
fatcat:p3xrgbgvqvdmnmedivcah6kuxa
Optimal Resource Discovery Paths of Gnutella2
2008
22nd International Conference on Advanced Information Networking and Applications (aina 2008)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer ...
The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, ...
Any node in the network can start a query, which means that some of the links are traversed based on the local forwarding decisions in the network. ...
doi:10.1109/aina.2008.89
dblp:conf/aina/VapaAIKV08
fatcat:6vrvgeftpbdb7p7p7a4wskm2de
A New P2P Network Routing Algorithm Based on ISODATA Clustering Topology
2011
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Preliminary evaluation shows that RIDC achieves a good convergence on a large scale of nodes. ...
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. These routing algorithms increase the routing hops. ...
This paper presents a new routing algorithm based on ISODATA Clustering Topology (RIDC) for structured P2P overlay network. ...
doi:10.1016/j.proeng.2011.08.558
fatcat:flbpsi2owbe2lnemchvmjr533q
Research on Topology Structure Analysis of Several Interconnection Networks
2016
DEStech Transactions on Computer Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Fault-tolerant delay is one of the important parameters to measure the reliability. In this paper, it is proved that the routing selection of some graphs can achieve the minimum fault tolerance. ...
There are many indicators to evaluate the performance of an interconnection network, this paper introduces the basic methods and principles of an interconnection network, and analyzes the characteristics ...
Based on graph Cayley, we can construct the network topology which has deterministic small world characteristics, and it is a kind of P2P overlay network topology model CHC with small world characteristics ...
doi:10.12783/dtcse/cmsam2016/3594
fatcat:it2hj4vnqjcuvhghtweaxgtyrm
Using topology information for quality-aware Peer-to-Peer multilayer video streaming
2015
International Journal of Communication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Introducing network topology information into these P2P frameworks offers opportunities to enhance the performance. ...
The paper addresses the optimization problem seen from the stream provider's viewpoint, having access to network topology information. ...
The IBBT OMUS project is a project cofunded by IBBT (Interdisciplinary Institute for Technology), a research institute founded by the Flemish Government. ...
doi:10.1002/dac.2919
fatcat:rbtaoihhljbnvb7dhp7ss24tcy
A Theory-Driven Distribution Algorithm for Peer-to-Peer Real Time Streaming
2008
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
or equivalently the time required to reach a given number of nodes; ii) we proved the optimality of Streamline, a distribution algorithm based on the serial transmission over forest-based topologies, ...
The Streamline algorithm is based on some ideal assumptions that prevent its practical implementation. ...
a given time interval or equivalently the time required to reach a given number of nodes; ii) we proved the optimality of Streamline, a distribution algorithm based on the serial transmission over forest-based ...
doi:10.1109/glocom.2008.ecp.441
dblp:conf/globecom/BraccialePLBBS08
fatcat:ll3a57cvd5ekbagk3dzol47dia
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
2008
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
First, we analyze the convergence time of the random walk node visitation probability distribution on common p2p network topologies. ...
Such a convergence guarantee is essential for strong analytical properties and high performance of many p2p applications. ...
We provide analytical bounds for the random walk convergence time on several common p2p network topologies: k-dimensional tori, Chord topology [43] , random powerlaw topology, and random regular topology ...
doi:10.1109/tc.2007.70837
fatcat:qncanwsmujerzfbn3qk6rzz3uq
Towards limited scale-free topology with dynamic peer participation
2016
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1607.02733v1 fatcat:ymrpxc5penfvncxg3afobcaxkm
Growth models have been proposed for constructing the scale-free overlay topology to improve the performance of unstructured peer-to-peer (P2P) networks. ...
However, previous growth models are able to maintain the limited scale-free topology when nodes only join but do not leave the network; the case of nodes leaving the network while preserving a precise ...
In this algorithm, a new node broadcasts a message when it joins the network using computing with time principle [20] . ...
doi:10.1016/j.comnet.2016.06.019
fatcat:ayftqvpktzhjfpqttfpk2cka5y
Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks
2009
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Topological characteristics have profound impact on the efficiency of a search on such unstructured P2P networks, as well as other networks. ...
In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store a large number of entries for construction of the overlay topology. ...
The NF search algorithm is based on the minimum degree in the network. ...
doi:10.1109/tpds.2008.150
fatcat:aig2sycwwzas3iomc46n4it5mq
Study of Two-level P2P Model on Self-adaptive Dynamic Network
2010
Modern Applied Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Super peers compose to a self-adaptive Distribute Hash Table network on the top layer, and lower ordinary peers take super peer in the same group as their center server to form a cluster. ...
This study's objective was to solve the problem that the structured P2P model was not appropriate for dynamic network. A self-adaptive dynamic P2P model of two-level is proposed. ...
CHEN H h(2006) proposed Semre X, a Semantic Similarity Based P2P Overlay Networks. ...
doi:10.5539/mas.v4n7p59
fatcat:7xrj3ickcvbbxbdxpw7bezx6mm
State-of-the-art survey on P2P overlay networks in pervasive computing environments
2015
Journal of Network and Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
P2P overlay networks have attracted significant research interest due to their utility as virtualized abstractions of complex network infrastructures, optimized to satisfy specific criteria, e.g. minimum ...
In this paper we review related research on P2P (peer-to-peer) overlay networks in pervasive environments. ...
ACO principles are exploited to ensure optimization of node connections in the P2P overlay topology in a fully decentralized and distributed manner. ...
doi:10.1016/j.jnca.2015.04.014
fatcat:7uruzbtonnb2phxibpxpt2ez4e
Adapting peer-to-peer topologies to improve system performance
2004
37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Since the effectiveness of any routing protocol is dependent on the P2P overlay network's interconnection topology, simultaneously controlling the network topology should enable performance enhancements ...
We adapt topologies using operations of edge thinning, the removal of redundant links based on message passing utilities, and diameter folding, the selective addition of short-cut links between nodes at ...
The minimum path lengths gave us a gauge on the average search time as well as the maximum search time for a query. ...
doi:10.1109/hicss.2004.1265470
dblp:conf/hicss/SilveyH04
fatcat:yigxyjfwajg3hjtkih2jvwmda4
An Adaptive Multi-channel P2P Video-on-Demand System using Plug-and-Play Helpers
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We present a multi-channel P2P Video-on-Demand (VoD) system using "plug-and-play" helpers. ...
allocation algorithm and a "soft-worst-neighbor-choking" topology-building algorithm. ...
In contrast, we propose a "soft-worstneighbor-choking" algorithm and prove its optimality. There are a number of works on practical P2P VoD system design. ...
arXiv:1011.5469v1
fatcat:j2su4kbzirgordss7t2jbyvx5q
On the performance of ACO-based methods in p2p resource discovery
2013
Applied Soft Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On the performance of ACO-based methods in p2p resource discovery. ...
On the performance of ACObased methods in p2p resource discovery. Applied Soft Computing. 13(12):4813-4831. Please cite as: Krynicki, K., Jaen, J., Mocholí, J.A. ...
Omitting of any or all of these principles is possible. Such a system would, however, suffer from lower generality and it would be incomparable to the real world p2p networks. ...
doi:10.1016/j.asoc.2013.07.022
fatcat:nn6zv6t2pzdh3ehxukjnyvnv4a
Efficient topology control of blockchain peer to peer network based on SDN paradigm
2021
Peer-to-Peer Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This new layer is responsible for building and managing the topological structure of the P2P network layer based on random r-out digraphs. ...
Then, and in order to reduce the number of connections per peer, we establish lower and minimum upper bounds on outbound and inbound connections respectively that still guarantee the P2P network feasibility ...
Hence, in our work, we focus on a structured P2P network to optimize the topology according to given network properties specifications. ...
doi:10.1007/s12083-021-01248-6
fatcat:ecpphmw4efgrncmsmdguazd2ai
« Previous
Showing results 1 — 15 out of 1,545 results