Network planning and design

About: Network planning and design is a research topic. Over the lifetime, 12393 publications have been published within this topic receiving 229776 citations. The topic is also known as: network design.

Minimal cost coverage planning for single frequency networks

Abstract: OFDM based single frequency networks (SFNs) have been standardized for terrestrial broadcasting systems, for digital audio broadcasting (DAB) as well as for digital video broadcasting (DVB). Due to the multipath tolerance of the OFDM scheme, the receiver is able to combine signals coming from several transmitters, despite of the varying propagation delays, i.e., heavy artificial multipath propagation. In order to take full advantage of the diversity gain provided by the SFN architecture, proper network design is required. We focus on the cost efficient design of an SFN providing broadcasting services over a predefined service area with requirements both on the received signal quality and on the allowable interference level experienced by existing services in the same spectrum. We formulate the problem as a discrete optimization problem, where the network design parameters such as power, antenna heights and transmitter locations are the decision variables. The general stochastic optimisation algorithm simulated annealing has been adapted for solving the above problem. The novelty of our method is that cost factors and interference constraints are embedded in the optimisation procedure. Through numerical examples we demonstrate that significant reduction in network cost can be achieved by our approach.

The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic

Abstract: Many air, less-than-truck load and intermodal transportation and telecommunication networks incorporate hubs in an effort to reduce total cost. These hubs function as make bulk/break bulk or consolidation/deconsolidation centres. In this paper, a new hub location and network design formulation is presented that considers the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with the demands on the arcs. The problem is formulated as a mixed integer programming problem embedding a multi-commodity flow model. The formulation can be transformed into some previously modelled hub network design problems. We develop a dual-based heuristic that exploits the multi-commodity flow problem structure embedded in the formulation. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.

Efficient implementation of heuristics for the continuous network design problem

Abstract: In this paper, we present an efficient implementation of heuristic procedures for solving the continuous network design problem where network users behave according to Wardrop's first principle of traffic equilibrium. Numerical results involving a “standard” benchmark problem are given. Also, it is shown that the cost mapping arising in the Iterative-Optimization-Assignment algorithm is integrable if and only if the volume-delay function is of either the BPR or some logarithmic form.

A Review of Network Traffic Analysis and Prediction Techniques.

Abstract: Analysis and prediction of network traffic has applications in wide comprehensive set of areas and has newly attracted significant number of studies. Different kinds of experiments are conducted and summarized to identify various problems in existing computer network applications. Network traffic analysis and prediction is a proactive approach to ensure secure, reliable and qualitative network communication. Various techniques are proposed and experimented for analyzing network traffic including neural network based techniques to data mining techniques. Similarly, various Linear and non-linear models are proposed for network traffic prediction. Several interesting combinations of network analysis and prediction techniques are implemented to attain efficient and effective results. This paper presents a survey on various such network analysis and traffic prediction techniques. The uniqueness and rules of previous studies are investigated. Moreover, various accomplished areas of analysis and prediction of network traffic have been summed.