skip to main content
poster

Revisiting next-hop selection in multipath networks

Published:15 August 2011Publication History
Skip Abstract Section

Abstract

Multipath routing strategies such as Equal-Cost MultiPath (ECMP) are widely used in IP and data-center networks. Most current methods to balance packets over the multiple next hops toward the destination base their decision on a hash computed over selected fields of the packet headers. Because of the non-invertible nature of hash functions, it is hard to determine the values of those fields so as to make the packet follow a specific path in the network. However, several applications might benefit from being able to choose such a path. Therefore, we propose a novel next-hop selection method based on an invertible function. By encoding the selection of successive routers into common fields of packet headers, the proposed method enables end hosts to force their packets to follow a specific path.

References

  1. B. Augustin, X. Cuvellier, B. Orgogozo, F. Viger, T. Friedman, M. Latapy, C. Magnien, and R. Teixeira. Avoiding traceroute anomalies with Paris traceroute. In Proc. ACM SIGCOMM IMC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Z. Cao, Z. Wang, and E. Zegura. Performance of Hashing-Based Schemes for Internet Load Balancing. In Proc. IEEE INFOCOM, 2000.Google ScholarGoogle Scholar
  3. C. Raiciu, C. Pluntke, S. Barre, A. Greenhalgh, D. Wischik, and M. Handley. Data Center Networking with Multipath TCP. In Proc. ACM SIGCOMM HotNets Workshop, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Shannon, E. Aben, K. Claffy, and D. Andersen. The CAIDA Anonymized 2008 Internet Traces -- 2008-07-17 12:59:07 -- 2008-07-17 14:01:00.Google ScholarGoogle Scholar

Index Terms

  1. Revisiting next-hop selection in multipath networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 41, Issue 4
        SIGCOMM '11
        August 2011
        480 pages
        ISSN:0146-4833
        DOI:10.1145/2043164
        Issue’s Table of Contents
        • cover image ACM Conferences
          SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference
          August 2011
          502 pages
          ISBN:9781450307970
          DOI:10.1145/2018436

        Copyright © 2011 Copyright is held by the owner/author(s)

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 15 August 2011

        Check for updates

        Qualifiers

        • poster

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader