The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic

Open access


Algorithms of queue management in IP routers determine which packet should be deleted when necessary. The article investigates the influence of the self-similarity on the optimal packet rejection probability function in a special case of NLRED queues. This paper describes another approach to the non-linear packet dropping function. We propose to use the solutions based on the polynomials with degree equals to 3. The process of obtaining the optimal dropping packets function has been presented. Our researches were carried out using the Discrete Event Simulator OMNET++. The AQM model was early verified using the discrete-time Markov chain. The obtained results show that the traffic characteristic has the great impact on the network node behavior, but self-similarity of network traffic has no influence on the choosing of the optimal dropping packet function.

[1] J. Beran, Statistics for Long-Memory Processes, Chapman and Hall, New York, 1994.

[2] B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K. Ramakrishnan, S. Shenker, J. Wroclawski, and L. Zhang, “Recommendations on queue management and congestion avoidance in the internet”, RFC 2309, IETF (1998).

[3] S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance”, IEEE/ACM Trans. on Networking 1 (4), 397-413 (1993).

[4] A. Haider, “Improved congestion control for packet switched data networks and the internet”, PhD Thesis, Electrical and Electronic Engineering, University of Canterbury, Christchurch, 2004.

[5] P.K. Padhy and R.K. Sundaram, “Analysis and design of improved PI-PD controller for TCP AQM routers”, Int. Conf. Power, Control and Embedded Systems (ICPCES) 1, 1-5 (2010).

[6] A. Haider and A. Nakao, “On path switching in overlay network”, Australasian Telecom. Networks and Applications Conf.(ATNAC) 1, 355-360 (2008).

[7] H.-J. Ho and W.-M. Lin, “AURED - Autonomous Random Early Detection for TCP congestion control”, 3rd Int. Conf. onSystems and Networks Communications 1, 79-84 (2008).

[8] L. Enhai, L. Yan, and P. Ruimin, “An improved random early detection algorithm based on flow prediction”, Second Int. Conf. on Intelligent Networks and Intelligent Systems 1, 425-428 (2009).

[9] M.A. Qadeer, V. Sharma, A. Agarwal, and S.S. Husain, “Differentiated services with multiple random early detection algorithm using ns2 simulator”, 2nd IEEE Int. Conf. on ComputerScience and Information Technology 1, 144-148 (2009).

[10] S. Bhatnagar and R. Patro, “A proof of convergence of the BRED and P-RED algorithms for random early detection”, IEEECommunications Letters 13 (10), 809-811 (2009).

[11] B. Zheng and M. Atiquzzaman “DSRED: an active queue management scheme for new generation network”, IEEE Conf. onLocal Computer Networks 1, 242-251 (2000).

[12] S. Athuraliya, V.H. Li, S.H. Low, and Q. Yin, “REM: active queue management”, IEEE Network 15 (30), 48-53 (2001).

[13] K. Zhou, K.L. Yeung, and V. Li, “Nonlinear RED: asimple yet efficient active queue management scheme”, Computer Networks:Int. J. Computer and Telecommunications Networking 50, 3784-3794 (2006).

[14] H. Abdel-jaber, M. Mahafzah, F. Thabtah, and M. Woodward, “Fuzzy logic controller of Random Early Detection based on average queue length and packet loss rate”, Int. Symp. on PerformanceEvaluation of Computer and Telecommunication Systems 1, 428-432 (2008).

[15] J. Domańska, A. Domański, and T. Czachorski, “The dropfrom- front strategy in AQM”, Lecture Notes in Computer Science 4712, 61-72 (2007).

[16] D.R. Augustyn, A. Domański, and J. Domańska, “Active queue management with non linear packet dropping function”, 6th Int. Conf. on Performance Modelling and Evaluation of HeterogenousNetworks 1, 133-143 (2010).

[17] D.R. Augustyn, A. Domański, and J. Domańska, “A choice of optimal packet dropping function for active queue management”, Communications in Computer and Information Science 79, 199-206 (2010).

[18] L. Kleinrock, Queueing Systems, vol. II, Wiley, New York, 1976.

[19] W. Willinger, W.E. Leland, and M.S. Taqqu, “On the selfsimilar nature of ethernet traffic”, IEEE/ACM Trans. on Networking 2, 1-15 (1994).

[20] A. Domański, J. Domańska, and T. Czachorski, “The impact of self-similarity on traffic shaping in wireless LAN”, LectureNotes in Computer Science 5174, 156-168 (2008).

[21] V. Paxson and S. Floyd, “Wide area traffic: the failure of poisson modeling”, IEEE/ACM Trans. on Networking 3, 226-244 (1995).

[22] M. Crovella and A. Bestavros, “Self-similarity in world wide web traffic: evidence and possible causes”, IEEE/ACM Trans.on Networking 5, 835-846 (1997).

[23] M. Garret and W. Willinger, “Analysis, modeling and generation of self-similar VBR video traffic”, ACM SIGCOMM 1, 269-280 (1994).

[24] M. Becchi, “From Poisson processes to self-similarity: a survey of network traffic models”, Technical Report, Citeseer, 2008.

[25] B. Mandelbrot and J.V. Ness, “Fractional Brownian motions, fractional noises and applications”, SIAM Review 10, 422-437 (1968).

[26] D.R. Cox, “Long-range dependance: a review”, Statistics: anAppraisal 1, 55-74 (1984).

[27] W. Stallings, High-Speed Networks: TCP/IP and ATM DesignPrinciples, Prentice-Hall, London 1998.

[28] P. Abry, P. Flandrin, M. Taqqu, and D. Veitch, “Wavelets for the analysis, estimation and synthesis of scaling data”, SelfsimilarNetwork Traffic Analysis and Performance Evaluation 1, 39-88 (1999).

[29] A. Feldman, A. Gilbert, P. Huang, and W. Willinger, “Dynamics of ip traffic: study of the role of variability and the impact of control”, ACM SIGCOMM 1, 301-313 (1999).

[30] L. Muscariello, M. Mellia, M. Meo, M. Ajmone Marsan, and R. Lo Cigni, “Markov models of internet traffic and a new hierarchical MMPP model”, Computer Communications 28, 1835-1851 (2005).

[31] S. Robert, “Mod´elisation Markovienne du trafic dans les r´eseaux de communication”, PhD Thesis, Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, 1996.

[32] S. Robert and J.Y.L. Boudec, “New models for pseudo selfsimilar traffic”, Performance Evaluation 30 (1-2), 57-68 (1997).

[33] S. Floyd, “Discussions of setting parameters”, (1997).

[34] B. Zheng and M. Atiquzzaman, “A framework to determine the optimal weight parameter of RED in next-generation internet routers”, Int. J. Communication Systems 21 (9), 177-182 (2008).

[35] M. May, T. Bonald, and J. Bolot, “Analytic evaluation of red performance”, IEEE Infocom 1, 1415-1424 (2000).

[36] W. Chang Feng, D. Kandlur, and D. Saha, “Adaptive packet marking for maintaining end to end throughput in a differentiated service internet”, IEEE/ACM Trans. on Networking 7 (5), 685-697 (1999).

[37] M. May, C. Diot, B. Lyles, and J. Bolot, “Influence of active queue management parameters on aggregate traffic performance”, Technical Report, Research Report, Institut de Recherche en Informatique et en Automatique, Lausanne, 2000.

[38] B. Zheng and M. Atiquzzaman, “Low pass filter/over drop avoidance (lpf/oda): an algorithm to improve the response time of red gateways”, Int. J. Communication Systems 15 (10), 899-906 (2002).

[39] M. Hassan and R. Jain, High Performance TCP/IP Networking, Pearson Education Inc., London, 2004.

[40] C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations(Frontiers in Applied Mathematics), SIAM, Philadelphia, 1999.

[41] J. Domańska, “MArkow processes in modelling traffic intensity of computer networks”, PhD Thesis, IITiS PAN, Gliwice, 2005, (in Polish).

[42] OMNET++ homepage,

[43] J. Domańska, K. Grochla, and S. Nowak, Simulator of DiscreteEvents OMNeT++, High Business School, Dąbrowa Gornicza, 2009, (in Polish).

[44] C. Liu and R. Jain, “Improving explicit congestion notification with the mark-front strategy”, Computer Networks 35 (2-3), 185-201 (2000).

Bulletin of the Polish Academy of Sciences Technical Sciences

The Journal of Polish Academy of Sciences

Journal Information

IMPACT FACTOR 2016: 1.156
5-year IMPACT FACTOR: 1.238

CiteScore 2016: 1.50

SCImago Journal Rank (SJR) 2016: 0.457
Source Normalized Impact per Paper (SNIP) 2016: 1.239

Cited By


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 129 126 15
PDF Downloads 40 39 9