scispace - formally typeset
Book ChapterDOI

Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services

TLDR
The scheme assigns a nominal capacity to each service class and implements a form of virtual partitioning by means of state-dependent priorities, instead of each class of traffic having a fixed priority, as in traditional trunk reservation schemes.
Abstract
We propose a scheme for sharing an unbuffered resource, such as bandwidth or capacity, by various services The scheme assigns a nominal capacity to each service class and implements a form of virtual partitioning by means of state-dependent priorities That is, instead of each class of traffic having a fixed priority, as in traditional trunk reservation schemes, the priorities depend on the state of the system An approximate method of analysis based on fixed point equations is given Numerical results are obtained from the approximation, exact computations and simulations The results show that the scheme is robust, fair and efficient

read more

Citations
More filters
Journal ArticleDOI

The structure and management of service level agreements in networks

TL;DR: The results show that the SLA management scheme is robust, fair and efficient over a broad range of traffic conditions.
Journal ArticleDOI

Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic

TL;DR: A reward-penalty paradigm is adopted as a combined measure for efficiency and fairness, and it is shown that not only is the revenue generated by VP extremely close to the maximum achievable value, but that the structural form of the optimal policy also closely resembles that of VP.
Proceedings ArticleDOI

Performance and fluid simulations of a novel shared buffer management system

TL;DR: A buffer management scheme based on buffer admission control is proposed, which is integrated with connection admission control at the switch, and is at the same time fair, efficient and robust in sharing the buffer resources across ports.
Journal ArticleDOI

Robust dynamic admission control for unified cell and call QoS in statistical multiplexers

TL;DR: The design of connection admission control (CAC) for a simple Markovian model of a multiservice statistical multiplexer is considered, laying the foundation through several fundamental analytic concepts, before progressively leading up to real-world requirements, like robustness and simplicity of design.
Proceedings ArticleDOI

Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes

TL;DR: The main goal is to achieve statistical multiplexing gains in the presence of multiple traffic and quality-of-service classes of connections that share a common trunk.
References
More filters
Journal ArticleDOI

Stochastic modelling and analysis: a computational approach

TL;DR: This book uses realistic examples to explore a wide variety of applications, such as inventory and production control, reliability, maintenance, queueing computer and communication systems, and will be of considerable interest to practitioners and researchers in operations research, statistics, computer science and engineering.
Journal ArticleDOI

Optimum Allocation of Servers to Two Types of Competing Customers

TL;DR: For two types of users it is shown that among a large class of policies, the optimum is the easily implemented policy of restricting the maximum number of processors that one of the two types can occupy at any time.
Book ChapterDOI

Discounted Dynamic Programming

TL;DR: In this paper, the authors discuss the discounted dynamic programming (DDP) model and the use of a discount factor as a criterion to determine policies that are optimal, using the total expected discounted return as the criterion.
Related Papers (5)