Statistical multiplexing under non-i.i.d. packet arrival processes and different priority policies

1991 ◽  
Vol 12 (3) ◽  
pp. 181-189 ◽  
Author(s):  
Ioannis Stavrakakis
2008 ◽  
Vol 19 (10) ◽  
pp. 2762-2769 ◽  
Author(s):  
Wei-Dong YANG ◽  
Jian-Feng MA ◽  
Ya-Hui LI

1999 ◽  
Author(s):  
Konstantinos P. Tsoukatos ◽  
Armand M. Makowski
Keyword(s):  

1974 ◽  
Vol 11 (01) ◽  
pp. 145-158 ◽  
Author(s):  
Michael A. Crane

We consider a transportation system consisting of a linear network of N + 1 terminals served by S vehicles of fixed capacity. Customers arrive stochastically at terminal i, 1 ≦ i ≦ N, seeking transportation to some terminal j, 0 ≦ j ≦ i − 1, and are served as empty units of vehicle capacity become available at i. The vehicle fleet is partitioned into N service groups, with vehicles in the ith group stopping at terminals i, i − 1,···,0. Travel times between terminals and idle times at terminals are stochastic and are independent of the customer arrival processes. Functional central limit theorems are proved for random functions induced by processes of interest, including customer queue size processes. The results are of most interest in cases where the system is unstable. This occurs whenever, at some terminal, the rate of customer arrivals is at least as great as the rate at which vehicle capacity is made available.


Author(s):  
Yoshihisa Kondo ◽  
Satoko Itaya ◽  
Shinji Yamaguchi ◽  
Peter Davis ◽  
Ryutaro Suzuki ◽  
...  

1990 ◽  
Vol 20 (1-5) ◽  
pp. 351-360 ◽  
Author(s):  
Gillian Woodruff ◽  
Rungroj Kostpaiboon ◽  
Gordon Fitzpatrick ◽  
Philip Richards

Author(s):  
Thibaud Biatek ◽  
Wassim Hamidouche ◽  
Jean-Francois Travers ◽  
Olivier Deforges

Sign in / Sign up

Export Citation Format

Share Document