Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
On investigating overlay service topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
A design framework towards the profitable operation of service overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Optimization models for the radio planning of wireless mesh networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
QRON: QoS-aware routing in overlay networks
IEEE Journal on Selected Areas in Communications
Study on topology design for large scale service overlay networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Multi-channel live streaming in service overlay network
Multimedia Tools and Applications
An overlay multicast protocol for live streaming and delay-guaranteed interactive media
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Service Overlay Networks (SONs) create a virtual topology on top of the Internet and provide end-to-end quality of service guarantees without requiring support by the underlying network. The optimization of the resources utilized by an SON is a fundamental issue for an overlay operator owing to the costs involved and the need to satisfy user requirements. Careful decisions are necessary to provide enough capacity to overlay links, to route traffic, to assign users to access nodes and to deploy overlay nodes. In this paper, we propose two mathematical programming models for the user assignment problem, the traffic routing optimization and the dimensioning of the capacity reserved on overlay links in SONs. The first model minimizes the SON installation cost while providing full access to all users. The second model maximizes the SON profit by selecting which users to serve, based on the expected gain, and taking into consideration budget constraints of the SON operator. Moreover, we extend these models to include the optimization of the number and position of overlay nodes. We provide the optimal solutions of the proposed SON design formulations on a set of realistic-size instances and discuss the effect of different parameters on the characteristics of the planned networks. Numerical results show that the proposed approach is able to solve the problem to the optimum even for large-scale networks.