Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the Robustness of a Congestion Control Algorithm for Signaling Networks Based on a State Machine
Responsible organisation
1996 (English)Conference paper, (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Trondheim: Department of Telematics, Norwegian Univ. of Science and Technology , 1996.
Keyword [en]
Network overload, Intelligent networks
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:bth-9959Local ID: oai:bth.se:forskinfo622E3AADFD65DF68C12568A3002CAB0CISBN: 82-993980-0-2 (print)OAI: oai:DiVA.org:bth-9959DiVA: diva2:837961
Conference
Thirteenth Nordic Teletraffic Seminar
Note
This article is written under the Project "Overload Control in Intelligent Networks"Available from: 2012-09-18 Created: 2000-03-15 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(187 kB)48 downloads
File information
File name FULLTEXT01.pdfFile size 187 kBChecksum SHA-512
3493a076ead251a09203ca471f6f05ba170e5d8658e1f14cb7948fba49eeb61b0f19983b6cbf8d7f893201b4832bf763ab3184fe7fbdb4543d2057fb1f248b5e
Type fulltextMimetype application/pdf

Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 48 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 66 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf