| 1. |
|
|
| 2. |
- Kihl, Maria, et al.
(author)
-
A study of methods for protecting an SCP from overload
- 1995
-
In: Proceedings of 5th IEE Conference on Telecommunications. - 0852966342 ; , s. 125-129
-
Conference paper (peer-reviewed)abstract
- This paper deals with overload control algorithms that should see to that throughput in an service control points (SCP) is kept high, also under severe overload conditions. A couple of basic overload control schemes like random admittance, call gapping and window flow control are examined. We stress that the algorithms should both be efficient and show fairness among a number of SSPs logically connected to the SCP over Signalling System Number 7. Without a proper exchange of load information between the SSPs and the SCP only efficiency can be achieved. To have fairness among the SSPs this exchange of information is necessary
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Kihl, Maria, et al.
(author)
-
Load balancing strategies for TINA networks
- 1999
-
In: Teletraffic engineering in a competitive world : proceedings of the International Teletraffic Congress - ITC-16, Edinburgh International Conference Centre, United Kingdom, 7-11 June, 1999. - 0444502688
-
Conference paper (peer-reviewed)abstract
- TINA is an open, object oriented, distributed telecom architecture, with many concepts taken directly from the latest computer research. In TINA, instances of the same object type can be placed on different physical nodes. Therefore, the network performance can be improved by introducing load balancing algorithms. These algorithms should distribute the traffic between the object instances in such way that the overall throughput and setup time are improved. We discuss and examine a number of simple distributed load balancing algorithms, that do not require any extra load information exchange between the nodes. The results show that it is difficult to find an algorithm that behave well for all traffic situations. The main problem is that the algorithms have not enough information about the load situation on the different nodes, since no load information is exchanged between the nodes. This problem can be solved by adding the feasibility of load status information to the TINA protocols.
|
|
| 9. |
- Kihl, Maria, et al.
(author)
-
Measuring real-time performance in distributed object oriented systems
- 1999
-
In: Performance and control of network systems III : 20-21 September 1999, Boston, Massachusetts. - 0819434345 ; , s. 248-258
-
Conference paper (other academic/artistic)abstract
- The principles of distributed object oriented programming offer great possibilities for flexible architectures in multiple fields. In telecommunications, an architecture called Telecommunication Information Networking Architecture (TINA) has been developed using these very principles. It allows telecommunication services to be implemented using software objects that in turn can be executed in a location transparent way in a network. The location transparency offers great flexibility for service creation, but as the software must be executed somewhere in the network on nodes of finite capacity, performance problems can arise due to inefficient placement of objects causing either overloaded nodes or excessive and unneccesary inter-node communication. To ensure good performance, various measures of load control and load balancing must be taken. We discuss how to measure the performance of a distributed object oriented system and examine two load balancing algorithms that can be used in such systems. of finite capacity, performance problems can arise due to inefficient placement of objects causing either overloaded nodes or excessive and unneccesary inter-node communication. To ensure good performance, various measures of load control and load balancing must be taken. We discuss how to measure the performance of a distributed object oriented system and examine two load balancing algorithms that can be used in such systems.
|
|
| 10. |
|
|
