Sciweavers

794 search results - page 46 / 159
» A push-pull queueing system
Sort
View
CSJM
2007
92views more  CSJM 2007»
14 years 9 months ago
Generalized Priority Models for QoS and CoS Network Technologies
The variety of priority queueing systems with random switchover times is suggested in this paper. Such systems represent generalized models for a wide class of phenomena which inv...
Gh. Mishkoy, S. Giordano, A. Iu. Bejan, O. Benders...
INFOCOM
2003
IEEE
15 years 3 months ago
A Queueing Network Model of an Edge Optical Burst Switching Node
— We consider an edge optical burst switching (OBS) node with or without converters, and with no buffering. The OBS node serves a number of users, each connected to the switch ov...
Lisong Xu, Harry G. Perros, George N. Rouskas
SIGMETRICS
2010
ACM
115views Hardware» more  SIGMETRICS 2010»
14 years 4 months ago
The average response time in a heavy-traffic srpt queue
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
Minghong Lin, Adam Wierman, Bert Zwart
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
JSAC
2006
104views more  JSAC 2006»
14 years 9 months ago
Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi