Optimal link-state hop-by-hop routing

Current intra-domain routing protocols like OSPF and IS-IS use link-state routing algorithms with hop-by-hop forwarding that sacrifice traffic engineering performance for ease of implementation and management. Though optimal traffic engineering algorithms exist, they tend to be either not link-state algorithms or to require source routing - characteristics that make them difficult to implement. As the focus of this paper, we introduce HALO, the first optimal link-state routing algorithm with hop-by-hop forwarding, where link weights can be calculated locally. Furthermore, our solution can adapt to changing traffic patterns automatically. The optimality of the algorithm is proved theoretically and also verified numerically.

[1]  Daniel Pérez Palomar,et al.  A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.

[2]  F. Paganini,et al.  A Unified Approach to Congestion Control and Node-Based Multipath Routing , 2009, IEEE/ACM Transactions on Networking.

[3]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[4]  Ao Tang,et al.  Cost of Not Splitting in Routing: Characterization and Estimation , 2011, IEEE/ACM Transactions on Networking.

[5]  M..  Projected Newton Methods and Optimization of Multicommodity Flows , 2022 .

[6]  Larry J. LeBlanc,et al.  A new proximal decomposition algorithm for routing in telecommunication networks , 1998, Networks.

[7]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[8]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[9]  Mung Chiang,et al.  Link-State Routing With Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2011, IEEE/ACM Trans. Netw..

[10]  Mung Chiang,et al.  Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2008, INFOCOM.

[11]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[12]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[13]  Karl Henrik Johansson,et al.  Dynamical properties of hybrid automata , 2003, IEEE Trans. Autom. Control..

[14]  Guy Leduc,et al.  TOTEM: A Toolbox for Traffic Engineering Methods , 2006 .

[15]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[16]  Edmund M. Yeh,et al.  Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks , 2006, IEEE Transactions on Information Theory.

[17]  Deep Medhi,et al.  Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach , 2005, IEEE Transactions on Network and Service Management.

[18]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[19]  DiotChristophe,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005 .

[20]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[21]  T. Stern,et al.  A Class of Decentralized Routing Algorithms Using Relaxation , 1977, IEEE Trans. Commun..

[22]  C. E. Agnew,et al.  On quadratic adaptive routing algorithms , 1976, CACM.