Transport Network Design of Integrated Networks with Real-Time Dynamic Routing [Vol. 1, No. 4, 1993]

Transport Network Design of Integrated Networks with Real-Time Dynamic Routing

Gerald R. Ash
AT&T Bell Laboratories
Room HO-3c509
101 Crawfords Corner Road
Holmdel, New Jersey 07733

Fu Chang
Institute of Information Science
Academia Sinica
Taipei, Taiwan Republic of China

Abstract
Integrated real-time dynamic routing(IRR) network provide dynamic routing features multiple classes-of-service on an integrated transport network. In a previous Journal paper it is shown that IRR network s allow reduced network management costs since with real-time dynamic routing a number of network operations are simplified or eliminated, leading to savings in operations costs and expenses. In this paper, a new algorithm is described for the transport design of IRR network which achieves near-optimal capacity engineering. In particular, a Karmarkar Algorithm optimal solution to the linear programming flow model achieves approximately a 5 to 8 percentage point reduction in network design cost in comparison to the designs of pre-planned dynamic networks solved with heuristic design techniques. The optimization techniques described in this and the previous Journal paper attain significant capital cost reductions and network performance improvements by properly modeling the more efficient operation of IRR networks.

Keywords: Dynamic routing; transport network design; linear programming flow optimization; multiple class-of-service; Karmarkar algorithm.

JNSM: Vol. 1, No. 4, 1993 Transport Network Design of Integrated Networks with Real-Time Dynamic Routing [Vol. 1, No. 4, 1993]

NOTE: only abstract of paper available on-line

Back to JNSM main page