Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
Frank Dabek, Russ Cox, M. Frans Kaashoek, Robert M...
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute rangebased searches. Mercury differs from previous range-based query systems in that...
Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Ses...
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature ...
Hari Balakrishnan, Karthik Lakshminarayanan, Sylvi...
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
The limitations of BGP routing in the Internet are often blamed for poor end-to-end performance and prolonged connectivity interruptions. Recent work advocates using overlays to e...
Aditya Akella, Jeffrey Pang, Bruce M. Maggs, Srini...
This paper analyzes the causes of packet loss in a 38-node urban multi-hop 802.11b network. The patterns and causes of loss are important in the design of routing and errorcorrect...
Daniel Aguayo, John C. Bicket, Sanjit Biswas, Glen...