Spanning tree method for link state aggregation in large communication networks

摘要: We consider a communication network in which dynamic routing is used for establishing connections that support information transfer between end-users. Link state exchanged and maintained up-to-date among nodes path computation resource allocation. When the population of users large, amount link can be overwhelming. A common solution to use hierarchical structure. In this paper, we present method aggregating network. assume each parameter associated with symmetrical both directions link. The key idea first reduce original subnetwork topology full-mesh representation consists logical pair border subnetwork, then encode an appropriate spanning tree.