Dynamic Core Provisioning for Quantitative Differentiated Service

Efficient network provisioning mechanisms supporting service differentiation and automatic capacity dimensioning are important for the realization of a differentiated service Internet. In this paper, we extend our prior work on edge provisioning [7] to interior nodes and core networks including algorithms for: (i) dynamic node provisioning and (ii) dynamic core provisioning. The dynamic node provisioning algorithm prevents transient violations of service level agreements by self-adjusting per-scheduler service weights and packet dropping thresholds at core routers, reporting persistent service level violations to the core provisioning algorithm. The dynamic core provisioning algorithm dimensions traffic aggregates at the network ingress taking into account fairness issues not only across different traffic aggregates, but also within the same aggregate whose packets take different routes in a core IP network. We demonstrate through analysis and simulation that our model is capable of delivering capacity provisioning in an efficient manner providing quantitative delay-bounds withdifferen tiated loss across per-aggregate service classes.

[1]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[2]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.

[3]  穂鷹 良介.  Non-Linear Programming の計算法について , 1963 .

[4]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[5]  Andrew T. Campbell,et al.  Dynamic edge provisioning for core IP networks , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[6]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[7]  Scott Shenker,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.

[8]  Tatsuya Suda,et al.  Network Border Patrol , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[10]  K. G. Ramakrishnan,et al.  Virtual private networks: joint resource allocation and routing design , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Christophe Diot,et al.  Simple performance models of differentiated services schemes for the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[13]  C. D. Meyer,et al.  Generalized inverses of linear transformations , 1979 .