Sciweavers

29 search results - page 1 / 6
» Start-Time Fair Queueing: A Scheduling Algorithm for Integra...
Sort
View
SIGCOMM
1996
ACM
13 years 9 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
INFOCOM
1998
IEEE
13 years 9 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
RTSS
1999
IEEE
13 years 9 months ago
Parallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
ICC
1997
IEEE
158views Communications» more  ICC 1997»
13 years 9 months ago
The Priority Token Bank in a Network of Queues
This paper takes a known approach for scheduling and admission control in integrated services networks1 , the Priority Token Bank (PTB), whose mechanism and performance have been ...
Mark A. Lynn, Jon M. Peha
PE
2002
Springer
207views Optimization» more  PE 2002»
13 years 4 months ago
Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline
Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-tim...
Joris Walraevens, Bart Steyaert, Herwig Bruneel