Sciweavers

346 search results - page 59 / 70
» Routing networks for distributed hash tables
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
SIGMETRICS
2005
ACM
100views Hardware» more  SIGMETRICS 2005»
14 years 1 months ago
On AS-level path inference
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
Zhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang
INFOCOM
2003
IEEE
14 years 28 days ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
INFOCOM
2003
IEEE
14 years 28 days ago
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...
Prasanna Ganesan, Qixiang Sun, Hector Garcia-Molin...
INFOCOM
2003
IEEE
14 years 28 days ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid