SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "LAR1:bth ;lar1:(bth);srt2:(1995-1999);pers:(Angelin Lars)"

Sökning: LAR1:bth > Blekinge Tekniska Högskola > (1995-1999) > Angelin Lars

  • Resultat 1-7 av 7
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Angelin, Lars, et al. (författare)
  • A Congestion Control Algorithm for Signalling Networks Based on a State Machine Controlled by Network Delays
  • 1995
  • Ingår i: Bangkok Regional International Teletraffic Seminar.
  • Konferensbidrag (refereegranskat)abstract
    • Congestion control in Signaling System number 7 faces new challenges as mobile com-munication systems and Intelligent Networks grow rapidly. New services change traffic patterns, add to signalling network load, and raise demands on shorter service completion times. To handle new demands, the congestion control mechanisms must foresee an over-load situation, and respond to it so that the network can maintain high throughput. With the introduction of a state machine and a memory function for each signaling link it is possible to predict the completion time of a service session and to detect an emerging congestion. If the predicted completion time of a service session is too long, the session is annihilated. This is the foundation of a congestion control mechanism that reacts fast on information supplied by the network. The congestion control mechanism enables the network to main-tain a high throughput during overload.
2.
  • Angelin, Lars, et al. (författare)
  • A Congestion Control Mechanism for Signaling Networks based on Network Delays
  • 1995
  • Ingår i: Twelfth Nordic Teletraffic Seminar. - 951-38-4545-1 ; s. 367-378
  • Konferensbidrag (refereegranskat)abstract
    • Congestion control in Signaling System #7 faces new challenges as mo-bile communication systems and Intelligent Networks grow rapidly. New ser-vices change traffic patterns, add to signalling network load, and raise demands on shorter service completion times. To handle new demands, the congestion control mechanisms must foresee an overload situation, and respond to it so that the network can maintain high probability for successful service comple-tion. With the introduction of a state machine and a memory function for each signaling link it is possible to predict the completion time of a service session and to detect an emerging congestion. If the predicted completion time of a service session is too long, the session is annihilated. This is the foundation of a congestion control mechanism that reacts fast on information supplied by the congested part of the network. The congestion control mechanism increases the ratio of successfully completed service sessions during congestion by several hundred percent.
3.
  • Angelin, Lars, et al. (författare)
  • A Network Approach to Signalling Network Congestion Control
  • 1995
  • Ingår i: Second St. Petersburg Regional International Teletraffic Seminar. ; s. 10-21
  • Konferensbidrag (refereegranskat)abstract
    • Congestion control in Signaling System #7 faces new challenges as mobile communication systems and Intelligent Networks grow rapidly. New services change traffic patterns, add to signalling network load, and raise demands on shorter service completion times. To handle new demands, the congestion control mechanisms must foresee an overload situation, and respond to it so that the net-work can maintain high probability for successful service completion. By measur-ing the time consumption for the initial Message Signalling Units of a service session it is possible to predict the duration of the service session and to detect an emerging congestion. If the predicted duration of the service session is too long, the service session is annihilated. This is the foundation of a congestion control mechanism that reacts fast and on information supplied by the congested part of the network. The congestion control mechanism increases the ratio of successfully completed services during congestion by several hundred percent.
4.
  • Angelin, Lars (författare)
  • On the Properties of a Congestion Control Mechanism for Signaling Networks Based on a State Machine
  • 1996
  • Rapport (övrigt vetenskapligt)abstract
    • Congestion control in signaling systems is a necessity to fulfil the requirements of a tele-communication network that aims satisfy the customers’ requirements on service quality. Heavy network load is an important source of customer dissatisfaction as congested net-works result in deteriorated service quality. Sessions of a signaling service with high real time demands which are subject to unacceptable 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 improve the performance of all sessions in progress, if such delayed sessions could be aborted 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 considers 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 several hundred percent under favorable circum-stances. The state machine approach is proven to perform well in all types of environ-ments. The robustness and stability of the proposed CCM is demonstrated in a wide range of environments. The fairness in the admission of signaling services into the network at very high loads are also shown to be good.
5.
  • Angelin, Lars, et al. (författare)
  • On the Robustness of a Congestion Control Algorithm for Signaling Networks Based on a State Machine
  • 1996
  • Ingår i: Thirteenth Nordic Teletraffic Seminar. - 82-993980-0-2 ; s. 338-351
  • Konferensbidrag (refereegranskat)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.
6.
  • Arvidsson, Åke, et al. (författare)
  • Congestion Control in Intelligent Networks for Real Time Performance and Profit Optimisation
  • 1996
  • Ingår i: Tenth International Teletraffic Congress Specialist Seminar. ; s. 347-358
  • Konferensbidrag (refereegranskat)abstract
    • Current developments in technologies and markets stress the importance of exible and robust performance optimisation and congestion control. In intelligent networks, congestion control has traditionally taken a purely technical view and focused on pro- tecting individual nodes from harmful overloads. We take a profit oriented, network wide view and develop a congestion control mechanism to ensure real time performance under profit maximisation. Numerical studies in a simulator show that the proposed mechanism is robust and, in particular in overloaded states, provides a substantial improvement in comparison to conventional load control mechanisms.
7.
  • Arvidsson, Åke, et al. (författare)
  • Profit Optimal Congestion Control in Intelligent Networks
  • 1997
  • Ingår i: 15th International Teletraffic Congress on Teletraffic Contributions for the Information. - 0-444-82598-3 ; s. 911-920
  • Bokkapitel (refereegranskat)abstract
    • Current developments in technologies and markets stress the importance of exible and robust performance optimisation and congestion control. In intelligent networks, conges- tion control has traditionally taken a mainly technical view and focused on protecting individual nodes from harmful overloads. We take a profit oriented, network wide view and develop a congestion control mechanism to ensure profit maximisation under real time performance. Numerical studies in a simulator show that the proposed mechanism is robust and, in particular in overloaded states, provides a substantial improvement in comparison to conventional load control mechanisms.
Skapa referenser, mejla, bekava och länka
  • Resultat 1-7 av 7
Åtkomst
fritt online (7)
Typ av publikation
konferensbidrag (5)
bokkapitel (1)
rapport (1)
Typ av innehåll
refereegranskat (6)
övrigt vetenskapligt (1)
Författare/redaktör
Arvidsson, Åke (6)
Pettersson, Stefan, (3)
Lärosäte
Språk
Engelska (7)

År

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy