Introduction to algorithms
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)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Spanning tree method for link state aggregation in large communication networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Algorithms for precomputing constrained widest paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
State aggregation of large network domains
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
Quality-of-Service routing with path information aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cost-effective multicast approaches for time-critical applications in dynamic network environments
Journal of High Speed Networks
Research challenges in QoS routing
Computer Communications
An iterative distributed algorithm for multi-constraint multicast routing
Computer Communications
The aggregation of multicast tree state information with delay-bandwidth constraints
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Distributed grooming in multi-domain IP/MPLS-DWDM networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Enhanced crankback signaling for multi-domain IP/MPLS networks
Computer Communications
Graph partitioning for survivability in multi-domain optical networks
IEEE Communications Letters
Photonic Network Communications
Unicast QoS routing in overlay networks
Network performance engineering
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Routing is a process of finding a network path from a source node to a destination node. The execution time and the memory requirement of a routing algorithm increase with the size of the network. In order to deal with the scalability problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. For delay-bandwidth sensitive networks, traditional approaches represent the property of each link in the aggregated topology as a delay-bandwidth pair, which corresponds to a point on the delay-bandwidth plane. Since each link after aggregation may be the abstraction of many physical paths, a single delay-bandwidth pair results in significant information loss. The major contribution of this paper is a novel quality-of-service (QoS) parameter representation with a new aggregation algorithm and a QoS-aware routing protocol. Our QoS representation captures the state information about the network with much greater accuracy than the existing algorithms. Our simulation results show that the new approach achieves very good performance in terms of delay deviation, success ratio, and crankback ratio.