Abstract
Integrated real-time dynamic routing (IRR) networks provide dynamic routing features for multiple classes-of-service on an integrated transport network. In a previous Journal paper it is shown that IRR networks 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 networks 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.
Access this article
Rent this article via DeepDyve
Similar content being viewed by others
References
G. R. Ash and F. Chang, Management, Control, and Design of Integrated Networks with Real-Time Dynamic Routing,Journal of Network and Systems Management, Volume 1, Issue 3.
G. R. Ash, J-S. Chen, A. E. Frey, and B. D. Huang, Real-Time Network Routing in a Dynamic Class-of-Service Network,Proceedings of the Thirteenth International Teletraffic Congress, Copenhagen, Denmark, June 1991.
G. R. Ash, R. H. Cardwell, and R. P. Murray, Design and Optimization of Networks with Dynamic Routing,Bell System Technical Journal, Volume 60, No. 8, October 1981.
R. I. Wilkinson, Theories of Toll Traffic Engineering in the U.S.A.,Bell System Technical Journal, Vol. 35, No. 6, March 1956.
D. W. Hill and S. R. Neal, The Traffic Capacity of a Probability-Engineered Trunk Group,Bell System Technical Journal, Vol. 55, No. 7, September 1976.
C. J. Truitt, Traffic Engineering Techniques for Determining Trunk Requirements in Alternate Routed Networks,Bell System Technical Journal, Volume 31, Number 2, March 1954.
N. K. Karmarker, A New Polynomial Time Algorithm for Linear Programming,Combinatorica, Vol. 4, No. 4, pp. 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,13th International Symposium on Mathematical Programming, Tokyo, Japan, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ash, G.R., Chang, F. Transport network design of integrated networks with real-time dynamic routing. J Netw Syst Manage 1, 319–335 (1993). https://doi.org/10.1007/BF01036826
Issue Date:
DOI: https://doi.org/10.1007/BF01036826