Y. Shavitt, X. Sun, A. Wool, and B. Yener. Computing the unmeasured: An algebraic approach to Internet mapping. Technical Report 2000-15, DIMACS, 23 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....due to security problems, many routers frequently disable the IP source routing option. Consequently, approaches that rely on explicitly routed probe packets for delay and fault monitoring may not be feasible in today s ISP and Enterprise environments. In other recent work on monitoring, [10] proposes to solve a linear system of equations to compute delays for smaller path segments from a given a set of end to end delay measurements for paths in the network. Similarly, 2] considers the problem of inferring link level loss rates and delays from end to end multicast measurements for a ....

Y. Shavitt, X. Sun, A. Wool and B. Yener, "Computing the Unmeasured: An Algebraic Approach to Internet Mapping",InProceedings of IEEE INFOCOM'2001.

....to obtain a solution to the likelihood equation. Coates and Nowak have extended their EM based, unicast based techniques to infer delay statistics in [6] Last, there exist several approaches that infer round trip link behavior. These include pathchar [8, 12] and the linear algebraic approach of [21]. The former infers loss, delay, and available link bandwidth whereas the latter infers round trip link delays. The former requires considerable time to converge. Both lose accuracy with asymmetric round trip paths. 3 2 Models for Probe and Report Transmission 2.1 Tree model Let T = V; L) ....

Y. Shavitt, X. Sun, A. Wool, B. Yener. "Computing the Unmeasured: An Algebraic Approach to Internet Mapping " to appear in Proc. INFOCOM01.

....provide enough information to determine the link measure of interest. Briefly, the paper makes the following contributions. We establish efficient algorithms for solving the identifiability problems. These are sufficiently general to apply to unicast based end to end measurements as well, e.g. [11]. We establish that the cover problems are NP hard and that in some cases, finding an approximation within a certain factor of optimal is also NP hard. Thus, we also propose several heuristics and show through simulation that a greedy heuristic that iteratively combines trees containing a small ....

....In addition to the MINC approach which applies to multicast, there are several promising unicast based techniques. For example, 5, 8] attempt to emulate multicast through the use of packet pairs so that multicast based analysis techniques can be applied. An algebraic approach has been proposed in [11] which can be used to infer link round trip times based on path round trip time measurements. However, none of these deal with the problem of designing measurements so as to minimize the overhead imposed on the network. We believe that our techniques can be adapted to be used with these ....

[Article contains additional citation context not shown here]

Y. Shavitt, X. Sun, A. Wool, B. Yener. "Computing the Unmeasured: An Algebraic Approach to Internet Mapping" to appear in Proc. INFOCOM01.

....Figure 2: Performance of server selection metrics (UCSC, 48 subset) 4.1 Hop Counts Server selection based on minimizing the number of router hops between a client and server is used by many proposed server selection services. The use of a hop count metric can be either by direct measurement [9, 8, 11, 21] at the application layer or by modi cations to unicast or multicast routing [6, 14] In our analysis, when multiple servers were at minimum distance, we averaged their observed transfer times as no other information would allow a resolver to make a distinguishing choice in the most generic case. ....

Y. Shavitt, X. Sun, A. Wool, and B. Yener. Computing the Unmeasured: An Algebraic Approach to Internet Mapping. In IEEE INFOCOM 2001, April 2001. 13

No context found.

Y. Shavitt, X. Sun, A. Wool, and B. Yener. Computing the unmeasured: An algebraic approach to Internet mapping. Technical Report 2000-15, DIMACS, 23 2000.

.... a wide variety of pure and applied research projects during my years at Rutgers as a graduate student, including: 1) An algorithm that extracts all point to point delay information that can be inferred from the delays measured among nodes in a given subset of nodes in a network like the Internet [14]. A patent has been filed for this algorithm. 2) A computer program that extracts finite state models from a restricted class of C programs. This is a preliminary step towards formal verification of C programs [12] This work was done during the summer of 2000 at Bell labs under supervision of ....

Yuval Shavitt, Xiaodong Sun, Avishai Wool, and Bulent Yener. Computing the unmeasured: an algebraic approach to Internet mapping, In Proc. of IEEE Infocom

....(7) Procedure compute sub paths: Foreach measurement path , I CQQQ= Foreach sub path of 1 consisting of segments 4 5Q 3 Set = for CQQ5 and 5 elsewhere. If l Then Compute using (9) Else cannot be solved. A detailed example of the algorithm operation appears in [15]. F. Completeness A distance, by the metric definition (delay) is a linear combination of end to end distances. Using linear algebra, since is non singular, a sub path can be expressed as linear combination of the given distances if and only if it can be expressed as linear combination of ....

Y. Shavitt, X. Sun, A. Wool, and B. Yener. Computing the unmeasured: An algebraic approach to Internet mapping. DIMACS TR 2000-15, 2000.

....M i , i = 1; n Foreach sub path p of M i consisting of segments x j 1 ; x j Set c j k = 1 for k = 1; and c k = 0 elsewhere. If P i c i T ij = 0; 8j m 0 Then Compute p using (9) Else p cannot be solved. A detailed example of the algorithm operation appears in [15]. F. Completeness A distance, by the metric definition (delay) is a linear combination of end to end distances. Using linear algebra, since T is non singular, a sub path can be expressed as linear combination of the given distances if and only if it can be expressed as linear combination of ....

Y. Shavitt, X. Sun, A. Wool, and B. Yener. Computing the unmeasured: An algebraic approach to Internet mapping. DIMACS TR 2000-15, 2000.

No context found.

Y. Shavitt, X. Sun, A. Wool, and B. Yener, "Computing the unmeasured: An algebraic approach to Internet mapping," in IEEE INFOCOM, 2001.

No context found.

Y. Shavitt, X. Sun, A. Wool, B. Yener. "Computing the Unmeasured: An Algebraic Approach to Internet Mapping" IEEE Infocom 2001.

No context found.

Y. Shavitt, X. Sun, A. Wool, B. Yener. "Computing the Unmeasured: An Algebraic Approach to Internet Mapping " to appear in Proc. INFOCOM01.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC