Measurement-Based Optimization of a 3G Core Network: A Case Study

Ricciato, Fabio; Pilz, René; Hasenleithner, Eduard

doi:10.1007/11759355_9

Cited by 18 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, it is not very different from the planning problem in traditional wired networks [21]. Ricciato et al [14] handle the problem of RNC to SGSN assignment in GPRS networks, with the aim to balance the number of SGSN and RNC in order to minimize the inter-SGSN routing. The authors developed a model in integer linear programing and solved it with CPLEX software.…”

Section: A Network Planning Problemmentioning

confidence: 99%

See 1 more Smart Citation

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

Lemamou

Galinier

Chamberland

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

In this paper, we propose a hybrid iterated local search (ILS) heuristic, named GPP4G-ILS, to solve the global planning problem of survivable wireless networks. The planning problem of wireless networks is to determine a set of sites among potential sites to install the various network devices in order to cover a given geographical area. It should also make the connections between the devices in accordance with well-defined constraints. The global planning consists in solving this problem without dividing it into several subproblems. The objective is to minimize the cost of the network while maximizing its survivability. The GPP4G-ILS algorithm is a new form of hybridization between the ILS algorithm and the integer linear programing (ILP) method. We propose a configuration that allows to reuse a previously developed ILP algorithm by integrating it in the ILS algorithm. This allows to benefit from the advantages of both methods. The ILS algorithm is used to effectively explore the search space, while the ILP algorithm is used to intensify the solutions obtained. The performance of the algorithm was evaluated using an exact method that generates optimal solutions for small instances. For larger instances, lower bounds have been calculated using a relaxation of the problem. The results show that the proposed algorithm is able to reach solutions that are, on average, within 0.06% of the optimal solutions and 2.43% from the lower bounds for the instances that cannot be solved optimally, within a reduced computation time. Index Terms-Fourth-generation (4G) networks design, global approach, hybrid methods, iterated local search (ILS), metaheuristics, reliability. 1063-6692 His research interests deal with the solution oflarge-scale instances of difficult (NP-hard) combinatorial problems by using metaheuristics, such as neighborhood search techniques and evolutionary algorithms, in particular memetic algorithms. The problems he studies include both academic problems (notably graph-related problems such as graph coloring, graph partitioning, graph matching, etc.) and various real-world applications, notably in the areas of telecommunication networks and software engineering.

show abstract

Section: A Network Planning Problemmentioning

confidence: 99%

“…In the literature, most papers focus on only one subproblem. They propose diverse models to solve the cell network subproblem [5]- [8], the access network subproblem [9]- [11], and the core network subproblem [12]- [14].…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

Lemamou

Galinier

Chamberland

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…It is not unusual that one or more terabytes of data per second is flowing in a typical mobile operator consisting of 10 to 20 million subscribers which translates into roughly exabytes every month. The scale of this problem rules out direct sniffing approaches [29] , with the additional problem of data packets not carrying information regarding the location of the user. The analysis of mobility requirements necessitates the extraction of handover related information, which can be tracked both in radio access and core network nodes.…”

Section: Dataset and Collection Of Informationmentioning

confidence: 99%

Mobility management: Deployment and adaptability aspects through mobile data traffic analysis

Sanchez

Zeydan

Oliva

et al. 2016

Computer Communications

View full text Add to dashboard Cite

The expected boost in mobile data traffic and the evolution towards the next generation of networks are making cellular operators reconsider whether current approaches for handling mobility could be im proved, according to the characteristics of the mobile traffic that actually flows through real networks. In this work, we make use of extensive analysis of real network traces to infer the main characteristics of mobile data traffic for a particular operator. Our analysis focuses on the features related to mobility, i.e., location information, number of handovers, or duration of the data traffic exchange. New techniques to gather the mobility characteristics of the user based on data and control packets correlation are designed and applied to compare the gains of deploying different mobility management approaches. We show that adapting the mobility management mechanism to the degree of mobility and the network characteristics brings some benefits to the network operator over the current approach, especially in scenarios of low mobility, where a dstributed mobility management solution proves to be more efficient.

show abstract

“…A first paper by Ricciato et al [61] focuses on the assignment of RNCs to SGSNs based on measured data. Their objective is twofold: balance the number of RNC per SGSN and minimize the inter-SGSN routing.…”

Section: Core Network Planningmentioning

confidence: 99%

Topological planning and design of UMTS mobile networks: a survey

St-Hilaire

2008

Wireless Communications

View full text Add to dashboard Cite

In this paper, we present a literature review on the topological planning problem of third generation (3G) cellular networks based on the universal mobile telecommunications system (UMTS) standard. After describing the UMTS architecture, we introduce each subproblem and present major works that have been done. The cell, the access and the core network planning problems have all been considered as well as a more global approach (when more than one subproblems are considered simultaneously). Both planning and expansion algorithms are also included in this review. The goal of this paper is to present and classify the different research works that have been done so that it can be used as a starting point for future research on topological design of UMTS networks.• The optimal number of BSs.• The best location to install the BSs. • The type (or model) of BSs. Fig. 2. UMTS planning subproblems.

show abstract

Measurement-Based Optimization of a 3G Core Network: A Case Study

Cited by 18 publications

References 6 publications

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

Mobility management: Deployment and adaptability aspects through mobile data traffic analysis

Topological planning and design of UMTS mobile networks: a survey

Contact Info

Product

Resources

About