Sciweavers

302 search results - page 3 / 61
» On Queues with Inter-Arrival Times Proportional to Service T...
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
Warren Smith, Valerie E. Taylor, Ian T. Foster
WIMOB
2008
IEEE
14 years 1 months ago
Proportional Fairness for MIMO Multi-user Schedulers with Traffic Arrival Process
—Packet scheduling at the data link layer may impact significantly the overall performance of a wireless system using multiple antennas. In this paper, we propose a novel packet ...
Masoomeh Torabzadeh, Wessam Ajib
GLOBECOM
2006
IEEE
14 years 1 months ago
Time-Driven Early Discard (TED) to Improve the Fairness of TCP Congestion Control
— This paper proposes a novel adaptive AQM (advanced queue management) approach called Time-Driven Early Discard (TED). The basic underlying idea is to set a deadline on packet s...
Mario Baldi, Andrea Vesco
INFOCOM
2005
IEEE
14 years 1 months ago
Analysis of alternating-priority queueing models with (cross) correlated switchover times
This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue ...
Robin Groenevelt, Eitan Altman
TELETRAFFIC
2007
Springer
14 years 1 months ago
Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
Onno J. Boxma, Vinod Sharma, D. K. Prasad