Overload control of SCP in advanced intelligent network with fairness and priority

Y. Lee, J. S. Song

Research output: Contribution to conferencePaper

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 languageEnglish
Pages85-90
Number of pages6
Publication statusPublished - 1997 Dec 1
EventProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA
Duration: 1997 Sep 221997 Sep 25

Other

OtherProceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97
CityLas Vegas, NV, USA
Period97/9/2297/9/25

Fingerprint

Intelligent networks
Throughput

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Lee, Y., & Song, J. S. (1997). Overload control of SCP in advanced intelligent network with fairness and priority. 85-90. Paper presented at Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97, Las Vegas, NV, USA, .
Lee, Y. ; Song, J. S. / Overload control of SCP in advanced intelligent network with fairness and priority. Paper presented at Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97, Las Vegas, NV, USA, .6 p.
@conference{38ed7d0f18ed4f97a6ddc6cb0b79927b,
title = "Overload control of SCP in advanced intelligent network with fairness and priority",
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.",
author = "Y. Lee and Song, {J. S.}",
year = "1997",
month = "12",
day = "1",
language = "English",
pages = "85--90",
note = "Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 ; Conference date: 22-09-1997 Through 25-09-1997",

}

Lee, Y & Song, JS 1997, 'Overload control of SCP in advanced intelligent network with fairness and priority', Paper presented at Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97, Las Vegas, NV, USA, 97/9/22 - 97/9/25 pp. 85-90.

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 conferencePaper

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 -

Lee Y, Song JS. Overload control of SCP in advanced intelligent network with fairness and priority. 1997. Paper presented at Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97, Las Vegas, NV, USA, .