### 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 language | English |
---|---|

Title of host publication | Proceedings of the IEEE Conference on Decision and Control |

Editors | Anon |

Volume | 1 |

Publication status | Published - 1 Dec 1996 |

Externally published | Yes |

Event | Proceedings of the 1996 35th IEEE Conference on Decision and Control. Part 3 (of 4) - Kobe, Jpn Duration: 11 Dec 1996 → 13 Dec 1996 |

### Other

Other | Proceedings of the 1996 35th IEEE Conference on Decision and Control. Part 3 (of 4) |
---|---|

City | Kobe, Jpn |

Period | 11/12/96 → 13/12/96 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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

}

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

VL - 1

BT - Proceedings of the IEEE Conference on Decision and Control

A2 - Anon, null

ER -