| 1. |
- Angelin, Lars, et al.
(author)
-
A Congestion Control Algorithm for Signalling Networks Based on a State Machine Controlled by Network Delays
- 1995
-
Conference paper (peer-reviewed)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.
(author)
-
A Congestion Control Mechanism for Signaling Networks based on Network Delays
- 1995
-
Conference paper (peer-reviewed)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.
(author)
-
A Network Approach to Signalling Network Congestion Control
- 1995
-
Conference paper (peer-reviewed)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, et al.
(author)
-
On the Robustness of a Congestion Control Algorithm for Signaling Networks Based on a State Machine
- 1996
-
Conference paper (peer-reviewed)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.
|
|
| 5. |
- Arvidsson, Åke, et al.
(author)
-
Analysis of the Accuracy of Bursty Traffic Models
- 1993
-
Conference paper (peer-reviewed)abstract
- Traffic models are an essential component of performance analyses of telecommunication networks. This paper investigates the modeling of bursty traffic streams in both single source and multiple source environments. Using a ranking scheme it is shown that, for the single server case, the switched Poisson process models performed the best and that for the multiple source case, models based on the switched Poisson process, or its discrete version (switched Bernoulli) together with the threshold model may give the closest match to the performance of the “real data“. The results also seem to suggest that for traffic for which there is no known, ideal model, a traffic-oriented fitting method performs better than a model oriented one. This study has concentrated on a particular set of “real data” and it has not tried to consider the many different types of bursty traffic, since, at the time of commencing this study, there was little real data available
|
|
| 6. |
- Arvidsson, Åke, et al.
(author)
-
Congestion Control in Intelligent Networks for Real Time Performance and Profit Optimisation
- 1996
-
Conference paper (peer-reviewed)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.
(author)
-
Forecasting Cellular Mobile Traffic : An Econometric Approach
- 2006
-
Conference paper (peer-reviewed)abstract
- We consider the problem of explaining and forecasting the volume of cellular mobile traffic in a long-term perspective. To this end, we create a model of a market with both economic and non-economic variables, viz. the state of the economy, the current price level and the penetration effect on the market in question. We measure these variables by using publicly available data and by applying income theories and by combining theories of demand and technology diffusion. Applying the model to three markets, viz. China, Italy and Sweden, we show that it performs very well in explaining and predicting the volume of cellular mobile traffic. Noting the qualitative differences between these markets, we conclude that the model has some universality in that the results are comparable for all of them
|
|
| 8. |
- Arvidsson, Åke
(author)
-
High Level B-ISDN/ATM Traffic Management in Real Time
- 1995
-
In: Performance Modelling and Evaluation of ATM Networks. - London : Chapman & Hall. - 0412711400 ; , s. 177-207
-
Book chapter (other academic/artistic)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].
|
|
| 9. |
- Arvidsson, Åke
(author)
-
Management of Reconfigurable Virtual Path Networks
- 1994
-
In: The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks. - Amsterdam : Elsevier. - 9920106445 ; , s. 931-940
-
Book chapter (other academic/artistic)abstract
- We study dynamically rearrangable end-to-end transport networks by means of SDH/SONET and/or ATM virtual paths. The concept and its advantages are brie y reviewed and we propose a new algorithm for designing such networks. Our algorithm provides integer solutions, handles non-linear equivalent bandwidths, finds its own paths, and allows for an arbitrary design optimisation criterion. It is found to perform equal to or better than an earlier, comparable though more restricted, algorithm. We also put forward a strategy for managing virtual paths in real time. It consists of a repeated cycle of on-line measurement of offered traffics followed by the design and implementation of a new virtual path network. Methods and parameters for traffic measurements and network updating frequency are studied and optimised. Applying the strategy to rearrangeable networks subject to variable traffics in a simulator, we discover considerable gains and a robustness in our parameter settings.
|
|
| 10. |
- Arvidsson, Åke
(author)
-
On Dynamic Capacity Management in Voice/Frame Relaying Networks
- 1992
-
Conference paper (peer-reviewed)abstract
- We consider call admission and capacity management in a dynamically reconfigurable network that carries a multitude of traffics. Our approach is a heuristic capacity as- signment algorithm designed to maximise an arbitrary profit function. The algorithm is based on the concept of equivalent circuits, i.e. a given relationship between transmis- sion capacities and call handling capabilities expressed as effective numbers of circuits. Such relationships are examined for the two traffics of our application, voice and frame relaying. Methods and results are independent of the transfer mode used.
|
|
