Abstract
In this paper we propose two mechanisms for overload control of SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which an SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. 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 | 85-90 |
| Number of pages | 6 |
| Publication status | Published - 1997 Dec 1 |
| Event | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA Duration: 1997 Sep 22 → 1997 Sep 25 |
Other
| Other | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 |
|---|---|
| City | Las Vegas, NV, USA |
| Period | 97/9/22 → 97/9/25 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science(all)
Cite this
}
Overload control of SCP in advanced intelligent network with fairness and priority. / Lee, Y.; Song, J. S.
1997. 85-90 Paper presented at Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97, Las Vegas, NV, USA, .Research output: Contribution to conference › Paper
TY - CONF
T1 - Overload control of SCP in advanced intelligent network with fairness and priority
AU - Lee, Y.
AU - Song, J. S.
PY - 1997/12/1
Y1 - 1997/12/1
N2 - In this paper we propose two mechanisms for overload control of SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which an SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. 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 paper we propose two mechanisms for overload control of SCP in AIN; continuous gapping method and new arrival gapping method. They are all interactive mechanisms in which an SCP and SSPs exchange load information for overload control. These mechanisms are based on the general ACG and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. 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=0031374244&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0031374244&partnerID=8YFLogxK
M3 - Paper
AN - SCOPUS:0031374244
SP - 85
EP - 90
ER -