49,391 research outputs found
Virtual Topology Design for Minimizing Network Diameter and Average Hop Count in WDM Networks
We design virtual topologies in wavelength division multiplexing (WDM) networks to minimize the network diameter and average hop count, where network diameter refers to the number of hops of the longest shortest path and average hop count is the average number of hops among the shortest paths of all node pairs. Such objectives are important to WDM networks, especially to those with statistical multiplexing mechanisms such as optical burst switching (OBS) and optical packet switching (OPS). By minimizing the network diameter and average hop count, optical packets or bursts will experience less contention loss and smaller delay due to a reduced number of intermediate nodes en route. In this paper, we first formulate an integer linear program (ILP) for optimal design of virtual topologies with minimized network diameter and average hop count. Then, a novel heuristic least weight minimum diameter (LWMD) is proposed to find good solutions efficiently. Based on the virtual topology obtained, we further design two traffic accommodation schemes to provision wavelengths under a given traffic matrix, with guaranteed network diameter and minimized network resource consumption.published_or_final_versio
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using
end-to-end random measurements (e.g., delay) between a subset of nodes,
referred to as the participants. The rest of the nodes are hidden, and do not
provide any information for topology discovery. We consider topology discovery
under two routing models: (a) the participants exchange messages along the
shortest paths and obtain end-to-end measurements, and (b) additionally, the
participants exchange messages along the second shortest path. For scenario
(a), our proposed algorithm results in a sub-linear edit-distance guarantee
using a sub-linear number of uniformly selected participants. For scenario (b),
we obtain a much stronger result, and show that we can achieve consistent
reconstruction when a sub-linear number of uniformly selected nodes
participate. This implies that accurate discovery of sparse random graphs is
tractable using an extremely small number of participants. We finally obtain a
lower bound on the number of participants required by any algorithm to
reconstruct the original random graph up to a given edit distance. We also
demonstrate that while consistent discovery is tractable for sparse random
graphs using a small number of participants, in general, there are graphs which
cannot be discovered by any algorithm even with a significant number of
participants, and with the availability of end-to-end information along all the
paths between the participants.Comment: A shorter version appears in ACM SIGMETRICS 2011. This version is
scheduled to appear in J. on Random Structures and Algorithm
Logical topology design for IP rerouting: ASONs versus static OTNs
IP-based backbone networks are gradually moving to a network model consisting of high-speed routers that are flexibly interconnected by a mesh of light paths set up by an optical transport network that consists of wavelength division multiplexing (WDM) links and optical cross-connects. In such a model, the generalized MPLS protocol suite could provide the IP centric control plane component that will be used to deliver rapid and dynamic circuit provisioning of end-to-end optical light paths between the routers. This is called an automatic switched optical (transport) network (ASON). An ASON enables reconfiguration of the logical IP topology by setting up and tearing down light paths. This allows to up- or downgrade link capacities during a router failure to the capacities needed by the new routing of the affected traffic. Such survivability against (single) IP router failures is cost-effective, as capacity to the IP layer can be provided flexibly when necessary. We present and investigate a logical topology optimization problem that minimizes the total amount or cost of the needed resources (interfaces, wavelengths, WDM line-systems, amplifiers, etc.) in both the IP and the optical layer. A novel optimization aspect in this problem is the possibility, as a result of the ASON, to reuse the physical resources (like interface cards and WDM line-systems) over the different network states (the failure-free and all the router failure scenarios). We devised a simple optimization strategy to investigate the cost of the ASON approach and compare it with other schemes that survive single router failures
Optimal Topology Design for Disturbance Minimization in Power Grids
The transient response of power grids to external disturbances influences
their stable operation. This paper studies the effect of topology in linear
time-invariant dynamics of different power grids. For a variety of objective
functions, a unified framework based on norm is presented to analyze the
robustness to ambient fluctuations. Such objectives include loss reduction,
weighted consensus of phase angle deviations, oscillations in nodal frequency,
and other graphical metrics. The framework is then used to study the problem of
optimal topology design for robust control goals of different grids. For radial
grids, the problem is shown as equivalent to the hard "optimum communication
spanning tree" problem in graph theory and a combinatorial topology
construction is presented with bounded approximation gap. Extended to loopy
(meshed) grids, a greedy topology design algorithm is discussed. The
performance of the topology design algorithms under multiple control objectives
are presented on both loopy and radial test grids. Overall, this paper analyzes
topology design algorithms on a broad class of control problems in power grid
by exploring their combinatorial and graphical properties.Comment: 6 pages, 3 figures, a version of this work will appear in ACC 201
Classification of scale-free networks
While the emergence of a power law degree distribution in complex networks is
intriguing, the degree exponent is not universal. Here we show that the
betweenness centrality displays a power-law distribution with an exponent \eta
which is robust and use it to classify the scale-free networks. We have
observed two universality classes with \eta \approx 2.2(1) and 2.0,
respectively. Real world networks for the former are the protein interaction
networks, the metabolic networks for eukaryotes and bacteria, and the
co-authorship network, and those for the latter one are the Internet, the
world-wide web, and the metabolic networks for archaea. Distinct features of
the mass-distance relation, generic topology of geodesics and resilience under
attack of the two classes are identified. Various model networks also belong to
either of the two classes while their degree exponents are tunable.Comment: 6 Pages, 6 Figures, 1 tabl
- …