HALO: Hop-by-Hop Adaptive Link-State Optimal Routing

IEEE/ACM Transactions on Networking

Volumn 23, Issue 6, 2015, Pages 1862-1875

  Michael, Nithin ^a   Tang, Ao ^a  

^a School of Operations Research and Industrial Engineering   (United States)

Author keywords

IP networks; load balancing; network management; optimal routing

Indexed keywords

COSTS; GRAPH THEORY; ITERATIVE METHODS; PACKET NETWORKS; SWITCHING CIRCUITS; NETWORK MANAGEMENT; RESOURCE ALLOCATION;

EXPERIMENTAL EVALUATION; LINK-STATE ROUTING; NETWORK'S LINKS; OPTIMAL ROUTING; PACKET FORWARDING; PACKET-SWITCHED; PROOF OF CONCEPT; ROUTING ASSIGNMENT; IP NETWORKS; LINK STATE UPDATE;

NETWORK ROUTING;

EID: 84907688548     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2014.2349905     Document Type: Conference Paper

References (30)

1. N. Michael, A. Tang, and D. Xu, "Optimal link-state hop-by-hop routing," in Proc. IEEE ICNP, 2013, pp. 1-10.
2. R. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73-85, Jan. 1977.
3. L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method: An approach to store-and-forward communication network design," Networks, vol. 3, no. 2, pp. 97-133, 1973.
4. B. Fortz and M. Thorup, "Increasing internet capacity using local search," Comput. Optim. Appl., vol. 29, no. 1, pp. 13-48, Oct. 2004.
5. J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach, 5/E. New York, NY, USA: Addison-Wesley, 2010.
6. D. Bertsekas and E. Gafni, "Projected newton methods and optimization of multicommodity flows," IEEE Trans. Autom. Control, vol. AC-28, no. 12, pp. 1090-1096, Dec. 1983.
7. D. Xu, M. Chiang, and J. Rexford, "Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering," IEEE/ACMTrans. Netw., vol. 19, no. 6, pp. 1717-1730, Dec. 2011.
8. A. Sridharan, R. Guerin, and C. Diot, "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks," IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 234-247, Apr. 2005.
9. S. Srivastava, G. Agrawal, M. Pioro, and D. Medhi, "Determining link weight system under various objectives for OSPF networks using a lagrangian relaxation-based approach," IEEE Trans. Netw. Service Manag., vol. 2, no. 1, pp. 9-18, Nov. 2005.
10. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale IP traffic matrices from link loads," in Proc. ACM SIGMETRICS, New York, NY, USA, 2003, pp. 206-217.
11. D. Awduche, "MPLS and traffic engineering in IP networks," IEEE Commun. Mag., vol. 37, no. 12, pp. 42-47, Dec. 1999.
12. A. Elwalid, C. Jin, S. Low, and I. Widjaja, "MATE: MPLS adaptive traffic engineering," in Proc. 20th Annu. IEEE INFOCOM, 2001, vol. 3, pp. 1300-1309.
13. D. Applegate and E. Cohen, "Making routing robust to changing traffic demands: Algorithms and evaluation," IEEE/ACM Trans. Netw., vol. 14, no. 6, pp. 1193-1206, Dec. 2006.
14. M. Kodialam, T. V. Lakshman, J. Orlin, and S. Sengupta, "Oblivious routing of highly variable traffic in service overlays and IP backbones," IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 459-472, Apr. 2009.
15. T. Stern, "A class of decentralized routing algorithms using relaxation," IEEE Trans. Commun., vol. COM-25, no. 10, pp. 1092-1102, Oct. 1977.
16. C. E. Agnew, "On quadratic adaptive routing algorithms," Commun. ACM, vol. 19, no. 1, pp. 18-22, Jan. 1976.
17. D. Palomar and M. Chiang, "A tutorial on decomposition methods for network utility maximization," IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1439-1451, Aug. 2006.
18. F. Paganini and E. Mallada, "A unified approach to congestion control and node-based multipath routing," IEEE/ACM Trans. Netw., vol. 17, no. 5, pp. 1413-1426, Oct. 2009.
19. Y. Xi and E. Yeh, "Node-based optimal power control, routing, and congestion control in wireless networks," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 4081-4106, Sep. 2008.
20. P. Mahey, A. Ouorou, L. J. LeBlanc, and J. Chifflet, "A new proximal decomposition algorithm for routing in telecommunication networks," Networks, vol. 31, no. 4, pp. 227-238, 1998.
21. D. Bertsekas and R. Gallager, Data Networks. Upper Saddle River, NJ, USA: Prentice-Hall, 1992.
22. M. Wang, C. W. Tan, W. Xu, and A. Tang, "Cost of not splitting in routing: characterization and estimation," IEEE/ACM Trans. Netw., vol. 19, no. 6, pp. 1849-1859, Dec. 2011.
23. S. Boyd and L. Vandenberghe, Convex Optimization. New York,NY, USA: Cambridge Univ. Press, 2004.
24. J. Lygeros, K. Johansson, S. Simic, J. Zhang, and S. Sastry, "Dynamical properties of hybrid automata," IEEE Trans. Autom. Control, vol. 48, no. 1, pp. 2-17, Jan. 2003.
25. J. Lygeros, K. Johansson, S. Simic, J. Zhang, and S. Sastry, "Continuity and invariance in hybrid automata," in Proc. 40th IEEE Decision Control, 2001, vol. 1, pp. 340-345.
26. M. Alizadeh et al., "Data center TCP (DCTCP)," Comput. Commun. Rev. vol. 40, no. 4, pp. 63-74, Aug. 2010.
27. Cisco Systems, Inc., San Jose, CA, USA, "OSPF link-state advertisement (LSA) throttling," 2012 [Online]. Available: http://www.cisco. com/en/US/docs/ios/12-0s/feature/guide/fsolsath.html
28. CVX Reaserch, Inc., "CVX: Matlab software for disciplined convex programming, version 2.0 beta," Sep. 2012 [Online]. Available: http:/ /cvxr.com/cvx
29. J. Lepropre, S. Balon, and G. Leduc, "Totem: A toolbox for traffic engineering methods," presented at the Poster and Demo Session of IEEE INFOCOM Apr. 2006.
30. Stanford University, Stanford, CA, USA, "NetFGPA reference router walkthrough," Aug. 2013 [Online]. Available: https://github.com/ NetFPGA/netfpga/wiki/ReferenceRouterWalkthrough