| 1. |
|
|
| 2. |
|
|
| 3. |
- Ahlfors, Ulf, et al.
(författare)
-
Overload control strategies in a multiprocessor system with distributed data
- 1995
-
Ingår i: Proceedings of the 5th IEE Conference on Telecommunications, Brighton, UK, March 1995. - 0852966342 ; , s. 145-149
-
Konferensbidrag (refereegranskat)abstract
- This paper addresses overload control issues for distributed control systems, i.e. multiprocessor systems, in telephone exchanges, signalling transfer points, service control points, home location registers, etc. Three different strategies for rejecting calls, due to severe overload conditions, are examined. The strategies differ in that they allow call rejection during different time epochs of the entire life time of the call. The optimal solution, i.e. the largest throughput, can only be obtained by a centrally placed overload control mechanism which collects data from all processors in the system
|
|
| 4. |
- Ahlfors, Ulf, et al.
(författare)
-
Towards Efficient Call Admission Control Criterion for State-Dependent Routing in Multirate Networks
- 1999
-
Ingår i: Proceedings of the 1999 IEEE International Conference on Control Applications, (2):1607-1613, Hawaii, USA, August 1999. - 078035446X ; 2, s. 1607-1613
-
Konferensbidrag (refereegranskat)abstract
- We consider a link serving multiple service classes. We evaluate the properties of the link admission control policies that are obtained from an efficient scheme proposed by Krishnan and Hubner (1997). The Krishnan and Hubner approach suggests efficient calculations of state-dependent routing criteria for multi-rate networks through state-space aggregation. Through simple examples we show that it is possible that the approximations made in the approach might lead to degraded performance, instead of the expected improvement. We outline and discuss a possible extension to the Krishnan and Hubner approach in an effort to address this problem
|
|
| 5. |
|
|
| 6. |
- Ahlfors, Ulf
(författare)
-
Dynamic Traffic Control in Multiservice Networks - Applications of Decision Models
- 2000
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- In this thesis, we develop and examine decision models intended for traffic engineering analysis of multiservice networks. Two important issues are addressed, namely call admission and routing control in multiservice broadband networks, and overload control in distributed-memory systems. Multiservice broadband networking generally refers to the ability to handle widely disparate traffic streams such as voice, data and multimedia services on a single platform architecture. We study call admission and routing control in such networks adopting the well known multi-rate circuit-switched network model. The various services are distinguished by their bandwidth requirements, call characteristics, and performance objectives. The optimal control problem is formulated and examined using the theory of Markov Decision Processes. Some novel structural properties of the optimal call admission policy are revealed, but it is concluded that the general control problem is impractical to solve for any realistic system. Therefore, based on the structural knowledge of the optimal policy, a novel algorithm is formulated through which a reasonably accurate call admission policy can be calculated. It is demonstrated how this algorithm may be embedded into a fixed point network traffic approximation, leading to an efficient state-dependent least cost routing strategy for multiservice broadband networks. The second study in this thesis is devoted to overload control in distributed systems. The architectures considered are distributed-memory, message-passing systems, which essentially are collections of computers that communicate by sending explicit messages to one another. Typically, in order to serve a call, one or several, possibly physically distributed resources will be needed. From an overload control point of view, this poses a complex problem, since it is generally unknown in advance which resources the call will have to involve in order to complete successfully. We formulate and examine the associated optimal control problem using the theory of Markov Decision Processes. Again, it is concluded that the general problem is impractical to solve for any realistic system, and more efficient, yet accurate approximations are therefore developed and examined.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
|
|
