Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Congestion control for best-effort service: why we need a new paradigm
IEEE Network: The Magazine of Global Internetworking
An approach to the implementation of the dynamical priorities method
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
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 inter-segment 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.