Abstract
In this article we propose two mechanisms for overload control SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which as SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG, however different call gapping times are applied to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. The analytic and simulation results show that the call throughput in the two mechanisms is almost same and fairness about the probability of rejection is maintained with the same value on all SSPs. On the priority scheme, new arrival gapping method has better priority achievement than continuous gapping method.
| Original language | English |
|---|---|
| Pages (from-to) | 137-143 |
| Number of pages | 7 |
| Journal | Computer Communications |
| Volume | 22 |
| Issue number | 2 |
| Publication status | Published - 1999 Jan 25 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
An overload control of SCP in advanced intelligent network with fairness and priority. / Lee, Yong; Song, Joo Seok.
In: Computer Communications, Vol. 22, No. 2, 25.01.1999, p. 137-143.Research output: Contribution to journal › Article
TY - JOUR
T1 - An overload control of SCP in advanced intelligent network with fairness and priority
AU - Lee, Yong
AU - Song, Joo Seok
PY - 1999/1/25
Y1 - 1999/1/25
N2 - In this article we propose two mechanisms for overload control SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which as SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG, however different call gapping times are applied to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. The analytic and simulation results show that the call throughput in the two mechanisms is almost same and fairness about the probability of rejection is maintained with the same value on all SSPs. On the priority scheme, new arrival gapping method has better priority achievement than continuous gapping method.
AB - In this article we propose two mechanisms for overload control SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which as SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG, however different call gapping times are applied to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. The analytic and simulation results show that the call throughput in the two mechanisms is almost same and fairness about the probability of rejection is maintained with the same value on all SSPs. On the priority scheme, new arrival gapping method has better priority achievement than continuous gapping method.
UR - http://www.scopus.com/inward/record.url?scp=0032652265&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032652265&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0032652265
VL - 22
SP - 137
EP - 143
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
IS - 2
ER -