Routing in multi-domain networks

Author

Dimitrijevic, Dragomir D. ; Maglaris, Basil ; Boorstyn, Robert R.

Author_Institution

Contel Technol. Center, Chantilly, VA, USA

fYear

1991

fDate

7-11 Apr 1991

Firstpage

257

Abstract

The problem of management and control in a large and, for simplicity, homogeneous packet-switched network is investigated. In particular, routing is considered as an important function of network management. The network consists of several individually controlled domains interconnected via gateway links. Each domain is controlled by its own network control center, while the overall network performance is managed by the integrated network control center. Each center has only a portion of the information required for global routing. The impact of the reduced information available at each center on network performance is investigated. A general approach to designing a hierarchical algorithm for routing in multi-domain networks is presented. A heuristic procedure suitable for packet-switched networks is proposed. An example of the algorithm is shown. Its performance is compared against a lower bound to the network performance

Keywords

optimisation; packet switching; telecommunication network management; telecommunications control; gateway links; heuristic procedure; hierarchical algorithm; lower bound; multidomain network; network control center; network management; network performance; packet-switched network; routing; Algorithm design and analysis; Communication networks; Communication system control; Computer networks; Control systems; Delay; ISDN; Intelligent networks; Peer to peer computing; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Conference_Location

Bal Harbour, FL

Print_ISBN

0-87942-694-2

Type

conf

DOI

10.1109/INFCOM.1991.147512

Filename

147512