Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees

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.