| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Angelin, Lars, et al.
(författare)
-
A Congestion Control Algorithm for Signalling Networks Based on a State Machine Controlled by Network Delays
- 1995
-
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.
|
|
| 5. |
- Angelin, Lars, et al.
(författare)
-
A Congestion Control Mechanism for Signaling Networks based on Network Delays
- 1995
-
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.
|
|
| 6. |
- Angelin, Lars, et al.
(författare)
-
A Network Approach to Signalling Network Congestion Control
- 1995
-
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.
|
|
| 7. |
- Arvidsson, Åke
(författare)
-
High Level B-ISDN/ATM Traffic Management in Real Time
- 1995
-
Ingår i: Performance Modelling and Evaluation of ATM Networks. - London : Chapman & Hall. - 0412711400 ; , s. 177-207
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- We study real time traffic management in the perspective of a four-level model of traffic variations: cells, bursts, sessions, and links. Our interest is focused on the two latter levels: Using virtual channels (VCs) and virtual paths (VPs) as the managed entities on the two levels respectively, we put forward a simple and robust strategy for traffic management in real time: All nodes simultaneously monitor offered traffics and forward the result to a network management centre (NMC); The NMC computes a new set of optimal VPs and compares the result to the existing network; If a change appears profitable, the necessary information is sent back to the nodes and the new design is implemented. Applying our strategy to control general networks subject to traffics which in advance are known only as expectations, we develop simple methods for traffic observation, the optimal observation interval, a fast and efficient algorithm to compute VP networks, a test to determine whether to implement a new design in which costs related to lost traffic are compared to processing costs, and the optimal updating interval. Running our strategy in a simulator, we discover a considerable adaptivity, large savings in transmission capacity, and a performance far better than achieved by fixed redesign according to forecasts. Finally we discuss limits to the range of variations within which our strategy can be applied. The present work applies both to networks using SDH/SONET and/or networks based on ATM, i.e. both to present public switched telephony networks and broadband inte- grated services digital networks, and is a summary and extension of earlier works within this area [3{9].
|
|
| 8. |
- Arvidsson, Åke
(författare)
-
On the Usage of Virtual Paths, Virtual Channels, and Buffers in ATM Traffic Management
- 1995
-
Konferensbidrag (refereegranskat)abstract
- Traffic in ATM networks can be described by numerous parameters. On a per session basis, one may use peak rate, average rate, sustainable rate, average burst duration, average silence duration, and others. In a longer time scale, parameters like the average and peakedness of connection request interarrival times, the average and variance of session holding times, and so on are proposed. Theoretically, users should provide the former parameters and network operators the latter. In reality, however, few users can be expected to provide all sorts of statistical information about their traffic in advance, and operators do not have enough experience to prepare traffic forecasts for new services and applications. Moreover, even if the information could be provided, the lack of simple yet valid traffic models for ATM networks means that it is far from clear how such information should be used. Realising that ATM networks, which are already being built, at least for the next few years will have to operate under these uncertain conditions, we propose a robust and forgiving network design and traffic management strategy. The idea is to use only little information about offered traffics and then dynamically control resource allocations, so as to provide acceptable quality of service combined with high utilisation. The network design is based on the idea of keeping congestion at the edges of the net- work, so that the operating areas of fast congestion control mechanisms are minimised. Traffic variations are characterised by a model of six layers, each of which is assigned a corresponding layer in a traffic management model. We define the functionalities of each level in the latter modell and review possible implementations. In particular, we report on an implementation of two of these layers and discuss in some detail how a third one could be added.
|
|
| 9. |
- Arvidsson, Åke, et al.
(författare)
-
On the Validity of Some Markovian Models in ATM Traffic Modelling
- 1995
-
Konferensbidrag (refereegranskat)abstract
- Markov modulated models are often used to model traffic in a network. How well the processes really capture the essentials of real traffic is less known. We review some of these models and apply a number of associated fitting methods to an Ethernet traffic in different timescales. The fitted models are then used as input to a buffer where buffer occupancies are used as a measure of the goodness of the models. Also, the ability of a fitting method to correctly model the traffic when applied to traffic generated from a model that the fitting method was intended for is examined.
|
|
| 10. |
- Arvidsson, Åke
(författare)
-
Real Time Traffic Management by Dynamic Bandwidth Allocation
- 1995
-
Konferensbidrag (refereegranskat)abstract
- We introduce a six layer model of traffic variations and a corresponding model of management actions. In particular, we traffic study real time traffic management on the traffic and session levels which correspond to variations on the hour and minute levels. Using virtual paths (VPs) and virtual channels (VCs) as the managed entities on the two levels respectively, we put forward a simple and robust strategy for traffic management in real time: For slow variations, i.e. on the traffic level, all nodes simultaneously monitor offered traffics and forward the result to a network management centre (NMC); The NMC computes a new set of optimal VPs compares the result to the existing network; If a change appears profitable, the necessary information is sent back to the nodes and the new design is implemented. For fast variations, i.e. on the session level, dynamic routing schemes similar to those of public switched telephone networks are employed. Applying our strategy to control general networks subject to traffics which in advance are known only as expectations, we develop simple methods for traffic observation, derive the optimal observation interval, brie y review algorithms to compute VP networks, develop a cost optimal test to determine whether to implement a new design or not, and derive the optimal updating interval. Running our strategy in a simulator, we discover a considerable adaptivity and a performance far better than obtained by alternative methods.
|
|
