IEEE/ACM Transactions on Networking (TON)
Ballot theorems applied to the transient analysis of nD/D/1 queues
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Quality-of-service in packet networks: basic mechanisms and directions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
Deterministic end-to-end delay guarantees with rate controlled EDF scheduling
Performance Evaluation
Capacity overprovisioning for networks with resilience requirements
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
QoS-aware bandwidth provisioning for IP network links
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity planning in IP Virtual Private Networks under mixed traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks
IEEE Transactions on Multimedia
Transport of TCP/IP traffic over assured forwarding IP-differentiated services
IEEE Network: The Magazine of Global Internetworking
Dimensioning network links: a new look at equivalent bandwidth
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
We address the problem of capacity assignment in packet networks with soft maximum waiting time guarantees. We present a multi-level framework for designing and analyzing capacity assignment methods in multiservice networks. Moreover, we propose a novel capacity assignment method that provides a tradeoff between capacity requirements and quality for the voice traffic class. The proposed method aims at providing slightly softened quality guarantees with some controlled tolerance to service degradation in order to notably reduce the amount of required capacity. In order to demonstrate the key characteristics of the proposed method, derivations, analysis, and results are presented over multiple levels of detail starting at the buffer level and extending to the node level, the path level, and finally the network level. At the path and network levels, the problem of capacity assignment with soft maximum waiting time guarantees is formulated as an optimization problem in order to obtain minimized values of the link capacities. Numerical calculation results are presented based on example scenarios at the different levels in order to demonstrate the effectiveness of the proposed method compared to other approaches. Moreover, Monte Carlo simulation results are presented whenever necessary in order to validate assumptions and further support observations.