Sciweavers

365 search results - page 8 / 73
» Fast construction of overlay networks
Sort
View
TPDS
2008
88views more  TPDS 2008»
14 years 9 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu
ICC
2008
IEEE
114views Communications» more  ICC 2008»
15 years 4 months ago
OCals: A Novel Overlay Construction Approach for Layered Streaming
—Layered streaming in overlay networks has drawn great interests since not only can it accomodate large scales of clients but also it handles client heterogeneities. However, to ...
Xin Xiao, Yuanchun Shi, Baopeng Zhang, Yuan Gao
INFOCOM
2002
IEEE
15 years 2 months ago
Topologically-Aware Overlay Construction and Server Selection
— A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host no...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...
EDBT
2009
ACM
164views Database» more  EDBT 2009»
15 years 2 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
INFOCOM
2003
IEEE
15 years 2 months ago
Turning Heterogeneity into an Advantage in Overlay Routing
Abstract— Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay ne...
Zhichen Xu, Mallik Mahalingam, Magnus Karlsson