scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: This work shows that the above problem, and in fact, several basic problems in this general network design framework, cannot be approximated better than Ω(log log n) unless NPNO
Abstract: Consider the following classical network design problem: a set of terminals T = ltir wishes to send traffic to a root r in an n-node graph G = (V, E). Each terminal ti sends di units of traffic and enough bandwidth has to be allocated on the edges to permit this. However, bandwidth on an edge e can only be allocated in integral multiples of some base capacity ue and hence provisioning k × ue bandwidth on edge e incurs a cost of ⌈k⌉ times the cost of that edge. The objective is a minimum-cost feasible solution.This is one of many network design problems widely studied where the bandwidth allocation is governed by side constraints: edges can only allow a subset of cables to be purchased on them or certain quality-of-service requirements may have to be met.In this work, we show that this problem and, in fact, several basic problems in this general network design framework cannot be approximated better than Ω(log log n) unless NP ⊆ DTIME (nO(log log log n)), where vVv = n. In particular, we show that this inapproximability threshold holds for (i) the Priority-Steiner Tree problem, (ii) the (single-sink) Cost-Distance problem, and (iii) the single-sink version of an even more fundamental problem, Fixed Charge Network Flow. Our results provide a further breakthrough in the understanding of the level of complexity of network design problems. These are the first nonconstant hardness results known for all these problems.

75 citations

Journal ArticleDOI
01 Jun 2008
TL;DR: This paper proposes polymorphic on-chip networks to enable per-application network customization, and demonstrates its modes of configurability, and evaluates the polymorphic network architecture design space, producing polymorphic fabrics that minimize the network area overhead.
Abstract: As the number of cores per die increases, be they processors, memory blocks, or custom accelerators, the on-chip interconnect the cores use to communicate gains importance. We begin this study with an area-performance analysis of the interconnect design space. We find that there is no single network design that yields optimal performance across a range of traffic patterns. This indicates that there is an opportunity to gain performance by customizing the interconnect to a particular application or workload. We propose polymorphic on-chip networks to enable per-application network customization. This network can be configured prior to application runtime, to have the topology and buffering of arbitrary network designs. This paper proposes one such polymorphic network architecture. We demonstrate its modes of configurability, and evaluate the polymorphic network architecture design space, producing polymorphic fabrics that minimize the network area overhead. Finally, we expand the network on chip design space to include a polymorphic network design, showing that a single polymorphic network is capable of implementing all of the pareto optimal fixed-network designs.

75 citations

Patent
29 Dec 1995
TL;DR: In this article, a system and method for using service impact analysis (SIA) to provide a telecommunications network carrier with improved real-time information on network failures is presented, which assesses the fault data to determine the actual service impact at a particular instant in time and the likely cause of the fault.
Abstract: A system and method for using service impact analysis (SIA) to provide a telecommunications network carrier with improved real-time information on network failures. The system monitors a network for faults by collecting fault data. The system assess the fault data to determine the actual service impact at a particular instant in time and the likely cause of the fault. The system also predicts future service impact based on collected historical data of the telecommunications network. The system thus associates equipment failures with actual and potential call traffic impact to provide both customer and network support operations with additional perspective on the service impact of a network equipment failure. This customer oriented view, rather that the traditional network oriented view, is significant in providing imported telecommunications service availability with limited human resources.

75 citations

Journal ArticleDOI
TL;DR: This article uses reliability indices and develops analytical formulations that model the impact of upstream supply chain on individual entities’ reliability to quantify the total reliability of a network.
Abstract: Risk management in supply chains has been receiving increased attention in the past few years. In this article, we present formulations for the strategic supply chain network design problem with dual objectives, which usually conflict with each other: minimizing cost and maximizing reliability. Quantifying the total reliability of a network design is not as straightforward as total cost calculation. We use reliability indices and develop analytical formulations that model the impact of upstream supply chain on individual entities’ reliability to quantify the total reliability of a network. The resulting multiobjective nonlinear model is solved using a novel hybrid algorithm that utilizes a genetic algorithm for network design and linear programming for network flow optimization. We demonstrate the application of our approach through illustrative examples in establishing tradeoffs between cost and reliability in network design and present managerial implications.

75 citations

Journal ArticleDOI
TL;DR: The proposed PP model enables a decision maker to consider multiple criteria (i.e., cost, customer service and intangible benefits) and to express criteria preferences not in a traditional form of weights, but in ranges of different degrees of desirability.

75 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
85% related
Network packet
159.7K papers, 2.2M citations
84% related
Wireless network
122.5K papers, 2.1M citations
84% related
Node (networking)
158.3K papers, 1.7M citations
83% related
Wireless
133.4K papers, 1.9M citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202390
2022195
2021432
2020493
2019570
2018573