Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Conditional Sojourn Time Moments in the Finite Capacity GI/M/1 Queue With Processor-Sharing Service

Yongzhi Yang and Charles Knessl
SIAM Journal on Applied Mathematics
Vol. 53, No. 4 (Aug., 1993), pp. 1132-1193
Stable URL: http://www.jstor.org/stable/2102267
Page Count: 62
  • Subscribe ($19.50)
  • Cite this Item
Conditional Sojourn Time Moments in the Finite Capacity GI/M/1 Queue With Processor-Sharing Service
Preview not available

Abstract

This paper considers a processor-sharing GI/M/1 queue that can hold at most K customers. Assuming that K is large, asymptotic expansions are constructed for the first two moments of a tagged customer's remaining sojourn time, given the present value of (i) the number of other customers in the system, (ii) the remaining service time the customer must receive, and (iii) the clock on the renewal process that governs the arrivals. From this, formulas are obtained for the moments of the total sojourn time. The mean sojourn time is also computed, given only the total required service. The results are obtained using singular perturbation methods.

Page Thumbnails

  • Thumbnail: Page 
1132
    1132
  • Thumbnail: Page 
1133
    1133
  • Thumbnail: Page 
1134
    1134
  • Thumbnail: Page 
1135
    1135
  • Thumbnail: Page 
1136
    1136
  • Thumbnail: Page 
1137
    1137
  • Thumbnail: Page 
1138
    1138
  • Thumbnail: Page 
1139
    1139
  • Thumbnail: Page 
1140
    1140
  • Thumbnail: Page 
1141
    1141
  • Thumbnail: Page 
1142
    1142
  • Thumbnail: Page 
1143
    1143
  • Thumbnail: Page 
1144
    1144
  • Thumbnail: Page 
1145
    1145
  • Thumbnail: Page 
1146
    1146
  • Thumbnail: Page 
1147
    1147
  • Thumbnail: Page 
1148
    1148
  • Thumbnail: Page 
1149
    1149
  • Thumbnail: Page 
1150
    1150
  • Thumbnail: Page 
1151
    1151
  • Thumbnail: Page 
1152
    1152
  • Thumbnail: Page 
1153
    1153
  • Thumbnail: Page 
1154
    1154
  • Thumbnail: Page 
1155
    1155
  • Thumbnail: Page 
1156
    1156
  • Thumbnail: Page 
1157
    1157
  • Thumbnail: Page 
1158
    1158
  • Thumbnail: Page 
1159
    1159
  • Thumbnail: Page 
1160
    1160
  • Thumbnail: Page 
1161
    1161
  • Thumbnail: Page 
1162
    1162
  • Thumbnail: Page 
1163
    1163
  • Thumbnail: Page 
1164
    1164
  • Thumbnail: Page 
1165
    1165
  • Thumbnail: Page 
1166
    1166
  • Thumbnail: Page 
1167
    1167
  • Thumbnail: Page 
1168
    1168
  • Thumbnail: Page 
1169
    1169
  • Thumbnail: Page 
1170
    1170
  • Thumbnail: Page 
1171
    1171
  • Thumbnail: Page 
1172
    1172
  • Thumbnail: Page 
1173
    1173
  • Thumbnail: Page 
1174
    1174
  • Thumbnail: Page 
1175
    1175
  • Thumbnail: Page 
1176
    1176
  • Thumbnail: Page 
1177
    1177
  • Thumbnail: Page 
1178
    1178
  • Thumbnail: Page 
1179
    1179
  • Thumbnail: Page 
1180
    1180
  • Thumbnail: Page 
1181
    1181
  • Thumbnail: Page 
1182
    1182
  • Thumbnail: Page 
1183
    1183
  • Thumbnail: Page 
1184
    1184
  • Thumbnail: Page 
1185
    1185
  • Thumbnail: Page 
1186
    1186
  • Thumbnail: Page 
1187
    1187
  • Thumbnail: Page 
1188
    1188
  • Thumbnail: Page 
1189
    1189
  • Thumbnail: Page 
1190
    1190
  • Thumbnail: Page 
1191
    1191
  • Thumbnail: Page 
1192
    1192
  • Thumbnail: Page 
1193
    1193