Fast connection establishment in large-scale networks
Willibald Doeringer, H. D. Dykeman, A.P.J. Engbersen, Roch A. Guérin, Andreas Herkersdorf, L. Heusler · 2002
A hierarchical decomposition of network nodes which permits the networkwide topology database and algorithms to be independent of node internals, yet allows (implicit) access to special intranodal features when required is described. A complementary procedure for the establishment of bandwidth-reserved connections is outlined that makes efficient use of this node structure to support network-level optimization through use of node-level features. Based on a significantly increased concurrency of path computation and bandwidth reservation, the execution time of the setup procedure is independent of the network's complexity (such as number of nodes and links) and is essentially bounded from above by the round-trip delay only.>