Advertisement

Annals of Operations Research

, Volume 49, Issue 1, pp 185–206 | Cite as

An algorithm for optimal minimax routing in ATM networks

  • Ming-Jeng Lee
  • James R. Yee
Article

Abstract

Asynchronous Transfer Mode (ATM) has been adopted by the CCITT as the transport mode in which Broadband ISDN will be based. In this paper, we formulate the problem of routing cells in an ATM network as an optimization problem. The objective is to minimize the largest cell loss probability among all links. The constraints correspond to a multicommodity network flow problem with gains. An algorithm to determine a global optimal flow assignment is presented. The minimax routing algorithm was implemented and tested on several sample networks. The computational experiments show that the algorithm is computationally efficient.

Keywords

Large Cell Cell Loss Computational Experiment Flow Problem Loss Probability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.E. Eckberg, D.T. Luan and D.M. Lucantoni, Meeting the challenge: control and flow control strategies for broadband information transport, in:Proc. IEEE Globecom (1989) pp. 49.3.1–49.3.5.Google Scholar
  2. [2]
    R. Händel, Evolution of ISDN toward Broadband ISDN, IEEE Network Mag. 3 (1989) 7–13.Google Scholar
  3. [3]
    S.E. Minzer, Broadband ISDN and Asynchronous Transfer Mode (ATM), IEEE Commun. Mag. 27 (1989) 17–24.Google Scholar
  4. [4]
    A. Huang and S. Knauer, STARLITE: a wideband digital switch,Proc. IEEE GLOBECOM (1984).Google Scholar
  5. [5]
    Y.S. Yeh, M.G. Hluchyj and A.S. Acampora, The knockout switch: a simple architecture for high performance packet switching, IEEE J. Sel. Areas Commun. SAC-5 (1987) 1274–1283.Google Scholar
  6. [6]
    J.Y. Hui and E. Arthurs, A broadband packet switch for integrated transport, IEEE J. Sel. Areas Commun. SAC-5 (1987) 1264–1273.Google Scholar
  7. [7]
    M.G. Hluchyj and M.J. Karol, Queueing in high-performance packet switching, IEEE J. Sel. Areas Commun. SAC-6 (1988) 1587–1597.Google Scholar
  8. [8]
    K.Y. Eng, M.J. Karol and Y.S. Yeh, A growable packet (ATM) switch architecture: design principles and applications,Proc. IEEE GLOBECOM (1989) pp. 32.2.1–32.2.7.Google Scholar
  9. [9]
    P. Newman, ATM technology for corporate networks, IEEE Commun. Mag. 20 (1992) 70–78.Google Scholar
  10. [10]
    P.M. Lin, B.J. Leon and C.R. Steward, Analysis of circuit-switched networks employing originating-office control with spill-forward, IEEE Trans. Commun. COM-26 (1978) 754–765.Google Scholar
  11. [11]
    A. Girard and M. Bell, Blocking evaluation for network with residual capacity adaptive routing, IEEE Trans. Commun. COM-37 (1989) 1372–1380.Google Scholar
  12. [12]
    J.R. Yee, Distributed routing and flow control algorithms for communications networks, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT (1985).Google Scholar
  13. [13]
    L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method: an approach to store-and-forward communication network design, Networks 3 (1973) 95–110.Google Scholar
  14. [14]
    D.P. Bertsekas and R.G. Gallager,Data Networks (Prentice-Hall, Englewood Cliffs, NJ, 1987).Google Scholar
  15. [15]
    M.J. Lee and J.R. Yee, Optimal minimax routing in ATM networks,Proc. IEEE GLOBECOM (December 1990).Google Scholar
  16. [16]
    Y.S. Lin and J.R. Yee, A distributed routing algorithm for virtual circuit data networks,Proc. IEEE INFOCOM (1989); also in ORSA J. Comp. 4 (1992) 250–266.Google Scholar
  17. [17]
    M.J. Lee, Design algorithms for reconfigurable networks, Ph.D. Thesis, Department of EE-Systems, USC (March 1991).Google Scholar
  18. [18]
    J.R. Yee and M.J. Lee, A convergence proof for an iterative method for ATM networks,Proc. IEEE INFOCOM (May 1992) pp. 2472–2482.Google Scholar
  19. [19]
    R.G. Gallager, A minimum delay routing algorithm using distributed computation, IEEE Trans. Commun. COM-25 (1977) 73–85.Google Scholar
  20. [20]
    D.G. Cantor and M. Gerla, Optimal routing in a packet-switched computer network, IEEE Trans. Comp. C-23 (1974) 1062–1068.Google Scholar
  21. [21]
    M.S. Barazaa and J.J. Jarvis,Linear Programming And Network Flows (Wiley, 1977).Google Scholar
  22. [22]
    P.A. Jensen and J.W. Barnes,Network Flow Programming (Robert E. Krieger Publ., Marlabar, FL, 1987).Google Scholar
  23. [23]
    J.M. Wozencraft, R.G. Gallager and A. Segall, First annual report on data network reliability, ESL-IR-677, MIT (1976).Google Scholar
  24. [24]
    J.E. Defenderfer, Comparative analysis of routing algorithms for computer networks, Sc.D. Thesis, Department of EECS, MIT (1977).Google Scholar
  25. [25]
    F. Ros, Routing to minimize the maximum congestion in a communications network, Ph.D. Thesis, Department of EECS, MIT (1978).Google Scholar
  26. [26]
    J.R. Yee, Discrete capacity assignments for computer networks using a minimax objective,Proc. IEEE Int. Conf. on Circuits and Computers (October 1980).Google Scholar
  27. [27]
    J.R. Yee and F.M. Shiao, On calculating high throughputs in multi-hop slotted aloha packet radio networks,Proc. IEEE INFOCOM (June 1990); also to appear in IEEE Trans. Commun.Google Scholar
  28. [28]
    F.M. Shiao and J.R. Yee, On determining the transmission range for multi-hop slotted aloha packet radio networks,Proc. IEEE MILCOM (September, 1990).Google Scholar
  29. [29]
    F.Y.S. Lin and J.R. Yee, A real-time distributed routing and admission control algorithm for ATM networks, to appear inProc. IEEE INFOCOM (May 1993).Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1994

Authors and Affiliations

  • Ming-Jeng Lee
    • 1
  • James R. Yee
    • 2
  1. 1.IBMResearch Triangle ParkUSA
  2. 2.Department of Electrical EngineeringUniversity of HawaiiHonoluluUSA

Personalised recommendations