Route selection in backbone data communication networks
Computer Networks and ISDN Systems
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Deterministic and adaptive routing policies in packet-switched computer networks
DATACOMM '73 Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design
Joint optimization of data network design and facility selection
IEEE Journal on Selected Areas in Communications
A system for the design of packet-switched communication networks with economic tradeoffs
Computer Communications
A genetic algorithm based approach to route selection and capacity flow assignment
Computer Communications
| Hi-index | 0.24 |
This paper addresses the problem of selecting a route for every pair of communicating nodes in a packet-switched communication network in order to minimize the average delay encountered by messages. A mathematical programming formulation of the problem is presented. An efficient solution procedure based on a Lagrangean relaxation of the problem is developed. Unlike most previous approaches where the best route for a communicating node pair is restricted to a set of prespecified candidate routes, our approach considers all possible routes for every communicating node pair. Our approach can also be used to generate good feasible routing schemes, whereas other approaches fail to generate feasible schemes beyond moderate levels of traffic. Extensive computational results across a variety of networks are reported. These results indicate that the solution procedure is effective for a wide range of traffic loads.