Results 1 - 10 of 1,922

On the Treeness of Internet Latency and Bandwidth

by Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian Kuhn, Mahesh Balakrishnan, Archit Gupta, Aditya Akella - SIGMETRICS/PERFORMANCE , 2009
"... Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Internet measures—latency and bandwidth—approximate tree metrics. We evaluate our ability to model end-to-end measures using t ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Internet measures—latency and bandwidth—approximate tree metrics. We evaluate our ability to model end-to-end measures using

A Distributed Measurement Scheme for Internet Latency Estimation

by Negar Hariri, Behnoosh Hariri, Shervin Shirmohammadi
"... Abstract—Estimating latency between the hosts in the Internet can play a significant role in the improvement of the performance of many services that use latency among hosts to make routing decisions. A popular example is peer to peer networks that need to build an overlay between peers in a way tha ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract—Estimating latency between the hosts in the Internet can play a significant role in the improvement of the performance of many services that use latency among hosts to make routing decisions. A popular example is peer to peer networks that need to build an overlay between peers in a way

pcp: Internet Latency Estimation using CDN Replicas

by Samuel Micka, Utkarsh Goel, Hanlu Ye, Mike P. Wittie, Brendan Mumey
"... Abstract—Interactive mobile Internet applications have be-come increasingly common and necessary to perform everyday tasks such as augmented reality, online gaming, video chat, and cloud-based voice recognition. These applications speed up their communications by connecting users to the closest serv ..."
Abstract - Add to MetaCart
the responsiveness of interactive Internet applications. Index Terms—latency estimation, server selection, P2P cluster-ing, network coordinate systems

A Hierarchical Internet Object Cache

by Anawat Chankhunthod , Peter B. Danzig, Chuck Neerdaels, Michael F. Schwartz, Kurt J. Worrell - IN PROCEEDINGS OF THE 1996 USENIX TECHNICAL CONFERENCE , 1995
"... This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits of hierarch ..."
Abstract - Cited by 496 (6 self) - Add to MetaCart
This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits

A Scalable Content-Addressable Network

by Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - IN PROC. ACM SIGCOMM 2001 , 2001
"... Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infra ..."
Abstract - Cited by 3371 (32 self) - Add to MetaCart
infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.

Vivaldi: A Decentralized Network Coordinate System

by Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris - In SIGCOMM , 2004
"... 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 unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract - Cited by 602 (4 self) - Add to MetaCart
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 unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a

Resilient Overlay Networks

by David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris , 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s wide-area routing protocols that take at least several minutes to recover. A R ..."
Abstract - Cited by 1160 (31 self) - Add to MetaCart
in the Internet. Furthermore, RON was able to improve the loss rate, latency, or throughput perceived by data transfers; for example, about 5 % of the transfers doubled their TCP throughput and 5 % of our transfers saw their loss probability reduced by 0.05. We found that forwarding packets via at most one

Scalable Application Layer Multicast

by Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy , 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract - Cited by 731 (21 self) - Add to MetaCart
delivery trees with desirable properties. We present extensive simulations of both our protocol and the Narada application-layer multicast protocol over Internet-like topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25%), improved or similar

Principled design of the modern web architecture

by Roy T. Fielding, Richard N. Taylor - ACM Trans. Internet Techn
"... The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internet-scale distributed hypermedia system. The modern Web architecture emphasizes scalability of component interactions, generality of interfaces, independent deployment of c ..."
Abstract - Cited by 531 (14 self) - Add to MetaCart
The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internet-scale distributed hypermedia system. The modern Web architecture emphasizes scalability of component interactions, generality of interfaces, independent deployment

Delayed internet routing convergence

by Craig Labovitz, Abha Ahuja, Abhijit Bose, Farnam Jahanian - ACM SIGCOMM Computer Communication Review , 2000
"... Abstract—This paper examines the latency in Internet path failure, failover, and repair due to the convergence properties of interdomain routing. Unlike circuit-switched paths which exhibit failover on the order of milliseconds, our experimental mea-surements show that interdomain routers in the pac ..."
Abstract - Cited by 408 (5 self) - Add to MetaCart
Abstract—This paper examines the latency in Internet path failure, failover, and repair due to the convergence properties of interdomain routing. Unlike circuit-switched paths which exhibit failover on the order of milliseconds, our experimental mea-surements show that interdomain routers
Results 1 - 10 of 1,922