IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Evaluating the Performance of Active Queue Management Using Discrete-Time Analytical Model

Evaluating the Performance of Active Queue Management Using Discrete-Time Analytical Model
View Sample PDF
Author(s): Jafar Ababneh (World Islamic Sciences & Education University (WISE), Jordan), Fadi Thabtah (Philadelphia University, Jordan), Hussein Abdel-Jaber (University of World Islamic Sciences, Jordan), Wael Hadi (Philadelphia University, Jordan)and Emran Badarneh (The Arab Academy for Banking & Financial Sciences, Jordan)
Copyright: 2012
Pages: 17
Source title: Technology Engineering and Management in Aviation: Advancements and Discoveries
Source Author(s)/Editor(s): Evon Abu-Taieh (Arab International University, Republic of Syria), Asim El Sheikh (Arab Academy for Banking and Financial Sciences, UAE)and Mostafa Jafari (Research Institute of Forests and Rangelands, Iran)
DOI: 10.4018/978-1-60960-887-3.ch018

Purchase

View Evaluating the Performance of Active Queue Management Using Discrete-Time Analytical Model on the publisher's website for pricing and purchasing information.

Abstract

Congestion in networks is considered a serious problem; in order to manage and control this phenomena in early stages before it occurs, a derivation of a new discrete-time queuing network analytical model based on dynamic random early drop (DRED) algorithm is derived to present analytical expressions to calculate three performance measures: average queue length (Qavg,j), packet-loss rate (Ploss,j), and packet dropping probability (pd(j)). Many scenarios can be implemented to analyze the effectiveness and flexibility of the model. We compare between the three queue nodes of the proposed model using the derived performance measures to identify which queue node provides better performance. Results show that queue node one provides highest Qavg,j, Ploss,j, and (pd(j)) than queue nodes two and three, since it has the highest priority than other nodes. All the above results of performance measure are obtained only based on the queuing network setting parameters.

Related Content

Suthagar S., Gopalakrishnan K., Kumaran T., Praveen Kumar. © 2022. 25 pages.
Surekha Rathi Samundi D.. © 2022. 29 pages.
Kaliappan S., Raj Kamal M. D., Balaji V., Socrates S., Andrii Kondratiev. © 2022. 18 pages.
Kumaran T., Sivarasan E. N.. © 2022. 14 pages.
Madhankumar G., Mothilal T., Kumar K. M., Muralidharan G., Mala D.. © 2022. 41 pages.
Kaliappan S., Raj Kamal M. D., Joseph Manuel D., Balaji V., Murugan P.. © 2022. 13 pages.
Suresh Chinnasamy, Paramaguru Venugopal, Ramesh Kasimani. © 2022. 15 pages.
Body Bottom