Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
JoBS: Joint Buffer Management and Scheduling for Differentiated Services
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Proportional differentiated services for the internet
Proportional differentiated services for the internet
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
A combined delay and throughput proportional scheduling scheme for differentiated services
Computer Communications
Modeling two-windows TCP behavior in differentiated services networks
Computer Communications
| Hi-index | 0.24 |
The relative differentiation architecture does not require per-flow state at the network core or edges, nor admission control, but it can only provide higher classes with better service than lower classes. A central premise in the relative differentiation architecture is that users with an absolute QoS requirement can dynamically search for a class, which provides the desired QoS level. In the first part of this paper, we investigate this Dynamic Class Selection (DCS) framework in the context of Proportional Delay Differentiation (PDD). We illustrate that, under certain conditions, DCS-capable users can meet absolute QoS requirements, even though the network only offers relative differentiation. For a simple link model, we give an algorithm that checks whether it is feasible to satisfy all users, and if this is the case, computes the minimum acceptable class selection for each user. Users converge in a distributed manner to this minimum acceptable class, if the DCS equilibrium is unique. However, suboptimal and even unacceptable DCS equilibria may also exist. Simulations of an end-to-end DCS algorithm provide further insight in the dynamic behavior of DCS, show the relation between DCS and the network Delay Differentiation Parameters (DDPs), and demonstrate how to control the trade-off between a flow's performance and cost using DCS. In the second part of the paper, we consider the related problem of class provisioning. At the provisioning phase, the network manager configures the link to support the QoS requirements of all traffic types. Each traffic type is specified by an expected arrival rate and a delay requirement. The objective of the provisioning phase is to jointly determine: the minimum link capacity needed to support the given traffic types, the nominal class of service for each traffic type, and the appropriate resource allocation between classes. Our class provisioning methodology is also based on PDD. The major advantage of PDD is that it avoids the computation of an explicit bandwidth share for each class. The class provisioning methodology is illustrated with examples.