High-performance communication networks (2nd ed.)
High-performance communication networks (2nd ed.)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
QoS-Assured Service Composition in Managed Service Overlay Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A design framework towards the profitable operation of service overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SLA adaptation for service overlay networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Distributed resource adaptation for virtual network operators
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
| Hi-index | 0.00 |
The notion of service overlay network (SON) was proposed recently to alleviate difficulties encountered in providing end-to-end quality of service (QoS) guarantees in the current Internet architecture. The SONs are able to provide QoS guarantees by purchasing bandwidth from individual network domains and building a logical end-to-end data delivery infrastructure on top of existing Internet. In this paper, we consider a generalized framework for SON, which is categorized based on three different characteristics: a) single-homed/multi-homed end-system b) usage-based/leased cost model and c) capacitated/uncapacitated network. We focus on the algorithmic analysis of the topology design problem for the above generalized SON. We prove that for certain case, polynomial-time optimal algorithm exists, while for other cases, the topology design problem is NP-complete. For the NP-complete cases, we provide approximation algorithms and experimental results.