Topic
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.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A class of production--distribution planning problems with nonstochastic uncertain demands is modeled as a dynamic game between two players who control flows on a network with node and arc capacity constraints to design a minimum cost network.
Abstract: A class of production--distribution planning problems with nonstochastic uncertain demands is modeled as a dynamic game between two players who control flows on a network with node and arc capacity constraints. Simple conditions are derived for determining which player wins the game. These conditions are then used to design a minimum cost network with the property that its feasible control strategies are allowed to meet the demand without violating the capacity constraints.
58 citations
••
TL;DR: Alternative mixed integer linear formulations for a network design problem in which every pair of nodes can communicate directly show the effectiveness of the formulations: for discounts of 5–10%, the gaps between linear and integer solutions are within few percent.
58 citations
••
01 Nov 2008TL;DR: A bipartite graph model in which nodes and links are geographically located on a plane is considered and a polynomial time algorithm for finding a worst possible cut is developed for finding the location of a disaster that would have the maximum effect on network capacity.
Abstract: Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to human attacks, such as an electromagnetic pulse (EMP) attack. Such real-world events have geographical locations, and therefore, the geographical structure of the network graph affects the impact of these events. In this paper we focus on assessing the vulnerability of (geographical) networks to such disasters. In particular, we aim to identify the location of a disaster that would have the maximum effect on network capacity. We consider a geometric graph model in which nodes and links are geographically located on a plane. Specifically, we model the physical network as a bipartite graph (in the topological and geographical sense) and consider the set of all vertical line segment cuts. For that model, we develop a polynomial time algorithm for finding a worst possible cut. Our approach has the potential to be extended to general graphs and provides a promising new direction for network design to avert geographical disasters or attacks.
58 citations
••
20 Jun 2004TL;DR: Results prove that the queuing behavior of the traffic generated by the MMPP model is coherent with the one produced by the real traces collected at the institution edge router under different networking scenarios and loads.
Abstract: In this paper, we propose a MMPP (Markov modulated Poisson process) traffic model that accurately approximates the LRU (long range dependence) characteristics of Internet traffic traces. Using the notion of sessions and flows, the proposed MMPP model mimics the real hierarchical behavior of the packet generation process by Internet users. Thanks to its hierarchical structure, the proposed model is both simple and intuitive: it allows the generation of traffic with the desired characteristics by easily setting a few input parameters which have a clear physical meaning. Results prove that the queuing behavior of the traffic generated by the MMPP model is coherent with the one produced by the real traces collected at our institution edge router under different networking scenarios and loads. Due to its characteristics, the proposed MMPP traffic model can be used as a simple and manageable tool for IP network performance analysis, as well as for network planning and dimensioning.
58 citations
••
TL;DR: In this paper, a new hybrid methodology by combining fuzzy random simulation (FRS) technique and multi-start simulated annealing (MSA) algorithm is designed to solve the proposed model.
Abstract: This paper addresses the planning and optimization of intermodal hub-and-spoke (IH&S) network considering mixed uncertainties in both transportation cost and travel time. Different from previous studies, this paper develops a novel modeling framework for the IH&S network design problem to jointly minimize the expected value of total transportation costs and the maximum travel time requirement in term of critical value. A new hybrid methodology by combining fuzzy random simulation (FRS) technique and multi-start simulated annealing (MSA) algorithm is designed to solve the proposed model. Numerical experiments are implemented to verify the effectiveness of the proposed model and solution approach.
58 citations