Results 201 to 210 of about 522 (214)

Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload

Computer Networks, 2010
In a recent paper, Bonald and Roberts (2001) [6] studied non-persistent TCP connections in transient overload conditions, under the assumption that all connections have the same round-trip times. In this paper our goal is to develop theoretical tools that will enable us to relax this assumption and obtain explicit expressions for the rate of growth of ...
Eitan Altman, Tania Jiménez, Daniel Kofman   +2 more
exaly   +3 more sources

Discriminatory Processor Sharing from Optimization Point of View

, 2013
Discriminatory Processor Sharing models play important role in analysing bandwidth allocation schemes in packet based communication systems. Users in such systems usually have access rate limitations which also influence their bandwidth shares. This paper is concerned with DPS models which incorporate these access rate limitations in a bandwidth ...
József Bíró, Tamás Bérczes, Attila Korösi, Zalán Heszberger, János Sztrik   +4 more
openaire   +2 more sources

Strategic Revenue Management for Discriminatory Processor Sharing Queues

Lecture Notes in Computer Science, 2023
Dieter Fiems, Fiems Dieter
exaly   +2 more sources

Performance modelling with adaptive hidden Markov models and discriminatory processor sharing queues [PDF]

, 2016
In modern computer systems, workload varies at different times and locations. It is important to model the performance of such systems via workload models that are both representative and efficient. For example, model-generated workloads represent realistic system behaviour, especially during peak times, when it is crucial to predict and address ...
Chis, Tiberiu
openaire   +4 more sources

Efficient and accurate Lyapunov function-based truncation technique for multi-dimensional Markov chains with applications to discriminatory processor sharing and priority queues

Performance Evaluation, 2023
Gagan Somashekar, Mohammad Delasay, Anshul Gandhi   +2 more
exaly   +2 more sources

Queue-Length Distribution for the Discriminatory Processor-Sharing Queue

Operations Research, 1996
In this paper, we study a multiple class discriminatory processor-sharing queue. The queue is assumed to have Poisson input and exponentially distributed service times. In this discipline there are K classes of customers. When there are ni customers present in the system of class i(i = 1, …, K), each member of class j receives a fraction of the server'
Kiran M. Rege, Bhaskar Sengupta
openaire   +2 more sources

Approximating Optimal Load Balancing Policy in Discriminatory Processor Sharing Systems

Proceedings of the 2nd International ICST Conference on Performance Evaluation Methodologies and Tools, 2007
Juha Leino
openaire   +2 more sources

A survey on discriminatory processor sharing (PDF)

, 2006
E. Altman, K. Avrachenkov, U. Ayesta (Urtzi)   +2 more
openaire   +2 more sources

Invariance of the stationary distribution of states of networks with multimode service, different types of requests, and discriminatory processor sharing

Automatic Control and Computer Sciences, 2012
Open and closed queuing networks with multimode strategies and several types of requests are studied. Single-line nodes can operate in several modes. The time spent in each mode has an exponential distribution. The queuing discipline of the server is the discriminatory processor sharing (DPS).
Aleksandra R. Eremina, Yu. V. Malinkovskii   +1 more
openaire   +1 more source

Determining the Moments of Queue-Length Distribution of Discriminatory Processor-Sharing Systems with Phase-Type Service Requirements

2007 Next Generation Internet Networks, 2007
In this paper, we study discriminatory processor sharing systems in which different customer classes receive different rates of service according to class weights. DPS systems have many interesting applications in modelling of, e.g., computer or telecommunication systems.
Juha Leino, Jorma Virtamo
openaire   +1 more source