Akihiro Nakao
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.
- Fixed Orbit. http://www.fixedorbit.com/.Google Scholar
- Packet Clearing House. http://www.pch.net.Google Scholar
- Route Views Project. http://antc.uoregon.edu/route-views/.Google Scholar
- D. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient Overlay Networks. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), pages 131--145, Chateau Lake Louise, Banff, Alberta, Canada, October 2001. Google ScholarDigital Library
- S. Banerjee, T. G. Griffin, and M. Pias. The Interdomain Connectivity of PlanetLab Nodes. In Proceedings of the Passive and Active Measurement Workshop (PAM2004), Antibes Juan-les-Pins, France, April 2004.Google ScholarCross Ref
- M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. SplitStream: High-bandwidth Multicast In Cooperative Environments. In Proceedings of the nineteenth ACM symposium on Operating systems principles, pages 298--313. ACM Press, 2003. Google ScholarDigital Library
- Y.-H. Chu, S. G. Rao, S. Seshan, and H. Zhang. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture. In Proceedings of the ACM SIGCOMM Conference, pages 1--12, August 2001. Google ScholarDigital Library
- Y.-H. Chu, S. G. Rao, and H. Zhang. A Case For End System Multicast. In Proceedings of the ACM SIGCOMM Conference, pages 1--12, June 2000. Google ScholarDigital Library
- M. Costa, M. Castro, A. Rowstron, and P. Key. PIC: Practical Internet Coordinates for Distance Estimation. In In Proceedings of the 24th International Conference on Distributed Computing Systems 2004, March 2004. Google ScholarDigital Library
- Dexter C. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, 1992. Google ScholarDigital Library
- S. Floyd, M. Handley. J. Padhye, and J. Widmer. Equation-based Congestion Control for Unicast Applications. In Proceedings of the ACM SIGCOMM, pages 43--56, 2000. Google ScholarDigital Library
- P. Francis, S. Jamin, C. Jin, Y. Jin, V. Paxson, D. Raz, Y. Shavitt, and L. Zhang. IDMaps: A Global Internet Host Distance Estimation Service. In Proceedings of the IEEE INFOCOM Conference, 1999.Google Scholar
- L. Gao. On Inferring Autonomous System Relationships in the Internet. In Proceedings of IEEE Global Internet Symposium, November 2000.Google Scholar
- J. Jannotti, D. Gifford, K. Johnson, M. Kaashoek, and J. Jr. Overcast: Reliable Multicasting with an Overlay Network. In Proceedings of the Fourth USENIX Symposium on Operating System Design and Implementation (OSDI), October 2000. Google ScholarDigital Library
- D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh. In Proceedings of the 19th ACM symposium on Operating Systems Principles (SOSP), pages 282--297. ACM Press, 2003. Google ScholarDigital Library
- C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed Internet Routing Convergence. In Proceedings of the ACM SIGCOMM Conference, pages 175--187, 2000. Google ScholarDigital Library
- H. Lim, J. C. Hou, and C.-H. Choi. Constructing Internet Coordinate System Based on Delay Measurement. In Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement, pages 129--142. ACM Press, 2003. Google ScholarDigital Library
- Z. M. Mao, J. Rexford, J. Wang, and R. Katz. Towards an Accurate AS-Level Traceroute Tool. In Proceedings of the ACM SIGCOMM 2003 Conference, August 2003. Google ScholarDigital Library
- A. Nakao, L. Peterson, and A. Bavier. A Routing Underlay for Overlay Networks. In Proceedings of the ACM SIGCOMM 2003 Conference, August 2003. Google ScholarDigital Library
- T. S. E. Ng and H. Zhang. Predicting Internet Network Distance with Coordinates-Based Approaches. In Proceedings of the IEEE INFOCOM Conference, June 2002.Google ScholarCross Ref
- J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP throughput: A simple model and its empirical validation. In ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, pages 303--314, Vancouver, CA, 1998. Google ScholarDigital Library
- V. N. Padmanabhan and L. Subramanian. An investigation of geographic mapping techniques for internet hosts. In Proceedings of the ACM SIGCOMM 2001 Conference, 2001. Google ScholarDigital Library
- S. R. Paul Francis. Your Own Internet Distribution, 2001. http://www.aciri.org/yoid/.Google Scholar
- L. Peterson, T. Anderson, D. Culler, and T. Roscoe. A Blueprint for Introducing Disruptive Technology into the Internet. In Proceedings of the HotNets-I, 2002.Google Scholar
- M. Pias. J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for Scalable Distributed Location. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, February 2003.Google ScholarCross Ref
- Y. Rekhter and T. Li. A Border Gateway Protocol 4, March 1995. RFC 1771. Google ScholarDigital Library
- S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan. Detour: A Case for Informed Internet Routing and Transport. IEEE Micro, 19(1):50--59, January 1999. Google ScholarDigital Library
- J. L. Sobrinho. Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet. IEEE/ACM Transactions on Networking, 10(4):541--550, 2002. Google ScholarDigital Library
- N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP Topologies with Rocketfuel. In Proceedings of the ACM SIGCOMM Conference, pages 133--145, August 2002. Google ScholarDigital Library
- I. Stoica, D. Adkins, S. Zhuang. S. Shenker, and S. Surana. Internet Indirection Infrastructure. In Proceedings of the ACM SIGCOMM Conference, pages 73--85, August 2002. Google ScholarDigital Library
- L. Tang and M. Crovella. Virtual Landmarks for the Internet. In Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement, pages 143--152. ACM Press, 2003. Google ScholarDigital Library
- A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, and R. Y. Wang. Overlay Mesh Construction Using Interleaved Spanning Trees. In Proceedings of the IEEE INFOCOM Conference, March 2004.Google ScholarCross Ref
Index Terms
- Scalable routing overlay networks
Recommendations
A routing underlay for overlay networks
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsWe argue that designing overlay services to independently probe the Internet--with the goal of making informed application-specific routing decisions--is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. ...
Scaling all-pairs overlay routing
CoNEXT '09: Proceedings of the 5th international conference on Emerging networking experiments and technologiesThis paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as each node incurs quadratic (n2) communication overhead to broadcast its ...
A New Routing Protocol of Structured Peer-to-Peer Overlay Networks
SEC '08: Proceedings of the 2008 Fifth IEEE International Symposium on Embedded ComputingThe routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing ...
Comments