Internet routing instability

Labovitz, Craig; Malan, G.R.; Jahanian, Farnam

doi:10.1145/263105.263151

Cited by 236 publications

(78 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The effectiveness of TERCs depends on the Internet routing stability during the connection lifetime of an HTTP session. Our measurements (see Section V-B-4) and results by others [30], [24] suggest that for the short duration of an HTTP connection, routing is mostly stable.…”

Section: Introductionsupporting

confidence: 62%

See 1 more Smart Citation

The cache location problem

Krishnan¹,

Raz²,

Shavitt³

2000

IEEE/ACM Trans. Networking

312

227

View full text Add to dashboard Cite

This paper studies the problem of where to place network caches. Emphasis is given to caches that are transparent to the clients since they are easier to manage and they require no cooperation from the clients. Our goal is to minimize the overall flow or the average delay by placing a given number of caches in the network.We formulate these location problems both for general caches and for transparent en-route caches (TERCs), and identify that, in general, they are intractable. We give optimal algorithms for line and ring networks, and present closed form formulae for some special cases. We also present a computationally efficient dynamic programming algorithm for the single server case.This last case is of particular practical interest. It models a network that wishes to minimize the average access delay for a single web server. We experimentally study the effects of our algorithm using real web server data. We observe that a small number of TERCs are sufficient to reduce the network traffic significantly. Furthermore, there is a surprising consistency over time in the relative amount of web traffic from the server along a path, lending a stability to our TERC location solution. Our techniques can be used by network providers to reduce traffic load in their network.

show abstract

Section: Introductionsupporting

confidence: 62%

“…By placing caches [30] suggest that most routes remain stable over the small lifetime of an HTTP connection. Labovitz et al [24] studied Border Gateway Protocol (BGP) route changes and concluded, similarly, that in reality, Internet routing is stable. They found that 80% of the routes change at a frequency lower than once a day.…”

Section: ) Stabilitymentioning

confidence: 92%

The cache location problem

Krishnan¹,

Raz²,

Shavitt³

2000

IEEE/ACM Trans. Networking

312

227

View full text Add to dashboard Cite

show abstract

“…A similar argument can be made in the case of [10], where lookups are accelerated using memory placement and pipelining. Some protocol-based solutions have emerged ( [5], [6], [4], [7], [8], [9]), but all of these demand modifications to the current Internet Protocol and raise the complexity of routing without completely avoiding the prefix matching problem.…”

Section: A Related Researchmentioning

confidence: 99%

Adaptive data structures for IP lookups

Ioannidis

Grama

Atallah

2005

ACM J. Exp. Algorithmics

View full text Add to dashboard Cite

Abstract-The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this paper, we address the problem of generalizing LC tries and Extensible Hashing, based on traces of past lookups, to provide performance guarantees for memory sub-optimal structures. As a specific example, if a memory-optimal (LC) trie takes 6MB and the total memory at the router is 8MB, how should the trie be modified to make best use of the 2 MB of excess memory? We present a greedy algorithm for this problem and prove that, if for the optimal data structure there are b fewer memory accesses on average for each lookup compared with the original trie, the solution produced by the greedy algorithm will have 9×b 22 fewer memory accesses on average (compared to the original trie). An efficient implementation of this algorithm presents significant additional challenges. We describe an implementation with a time complexity of O(ξ(d)n × log n) and a space complexity of O(n), where n is the number of nodes of the trie and d its depth. The depth of a trie is fixed for a given version of the Internet protocol and is typically O(log n). In this case, ξ(d) = O(log2 n). We demonstrate experimentally the performance and scalability of the algorithm on actual routing data. We also show that our algorithm significantly outperforms Extensible Hashing for the same amount of memory.

show abstract

“…When the message loss probability is very low or uncommon, they can give a very high degree of reliability. But, failure scenarios such as router overload and system-wide noise which are known to be common in Internet protocols can cause these protocols to behave pathologically [15,25].…”

Section: Introductionmentioning

confidence: 99%

Performance study of a probabilistic multicast transport protocol

Özkasap

2004

Performance Evaluation

View full text Add to dashboard Cite

Traditional reliable multicast protocols depend on assumptions about flow control and reliability mechanisms, and they suffer from a kind of interference between these mechanisms. This in turn affects the overall performance, throughput and scalability of group applications utilizing these protocols. However, there exists a substantial class of distributed applications for which the throughput stability and scalability guarantees are indispensable. Bimodal Multicast (Pbcast) is a new option in scalable reliable multicast protocols that uses an inverted protocol stack approach, in which probabilistic mechanisms are used at low layers, and reliability properties introduced closer to the application. The main contributions of this study are development of simulation models for performance evaluation of Bimodal Multicast, demonstration of how the inverted protocol stack approach works well on several network settings, and its comparison with best-effort reliable multicast mechanisms. Analysis results reveal that Bimodal Multicast, together with optimizations for improving its latency and reliability characteristics, scales well, exhibits stable throughput and in contrast to the other scalable reliable multicast mechanisms it gives predictable reliability even under highly perturbed conditions.

show abstract

Internet routing instability

Cited by 236 publications

References 7 publications

The cache location problem

The cache location problem

Adaptive data structures for IP lookups

Performance study of a probabilistic multicast transport protocol

Contact Info

Product

Resources

About