Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Towards unbiased end-to-end network diagnosis

Published: 01 December 2009 Publication History

Abstract

Internet fault diagnosis is extremely important for end-users, overlay network service providers (like Akamai [), and even Internet service providers (ISPs). However, because link-level properties cannot be uniquely determined from end-to-end measurements, the accuracy of existing statistical diagnosis approaches is subject to uncertainty from statistical assumptions about the network. In this paper, we propose a novel least-biased end-to-end network diagnosis (in short, LEND) system for inferring link-level properties like loss rate. We define a minimal identifiable link sequence (MILS) as a link sequence of minimal length whose properties can be uniquely identified from end-to-end measurements. We also design efficient algorithms to find all the MILSs and infer their loss rates for diagnosis. Our LEND system works for any network topology and for both directed and undirected properties and incrementally adapts to network topology and property changes. It gives highly accurate estimates of the loss rates of MILSs, as indicated by both extensive simulations and Internet experiments. Furthermore, we demonstrate that such diagnosis can be achieved with fine granularity and in near real-time even for reasonably large overlay networks. Finally, LEND can supplement existing statistical inference approaches and provide smooth tradeoff between diagnosis accuracy and granularity.

References

[1]
"Technology Overview," Akamai Inc. {Online}. Available: http://www. akamai.com/en/html/technology/overview.html
[2]
M. Coates, A. Hero, R. Nowak, and B. Yu, "Internet tomography," IEEE Signal Process. Mag., vol. 19, no. 3, pp. 47-65, May 2002.
[3]
A. Adams et al., "The use of end-to-end multicast measurements for characterizing internal network behavior," IEEE Commun. Mag., vol. 38, no. 5, pp. 152-159, May 2000.
[4]
T. Bu, N. Duffield, F. Presti, and D. Towsley, "Network tomography on general topologies," in Proc. ACM SIGMETRICS, 2002, pp. 21-30.
[5]
V. Padmanabhan, L. Qiu, and H. Wang, "Server-based inference of Internet link lossiness," in Proc. IEEE INFOCOM, 2003, pp. 145-155.
[6]
D. Rubenstein, J. F. Kurose, and D. F. Towsley, "Detecting shared congestion of flows via end-to-end measurement," IEEE/ACM Trans. Netw., vol. 10, no. 3, pp. 381-395, Jun. 2002.
[7]
N. Duffield, "Simple network performance tomography," in Proc. ACM SIGCOMM IMC, 2003, pp. 210-215.
[8]
Y. Chen, D. Bindel, H. Song, and R. H. Katz, "An algebraic approach to practical and scalable overlay network monitoring," in Proc. ACM SIGCOMM, 2004, pp. 55-66.
[9]
R. Govindan and H. Tangmunarunkit, "Heuristics for Internet map discovery," in Proc. IEEE INFOCOM, 2000, pp. 1371-1380.
[10]
R. Caceres, N. Duffield, J. Horowitz, D. Towsley, and T. Bu, "Multicast-based inference of network-internal characteristics: Accuracy of packet loss estimation," in Proc. IEEE INFOCOM, 1999, pp. 371-379.
[11]
N. G. Duffield, F. L. Presti, V. Paxson, and D. Towsley, "Inferring link loss using striped unicast probes," in Proc. IEEE INFOCOM, 2001, pp. 915-923.
[12]
R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "User-level Internet path diagnosis," in Proc. ACM SOSP, 2003, pp. 106-119.
[13]
K. Anagnostakis, M. Greenwald, and R. Ryger, "Cing: Measuring network-internal delays using only existing infrastructure," in Proc. IEEE INFOCOM, 2003, pp. 2112-2121.
[14]
Y. Shavitt, X. Sun, A. Wool, and B. Yener, "Computing the unmeasured: An algebraic approach to Internet mapping," in Proc. IEEE INFOCOM, 2001, pp. 1646-1654.
[15]
G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins Univ. Press, 1989.
[16]
R. Caceres, N. Duffield, J. Horowitz, and D. Towsley, "Multicast-based inference of network-internal loss characteristics," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2462-2480, Nov. 1999.
[17]
N. Duffield, J. Horowitz, D. Towsley, W. Wei, and T. Friedman, "Multicast-based loss inference with missing data," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 700-713, May 2002.
[18]
C. Tang and P. McKinley, "On the cost-quality tradeoff in topology-aware overlay path probing," in Proc. IEEE ICNP, 2003, pp. 268-279.
[19]
R. A. Brualdi, A. Pothen, and S. Friedland, "The sparse basis problem and multilinear algebra," SIAM J. Matrix Anal. Appl., vol. 16, pp. 1-20, 1995.
[20]
Y. Zhang et al., "On the constancy of Internet path properties," in Proc. ACM SIGCOMM IMW, 2001, pp. 197-211.
[21]
G. W. Stewart, Matrix Algorithms: Basic Decompositions. Philadelphia, PA: SIAM, 1998.
[22]
V. Paxon, "End-to-end routing behavior in the Internet," IEEE/ACM Trans. Netw., vol. 5, no. 5, pp. 601-5, Oct. 1997.
[23]
R. Govindan and V. Paxson, "Estimating router ICMP generation delays," in Proc. PAM, 2002, pp. 1-8.
[24]
A. Medina, I. Matta, and J. Byers, "On the origin of power laws in Internet topologies," Comput. Commun. Rev., pp. 18-28, Apr. 2000.
[25]
N. Spring, R. Mahajan, and T. Anderson, "Quantifying the causes of path inflation," in Proc. ACM SIGCOMM, 2003, pp. 113-124.
[26]
PlanetLab, {Online}. Available: http://www.planet-lab.org/
[27]
Z. M. Mao et al., "Scalable and accurate identification of AS-level forwarding paths," in Proc. IEEE INFOCOM, 2004, pp. 1605-15.
[28]
University of Oregon Route Views archive project, {Online}. Available: http://www.routeviews.org/

Cited By

View all
  • (2018)On the estimation of link delay distributions by cumulant‐based moment matchingInternet Technology Letters10.1002/itl2.111:1Online publication date: 18-Jan-2018
  • (2017)PathfinderInternational Journal of Parallel Programming10.1007/s10766-016-0469-745:6(1273-1284)Online publication date: 1-Dec-2017
  • (2014)Towards detecting target link flooding attackProceedings of the 28th USENIX conference on Large Installation System Administration10.5555/2717491.2717497(81-96)Online publication date: 9-Nov-2014
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 17, Issue 6
December 2009
331 pages

Publisher

IEEE Press

Publication History

Published: 01 December 2009
Revised: 12 September 2007
Received: 05 July 2006
Published in TON Volume 17, Issue 6

Author Tags

  1. internet diagnosis
  2. linear algebra
  3. network measurement

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2018)On the estimation of link delay distributions by cumulant‐based moment matchingInternet Technology Letters10.1002/itl2.111:1Online publication date: 18-Jan-2018
  • (2017)PathfinderInternational Journal of Parallel Programming10.1007/s10766-016-0469-745:6(1273-1284)Online publication date: 1-Dec-2017
  • (2014)Towards detecting target link flooding attackProceedings of the 28th USENIX conference on Large Installation System Administration10.5555/2717491.2717497(81-96)Online publication date: 9-Nov-2014
  • (2011)Scalable deterministic end-to-end probing and analytical method for overlay network monitoringProceedings of the 7th International Conference on Network and Services Management10.5555/2147671.2147756(460-464)Online publication date: 24-Oct-2011
  • (2011)QoSaaSProceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services10.5555/1972422.1972430(6-6)Online publication date: 29-Mar-2011
  • (2011)A novel fault diagnosis mechanism for wireless sensor networksMathematical and Computer Modelling: An International Journal10.1016/j.mcm.2011.02.01854:1-2(330-343)Online publication date: 1-Jul-2011

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media