Sciweavers

365 search results - page 49 / 73
» Fast construction of overlay networks
Sort
View
NETGAMES
2003
ACM
15 years 5 months ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
IM
2007
14 years 11 months ago
A Service Middleware that Scales in System Size and Applications
We present a peer-to-peer service management middleware that dynamically allocates system resources to a large set of applications. The system achieves scalability in number of no...
Constantin Adam, Rolf Stadler, Chunqiang Tang, Mal...
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 6 months ago
Application-Aware Topology Formation Algorithm for Peer-to-Peer Networks
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
Kin Wah Kwong, Danny H. K. Tsang
ICPP
2005
IEEE
15 years 5 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
100
Voted
ICUMT
2009
14 years 9 months ago
Experimental study on neighbor selection policy for Phoenix Network Coordinate system
Network Coordinate (NC) which provides efficient distance prediction with scalable measurements, brings benefits to various network applications. Phoenix Network Coordinate system ...
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng,...