New packet-loss minimization routing algorithm for ATM high-speed data networks

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the IEEE Conference on Decision and Control
Editors Anon
Volume1
Publication statusPublished - 1 Dec 1996
Externally publishedYes
EventProceedings of the 1996 35th IEEE Conference on Decision and Control. Part 3 (of 4) - Kobe, Jpn
Duration: 11 Dec 199613 Dec 1996

Other

OtherProceedings of the 1996 35th IEEE Conference on Decision and Control. Part 3 (of 4)
CityKobe, Jpn
Period11/12/9613/12/96

Fingerprint

Automatic teller machines
Routing algorithms
Packet loss
HIgh speed networks
Asynchronous transfer mode

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality

Cite this

Zhu, S., & Huang, G. M. (1996). New packet-loss minimization routing algorithm for ATM high-speed data networks. In Anon (Ed.), Proceedings of the IEEE Conference on Decision and Control (Vol. 1)

New packet-loss minimization routing algorithm for ATM high-speed data networks. / Zhu, Shan; Huang, Garng Morton.

Proceedings of the IEEE Conference on Decision and Control. ed. / Anon. Vol. 1 1996.

Research output: Chapter in Book/Report/Conference proceedingChapter

Zhu, S & Huang, GM 1996, New packet-loss minimization routing algorithm for ATM high-speed data networks. in Anon (ed.), Proceedings of the IEEE Conference on Decision and Control. vol. 1, Proceedings of the 1996 35th IEEE Conference on Decision and Control. Part 3 (of 4), Kobe, Jpn, 11/12/96.
Zhu S, Huang GM. New packet-loss minimization routing algorithm for ATM high-speed data networks. In Anon, editor, Proceedings of the IEEE Conference on Decision and Control. Vol. 1. 1996
Zhu, Shan ; Huang, Garng Morton. / New packet-loss minimization routing algorithm for ATM high-speed data networks. Proceedings of the IEEE Conference on Decision and Control. editor / Anon. Vol. 1 1996.
@inbook{1afa1e18f46940e6b0c52933eba9bbed,
title = "New packet-loss minimization routing algorithm for ATM high-speed data networks",
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.",
author = "Shan Zhu and Huang, {Garng Morton}",
year = "1996",
month = "12",
day = "1",
language = "English",
volume = "1",
editor = "Anon",
booktitle = "Proceedings of the IEEE Conference on Decision and Control",

}

TY - CHAP

T1 - New packet-loss minimization routing algorithm for ATM high-speed data networks

AU - Zhu, Shan

AU - Huang, Garng Morton

PY - 1996/12/1

Y1 - 1996/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030378390&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030378390&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0030378390

VL - 1

BT - Proceedings of the IEEE Conference on Decision and Control

A2 - Anon, null

ER -