Journal ArticleDOI
Scalable routing overlay networks
TLDR
This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network, and shows that constructing a sparser routing mesh on the topology -aware routingMesh---rather than directly on the Internet---itself benefit, which improves the resilience of the resulting routing mesh.Abstract:
Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh: the route-selection algorithm considers only those virtual links inter-node links in an overlay---in the routing mesh rather than all N2 virtual links connecting an N-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead.This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanti es the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh---rather than directly on the Internet---itself benefit,; from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.read more
Citations
More filters
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces: Technical Report
TL;DR: These findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.
Proceedings ArticleDOI
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
TL;DR: In this article, the authors show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces, which facilitates maximally efficient greedy forwarding in complex networks, and suggest that forwarding information through complex networks such as the Internet is possible without the overhead of existing routing protocols.
Patent
Hierarchical and exact fastest path computation in time-dependent spatial networks
Ugur Demiryurek,Cyrus Shahabi +1 more
TL;DR: In this article, the exact and approximate techniques for path computation in time-dependent spatial networks are presented, where the arrival-time to an edge determines the actual travel-time on the edge.
Journal ArticleDOI
Big Data for Autonomic Intercontinental Overlays
TL;DR: A machine learning-based scheme is developed that exploits large scale data collected from communicating node pairs in a multihop overlay network that uses IP between the overlay nodes, and selects paths that provide substantially better QoS than IP.
Journal ArticleDOI
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
TL;DR: These findings suggest that forwarding information through complex networks, such as the Internet, is possible without the overhead of existing routing protocols, and may also find practical applications in overlay networks for tasks such as application-level routing, information sharing, and data distribution.
References
More filters
Proceedings Article
A case for end system multicast
TL;DR: The potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred and the results indicate that the performance penalties are low both from the application and the network perspectives.
Proceedings ArticleDOI
Modeling TCP throughput: a simple model and its empirical validation
TL;DR: In this article, the authors developed a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send.
Proceedings ArticleDOI
Resilient overlay networks
TL;DR: It is found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases, demonstrating the benefits of moving some of the control over routing into the hands of end-systems.
Domain names - implementation and specification
TL;DR: This RFC is the revised specification of the protocol and format used in the implementation of the Domain Name System and it obsoletes RFC-883.
Journal ArticleDOI
Resilient overlay networks
TL;DR: It is found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases, demonstrating the benefits of moving some of the control over routing into the hands of end-systems.