Optimal routing algorithm for high-speed (ATM) networks

Abstract

The gradient-projection (GP) technique is used to solve the optimal routing problem (ORP) for high-speed asynchronous transfer mode (ATM) networks. The ORP minimizing network average packet loss probability is complicated due to packet losses at intermediate switching nodes, and the problem is nonconvex. The nonconvex ORP is transformed into a convex ORP called the reduced-ORP (R-ORP), and the GP algorithm is used to obtain a routing solution. The solution obtained for the R-ORP is shown to be a good approximation of the globally optimal solution for the ORP for realistic network operating conditions. A theoretical upper bound of the difference between the R-ORP solution and the ORP solution is derived.<>