Load balancing in UTRAN by bipartite graphs

Author

Javan, Mohammad Reza ; Bouzari, Seyed Mahdi ; Tabandeh, Mahmoud

Author_Institution

Sch. of Eng., Tarbiat Modares Univ., Tehran

fYear

2008

fDate

10-11 July 2008

Firstpage

301

Lastpage

306

Abstract

3G wireless communication is the next version of mobile networks. Load balancing in networks causes efficient using of network resources. In this paper, we propose an efficient algorithm for load balancing of radio network controllers (RNCs) in radio access networks (RANs). As the characteristics of connections between RNCs and BTSs in a RAN are similar to those of graphs, we make use of graphs to solve our problem. The algorithm is based on the finding a path by which the RNCs could exchange their overloads. By using these paths the algorithm load balances the RNCs in an efficient and fast way. By testing our algorithm on networks with different topology and comparing the results, the efficiency and ability of our algorithm will be verified.

Keywords

3G mobile communication; graph theory; radio access networks; resource allocation; telecommunication network topology; 3G wireless communication; UTRAN; bipartite graphs; load balancing; mobile networks; network resources; radio access networks; radio network controllers; 3G mobile communication; Bipartite graph; Communication system control; Communications technology; Load management; Radio access networks; Radio control; Radio network; Traffic control; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems for Communications, 2008. ECCSC 2008. 4th European Conference on

Conference_Location

Bucharest

Print_ISBN

978-1-4244-2419-1

Electronic_ISBN

978-1-4244-2420-7

Type

conf

DOI

10.1109/ECCSC.2008.4611697

Filename

4611697