AUTOMATIC PLANNING OF 3G UMTS ALL-IP RELEASE 4 NETWORKS WITH REALISTIC TRAFFIC .

AREA COVERAGE

General overview

Related work on UMTS network planning

Problem statement and contributions

Model formulation

Heuristics for the design problem

Conclusion

GENERAL OVERVIEW Most Universal Mobile Telecommunications Systems (UMTS) service providers

are switching to an all- IP (also called flat-IP) architecture.

Using an all-IP architecture within 3G networks provides a cost- effective transport network since the same infrastructure can be used for both voice and data services.

However, planning and designing such an architecture is very complex especially if realistic traffic profiles are taken into consideration.

design and upgrade of networks with a minimum cost become a high priority and challenging for network operators.

The planning products are used to assist network planners to design a cost minimum network while observing several considerations.

Fig 1. 3G UMTS all-IP Release 4 network architecture

In all-IP architecture, user plane and control plane data are transmitted in form of

packets over IP. The facilitators are edge routers and core routers which are respectively

installed in UTRAN and core sites for packet routing purposes.

UMTS networks offer parallel CS (e.g. speech, circuit data, SMS) and PS (e.g. data,

MMS, VoIP, video call, etc.) services. Based on service precedence, reliability, delay,

and throughput, UMTS networks define four Quality of Service (QoS) classes:

conversational, streaming, interactive, and background.

RELATED WORK ON UMTS NETWORK PLANNING

Network planning is a well known field in operation research. In fact, most of the tools proposed in the literature will involve operation research techniques such as discrete optimization and heuristics

Several models and algorithms (both from the fields of network/telecommunication and operation research) have been proposed to solve the planning problem of UMTS networks.

However, due to the high complexity of the problem, most of the proposals only focus on a portion of the network. In fact, the entire planning problem is decomposed into three sub-problems:

(i) the cell planning sub-problem, (ii) the access network planning sub-problem, and (iii) the core network planning sub-problem.

These sub-problems are either considered individually and solved separately or combined and solved jointly.

The cell planning sub-problem :The UMTS air interface is based on W-CDMA.the usual coverage and frequency assignment problems faced in 2G networks do not apply in UMTS networks.The objective of the cell planning sub-problem can be summarized as: Minimizing network cost or electromagnetic field and maximizing capacity, coverage and signal quality.Different profit maximization models have been proposed in the literature.For example, Kalvenes et al. [6] considered the trade-off between the revenue generated per served customer and the cost of constructing new towers.

CONTD……..

The access network planning sub-problem :

Objectives:

1.cost minimization.2.reliability 3.combination of cost and reliability.The core network planning sub-problem :Objectives:

1. Is usually cost minimization (Cost minimization is the main objective, while considering network

quality.)

PROBLEM STATEMENT AND CONTRIBUTIONS

1. New releases such as Release 4, have been standardized.

2. While MSC was the only node to handle both user plane and control plane in Release 99, MGW and MSS were introduced in Release 4 to deal with user plane and control plane respectively.

3. IP transport technology was also introduced as an alternative for ATM .

4. These parameters are important because they consider almost all aspects of the voice and data traffic.

MODEL FORMULATION

Considerations: The location of NodeBs. The potential locations of all NEs(i.e.RNCs,MGWs,MSSs, SGSNs, GGSNs, edge

routers/CS routers/PS routers). The different types of Nes and links,their capacities and their costs. The installation cost for given types of facilities(including for instance: floor

space,cables,racks,electric installations, labor, etc.). The subscriber traffic profile. The planning parameters. The number of subscribers for each NodeB.

OUTPUTS:

1. The number, the location and the type of NEs(i.e. RNCs, MGWs, MSSs, SGSNs, GGSNs, edge routers/CS routers/PS routers) to be installed.

2. The number and the type of links and interfaces. The design of the network topology.

NODE B TRAFFIC RECORD NODE B TRAFFIC RECORD IS A SET OF DIFFERENT ASPECTS FOR VOICE AND DATA TRAFFICS.

SUMMARIZED VERSION OF THE MATHEMATICAL MODEL

HEURISTICS FOR THE DESIGN PROBLEM

A mobile network planner would use the heuristic algorithm instead of the exact model for complexity reasons .

1. Local Search heuristic

2. Tabu search heuristic

CONCLUSION:

1.The aim of the model is to design the network topology which can provide a satisfactory level of service to the subscribers with minimum network cost.

2. The model selects the location and the type of the NEs (i.e. RNCs, MGWs, MSSs, SGSNs, GGSNs, edge routers, CS routers, PS routers), their links and interfaces, as well as the access and core topologies.

3. In fact, we adapted the local search and the tabu search metaheuristics to our specific problem and developed planning tools to solve the design problem.

4. Comparing results from the local search and tabu search with the exact algorithm, we realized that the main advantage of such metaheuristics is the low CPU time.

5.Due to the complexity of the problem, heuristics based on local search and tabu search are also proposed.

6.Results show that the tabu search is able to provide solutions that are close to optimal solutions in a much shorter computation time.

THANK YOU