Skip to main content

On Modeling Round-Trip Time Dynamics of the Internet Using System Identification

  • Conference paper
  • First Online:
Information Networking: Wired Communications and Management (ICOIN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2343))

Included in the following conference series:

Abstract

Understanding the end-to-end packet dela y dynamic of the Internet is of crucial importance since it directly affects the QoS (Quality of Services) of realtime services, and it enables us to design an efficient congestion control mechanism. In this paper, we measure the round-trip time, and build a mathematical model representing its dynamics using system identification. We first measure, as the input and output data for system identification,the pac ket inter-departure time from a source host and the corresponding round-trip time measured by the source host. ICMP (Internet Control Message Protocol) is utilized to measure the round-trip time for each packet. We next model the network, seen by a sp ecific source host, as a dynamic SISO (Single-Input and Single-Output) system. Using measurement results obtained from three different net-w orkconfigurations, we investigate how accurately the round-trip time dynamics of the Internet can be modeled with the system identification.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. R. Jain, “A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks,” ACM Computer Communication Review, vol. 19, pp. 56–71, Oct. 1989.

    Google Scholar 

  2. L. S. Brakmo, S. W. O’Malley, and L. L. Peterson, “TCP Vegas: New techniques for congestion detection and avoidance,” in Proceedings of ACM SIGCOMM’ 94, pp. 24–35, Oct. 1994.

    Google Scholar 

  3. J.-C. Bolot, “Characterizing end-to-end packet delay and loss in the Internet,” Journal of High-Speed Networks, vol. 2, pp. 305–323, Dec. 1993.

    Google Scholar 

  4. S. B. Moon, J. Kurose, P. Skelly, and D. Towsley, “Correlation of packet delay and loss in the Internet,” tech. rep., Department of Computer Science, University of Massachusetts, USA, Jan. 1998.

    Google Scholar 

  5. V. Paxson, “End-to-end Internet packet dynamics,” in Proceedings of ACM SIGCOMM, pp. 139–152, Sept. 1997.

    Google Scholar 

  6. H. Ohsaki, M. Murata, and H. Miyahara, “Modeling end-to-end packet delay dynamics of the Internet using system identification,” in Proceedings of Seventeenth International Teletraffic Congress, pp. 1027–1038, Dec. 2001.

    Google Scholar 

  7. L. Ljung, System identification — theory for the user. Englewood Cliffs, N.J.: Prentice Hall, 1987.

    MATH  Google Scholar 

  8. M. Allman and V. Paxon, “On estimating end-to-end network path properties,” ACM SIGCOMM’ 99, pp. 263–274, Aug. 1999.

    Google Scholar 

  9. A. Adams, T. Bu, R. Caceres, N. DufEeld, T. Friedman, J. Horowitz, F. L. Presti, S. B. Moon, V. Paxson, and D. Towsley, “The use of end-to-end multicast measurements for characterizing internal network behavior,” IEEE Communications, pp. 152–159, May 2000.

    Google Scholar 

  10. V. Paxson, “End-to-end routing behavior in the Internet,” in ACM SIGCOMM’ 96, pp. 25–38, May 1996.

    Google Scholar 

  11. R. Caceres, P. B. Danzig, S. Jamin, and D. J.Mitzel, “Characteristics of wide-area TCP/IP conversations,” in ACM SIGCOMM’ 91, pp. 101–112, Sept. 1991.

    Google Scholar 

  12. H. Che and S.-Q. Li, “Fast algorithms for measurement-based traffic modeling,” IEEE Journal on Selected Areas in Communications, vol. 16, pp. 612–625, June 1998.

    Google Scholar 

  13. L. A. Kulkarni and S.-Q. Li, “Measurement-based traffic modeling: capturing important statistics,” Journal of Stochastic Model, vol. 14, no. 5, 1998.

    Google Scholar 

  14. S.-Q. Li, S. Park, and D. Arifler, “SMAQ: A measurement-based tool for traffic modeling and queueing analysis, Part I-design methodologies and software architecture,” IEEE Communications Magazine, vol. 36, pp. 56–65, Aug. 1998.

    Google Scholar 

  15. S.-Q. Li, S. Park, and D. Arifler, “SMAQ: a measurement-based tool for traffic modeling and queueing analysis, Part II-network applications,” IEEE Communications Magazine, vol. 36, pp. 66–77, Aug. 1998.

    Google Scholar 

  16. Y. Zhang, V. Paxon, and S. Schenker, “The stationarity of Internet path properties: routing, loss, and throughput,” tech. rep., ACIRI, May 2000.

    Google Scholar 

  17. O. Ait-Hellal, E. Altman, and T. Basar, “A robust identification algorithm for traffic models in telecommunications,” in Proceedings of IEEE CDC’ 99, Dec. 1998.

    Google Scholar 

  18. A. Sang and S.-Q. Li, “A predictability analysis of network traffic,” in Proceedings of IEEE INFOCOM 2000, pp. 342–351, Mar. 2000.

    Google Scholar 

  19. S. Hares, “Essential tools for the OSI Internet,” Request for Comments (RFC) 1574, Feb. 1994.

    Google Scholar 

  20. F. Baker, “Requirements for IP version 4 routers,” Request for Comments (RFC) 1812, June 1995.

    Google Scholar 

  21. J. Postel, “Internet control message protocol,” Request for Comments (RFC) 792, Sept. 1981.

    Google Scholar 

  22. S. Savage, “Sting: A TCP-based network measurement tool,” in Proceedings of USENIX Symposium on Internet Technologies and Systems, pp. 71–79, Oct. 1999.

    Google Scholar 

  23. H. Ohsaki, M. Morita, and M. Murata, “Measurement-based modeling of Internet round-trip time dynamics using system identification,” submitted to the Second IFIP-TC6 Networking Conference (NETWORKING 2002), Nov. 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohsaki, H., Morita, M., Murata, M. (2002). On Modeling Round-Trip Time Dynamics of the Internet Using System Identification. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45803-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44256-1

  • Online ISBN: 978-3-540-45803-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics