Sciweavers

133 search results - page 1 / 27
» Maximizing throughput in queueing networks with limited flex...
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 4 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
ESA
2004
Springer
91views Algorithms» more  ESA 2004»
13 years 10 months ago
Maximizing Throughput in Multi-queue Switches
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded cap...
Yossi Azar, Arik Litichevskey
INFOCOM
2006
IEEE
13 years 10 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
ICC
2007
IEEE
160views Communications» more  ICC 2007»
13 years 11 months ago
Maximizing Throughput of Cognitive Radio Networks with Limited Primary Users' Cooperation
— We consider a point-to-multipoint cognitive radio network that shares a set of channels with a primary network. Within the cognitive radio network, a base station (BS) controls...
Anh Tuan Hoang, Ying-Chang Liang, Habibul Islam
MOBIHOC
2009
ACM
14 years 5 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant