Network capacity allocation in service overlay networks

Authors:
Ngok Lam;Zbigniew Dziong;Lorne G. Mason
Affiliations:
Department of Electrical & Computer Engineering, McGill University, Montreal, Quebec, Canada;Department of Electrical Engineering, Ecole de technologie superieure, Montreal, Quebec, Canada;Department of Electrical & Computer Engineering, McGill University, Montreal, Quebec, Canada
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 12
Cited 0

Data networks

Data networks
Dimensioning of adaptively routed networks

IEEE/ACM Transactions on Networking (TON)
Computational techniques for accurate performance evaluation of multirate, multihop communication networks

IEEE/ACM Transactions on Networking (TON)
Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing

IEEE/ACM Transactions on Networking (TON)
Multicommodity flow models, failure propagation, and reliable loss network design

IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks

Routing and Dimensioning in Circuit-Switched Networks
ATM Network Resource Management

ATM Network Resource Management
Introduction to Algorithms

Introduction to Algorithms
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
Fixed point approximation for multirate multihop loss networks with state-dependent routing

IEEE/ACM Transactions on Networking (TON)
Multicast routing and bandwidth dimensioning in overlay networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning problem as one in profit maximization and propose a novel model with several new features. In particular the proposed methodology employs an efficient approximation for state dependent routing that reduces the cardinality of the problem. Moreover, the new formulation also takes into account the concept of network shadow prices in the capacity allocation process to improve the efficacy of the solution scheme.