Distance Realization Problems with Applications to Internet Tomography

Abstract

In recent years, a variety of graph optimization problems have arisen in which the graphs involved are much too large for the usual algorithms to be effective. In these cases, even though we are not able to examine the entire graph (which may be changing dynamically), we would still like to deduce various properties of it, such as the size of a connected component, the set of neighbors of a subset of vertices, etc. In this paper, we study a class of problems, called distance realization problems, which arise in the study of Internet data traffic models. Suppose we are given a set S of terminal nodes, taken from some (unknown) weighted graph. A basic problem is to reconstruct a weighted graph G including S, with possibly additional vertices, that realizes the given distance matrix for S. We will first show that this problem is not only difficult bu the solution is often unstable in the sense that even if all distances between nodes in S decrease, the solution can increase by a factor proportional to the size of S in the worst case. We then proceed to consider a weaker version of the realization problem that only requires the distances in G to upper bound the given distances. We will show that this weak realization problem is NP-complete and that its optimum solutions can be approximated to within a factor of 2. We also consider several variants of these problems and a number of heuristics are presented. These problems are of interest for monitoring large-scale networks and for supplementing network management techniques.

Identification of Resistors in Electrical Networks

“…Most of the work on this subject has concentrated on spectral graph theory (see [4], [8], [12], [9], [11], [10], [13], [14] and [16]). Thus far, spectral graph theory has been one of the most significant tools used studying graphs, and it has led to noteworthy progress in the study along these questions.…”

Minimum Disclosure Routing for Network Virtualization and Its Experimental Evaluation

“…Bandwidth is easily estimated from link cost because there is a well-known practice that link cost should be configured to the inverse of link bandwidth [12]. Topology and link costs can be inferred from path cost information even if the link costs of individual links are not directly disclosed by the routing protocol (as in RIP or OSPF interarea routing) [13]. The above-mentioned information gives the competitors of an SP significant advantage, which can be exploited to develop services that are more efficient and less costly than the SP's one.…”

Timing Model Reduction for Hierarchical Timing Analysis

“…On edges between connected inputs and outputs the longest path delays are attached. For example, the longest path from input 1 to output 10 is {(1, 4), (4,5), (5, 7), (7,8), (8,10)} which has delay 7. Thus, the delay attached on edge (1,10) is 7.…”

“…To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ICCAD'06, November [5][6][7][8][9]2006 shortest-path distances while minimizing the total sum of edge weights [3], [4]. A clique-star replacement technique is proposed for the graph with unit edge delays [5], [6].…”