Sciweavers

5079 search results - page 655 / 1016
» Hidden-Action in Network Routing
Sort
View
MOBIHOC
2002
ACM
16 years 6 months ago
Comparison of broadcasting techniques for mobile ad hoc networks
Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering i...
Brad Williams, Tracy Camp
INFOCOM
2005
IEEE
16 years 11 days ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
P2P
2009
IEEE
114views Communications» more  P2P 2009»
16 years 1 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
ICPP
2007
IEEE
16 years 1 months ago
Towards Location-aware Topology in both Unstructured and Structured P2P Systems
A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such ...
Tongqing Qiu, Guihai Chen, Mao Ye, Edward Chan, Be...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 22 days ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden