Premium
Routing in computer networks
Author(s) -
Frank H.,
Chou W.
Publication year - 1971
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230010202
Subject(s) - routing (electronic design automation) , computer science , heuristic , set (abstract data type) , static routing , multipath routing , equal cost multi path routing , mathematical optimization , flow network , link state routing protocol , flow (mathematics) , network routing , destination sequenced distance vector routing , distributed computing , routing protocol , computer network , mathematics , artificial intelligence , geometry , programming language
The problem of routing flow in a network of computers is extremely complex. This is especially formidable when routing is to be incorporated in iterative analysis and design. Among the properties of desirable flow patterns is low average delay from message inception to arrival. In this paper, we discuss procedures for minimizing average delay subject to a set of flow constraints. Heuristic routing procedures are presented and compared to optimum routing procedures. Computational experience is given.