DocumentCode
307182
Title
A new packet-loss minimization routing algorithm for ATM high-speed data networks
Author
Zhu, Shan ; Huang, G.M.
Author_Institution
Nortel Inc., Richardson, TX, USA
Volume
1
fYear
1996
fDate
11-13 Dec 1996
Firstpage
287
Abstract
An 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. Minimisation 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 a 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
Keywords
asynchronous transfer mode; data communication; minimisation; packet switching; probability; queueing theory; telecommunication network routing; ATM high-speed data networks; ATM networks; HAD based two-stage algorithm; nonconvex problem; optimal routing algorithm; optimal routing problem; packet-loss minimization routing algorithm; Asynchronous transfer mode; Charge carrier processes; High-speed networks; ISDN; Lakes; Minimization methods; Optical fiber losses; Packet switching; Projection algorithms; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1996., Proceedings of the 35th IEEE Conference on
Conference_Location
Kobe
ISSN
0191-2216
Print_ISBN
0-7803-3590-2
Type
conf
DOI
10.1109/CDC.1996.574317
Filename
574317
Link To Document