Abstract
This chapter describes optimization methods useful for the design of dynamic routing protocols, as well as for the concomitant optimization of dynamic routing network design and dynamic routing performance. A variety of dynamic routing methods are used in practice, which include time-dependent, state-dependent, and event-dependent algorithms, and these are briefly outlined. We briefly review current practice in dynamic routing protocol design in voice, data, and integrated voice/data networks. Case studies are given for dynamic routing protocol design for a) real-time network routing, a state-dependent dynamic routing method used in practice in a very large-scale application, and b) integrated voice/data routing in an IP/MPLS network application. Methods for optimal min-cost network design and max-flow performance optimization include traffic-load-flow, discrete-event flow, and virtual-transport-flow optimization models. Examples are given in the application of these methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
H. Ahmadi, J. Chen, and R. Guerin. Dynamic routing and call control in high-speed integrated networks. In Proc. 13th International Teletraffic Congress, ITC 13, pages 397–403, Copenhagen, 1992.
J. M. Akinpelu. The overload performance of engineered networks with nonhierarchical and hierarchical routing. Bell System Technical Journal, 63:1261–1281, 1984.
G. Apostolopoulos, R. Guerin, S. Kamat, A. Orda, and S. K. Tripathi. Intra-domain QoS routing in IP networks: A feasibility and cost/benefit analysis. IEEE Network, 13(5):42–54, 1999.
G. R. Ash. Dynamic Routing in Telecommunications Networks. McGraw-Hill, 1998.
G. R. Ash. Performance evaluation of QoS-routing methods for IP-based multiservice networks. Computer Communications, 26(8):817–833, May 2003.
G. R. Ash, R. H. Cardwell, and R. P. Murray. Design and optimization of networks with dynamic routing. Bell System Technical Journal, 60(8): 1787–1820, 1981.
G. R. Ash and P. Chemouil. 20 years of dynamic routing in circuit-switched networks: Looking backward to the future. IEEE Global Communications Newsletter, pages 1–4, October 2004. Insert of IEEE Communication Magazine, October 2004 issue.
G. R. Ash, P. Chemouil, A. N. Kashper, S. S. Katz, and Y. Watanabe. Robust design and planning of a worldwide intelligent network. IEEE Journal on Selected Areas in Communications, 7(8), 1989.
G. R. Ash, J.-S. Chen, A. E. Frey, and B. D. Huang. Real-time network routing in a dynamic class-of-service network. In Proc. 13th International Teletraffic Congress, ITC 13, Copenhagen, 1991.
ATM Forum Technical Committee. Private network-network interface specification version 1.1 (pnni 1.1), April 2002. [af-pnni-0055.002].
D. Awduche. MPLS and traffic engineering in IP networks. IEEE Communications Magazine, 37(12):42–47, December 1999.
D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao. Overview & principles of internet traffic engineering. RFC 3272, May 2002. Available online on May 15, 2005: http://www.faqs.org/rfcs/rfc3272.html.
D. Awduche, J. Malcolm, J. Agogbua, M. O’Dell, and J. McManus. Requirements for traffic engineering over MPLS. RFC 2702, September 1999. Available online on May 15,2005: http://www.faqs.org/rfcs/rfc2702.html.
R. E. Bellman. Dynamic Programming. Princeton University Press, 1957.
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services. RFC 2475, December 1998. Available online on May 15, 2005: http://www.faqs.org/rfcs/rfc2475.html.
T. Bonald, S. Oueslanti-Boulahia, and J. W. Roberts. IP traffic and QoS control: The need for a flow-aware architecture. In World Telecommunications Congress, Paris, France, September 2002.
E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick. A framework for QoS-based routing in the internet. RFC 2386, August 1998. Available online on May 15, 2005: http://www.faqs.org/rfcs/rfc2386.html.
G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.
A. DiBenedetto, P. LaNave, and C. Sisto. Dynamic routing of the italcable telephone traffic: Experience and perspectives. In Proceedings Globecom 1989, Dallas, TX, 1989.
E. W. Dijkstra. A note on two problems in connection with graphs. Numerical Mathematics, 1:269–271, 1959.
A. Elwalid, C. Jin, S. Low, and I. Widjaja. MATE: MPLS adaptive traffic engineering. In Proceedings INFOCOM’01, April 2001.
B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40(10): 118–124, October 2002.
B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of IEEE INFOCOM’00, March 2000.
R. J. Gibbens, F. P. Kelly, and P.B. Key. Dynamic alternative routing: Modeling and behavior. In Proc. 12th Int’l Teletraffic Congress, ITC 12, Turin, Italy, 1988.
ITU-T Recommendations. QoS routing & related traffic engineering methods for multiservice TDM. In ATM & IP-based networks, May 2002.
N. K. Karmarkar. A new polynomial time algorithm for linear programming. Combinatorica, 4(4):373–395, 1984.
N. K. Karmarkar and K. G. Ramakrishnan. Implementation and computational results of the karmarkar algorithm for linear programming, using an iterative method for computing projections. In 13th International Symposium on Mathematical Programming, Tokyo, Japan, 1988.
J. E. Knepley. Minimum cost design for circuit switched networks. Technical Report 36-73, Defense Communications Engineering Center, System Engineering Facility, Reston, Virginia, July 1973.
J. Kruithof. Telefoonverkeersrekening. De Ingenieur, 52(8):E15–E25, February 1937.
R. S. Krupp. Stabilization of alternate routing networks. In IEEE International Communications Conference, Philadelphia, Pennsylvania, 1982.
C. Liljenstolpe. An approach to IP network traffic engineering (Cable & Wireless), 2002. Available online on May 15, 2005: http://www.nanog.org/mtg-0202/ppt/lil/.
Q. Ma. Quality-of-Service Routing in Integrated Services Networks. PhD thesis, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, January 1998.
A. Mase and H. Yamamoto. Advanced traffic control methods for network management. Communications Magazine, 28(10):82–88, 1990.
J. McQuillan, I. Richter, and E. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, 28(5):711–719, May 1980.
J. Moy. Ospf version 2. RFC 2328, April 1998. Available online on May 15, 2005: http://www.faqs.org/rfcs/rfc2328.html.
Y. Nakagome and H. Mori. Flexible routing in the global communication network. In Proc. 7th International Tele traffic Congress, ITC7, Stockholm, Sweden, 1973.
A. Odlyzko. Data networks are lightly utilized, and will stay that way. The Review of Network Economics, 2(3):210–237, September 2003.
C. Pierantozzi and V. Springer. Level3 mpls protocol architecture, 2000. Internet Draft. Available online on May 15, 2005: https://datatracker.ietf.org/public/idindex.cgi?command=id_detail&id=58%93.
M. Pioro and D. Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, 2004.
J. Regnier and W. H. Cameron. State-dependent dynamic traffic management for telephone networks. IEEE Communications Magazine, 28(10):42–53, October 1990.
Y. Rekhter and T. Li. A border gateway protocol 4 (BGP-4), March 1995. Available online on May 15, 2005: http://ietf.org/rfc/rfc1771.txt.
E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol label switching architecture. RFC 3031, January 2001. Available online on May 15, 2005: http://www.faqs.org/rfcs/rfc3031.html.
C. J. Truitt. Traffic engineering techniques for determining trunk requirements in alternate routed networks. Bell System Technical Journal, 31(2):277–304, March 1954.
S. Weintraub. Tables of Cumulative Binomial Probability Distribution for Small Values of p. Collier-Macmillan Limited, 1963.
X. X. Xiao. Providing Quality of Service in the Internet. PhD thesis, Michigan State University, 2000.
X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with MPLS in the internet. IEEE Network Magazine, pages 28–33, March 2000.
X. Xiao and L. M. Ni. Internet QoS: A big picture. IEEE Network, 13(2):8–18, March–April 1999.
B. Yaged. Minimum cost design for circuit switched networks. Networks, 3:193–224, 1973.
B. Yaged Jr. Long Range Planning for Communications Networks. PhD thesis, Polytechnic Institute of Brooklyn, 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Ash, G.R. (2006). Optimization of Dynamic Routing Networks. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-30165-5_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30662-9
Online ISBN: 978-0-387-30165-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)