Sciweavers

25 search results - page 1 / 5
» Capacity Maximizing Packet Scheduling Algorithms for Interco...
Sort
View
GLOBECOM
2006
IEEE
13 years 10 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
EUROMICRO
1996
IEEE
13 years 9 months ago
Performance Analysis of Packet Switching Interconnection Networks with Finite Buffers
In thispaper,a mathematicalmethodfor analysis of synchronous packet-switching interconnection networks with jinite buffering capacity at the output of switching elements ispresent...
Aristotel Tentov, Aksenti L. Grnarov
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
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
SPAA
2009
ACM
14 years 5 months ago
Approximation algorithms for time-constrained scheduling on line networks
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
Harald Räcke, Adi Rosén