Sciweavers

SIGCOMM
2005
ACM
15 years 2 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
SIGCOMM
2005
ACM
15 years 2 months ago
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practica...
Martin Heusse, Franck Rousseau, Romaric Guillier, ...
SIGCOMM
2005
ACM
15 years 2 months ago
One more bit is enough
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end cong...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica...
89
Voted
SIGCOMM
2005
ACM
15 years 2 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
SIGCOMM
2005
ACM
15 years 2 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
Communications
Top of PageReset Settings