Skip to main content

An Approach to the Implementation of the Dynamical Priorities Method

  • Conference paper
Book cover Parallel Computing Technologies (PaCT 2005)

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

Included in the following conference series:

  • 488 Accesses

Abstract

In this work we consider a problem of optimizing the data transmission mechanism of Internet transport protocols. We use a priority discipline without time measurements by a receiver, which has the property of universality. The possibility of an application of this discipline for improving performances of the original Transmission Control Protocol (TCP) is discussed. We propose to apply the dynamical priority method to avoid time measurements by the receiver. Instead of this only mean queue lengths at the sending side have to be measured.

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. Sokolov, V.A., Timofeev, E.A.: Dynamical Priorities without Time Measurement and Modification of the TCP. LNCS, vol. 1649, pp. 240–245. Springer, Heidelberg (2001)

    Google Scholar 

  2. Stevens, W.R.: TCP/IP Illustrated. The Protocols, vol. 1. Addison-Wesley, New York (1994)

    MATH  Google Scholar 

  3. Balakrishnan, H., Padmanabhan, V., Katz, R.: The Effects of Asymmetry on TCP Performance. ACM MobiCom 9 (1997)

    Google Scholar 

  4. Brakmo, L., O’Malley, S., Peterson, L.: TCP Vegas: New Techniques for Congestion Detection and Avoidance. ACM SIGCOMM 8, 24–35 (1994)

    Article  Google Scholar 

  5. Alekseev, I.V., Sokolov, V.A.: The Adaptive Rate TCP. Model. and Anal. Inform. Syst. 6(1), 4–11 (1999)

    Google Scholar 

  6. Alekseev, I.V., Sokolov, V.A.: ARTCP: Efficient Algorithm for Transport Protocol for Packet Switched Networks. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol. 2127, pp. 159–174. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Alekseev, I.V., Sokolov, V.A.: Modelling and Traffic Analysis of the Adaptive Rate Transport Protocol. Future Generation Computer Systems 18(6), 813–827 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sokolov, V.A., Timofeev, E.A. (2005). An Approach to the Implementation of the Dynamical Priorities Method. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_7

Download citation

  • DOI: https://doi.org/10.1007/11535294_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics