Sciweavers

13 search results - page 2 / 3
» Local Scheduling Policies in Networks of Packet Switches wit...
Sort
View
GLOBECOM
2006
IEEE
13 years 11 months ago
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
Abstract— In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-st...
Kevin Ross, Nicholas Bambos
CAMAD
2006
IEEE
13 years 8 months ago
Improving quality of service for switched processing systems
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
Ying-Chao Hung, George Michailidis
IPPS
2007
IEEE
13 years 11 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
INFOCOM
2005
IEEE
13 years 10 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown
INFOCOM
2005
IEEE
13 years 10 months ago
On the maximal throughput of networks with finite buffers and its application to buffered crossbars
— The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assume...
Paolo Giaccone, Emilio Leonardi, Devavrat Shah