Dynamic Core Provisioning for Quantitative Differentiated Service

Abstract

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.