Sciweavers

EOR
2011
111views more  EOR 2011»
13 years 5 months ago
On the distribution of the number stranded in bulk-arrival, bulk-service queues of the M/G/1 form
Bulk-arrival queues with single servers that provide bulk service are widespread in the real world, e.g., elevators in buildings, people-movers in amusement parks, air-cargo deliv...
Aykut F. Kahraman, Abhijit Gosavi
QUESTA
2008
205views more  QUESTA 2008»
13 years 10 months ago
Continuity of the M/G/c queue
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
Lothar Breuer
ORL
2007
48views more  ORL 2007»
13 years 10 months ago
Remarks on the remaining service time upon reaching a target level in the M/G/1 queue
In this note we establish connections between new and previous results on the remaining service time upon reaching a target level in the M/G/1 queue.
Kyung C. Chae, Kilhwan Kim, Nam K. Kim
QUESTA
2002
87views more  QUESTA 2002»
13 years 10 months ago
A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary ...
Iddo Eliazar, Gadi Fibich, Uri Yechiali
TWC
2008
112views more  TWC 2008»
13 years 10 months ago
Service time analysis of a distributed medium access control scheme
Abstract--Distributed medium access control (MAC) is essential for a wireless network without a central controller. In previous work of the authors, a distributed MAC scheme has be...
Hai Jiang, Ping Wang, Weihua Zhuang, H. Vincent Po...
TWC
2008
109views more  TWC 2008»
13 years 10 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
JSW
2008
103views more  JSW 2008»
13 years 11 months ago
An Experimental Study of AJAX Application Performance
An experimental study compared the performance of a real-life HTML application and an AJAX application that implemented the same user interface. A statistically significant number ...
Clinton W. Smullen III, Stephanie A. Smullen
SIGMETRICS
2004
ACM
145views Hardware» more  SIGMETRICS 2004»
14 years 4 months ago
A resource-allocation queueing fairness measure
Fairness is a major issue in the operation of queues, perhaps it is the reason why queues were formed in the first place. Recent studies show that the fairness of a queueing syst...
David Raz, Hanoch Levy, Benjamin Avi-Itzhak
INFOCOM
2007
IEEE
14 years 5 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang