Routing in multidomain networks

Investigates the problem of management and control in a large and, for simplicity, homogeneous packet-switched network. Specifically the authors focus on routing, an important function of network management. The network consists of several individually controlled domains. Domains are interconnected via gateway links. Each domain is controlled by its own network control center, while the overall network performance is managed by an integrated network control center. Each center has only a portion of the information required for global routing. The authors investigate the impact of the reduced information available at each center on network performance (average delay in the present case). They present a general approach to designing a hierarchical algorithm for routing in multidomain networks. They propose a heuristic procedure suitable for packet-switched networks. Several numerical examples illustrate the impact of incomplete information on the network. Performance is compared with a lower bound obtained, which is not differentiating destinations in other domains. Therefore, for this bound, each domain is perceived as a single node in a simplified model of the network.