Results 1 to 10 of about 2,468 (253)

Generalized processor sharing: Characterization of the admissible region and selection of optimal weights [PDF]

open access: yesComputers and Operations Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lieshout, P., Mandjes, M.
exaly   +5 more sources

Generalized Processor Sharing Scheduling Enhancement through Session Decomposition [PDF]

open access: yes, 2003
In this paper a service discipline, which is based on Generalized Processor Sharing (GPS) and aims to improve resource utilization for deterministic guarantees at a single node is presented. According to the proposed scheme original sessions are decomposed into two components which are treated as separate sessions by a GPS scheduler; the work assigned ...
Panagakis, A., Stavrakakis, I.
openaire   +3 more sources

Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs [PDF]

open access: yesQueueing Systems, 2006
The authors first obtain the large-buffer asymptotics of two Gaussian flows that share the network capacity using generalized processor sharing discipline. It is assumed that flow 1 sends on average at a rate smaller than the guaranteed rate, and for flow 2 the following cases are distinguished: i) underload and ii) overload.
Krzysztof Debicki, Debicki Krzysztof
exaly   +3 more sources

Heavy-Traffic Comparison of a Discrete-Time Generalized Processor Sharing Queue and a Pure Randomly Alternating Service Queue

open access: yesMathematics, 2021
This paper compares two discrete-time single-server queueing models with two queues. In both models, the server is available to a queue with probability 1/2 at each service opportunity.
Arnaud Devos   +3 more
doaj   +1 more source

Scalable Flow Isolation With Work Conserving Stateless Core Fair Queuing for Deterministic Networking

open access: yesIEEE Access, 2023
We consider guaranteeing end-to-end (E2E) latency bounds to flows in a network. It is desirable that flows are isolated from other flows. The bursts from other flows or the network utilization level should not affect a flow’s latency bound.
Jinoo Joung   +3 more
doaj   +1 more source

Deficit Round Robin with Fragmentation Scheduling to Achieve Generalized Weighted Fairness for Resource Allocation in IEEE 802.16e Mobile WiMAX Networks

open access: yesFuture Internet, 2010
Deficit Round Robin (DRR) is a fair packet-based scheduling discipline commonly used in wired networks where link capacities do not change with time. However, in wireless networks, especially wireless broadband networks, i.e., IEEE 802.16e Mobile WiMAX ...
Chakchai So-In   +2 more
doaj   +1 more source

Performance analysis of generalized processor sharing based on fractal leaky bucket regulators

open access: yesTongxin xuebao, 2006
In order to analyze the effect of self-similar traffic on the generalized processor sharing(GPS),the relationship was explored between the performance of a GPS system and the parameter of self-similar traffic.The self-similar traffic getting into the GPS
CHEN Zhi-gang   +3 more
doaj   +2 more sources

On Generalized Processor Sharing and Objective Functions: Analytical Framework

open access: yes, 2015
Today, telecommunication networks host a wide range of heterogeneous services. Some demand strict delay minima, while others only need a best-effort kind of service. To achieve service differentiation, network traffic is partitioned in several classes which is then transmitted according to a flexible and fair scheduling mechanism.
Jasper Vanlerberghe   +4 more
openaire   +3 more sources

On the Influence of High Priority Customers on a Generalized Processor Sharing Queue [PDF]

open access: yes, 2015
In this paper, we study a hybrid scheduling mechanism in discrete-time. This mechanism combines the well-known Generalized Processor Sharing (GPS) scheduling with strict priority. We assume three customer classes with one class having strict priority over the other classes, whereby each customer requires a single slot of service.
Jasper Vanlerberghe   +3 more
openaire   +1 more source

Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators

open access: yesTongxin xuebao, 2007
In order to get exact bounds problems encountered in networking with self-similar input traffic,a fractal regu-lator was introduced into the ingress of a generalized processor sharing(GPS) system for regulating the self-similar traf-fic,and a model was ...
ZHANG Lian-ming1   +3 more
doaj   +2 more sources

Home - About - Disclaimer - Privacy