ANALYSIS AND DATA PROCESSING SYSTEMS

Abstract
Uneven growth rates of data transmission channels inevitably lead to “narrow” places in the communications network and thus to congestions, especially when connecting access level networks to the wide area network. Traditional protocols of queue management and congestion avoidance cannot cope with high density traffic management and nonlinearly changing load, which leads to congestions. This also causes a decrease in the effective rate of data transmission and degrades the quality parameters such as the percentage of lost packets, delays and jitters. A passive mechanism for resetting the excess data packets overflow queue is mostly used in data networks.. When sending the TCP traffic, this mechanism gives rise to the phenomenon of global synchronization. New mechanisms have been developed for early prevention of queue overflows and early detection of overloads. This article describes the principles of building a simulation model for active queue management algorithms. Algorithms and program listings performing discrete-event simulation are proposed. These algorithms are used to perform simulation using high-level programming languages. Increasing complexity of modern telecommunication technologies creates a problem in the application of analytical techniques to evaluate the performance of designed systems and networks, which results in an extensive use of simulation. To prevent overloading in the nodes of packet-switched networks active queue management algorithms are used in the paper..-In the relevant service system which simulates the work of a network node, each incoming packet can be dropped with a certain probability, even if the buffer is not fully filled yet. A probability to be dropped depends on the length of the queue at the time of receipt of the package. The paper presents the principles of discrete-event simulation algorithms of active queue management. The algorithms of simulation in high-level programming languages are described.

 

References
1. Barabanova E.A., Mal'ceva N.S., Barabanov I.O. Algoritm raboty bufernogo ustrojstva ATM-kommutatora s parallel'noj nastrojkoj [Algorithm of buffer device working of ATM-switch with parallel adjustment]. Vestnik Astrahanskogo gosudarstvennogo tehnicheskogo universiteta. Serija: Upravlenie, vychislitel'naja tehnika i informatika – Vestnik of Astrakhan state technical university. Series: Management, Computer science and Informatics, 2012, no. 1, pp. 97–103.

2. Barabanova E.A., Mal'ceva N.S., Barabanov I.O. Razrabotka universal'nogo algoritma dlja mnogokaskadnyh kommutatorov s parallel'noj nastrojkoj [Development of universal algorithm for multistage switches with parallel adjustment]. Vestnik Astrahanskogo gosudarstvennogo tehnicheskogo universiteta. Serija: Upravlenie, vychislitel'naja tehnika i informatika – Vestnik of Astrakhan state technical university. Series: Management, Computer science and Informatics, 2013, no. 1,

pp. 118–125.

3. Dmitriev V.N., Tushnov A.S., Sergeeva E.V. Imitacionnoe modelirovanie sistemy monitoringa mnogozvennoj seti peredachi dannyh [Simulation of monitoring multilink data transmission network]. Vestnik Astrahanskogo gosudarstvennogo tehnicheskogo universiteta. Serija: Upravlenie, vychislitel'naja tehnika i informatika – Vestnik of Astrakhan state technical university. Series: Management, Computer science and Informatics, 2013, no. 2, pp. 86–91.

4. Kvjatkovskaja I.Ju., Fam K.H. Sistema pokazatelej ocenki kachestva telekommunikacionnyh uslug i metody ih ocenki [System of criteria of evaluation of quality of telecommunication services and method of their evaluation]. Vestnik Astrahanskogo gosudarstvennogo tehnicheskogo universiteta. Serija: Upravlenie, vychislitel'naja tehnika i informatika – Vestnik of Astrakhan state technical university. Series: Management, Computer science and Informatics, 2013, no. 2, pp. 98–103.

5. Baklizi M., Abdel-jaber H., Ramadass S., Abdullah N., Anbar M. Performance assessment of AGRED, RED and GRED congestion control algorithms. Information Technology Journal, 2012, vol. 11, iss. 2, pp. 255–261. doi: 10.3923/itj.2012.255.261

6. Abdel-jaber H., Thabtah F., Daoud A.M., Ababneh J. Performance investigations of some active queue management techniques using simulation. International Journal on New Computer Architectures and Their Applications (IJNCAA). 2012, vol. 2, no. 1, pp. 286–301.

