Routing in packet-switched communication networks with different criticality classes of communicating node pairs
✍ Scribed by Ali Amiri; Hasan Pirkul
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 129 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
This paper addresses the routing problem with reliability requirements in packetswitched communication networks. In this problem, two classes of communicating node pairs are considered: less critical and highly critical node pairs. We develop a model which identifies a primary route for each less critical node pair and both a primary and a secondary (back up) route for each highly critical node pair. The objective is to minimize the average delay encountered by messages. A solution procedure based on a relaxation of the problem is presented. Computational results over a wide range of problem structures show that the procedure is very effective.