Queueing Analysis: Discrete-time systemsNorth-Holland, 1991 - Queuing theory |
From inside the book
Results 1-3 of 11
Page 238
... class p in an FCFS Geo / G / 1 system . The first term is the mean waiting time due to the remaining service time of ... Supermessage From now on throughout this section , we assume that classes are priority classes with descending order of ...
... class p in an FCFS Geo / G / 1 system . The first term is the mean waiting time due to the remaining service time of ... Supermessage From now on throughout this section , we assume that classes are priority classes with descending order of ...
Page 251
... messages of class p + 1 , ... , P do affect the waiting time of a message of class p because the arrival of such messages cause the termination of a vacation period . In a system with multiple vacations , a supermessage of class 1 , 2 ...
... messages of class p + 1 , ... , P do affect the waiting time of a message of class p because the arrival of such messages cause the termination of a vacation period . In a system with multiple vacations , a supermessage of class 1 , 2 ...
Page 450
... supermessage of class 1 , 2 , ... , p ith moment of the service time of a supermessage of class 1 , 2 , ... , p ith moment of the message service time Mean service time of a message of class p 239 239 3 235 b во ith moment of the ...
... supermessage of class 1 , 2 , ... , p ith moment of the service time of a supermessage of class 1 , 2 , ... , p ith moment of the message service time Mean service time of a message of class p 239 239 3 235 b во ith moment of the ...
Contents
DiscreteTime Systems | 1 |
MG1K | 5 |
Waiting Time in the FCFS System | 16 |
Copyright | |
16 other sections not shown
Common terms and phrases
1st slot arbitrary message arbitrary slot boundary boundary is given busy period process busy period started defined delay cycle denotes the number discrete-time E[W]LCFS early arrival model elapsed service exhaustive service system FCFS system FDMA Geo/G/1 system given by U(u Hence idle period initial condition joint distribution joint PGF late arrival model LCFS least one message length Markov chain mean waiting measured in slots message of class messages arrive messages that arrive multiple vacation model nth slot number of messages P₁ packet model period is given PGF P(z PGF W(u Po(w Po(z priority queues Prob Prob[L probability queue size immediately remaining service Rouché's theorem service completion service cycle service period service time immediately setup steady-state Substituting supermessage of class system immediately system is empty system is given system without vacations TDMA vacation period Wg(u wɅ(z Πο Σ λ Σ Σ Σπ