Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the stability of network distance estimation
ACM SIGMETRICS Performance Evaluation Review
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Quick and good facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
On the Internet Delay-Based Clustering
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
| Hi-index | 0.00 |
The advent of multimedia applications has triggered widespread interest in quality-of-service (QoS) support. An Internet-based QoS framework, Differentiated Services (DiffServ), has been proposed. The framework focuses mainly on packet scheduling. As such, it decouples routing from QoS provisioning. This typically results in inefficient routes, thereby limiting the ability of the network to support QoS requirements and to manage resources efficiently. This article proposes a scalable, clustering, and selective probing framework to assist in identifying and selecting routing paths that are very likely to meet the QoS requirements of the underlying application. The proposed approach can be seamlessly integrated into the DiffServ framework to extend its ability to support QoS requirements. A description of the basic components of the framework is provided. Scalability is achieved using a clustering algorithm, referred to as d-median, to reduce signaling and routers overhead. A thorough study to evaluate the performance of d-median is conducted. The results of the study show that, for power-law graphs such as the Internet, the d-median clustering-based approach outperforms existing clustering methods.