Optimization driven bandwidth provisioning in service overlay networks

Authors:
Kyung-Joon Park;Chong-Ho Choi
Affiliations:
Department of Computer Science, University of Illinois, 201 N. Goodwin Avenue, Urbana, IL 61801-2302, USA;School of Electrical Engineering and Computer Science, Seoul National University, Seoul 151-742, Republic of Korea
Venue:
Computer Communications
Year:
2008

Citing 10
Cited 0

Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Detour: Informed Internet Routing and Transport

IEEE Micro
Service Overlay Networks: SLAs, QoS and Bandwidth Provisioning

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Efficient topology-aware overlay network

ACM SIGCOMM Computer Communication Review
Scattercast: an architecture for internet broadcast distribution as an infrastructure service

Scattercast: an architecture for internet broadcast distribution as an infrastructure service
Service overlay networks: SLAs, QoS, and bandwidth provisioning

IEEE/ACM Transactions on Networking (TON)
QoS-aware bandwidth provisioning for IP network links

Computer Networks: The International Journal of Computer and Telecommunications Networking
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Adaptive rate allocation and resource planning for service level agreement maintenance in satellite communications

Computer Communications
Reinforcement learning-based dynamic bandwidth provisioning for quality of service in differentiated services networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

We consider the bandwidth provisioning problem in service overlay networks (SON). We formulate the bandwidth provisioning problem in an optimization framework taking the stochastic processes involved into consideration. First, we provide the optimal solution that maximizes the expected net revenue in a single-link network under stationary traffic demand. Then, we show that the revenue maximization problem in a general topology under stationary traffic can be nicely approximated by a separable convex optimization problem. We derive an approximate optimal solution for a general topology and provide a bandwidth provisioning algorithm via a gradient method, which works in a distributed manner. We also verify the effectiveness of the approximate optimal solution by showing several important characteristics of the solution. The performance of the algorithm is investigated through extensive simulations.