Search Results

Generalized processor sharing (GPS) service policy is a scheduling algorithm to allocate the bandwidth of a queueing system with multi-class input traffic. Simulating the GPS system in realistic traffic environments requires a large amount of time. Thus,...

In this paper, a new packet approximation algorithm based on WF²Q+ of TGPS (T-WF2Q+) has been proposed in multicast orthogonal frequency division multiplexing (OFDM) systems. By using Λ(t) instead of Λ, the TGPS scheme could preserve the service ...

This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistic al Quality-of-Service (QoS) guarantees in a Generalized Processor Sharing scheduler. The statistical QoS targets, for each service class,...

Generalized processor sharing (GPS) has been widely studied as an important scheme for providing differentiated quality of service. Realistic traffic in multi-service networks exhibits heterogeneous properties and can be categorized into two classes, ...

This paper presents a unified model of classical teletraffic models covering both circuit-switched and packet-switched networks. The models of Erlang, Engset, Palm, and Delbrouck are generalized to loss and delay systems with multi-rate BPP (Binomial, ...

Implementation of differentiated Quality-of-Service (QoS) in next-generation computer networks has received increasing research interests from both academia and industry. The Generalized Processor Sharing (GPS) scheduling strategy has been widely ...

While the (Egalitarian) Processor-Sharing (PS) discipline offers crucial insights in the performance of fair resource allocation mechanisms, it is inherently limited in analyzing and designing differentiated scheduling algorithms such as Weighted Fair ...

We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two traffic classes in accordance with the Generalized Processor Sharing (GPS) ...

Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session's queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline ...

A dynamic fair resource allocation scheme is proposed to efficiently support real-time and non-real-time multimedia traffic with guaranteed statistical quality of service (QoS) in the uplink of a wideband code-division multiple access (CDMA) cellular ...

The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence ...

This paper develops a rather general and easy-to-use methodology how to obtain good approximations for queue length distributions in priority and generalized processor sharing systems where the cumulative input traffic streams are modeled as general ...

Most of the end-to-end congestion control schemes are "voluntary" in nature and critically depend on end-user cooperation. We show that in the presence of selfish users, all such schemes will inevitably lead to a congestion collapse. Router and switch ...

In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair ...

To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the ‘many-sources scaling’. ...

We consider a Skorohod map \mathbf{R} which takes paths in \mathbb{R}^n to paths which stay in the positive orthant \mathbb{R}_+^n . We let \mathcal{S} be the domain of definition of \mathbf{R} . A convex and lower semi-continuous function \lambda \dvtx ...

We establish asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a multiple-queue system where a single constant rate server services the queues using the generalized processor sharing (GPS) ...

We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The ...

End-to-end support for Quality-of-Service (QoS) guarantees is a central and critical issue in the design of the future integrated services multimedia networks. Due to the bursty nature of the network traffic and the statistical multiplexing mechanism ...

Considers a single server system with finite buffers that services.