Abstract
Supporting multiple priority calls, we propose the queueing strategies which efficiently manage the queue to reduce the blocking probability with multiclass calls in multiservice personal communications services (MPCS). The two queueing schemes are proposed and are shown the analytic model with (n+1) class calls. Numerical results demonstrate that the two proposed schemes show the improved performance compared to the previous scheme with two types of traffic in terms of the blocking probability. The proposed schemes are flexibly adaptable to MPCS.
| Original language | English |
|---|---|
| Pages (from-to) | 1069-1083 |
| Number of pages | 15 |
| Journal | Computer Communications |
| Volume | 23 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 2000 Jun 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
Performance analysis of queueing strategies for multiple priority calls in multiservice personal communications services. / Lee, D. C.; Park, S. J.; Song, Joo Seok.
In: Computer Communications, Vol. 23, No. 11, 01.06.2000, p. 1069-1083.Research output: Contribution to journal › Article
TY - JOUR
T1 - Performance analysis of queueing strategies for multiple priority calls in multiservice personal communications services
AU - Lee, D. C.
AU - Park, S. J.
AU - Song, Joo Seok
PY - 2000/6/1
Y1 - 2000/6/1
N2 - Supporting multiple priority calls, we propose the queueing strategies which efficiently manage the queue to reduce the blocking probability with multiclass calls in multiservice personal communications services (MPCS). The two queueing schemes are proposed and are shown the analytic model with (n+1) class calls. Numerical results demonstrate that the two proposed schemes show the improved performance compared to the previous scheme with two types of traffic in terms of the blocking probability. The proposed schemes are flexibly adaptable to MPCS.
AB - Supporting multiple priority calls, we propose the queueing strategies which efficiently manage the queue to reduce the blocking probability with multiclass calls in multiservice personal communications services (MPCS). The two queueing schemes are proposed and are shown the analytic model with (n+1) class calls. Numerical results demonstrate that the two proposed schemes show the improved performance compared to the previous scheme with two types of traffic in terms of the blocking probability. The proposed schemes are flexibly adaptable to MPCS.
UR - http://www.scopus.com/inward/record.url?scp=0033731809&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033731809&partnerID=8YFLogxK
U2 - 10.1016/S0140-3664(00)00171-7
DO - 10.1016/S0140-3664(00)00171-7
M3 - Article
VL - 23
SP - 1069
EP - 1083
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
IS - 11
ER -