Data networks
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Deriving traffic demands for operational IP networks: methodology and experience
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Utility-Based Call Admission Control for Adaptive Mobile Services
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Bandwidth provisioning and pricing for networks with multiple classes of service
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
The QoSbox: quantitative service differentiation in BSD routers
Computer Networks: The International Journal of Computer and Telecommunications Networking
On achieving short-term QoS and long-term fairness in high speed networks
Journal of High Speed Networks
Enhancing class-based service architectures with adaptive rate allocation and dropping mechanisms
IEEE/ACM Transactions on Networking (TON)
Robust delay estimation of an adaptive scheduling algorithm
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
| Hi-index | 0.00 |
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.