skip to main content
10.1145/1921233.1921237acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

A mutualistic resource pooling architecture

Published:30 November 2010Publication History

ABSTRACT

Parallelism pervades the Internet, yet efficiently pooling this increasing path diversity has remained elusive. We defend that the inability to progress beyond a single path paradigm is due to an inflexible resource sharing model, rather than a lack of routing solutions. The tussle between networks and hosts over resource sharing has constricted resource pooling into being redefined by stakeholders according to their own needs, often at the expense of others.

In this paper we debate existing approaches to resource pooling and present PREFLEX, an architecture where edge networks and hosts both share the burden and reap the rewards of balancing traffic over multiple paths. Using PREF (Path RE-Feedback), networks suggest outbound paths to hosts, who in turn use LEX (Loss Exposure) to signal transport layer semantics such as loss and flow start to the underlying network. By making apparent network preferences and transport expectations, PREFLEX provides a mutualistic framework where congestion control and traffic engineering can both coexist and evolve independently.

References

  1. B. Ford and J. Iyengar, "Breaking up the transport logjam," Proceedings of the 7th ACM Workshop on Hot Topics in Networks, 2008.Google ScholarGoogle Scholar
  2. H. Haddadi, D. Fay, S. Uhlig, A. Moore, R. Mortier, and A. Jamakovic, "Mixing biases: Structural changes in the as topology evolution," Traffic Monitoring and Analysis, pp. 32--45, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. Rosen, A. Viswanathan, and R. Callon, "Rfc3031: Multiprotocol label switching architecture," Internet RFCs, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Bennett, C. Partridge, and N. Shectman, "Packet reordering is not pathological network behavior," IEEE/ACM Transactions on Networking, vol. 7, no. 6, pp. 789--798, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Clark, J. Wroclawski, K. Sollins, and R. Braden, "Tussle in cyberspace: defining tomorrow's internet," IEEE/ACM Transactions on Networking, vol. 13, Jun 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Sunshine, "Source routing in computer networks," ACM SIGCOMM Computer Communication Review, vol. 7, no. 1, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. X. Yang, "NIRA: A new Internet routing architecture," ACM SIGCOMM Computer Communication Review, vol. 33, no. 4, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. X. Yang and D. Wetherall, "Source selectable path diversity via routing deflections," ACM SIGCOMM 2006, Aug 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Godfrey, I. Ganichev, S. Shenker, and I. Stoica, "Pathlet routing," ACM SIGCOMM Computer Communication Review, vol. 39, no. 4, pp. 111--122, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Saltzer, D. Reed, and D. Clark, "End-to-end arguments in system design," ACM Transactions on Computer Systems (TOCS), vol. 2, no. 4, p. 288, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Thaler and C. Hopps, "Rfc2991: Multipath issues in unicast and multicast next-hop selection," RFC Editor United States, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Elwalid, C. Jin, S. Low, and I. Widjaja, "Mate: multipath adaptive traffic engineering," Computer Networks, vol. 40, no. 6, pp. 695--709, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Kandula, D. Katabi, B. Davie, and A. Charny, "Walking the tightrope: Responsive yet stable traffic engineering," ACM SIGCOMM Computer Communication Review, vol. 35, no. 4, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Key, L. Massoulie, and P. Towsley, "Path selection and multipath congestion control," INFOCOM 2007. 26th IEEE International Conference on Computer Communications., pp. 143--151, 2007.Google ScholarGoogle Scholar
  15. F. Kelly and T. Voice, "Stability of end-to-end algorithms for joint routing and rate control," ACM SIGCOMM Computer Communication Review, vol. 35, no. 2, p. 12, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Wischik, M. Handley, and M. Braun, "The resource pooling principle," ACM SIGCOMM Computer Communication Review, vol. 38, no. 5, pp. 47--52, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. B. Briscoe, A. Jacquet, C. D. Cairano-Gilfedder, A. Salvatori, A. Soppera, and M. Koyabe, "Policing congestion response in an internetwork using re-feedback," ACM SIGCOMM Computer Communication Review, vol. 35, no. 4, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Sinha, S. Kandula, and D. Katabi, "Harnessing tcp's burstiness with flowlet switching," Proceedings of the 3rd ACM Workshop on Hot Topics in Networks, 2004.Google ScholarGoogle Scholar

Index Terms

  1. A mutualistic resource pooling architecture

            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
            • Published in

              cover image ACM Conferences
              ReARCH '10: Proceedings of the Re-Architecting the Internet Workshop
              November 2010
              78 pages
              ISBN:9781450304696
              DOI:10.1145/1921233

              Copyright © 2010 ACM

              Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 30 November 2010

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader