Title :
Spanning tree method for link state aggregation in large communication networks
Author_Institution :
Motorola ISG, Mansfield, MA, USA
Abstract :
We consider a communication network in which dynamic routing is used for establishing connections that support information transfer between end-users. Link state information is exchanged and maintained up-to-date among network nodes for path computation and network resource allocation. When the population of users is large, the amount of link state information can be overwhelming. A common solution is to use a hierarchical structure. In this paper, we present a method for aggregating link state information in a hierarchical network. We assume that each link state parameter associated with a link is symmetrical in both directions of the link. The key idea for the method is to first reduce the original subnetwork topology to a full-mesh representation that consists of a logical link for each pair of border nodes in the subnetwork, and then encode the link state information associated with the full-mesh representation with an appropriate spanning tree
Keywords :
asynchronous transfer mode; encoding; hierarchical systems; resource allocation; telecommunication links; telecommunication network routing; ATM networks; border nodes; dynamic routing; encode; end-users; full-mesh representation; hierarchical network; hierarchical structure; information transfer; large communication networks; link state aggregation; logical link; network nodes; network resource allocation; path computation; spanning tree method; subnetwork topology; Broadcasting; Communication networks; Computer networks; Intelligent networks; Joining processes; Network topology; Resource management; Routing; Switching systems;
Conference_Titel :
INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE
Conference_Location :
Boston, MA
Print_ISBN :
0-8186-6990-X
DOI :
10.1109/INFCOM.1995.515888
