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
01 Nov 1987
TL;DR: The NDF uses a partitioned data path, low-voltage output drivers, and a distributed token-passing arbiter to provide a bandwidth of 450Mbits/sec into the network to facilitate the development of network nodes.
Abstract: : We describe the design of the network design frame, (NDF), a self-timed routing chip for a message-passing concurrent computer The NDF uses a partitioned data path, low-voltage output drivers, and a distributed token-passing arbiter to provide a bandwidth of 450Mbits/sec into the network Wormhole routing and bidirectional virtual channels are used to provide low latency communications, less than micro seconds latency to deliver a 216 bit message across the diameter of a 1K node machine To support concurrent software systems, the NDF provides two logical networks, one for user messages and one for system messages, that share the same set of physical wires To facilitate the development of network nodes, the NDF is a design frame The NDF circuitry is integrated into the pad frame of a chip leaving the center of the chip uncommitted

81 citations

Patent
30 Mar 2009
TL;DR: In this article, a femto gateway node is used to collect network operation data within a confined indoor wireless environment for generation of competitive intelligence and strategic network planning, which can be employed to identify service provider indoor coverage strengths or weaknesses relative to competitors to focus sales activities related to network services.
Abstract: System(s) and method(s) are provided to collect network operation data within a confined indoor wireless environment for generation of competitive intelligence and strategic network planning. Scanner component(s) survey and compare signals transported in a set of electromagnetic frequency bands, and in accordance with a set of radio technologies associated with competing networks. Collected data can be aggregated and delivered to femto gateway node(s), which can supply the data to an analysis component that generates network operations NetOp intelligence. A report component can manage received and aggregated network operation data and convey a portion thereof to planning tool(s) that can produce competitive intelligence and develop strategic network planning. Planning tool(s) can request specific network operation data or NetOp intelligence. Aggregated network operation data can be employed to identify service provider indoor coverage strengths or weaknesses relative to competitors to focus sales activities related to network services, and network improvement efforts.

81 citations

Journal ArticleDOI
TL;DR: This paper uses a time-dependent network to describe the possible car movements in time and space, and shows how this network can be transformed into a network with fixed costs on links representing movements of cars with identical origin and destination terminals, a capacitated network design model.
Abstract: In this paper, we consider empty freight car distribution in a scheduled railway system. We analyze the cost structure for the repositioning of empty cars, and conclude that the distribution cost shows an economy-of-scale behavior. In addition to the cost proportional to the number of cars sent from origin to destination, there is a cost related to car-handling operations at yards, which depends on the number of car groups that are handled. Thus, if we can find a transportation pattern in which fewer but larger groups of cars are built, the total distribution cost can be decreased.The objective of the paper is to propose an optimization model that explicitly takes this economy-of-scale effect into account. We use a time-dependent network to describe the possible car movements in time and space, and show how this network can be transformed into a network with fixed costs on links representing movements of cars with identical origin and destination terminals. The resulting optimization model is a capacitated network design model, where each capacity constraint limits the flow on several arcs. We describe a tabu heuristic for solving the model, and present computational results.

81 citations

Proceedings ArticleDOI
14 Mar 2010
TL;DR: This paper investigates a measure called pairwise connectivity and formulates this vulnerability assessment problem as a new graph-theoretical optimization problem called Disruptor, which aims to discover the set of critical node/edges, whose removal results in the maximum decline of the global Pairwise connectivity.
Abstract: Assessing network vulnerability before potential disruptive events such as natural disasters or malicious attacks is vital for network planning and risk management It enables us to seek and safeguard against most destructive scenarios in which the overall network connectivity falls dramatically Existing vulnerability assessments mainly focus on investigating the inhomogeneous properties of graph elements, node degree for example, however, these measures and the corresponding heuristic solutions can provide neither an accurate evaluation over general network topologies, nor performance guarantees to large scale networks To this end, in this paper, we investigate a measure called pairwise connectivity and formulate this vulnerability assessment problem as a new graph-theoretical optimization problem called β-disruptor, which aims to discover the set of critical node/edges, whose removal results in the maximum decline of the global pairwise connectivity Our results consist of the NP-Completeness and inapproximability proof of this problem, an O(log n loglog n) pseudo-approximation algorithm for detecting the set of critical nodes and an O(log^15 n) pseudo-approximation algorithm for detecting the set of critical edges In addition, we devise an efficient heuristic algorithm and validate the performance of the our model and algorithms through extensive simulations

81 citations

Journal ArticleDOI
TL;DR: This work proposes a scheme to enhance the network performance by adding a small fraction of links (or edges) to the currently existing network topology, and presents four edge addition strategies for adding edges efficiently.
Abstract: Transmission efficiency and robustness are two important properties of various networks and a number of optimization strategies have been proposed recently. We propose a scheme to enhance the network performance by adding a small fraction of links (or edges) to the currently existing network topology, and we present four edge addition strategies for adding edges efficiently. We aim at minimizing the maximum node betweenness of any node in the network to improve its transmission efficiency, and a number of experiments on both Barabasi–Albert (BA) and Erdos–Renyi (ER) networks have confirmed the effectiveness of our four edge addition strategies. Also, we evaluate the effect of some other measure metrics such as average path length, average betweenness, robustness, and degree distribution. Our work is very valuable and helpful for service providers to optimize their network performance by adding a small fraction of edges or to make good network planning on the existing network topology incrementally.

81 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