Maximum likelihood algorithm for link allocation

Author

Joutsensalo, J. ; Hämäläinen, Timo

Author_Institution

Dept. of Math. Inf. Technol., Jyvaskyla Univ., Finland

Volume

2

fYear

2001

fDate

2001

Firstpage

368

Abstract

We introduce an algorithm for the network link allocation. The link may be wired or wireless, so this method can be adapted e.g. in 3G networks. The algorithm allocates resources between two network devices. It is possible to allocate data rates using arbitrary number of user QoS classes, say $ 0.1, $ 0.2,..., $ 10. The maximal capacity of the data network infrastructure is exploited. The performance of the algorithm is justified from the maximum likelihood point of view

Keywords

cellular radio; channel allocation; channel capacity; code division multiple access; multiuser channels; quality of service; radio links; telecommunication network routing; time division multiple access; 3G networks; CDMA channels; QoS; TDMA channels; computational complexity; data network infrastructure; data rates; link allocation algorithms; maximum likelihood algorithm; maximum likelihood routing algorithm; network devices; network link allocation; network routing; resource allocation; wired network; wireless network; Added delay; Channel capacity; Cities and towns; Context-aware services; Cost function; Delay effects; Information technology; Quality of service; Resource management; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on

Conference_Location

Beijing

Print_ISBN

0-7803-7010-4

Type

conf

DOI

10.1109/ICII.2001.983605

Filename

983605