Routing in packet‐switched communication networks with different criticality classes of communicating node pairs

Ali Amiri and Hasan Pirkul

Naval Research Logistics (NRL), 1997, vol. 44, issue 5, 485-505

Abstract: This paper addresses the routing problem with reliability requirements in packet‐switched 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. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 485–505, 1997

Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199708)44:53.0.CO;2-0

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:44:y:1997:i:5:p:485-505

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().