7. Floyd S. Recommendation on using the “gentle” variant of RED. March 2000. Available at: http://www.aciri.org/floyd/red/gentle.html (accessed 06.03.2015)

8. Krifa A., Barakat C., Spyropolous T. Optimal buffer management policies for delay tolerant networks. Proceedings of 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON'08, San Francisco, California, 16–20 June 2008, pp. 260–268. doi: 10.1109/SAHCN.2008.40

9. Floyd S., Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking (TON), 1993, vol. 1, iss. 4, pp. 397–413. doi: 10.1109/90.251892

10. Barabanova E.A., Mal'ceva N.S., Barabanov I.O. Algoritm parallel'noj obrabotki dannyh v opticheskih setjah [The algorithm of parallel data processing in optical networks]. Nauchnyi vestnik Novosibirskogo gosudarstvennogo tekhnicheskogo universiteta – Science Bulletin of the Novosibirsk State Technical University, 2014, no. 3 (56), pp. 88–95.

11. Beheshti N., Burmeister E., Ganjali Y., Bowers J., Blumenthal D., McKeown N. Optical packet buffers for backbone internet routers. IEEE/ACM Transactions on Networking (TON), 2010, vol. 18, iss. 5, pp. 1599–1609. doi: 10.1109/TNET.2010.2048924

12. Lin D., Hamdi M., Muppala J. Designing packet buffers using random round robin. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM 2010), Miami, Florida, USA, 6–10 December 2010, pp. 1–5. doi: 10.1109/GLOCOM.2010.5683309

13. Kabra M., Saha S., Lin B. Fast buffer memory with deterministic packet departures. Proceedings of 14th IEEE Symposium on High-Performance Interconnects (HOTI 2006), Stanford, California, 23–25 August 2006, pp. 67–72. doi: 10.1109/HOTI.2006.13

14. Reddy T.B., Ahammed A., Banu R. Performance comparison of active queue management techniques. International Journal of Computer Science and Network Security, 2009, vol. 9, no. 2,

pp. 405–408.

15. Spyropoulos T., Psounis K., Raghavendra C.S. Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE/ACM Transactions on Networking, 2008, vol. 16,

iss. 1, pp. 63–76. doi: 10.1109/TNET.2007.897962

16. Grot B., Keckler S.W., Mutlu O. Preemptive virtual clock: a flexible, efficient, and cost-effective QOS scheme for networks-on-chip. Proceedings of 42nd Annual IEEE/ACM International Symposium on Microarchitecture MICRO–42, New York, USA, 12–16 December 2009, pp. 268–279.

17. Albert R., Barabasi A.-L. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002, vol. 74, iss. 1, pp. 47–97. doi: 10.1103/RevModPhys.74.47

18. Becker D.U., Nan Jiang, Michelogiannakis G., Dally W.J. Adaptive backpressure: efficient buffer management for on-chip networks. Proceedings of IEEE 30th International Conference on Computer Design (ICCD 2012), Montreal, Quebec, Canada, 30 September–3 October 2012, pp. 419–426. doi: 10.1109/ICCD.2012.6378673

19. Fathima G., Wahidabanu R.S.D. A new queuing policy for delay tolerant networks. International Journal of Computer Applications, 2010, vol. 1, no. 20, pp. 56–60. doi: 10.5120/422-622

20. Spyropoulos T., Bin Rais R.N., Turletti T., Obraczka K., Vasilakos A. Routing for disruption tolerant networks: taxonomy and design. Wireless Networks, 2010, vol. 16, iss. 8, pp. 2349–2370. – doi: 10.1007/s11276-010-0276-9

21. Padmavathi G., Chitra K. Classification and performance of AQM-based schemes for congestion avoidance. International Journal of Computer Science and Information Security, 2010, vol. 8, no. 1, pp. 331–340.

22. Thiruchelvi G., Raja J. A survey on active queue management mechanisms. International Journal of Computer Science and Network Security, 2008, vol. 8, no. 12, pp. 130–145.