Routing in multiple domain networks

An investigation is conducted of routing in packet-switched networks that consist of two individually controlled domains. Each domain controller determines a static routing plan for requirements that are contained within its domain and for requirements that are addressed to nodes in the other domain. The authors propose two routing algorithms, assuming that each controller has limited information on the configuration of the other domain. Numerical examples are provided that compare the delay performance of such algorithms with the optimal routing of a centralized scheme that has full information and control over both domains. Implications of distributed control on network design are explored