New packet-loss minimization routing algorithm for ATM high-speed data networks Conference Paper uri icon

abstract

  • In this paper, a new optimal routing algorithm to minimize packet loss in high-speed networks is proposed. In high-speed networks, such as ATM networks, packets could be lost while being routed to their destinations. Minimization of packet loss probabilities becomes a major concern. The optimal routing problem (ORP) minimizing average network packet loss probabilities is more complicated since the ORP is a non-convex problem and the ordinary gradient projection algorithm can not be directly used to achieve optimal routing. To solve the packet loss ORP, we developed an HAD based two-stage algorithm, which can effectively avoid the traps of local minimum caused by the non-convexity of the problem and thus, can find the true optimal solution of the ORP with high computation speed.

published proceedings

  • Proceedings of the IEEE Conference on Decision and Control

author list (cited authors)

  • Zhu, S., & Huang, G. M.

complete list of authors

  • Zhu, S||Huang, GM

publication date

  • December 1996