Skip to main content

Stable and Robust Multipath Oblivious Routing for Traffic Engineering

  • Conference paper
Managing Traffic Performance in Converged Networks (ITC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4516))

Included in the following conference series:

Abstract

Intra-domain traffic engineering is essential for the operation of an Internet Service Provider. Demand-oblivious routing [2] promises excellent performance guarantee with changing and uncertain traffic demands. However, it is difficult to implement it. We investigate an efficient and deployable implementation of oblivious routing. We study its performance by both numerical experiments and simulation. The performance study shows that the multipath implementation achieves a close approximation to oblivious routing [2], especially when approximate knowledge of traffic is available. The study also shows its robustness under varying traffic demands, link failures and an adversary attack. Its performance is excellent even with a 100% error in traffic estimation.

Y. Li received honorary Izaak Walton Killam memorial scholarship and Informatics Circle of Research Excellence (iCore) graduate student scholarship. B. Bai received Province of Alberta Graduate Fellowship. This research was partially supported by the Natural Science and Engineering Research Council of Canada (NSERC).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Applegate, D., Breslau, L., Cohen, E.: Coping with network failures: Routing strategies for optimal demand oblivious restoration. In: Proceedings of SIGMETRICS’04, New York, June 2004, pp. 270–281 (2004)

    Google Scholar 

  2. Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: Proceedings of SIGCOMM’03, Karlsruhe, Germany, August 2003, pp. 313–324 (2003)

    Google Scholar 

  3. Elwalid, A., Jin, C., Low, S., Widjaja, I.: MATE: MPLS adaptive traffic engineering. In: Proceedings of INFOCOM’01, Anchorage, April 2001, pp. 1300–1309 (2001)

    Google Scholar 

  4. Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications 20(4), 756–767 (2002)

    Article  Google Scholar 

  5. Kandula, S., Katabi, D., Davie, B., Charny, A.: Walking the tightrope: Responsive yet stable traffic engineering. In: Proceedings of SIGCOMM’05, Philadelphia, August 2005, pp. 253–264. (2005)

    Google Scholar 

  6. Li, Y., Bai, B., Harms, J., Holte, R.: Multipath oblivious routing for traffic engineering - stable and robust routing in changing and uncertain environments. Technical Report, TR06-11, Department of Computing Science, University of Alberta (May 2006)

    Google Scholar 

  7. Li, Y., Harms, J., Holte, R.: A simple method for balancing network utilization and quality of routing. In: Proceedings of IEEE ICCCN’05, San Diego, October 2005, pp. 71–76 (2005)

    Google Scholar 

  8. Nucci, A., Sridharan, A., Taft, N.: The problem of synthetically generating IP traffic matrices: initial recommendations. ACM SIGCOMM Computer Communication Review 35(3), 19 (2005)

    Article  Google Scholar 

  9. Ross, K.W.: Hash routing for collections of shared web caches. IEEE Network 11(7), 37–44 (1997)

    Article  Google Scholar 

  10. Shaikh, A., Rexford, J., Shin, K.G.: Load-sensitive routing of long-lived IP flows. In: Proceedings of SIGCOMM’99, Cambridge, MA, USA, August 1999, pp. 215–226 (2005)

    Google Scholar 

  11. Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: Proceedings of SIGCOMM’02, Pittsburgh, August 2002, pp. 133–146 (2002)

    Google Scholar 

  12. Wang, H., Xie, H., Qiu, L., Yang, Y.R., Zhang, Y., Greenberg, A.: COPE: Traffic Engineering in dynamic networks. In: SIGCOMM’06. Pisa, Italy (September 2006)

    Google Scholar 

  13. Zhang, C., Ge, Z., Kurose, J., Liu, Y., Towsley, D.: Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance. In: Proceedings of ICNP’05. Boston (November 2005)

    Google Scholar 

  14. Zhang, Y., Roughan, M., Duffield, N., Greenberg, A.: Fast accurate computation of large-scale IP traffic matrices from link loads. In: Proceedings of SIGMETRICS’03, San Diego, June 2003, pp. 206–217 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lorne Mason Tadeusz Drwiega James Yan

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Y., Bai, B., Harms, J., Holte, R. (2007). Stable and Robust Multipath Oblivious Routing for Traffic Engineering. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72990-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72989-1

  • Online ISBN: 978-3-540-72990-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics