Papers
Topics
Authors
Recent
2000 character limit reached

Virtual Multi-Topology Routing for QoS Constraints (2401.04226v1)

Published 8 Jan 2024 in cs.NI

Abstract: Multi-topology routing (MTR) provides an attractive alternative to segment routing for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and the need to frequently update link weights to follow evolving network conditions, MTR is often limited to a small number of topologies and the satisfaction of loose QoS constraints. To overcome these limitations we propose vMTR, an MTR extension where demands are routed over virtual topologies that are silent, i.e., they do not exchange LSA messages, and that are continuously derived from a very limited set of real topologies, optimizing each a QoS parameter. In this context, we present a polynomial and exact algorithm for vMTR and, as a benchmark, a local search algorithm for MTR. We show that vMTR helps reducing drastically the number of real topologies and that it is more robust to QoS changes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. N. Wang, K. H. Ho, G. Pavlou, and M. Howarth, “An overview of routing optimization for internet traffic engineering,” IEEE Communications Surveys Tutorials, vol. 10, no. 1, pp. 36–56, 2008.
  2. P. L. Ventre, S. Salsano, M. Polverini, A. Cianfrani, A. Abdelsalam, C. Filsfils, P. Camarillo, and F. Clad, “Segment routing: a comprehensive survey of research activities, standardization efforts, and implementation results,” IEEE Communications Surveys & Tutorials, vol. 23, no. 1, pp. 182–221, 2020.
  3. D. Wu and L. Cui, “A comprehensive survey on segment routing traffic engineering,” Digital Communications and Networks, 2022.
  4. P. Psenak, S. Mirtorabi, A. Roy, L. Nguyen, and P. Pillay-Esnault, “Multi-topology (MT) routing in OSPF. IETF RRC 4915.” Tech. Rep., 2007.
  5. T. Przygienda, N. Shen, and N. Sheth, “M-ISIS: multi topology (MT) routing in Intermediate System to Intermediate Systems (IS-ISs). IETF RFC 5120.” Tech. Rep., 2008.
  6. P. Psenak, S. Hegde, C. Filsfils, K. Talaulikar, and A. Gulko, “IGP Flexible Algorithm,” RFC 9350, Feb. 2023.
  7. N. Huin, S. Martin, J. m. Leguay, and S. Cai, “Network slicing with multi-topology routing,” in 2021 IFIP Networking Conference (IFIP Networking).   IEEE, 2021, pp. 1–2.
  8. Y. Tian, Z. Wang, X. Yin, X. Shi, Y. Guo, H. Geng, and J. Yang, “Traffic engineering in partially deployed segment routing over ipv6 network with deep reinforcement learning,” IEEE/ACM Transactions on Networking, vol. 28, no. 4, pp. 1573–1586, 2020.
  9. B. Fortz and M. Thorup, “Internet traffic engineering by optimizing OSPF weights,” in Proc. IEEE INFOCOM, vol. 2, 2000, pp. 519–528.
  10. A. Juttner, B. Szviatovski, I. Mécs, and Z. Rajkó, “Lagrange relaxation based method for the qos routing problem,” in Proc. IEEE INFOCOM, vol. 2, 2001, pp. 859–868.
  11. Y. Xiao, K. Thulasiraman, and G. Xue, “Gen-larac: A generalized approach to the constrained shortest path problem under multiple additive constraints,” in International Symposium on Algorithms and Computation.   Springer, 2005, pp. 92–105.
  12. A. Bley, “Routing and capacity optimization for IP networks,” in Operations Research Proceedings 2007.   Springer, 2008, pp. 9–16.
  13. B. Fortz and M. Thorup, “Optimizing OSPF/IS-IS weights in a changing world,” IEEE journal on selected areas in communications, vol. 20, no. 4, pp. 756–767, 2002.
  14. M. Ericsson, M. G. C. Resende, and P. M. Pardalos, “A genetic algorithm for the weight setting problem in OSPF routing ,” Journal of combinatorial optimization, vol. 6, no. 3, pp. 299–333, 2002.
  15. L. S. Buriol, M. G. Resende, C. C. Ribeiro, and M. Thorup, “A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing,” Networks: An International Journal, vol. 46, no. 1, pp. 36–56, 2005.
  16. A. Benhamiche, M. Chopin, and S. Martin, “Unsplittable shortest path routing: Extended model and matheuristic,” in Proc. CoDIT, 2023.
  17. E. Amaldi, A. Capone, and L. G. Gianoli, “Energy-aware IP traffic engineering with shortest path routing,” Computer Networks, vol. 57, no. 6, pp. 1503–1517, 2013.
  18. B. Fortz, M. Thorup et al., “Robust optimization of OSPF/IS-IS weights,” in Proc. INoC, vol. 20, 2003, pp. 225–230.
  19. J. Vallet and O. Brun, “Online OSPF weights optimization in IP networks,” Computer Networks, vol. 60, pp. 1–12, 2014.
  20. R. S. Ranaweera, I. M. Kamrul, and E. Oki, “Preventive start-time optimization of OSPF link weights against link failure for hose model,” in Asia-Pacific Conference on Communications (APCC).   IEEE, 2012, pp. 698–702.
  21. A. Altin, B. Fortz, and H. Ümit, “Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty,” Networks, vol. 60, no. 2, pp. 132–139, 2012.
  22. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. van der Merive, “A flexible model for resource management in virtual private networks,” SIGCOMM Comput. Commun. Rev., vol. 29, no. 4, p. 95–108, Aug. 1999.
  23. J. Moulierac and T. K. Phan, “Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices,” Computer Communications, vol. 61, pp. 79–89, 2015.
  24. M. Kodialam and T. Lakshman, “Network link weight setting: A machine learning based approach,” in Proc. IEEE INFOCOM, 2022, pp. 2048–2057.
  25. N. Wang, K.-H. Ho, and G. Pavlou, “Adaptive multi-topology IGP based traffic engineering with near-optimal network performance,” in IFIP NETWORKING.   Springer, 2008, pp. 654–666.
  26. N. Wang, K. H. Ho, and G. Pavlou, “Ample: an adaptive traffic engineering system based on virtual routing topologies,” IEEE Communications Magazine, vol. 50, no. 3, pp. 185–191, 2012.
  27. E. Mirzamany, A. Lasebae, and O. Gemikonakli, “An efficient traffic engineering based on multi-topology routing for future internet,” Computer Networks, vol. 70, pp. 170–178, 2014.
  28. X. Wang, S. Wang, and L. Li, “Robust traffic engineering using multi-topology routing,” in GLOBECOM 2009-2009 IEEE Global Telecommunications Conference.   IEEE, 2009, pp. 1–6.
  29. M. Menth and R. Martin, “Network resilience through multi-topology routing,” in DRCN, 2005, pp. 271–277.
  30. D. Garg et al., “Dynamizing dijkstra: A solution to dynamic shortest path problem through retroactive priority queue,” Journal of King Saud University-Computer and Information Sciences, vol. 33, no. 3, pp. 364–373, 2021.
  31. H. De Neve and P. Van Mieghem, “Tamcra: a tunable accuracy multiple constraints routing algorithm,” Computer Communications, vol. 23, no. 7, pp. 667–679, 2000.
  32. X. Ying, T. Krishnaiyan, X. Guoliang, A. Jüttner, and S. Arumugam, “The constrained shortest path problem,” AKCE International Journal of Graphs and Combinatorics, vol. 2, no. 2, pp. 63–86, 2005.
  33. H. Imai and T. Asano, “Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane,” J. Algorithms, vol. 4, pp. 310–323, 1983.
  34. S. Orlowski, R. Wessäly, M. Pióro, and A. Tomaszewski, “SNDlib 1.0—Survivable network design library,” Networks: An International Journal, vol. 55, no. 3, pp. 276–286, 2010.
  35. N. Huin, S. Martin, and J. Leguay, “Loss/delay instances for vIGP,” Jan. 2024. [Online]. Available: https://doi.org/10.5281/zenodo.10469172

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now

Whiteboard

Video Overview

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up