Skip to main content

Packet Analysis in Congested Networks

  • Chapter
  • First Online:
Progress in Discovery Science

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2281))

  • 500 Accesses

Abstract

This paper proposes new methods of measuring the Internet traffic. These are useful to analysing the network status, especially when the traffic is heavy, i.e. the network is congested. Our first method realizes a light weight measurement which counts only TCP flags, which occupies 6 bits in a TCP packet. Based on the simple flag counts, we can tell whether the network is congested or not. Moreover, we can estimate the average throughput of a network connection based on the flag count. Our second method analyses a sequence of TCP packets based on an automaton, or a protocol machine. The original automaton has been used in the formal specification of TCP protocol. However, it is not applicable to the real Internet traffic. We have improved the automaton in various ways, and established a modified machine. Using the new machine, we can analyse the Internet traffic even if there are packet losses.

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

Access this chapter

eBook
USD 16.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. Douglas E. Comer, “Internetworking with TCP/IP Vol.I: Principles, Protocols, and Architecture, 4th Ed.,”, Prentice-Hall, 2000.

    Google Scholar 

  2. W. Richard Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison-Wesley, 1994.

    Google Scholar 

  3. W. Richard Stevens, Gary Wright, TCP/IP Illustrated, Volume 2: The Implementation, Addison-Wesley, 1995.

    Google Scholar 

  4. W. Richard Stevens, TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the UNIXDomain Protocols, Addison-Wesley, 1996.

    Google Scholar 

  5. Marshall Kirk McKusick, Keith Bostic, Michael J. Karels and John S. Quarterman, The Design and Implementation of the 4.4BSD Operating System, Addison-Wesley, 1996.

    Google Scholar 

  6. APAN, http://www.apan.net/, (Asia-Pacific Advanced Research Information Network).

  7. Gerard J. Holzmann, “Design and Validation of Computer Protocols”, Prentice Hall, 1991.

    Google Scholar 

  8. Kimberly C. Claffy, Hans-Werner Braun and George C. Polyzos, “A parametrizable methodology for Internet traffic flow profiling”, IEEE JSAC Special Issue on the Global Internet, 1995.

    Google Scholar 

  9. J. Postel, “Transmission Control Protocol-DARPA Internet Program Protocol Specification”, RFC793, 1981.

    Google Scholar 

  10. Yoichi Obuchi, “Discrete Information Processing and Automaton” (in Japanese), Asakura Shoten, 1999.

    Google Scholar 

  11. Masaki Fukushima and Shigeki Goto, “Analysis of TCP Flags in Congested Network”, IEICE Transactions on Information and Systems, VOL. E83-D, NO. 5, PP.996–1002, MAY 2000.

    Google Scholar 

  12. R. Sedgewick, “Algorithms”, Addison-Wesley, 1988.

    Google Scholar 

  13. Masaki Fukushima and Shigeki Goto, Improving TCP Protocol Machine to Accept Real Internet Traffic, IWS2001 Internet Workshop 2001, pp.47–53, Tokyo, Japan, February 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 chapter

Cite this chapter

Fukushima, M., Goto, S. (2002). Packet Analysis in Congested Networks. In: Arikawa, S., Shinohara, A. (eds) Progress in Discovery Science. Lecture Notes in Computer Science(), vol 2281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45884-0_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-45884-0_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45884-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics