Network Capacity Allocation in Service Overlay Networks

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.

[1]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[2]  Brunilde Sansò,et al.  Multicommodity flow models, failure propagation, and reliable loss network design , 1998, TNET.

[3]  Zbigniew Dziong,et al.  Call admission and routing in multi-service loss networks , 1994, IEEE Trans. Commun..

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[6]  André Girard,et al.  Multi-service network design: a decomposition approach , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[7]  Keith W. Ross,et al.  Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..

[8]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[9]  Mingyan Liu,et al.  Fixed point approximation for multirate multihop loss networks with state-dependent routing , 2004, IEEE/ACM Transactions on Networking.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[11]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS, and bandwidth provisioning , 2003, TNET.

[12]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[13]  I. Kaufman,et al.  On the numerical evaluation of some basic traffic formulae , 1978, Networks.

[14]  André Girard,et al.  Revenue optimization of telecommunication networks , 1993, IEEE Trans. Commun..

[15]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[16]  Deep Medhi,et al.  Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing , 1997, TNET.

[17]  Zbigniew Dziong,et al.  ATM Network Resource Management , 1997 .

[18]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[19]  R. Srikant,et al.  Computational techniques for accurate performance evaluation of multirate, multihop communication networks , 1997, TNET.

[20]  S. Qiao,et al.  A Robust and Eecient Algorithm for Evaluating Erlang B Formula , 1998 .

[21]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[22]  André Girard,et al.  Dimensioning of adaptively routed networks , 1993, TNET.

[23]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[24]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[25]  Jonathan S. Turner,et al.  Multicast routing and bandwidth dimensioning in overlay networks , 2002, IEEE J. Sel. Areas Commun..