Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Optimal PNNI complex node representations for restrictive costs and minimal path computation time
IEEE/ACM Transactions on Networking (TON)
Topology aggregation for directed graphs
IEEE/ACM Transactions on Networking (TON)
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Crankback Prediction in Hierarchical ATM Networks
Journal of Network and Systems Management
QoS Routing with Incomplete Information by Analog Computing Algorithms
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Routing with topology aggregation in delay-bandwidth sensitive networks
IEEE/ACM Transactions on Networking (TON)
Distributed cost-based update policies for QoS routing on hierarchical networks
Information Sciences—Informatics and Computer Science: An International Journal
State aggregation of large network domains
Computer Communications
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
Multi-commodity source location problems and price of greed
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Photonic Network Communications
Adaptive crankback schemes for hierarchical QoS routing in ATM networks
Computer Communications
A QoS-based routing algorithm for PNNI ATM networks
Computer Communications
Optimal PNNI complex node representations for restrictive costs
Computer Communications
Dynamic transition matrix generation for topology aggregation
Computer Communications
Efficient hierarchical QoS routing in ATM networks
Computer Communications
| Hi-index | 0.00 |
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.