On the Robustness of a Congestion Control Algorithm for Signaling Networks Based on a State Machine

Document type: Conference Papers
Peer reviewed: Yes
Full text:
Author(s): Lars Angelin, Åke Arvidsson
Title: On the Robustness of a Congestion Control Algorithm for Signaling Networks Based on a State Machine
Conference name: Thirteenth Nordic Teletraffic Seminar
Year: 1996
Pagination: 338-351
ISBN: 82-993980-0-2
Publisher: Department of Telematics, Norwegian Univ. of Science and Technology
City: Trondheim
Organization: Blekinge Institute of Technology
Department: Dept. of Telecommunications and Mathematics (Institutionen för telekommunikation och matematik)
Dept. of Telecommunications and Mathematics S-371 79 Karlskrona
+46 455 780 00
http://www.hk-r.se/itm/index.html
Authors e-mail: larsa@itm.hk-r.se
Language: English
Abstract: Sessions of a signaling service with high real time demands which are subject to unaccept-able
delays may be obsolete or prematurely terminated by the customer; in either way,
they are a burden to the signaling network. It would ease the load of the network and im-prove
the performance of all sessions in progress, if such delayed sessions could be abort-ed
as quickly as possible. By measuring the network delay on individual signals of a
service session, it is possible to perform signaling network congestion control that consid-ers
the state in the entire signaling network. Under the assumption that a session comprises
a sequence of signals between one originating node and an arbitrary number of destination
nodes, it is possible to predict the total duration of a session. The prediction is calculated
from previously completed signals using a state machine, which is defined per signaling
link. The annihilation of sessions, for which the prediction exceeds a predefined time limit,
is an embryo of a simple signaling network congestion control mechanism (CCM). This
simple CCM increases the number of successfully completed services with a few hundred
percent under favorable circumstances. The state machine approach has been proven to
function well in all types of environments. The robustness and stability of the proposed
CCM is demonstrated and the fairness in the admission of signaling services into the net-work
at very high loads are also shown.
Subject: Telecommunications\Overload Control in Intelligent Networks
Keywords: Network overload, Intelligent networks
Note: This article is written under the Project "Overload Control in Intelligent Networks"
Edit