There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
An Adaptive Hierarchical Routing Protocol
IEEE Transactions on Computers
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Scalable inter-domain routing architecture
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
On sparse spanners of weighted graphs
Discrete & Computational Geometry
NP-completeness of minimum spanner problems
Discrete Applied Mathematics
Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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)
Tree spanners in planar graphs
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Hierarchical QoS routing in delay-bandwidth sensitive networks
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Using Network Flows in Hierarchical QoS Routing
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
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
Routing Through Networks with Hierarchical Topology Aggregation
Routing Through Networks with Hierarchical Topology Aggregation
NIRA: a new Internet routing architecture
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Routing with topology aggregation in delay-bandwidth sensitive networks
IEEE/ACM Transactions on Networking (TON)
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Efficient hierarchical QoS routing in ATM networks
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Distributed, scalable routing based on vectors of link states
IEEE Journal on Selected Areas in Communications
The viewserver hierarchy for interdomain routing: protocols and evaluation
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Quality-of-Service routing with path information aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Quality-of-service provisioning via stochastic path selection under Weibullian link delays
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Smart meeting systems: A survey of state-of-the-art and open issues
ACM Computing Surveys (CSUR)
A service plane architecture for future optical internet
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Topology Aggregation for E-science Networks
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Designing Connection Oriented Networks for Multi-Domain Path Resilience
Journal of Network and Systems Management
Multihoming, content delivery networks, and the market for Internet connectivity
Telecommunications Policy
Towards an optimized abstracted topology design in cloud environment
Future Generation Computer Systems
| Hi-index | 0.00 |
We study and compare topology aggregation techniques used in QoS routing. Topology Aggregation (TA) is defined as a set of techniques that abstract or summarize the state information about the network topology to be exchanged, processed, and maintained by network nodes for routing purposes. Due to scalability, aggregation techniques have been an integral part of some routing protocols. However, TA has not been studied extensively except in a rather limited context. With the continuing growth of the Internet, scalability issues of QoS routing have been gaining importance. Therefore, we survey the current TA techniques, provide methodology to classify, evaluate, and compare their complexities and efficiencies.