Abstract
We propose a new algorithm (ARTCP) for transport protocols of packet switching networks.
ARTCP uses scheduling mechanism to smoothly transmit data flow, and does not cause network overload, because it considers temporal characteristics of the flow to self adjust to the available network capacity. ARTCP utilizes intersegment spacing and round trip time measurements to control the rate of the flow.
In order to study of the characteristics of the ARTCP protocol we have developed and coded imitational programmable model, which is a universal tool for studying processes occurring in communication networks. Built with object-oriented principles, this model allows building simulation network topology of great complexity and setting various environments for simulation experiments. Results of our simulation studies, performed with ARTCP, on our model display substantial advantages, which ARTCP has over standard TCP algorithms. Statistical analysis of ARTCP traffic traces yields the self-similar property of ARTCP traffic, which is in line with other studies of traffic traces in network systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cerf V., Kahn R.: A protocol for packet network intercommunication. IEEE Trans. on communications, Vol. COM-22, N. 5. (1974) 637–648.
Postel J.: Transmission Control Protocol. RFC793 (STD7). (1981)
Braden R. T.: Requirements for Internet Hosts-Communication Layers. RFC1122. (1989)
Jacobson V.: Congestion Avoidance and Control. In proc. ACM SIGCOMM’88. (1988)
Haken H.: Synergetics. 2nd edn. Springer-Verlag, Berlin Heidelberg New York (1978)
Brakmo L., O’Malley S., Peterson L.: TCP Vegas: New Techniques for Congestion Detection and Avoidance. In proc. ACM SIGCOMM’94. (1994) 24–35.
Tomey C.: Rate-Based Congestion Control Framework for Connectionless Packet-Switched Networks. Doctor of Philosophy Thesis. University of New South Wales Australian Defense Force Academy (1997)
Keshav S.: The Packet Pair Flow Control Protocol. ICSI Tech. Rept. TR-91-028. Computer Science Division, Department of EECS, University of California, Berkeley and International Computer Science Institute. Berkeley (1991)
Clark D., Lambert M., Zhang L.: NETBLT: A Bulk Data Tranfer Protocol. RFC 969 (1987)
Wang Z. Routing And Congestion Control In Datagram Networks. Doctor Of Philosophy Thesis. University College London. London (1992)
Zhang L., Lefelhocz C., Lyles Shenker S.: Congestion Control for Best-Effort Service: Why We Need a New Paradigm. IEEE Network, Vol. 10, N. 1. (1996)
Jacobson V., Braden R., Borman D.: TCP Extensions for High Performance. RFC1323 (1992)
Leland W., Taqqu M., Willinger W., Wilson D.: On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking. Vol. 2(1) (1994) 1–15
Willinger W., Taqqu M., Sherman R., Wilson D.: Self-similarity through high variability: Statistical analysis of Ethernet LAN traffic at source level. IEEE/ACM Transactions of Networking. Vol. 5. (1997) 71–86
Taqqu M., Teverovsky V., Willinger W.: Is network traffic self-similar or multifractal? Fractals. Vol. 5. (1997) 63–73
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alekseev, I.V., Sokolov, V.A. (2001). ARTCP: Efficient Algorithm for Transport Protocol for Packet Switched Networks. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-44743-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42522-9
Online ISBN: 978-3-540-44743-6
eBook Packages: Springer Book Archive