Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4331))

  • 514 Accesses

Abstract

In this paper a novel approach to link utilization measurement is proposed. In the network, the source workstation sends IP packets (namely, probes) that have the time stamp options being set to an arbitrary ICMP-enabled destination. Each router that the probes traverse across will record a timestamp in the packets. The timestamps are collected and further processed to gain the link utilization. By analyzing the model of the single hop delay, it is observed that the packet processing delay, propagation delay, the clock skew greatly affect the timestamps. So, the LUS (Link Utilization Statistic) algorithm is proposed to remove the disturbance. The LUS algorithm computes the queuing delay of each probe by processing multiple timestamps jointly. Then being quantized and smoothed with slide window, the queuing delay is transformed into link utilization. This approach is verified through simulation.

This work is partially supported by the research fund of CNGI-04-8-1D, NSFC(NO. 90604019 and NO. 90204003).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Moon, S.B., Skelly, P.: Estimation and removal of clock skew from network delay measurements. In: IEEE INFOCOM 1999, New York, USA, pp. 227–234 (1999)

    Google Scholar 

  2. Zhang, L., Liu, Z., Hong, C., Xia, H.: Clock synchronization algorithms for network measurements. In: IEEE INFOCOM 2002, New York, USA, pp. 160–169 (2002)

    Google Scholar 

  3. Jain, M., Dovrolis, C.: End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput. In: ACM SIGCOMM 2002, USA, pp. 295–308 (2002)

    Google Scholar 

  4. Hu, N., Steenkiste, P.: Evaluation and characterization of available bandwidth probing techniques. IEEE JSAC Special Issue in Internet and WWW Measurement, Mapping, and Modeling 21(6), 879–894 (2003)

    Google Scholar 

  5. Hu, N., Li, L., Mao, Z.M.: Locating Internet Bottlenecks: Algorithms, Measurements, and Implications. In: ACM SIGCOMM 2004, USA, pp. 41–54 (2004)

    Google Scholar 

  6. Duffield, N.G., Presti, F.L.: Inferring link loss using stripped unicast probes. In: IEEE INFOCOM 2001, Alaska, USA, pp. 22–26 (2001)

    Google Scholar 

  7. Bestavros, J.B., Harfoush, K.: Inference and labeling of metric-induced network topologies. In: IEEE INFOCOM 2002, New York, USA, pp. 628–637 (2002)

    Google Scholar 

  8. Papagiannaki, K., Moon, S., Fraleigh, C., Thiran, P., Diot, C.: Measurement and Analysis of Single-Hop Delay on an IP Backbone Network. IEEE JSAC Special Issue in Internet and WWW Measurement, Mapping, and Modeling, USA, 908–921 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yidong, C., Bin, Z., Yan, M. (2006). A Novel Approach to Link Utilization Measurement. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_113

Download citation

  • DOI: https://doi.org/10.1007/11942634_113

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49860-5

  • Online ISBN: 978-3-540-49862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics