Saaidah A.M.Jali M.Z.Marhusin M.F.Abdel-Jaber H.2024-05-292024-05-292014978148000000010.1109/I4CT.2014.69141362-s2.0-84925950107https://www.scopus.com/inward/record.uri?eid=2-s2.0-84925950107&doi=10.1109%2fI4CT.2014.6914136&partnerID=40&md5=4459292cd822be0e97caaa955cf731cehttps://oarep.usim.edu.my/handle/123456789/10047In this study, the discrete-time performance of BLUE algorithms under bursty and correlated traffics is analyzed using two-state Markov-modulated Bernoulli arrival process (BLUE-MMBP-2). A two-dimensional discrete-time Markov chain is used to model the BLUE algorithm for two traffic classes, in which each dimension corresponds to a traffic class and the parameters of that traffic class. The MMBP is used to replace the conventional and widely-used Bernoulli process (BP) in evaluating and proposing analytical models based on the BLUE algorithm. The BP captures neither the traffic correlation nor the burstiness. The proposed approach is simulated, and the obtained results are compared with that of the BLUE-BP, which can modulate a single traffic class only. The comparison is performed in terms of mean queue length (mql), average queuing delay (D), throughput, packet loss, and dropping probability (DP). The results show that during congestion, particularly heavy congestion under bursty and correlated traffics, the BLUE-MMBP-2 algorithm provides better mql, D, and DP than the BLUE-BP. � 2014 IEEE.en-USBLUE algorithmcongestion controlMarkov-modulated Bernoulli processperformance evaluationAlgorithmsCongestion control (communication)Markov processesQueueing networksBlue algorithmsCorrelated trafficDiscrete time Markov chainsDropping probabilityMarkov modulated Bernoulli arrival processMarkov-modulated bernoulli processPerformance analysisperformance evaluationTraffic congestionConference Paper9146914136