PriMera Scientific Engineering (ISSN: 2834-2550)

PhD Thesis

Volume 5 Issue 5

Priority Scheduling Schemes in Mobile Ad-Hoc Networks

Mukakanya Abel Muwumba*

November 01, 2024

DOI : 10.56831/PSEN-05-164

View PDF

Abstract

Delay is a major Quality of Service (QoS) metric in mission critical applications. Some applications run on Mobile Ad-Hoc Network (MANET) set ups which comes with transmission challenges arising from the size of traffic packets and environmental conditions. These challenges cause transmission delays, packet loss and hence a degraded network performance. This study investigated the performance of: Earliest Deadline First (EDF); Low Latency Queueing (LLQ) and Weighted Round Robin (WRR) scheduling algorithms in MANETs.

Firstly, the study investigated the Abhaya pre-emptive EDF scheduler. The study improved and adopted EDF algorithm to the MANETs environment, and formulated the Enhanced Earliest Deadline First-I and II (EEDF-I & EEDF-II) algorithms respectively. The numerical results showed that the EEDF-II model shortened the waiting times of packets of the different queues at various system loads compared with the EEDF-I model.

Secondly, the study adopted and improved the existing model to LLQ algorithm in the M/G/1 queue system. The numerical results revealed that the proposed algorithm performed better than the adopted in transmitting video packets. The study extended further the proposed LLQ algorithm to formulate the Extended Low Latency Queuing algorithm (ELLQ). The numerical results revealed that the video packets experienced the least conditional mean response time/slowdown; followed by voice packets and lastly text packets.

Thirdly, the study enhanced and studied the Existing (EWRR) service strategy; and then proposed an Improved (IWRR) model in the M/G/1 queue system under varying workloads distributions. The numerical results showed that video packets performed poorly compared to voice packets in the EWRR algorithm.

In conclusion, we studied three algorithms namely: EDF, LLQ & WRR, and proposed three novel variants i.e., EEDF-II, ELLQ plus IWRR for MANETs.

References

  1. JN Al-Karaki. “Infrastructureless wireless networks: Cluster-based architectures and protocols”. Ph.D. dissertation, Iowa State University, Ames, Iowa (2004).
  2. J Jubin and JT now. “The DARPA packet radio network protocols”. in Proc. of IEEE 75.1 (1987): 21-32.
  3. T Sunil and K Ashwani. “A Survey of Routing Protocols in Mobile Ad Hoc Networks”. International Journal of Innovation, Management and Technology.
  4. DH Morais. 5G and Beyond Wireless Transport Technologies Enabling Backhaul, Midhaul, and Fronthaul. Gewerbestrasse 11, 6330 Cham, Switzerland: Springer Nature Switzerland AG (2021).
  5. M Rath, B Pattanayak and B Pati. “Energy Efficient MANET Protocol Using Cross Layer Design for Military Applications”. Defence Science Journal 66.2 (2016): 146-150.
  6. V Kumar. “Improving Quality of Service in Mobile Ad-Hoc Networks (MANETs) Using Adaptive Broadcast Scheduling Algorithm with Dynamic Source Routing Protocol”. Journal of Computational and Theoretical Nanoscience 14.5 (2017).
  7. AM Fahad., et al. “Ns2 based performance comparison study between dsr and aodv protocols”. Int. J. Adv. Trends Comput. Sci. Eng 8 (2019): 379-393.
  8. H Al-Bahadili. “An optimized scheduling scheme in OFDMA WiMax networks”. (2012).
  9. J Loo, JL Mauri and JH Ortiz. Mobile ad hoc networks: current status and future trends: CRC Press (2016).
  10. D Taniar. “Mobile Computing: Concepts, Methodologies, Tools, and Applications: Concepts, Methodologies, Tools, and Applications”. IGI Global 1 (2008).
  11. S Dhar. “MANET: Applications, Issues, and Challenges for the Future”. International Journal of Business Data Communications and Networking (IJBDCN) 1 (2005): 66-92.
  12. B Karaoglu. “Efficient Use of Resources in Mobile Ad Hoc Networks”. Ph.D. dissertation, University of Rochester, New York (2013).
  13. MB Sedrati. “Multipath Routing to Improve Quality of Service for Video Streaming Over Mobile Ad Hoc Networks”. Wireless Personal Communications Springer US 99 (2018): 999-1013.
  14. ML Raja and CDSS Babooi. “An Overview of MANET: Applications, Attacks and Challenges”. International Journal of Computer Science and Mobile Computing (IJCSMC) 3 (2014): 408-417.
  15. W Chen., et al. “Joint qos provisioning and congestion control for multihop wireless networks”. EURASIP Journal on Wireless Communications and Networking (2016).
  16. S Malik., et al. “An Adaptive Emergency First Intelligent Scheduling Algorithm for Efficient Task Management and Scheduling in Hybrid of Hard Real-Time and Soft Real-Time Embedded IoT Systems” (2019).
  17. Cisco. “Cisco Visual Networking Index:  Forecast and Trends, 2017-2022”. 2018, white Paper. [Online]. https://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/white-paper-c11-741490.html
  18. TA Assegie and HD Bizuneh. “Improving network performance with an integrated priority queue and weighted fair queue scheduling”. Indonesian Journal of Electrical Engineering and Computer Science 19.1 (2020): 241-247.
  19. A Sufian, A Banerjee and P Dutta. “Survey of various real and nonreal-time scheduling algorithms in mobile ad hoc networks”. Industry Interactive Innovations in Science, Engineering and Technology (2018).
  20. V Abhaya., et al. “Performance Analysis of EDF Scheduling in a Multi-Priority Preemptive M/G/1 Queue”. in IEEE Transactions on Parallel and Distributed Systems 25.8 (2014).
  21. G Abhaya. “Towards Achieving Execution Time Predictability in Web Services Middleware”. Ph.D. dissertation, School of Computer Science and Information Technology, College of Science, Engineering, and Health, RMIT University, Melbourne, Victoria (2012).
  22. S Kakuba, K Kawaase and M Okopa. “Modeling Improved Low Latency Queuing Scheduling Scheme for Mobile AdHoc Networks”. in International Journal of Digital Information and Wireless Communication (2017).
  23. V Hottmar and B Adamec. “Analytical Model of a Weighted Round Robin Service System”. Journal of Electrical and Computer Engineering (2012).
  24. Y Yang., et al. “Traffic Agents for Improving QoS in Mixed Infrastructure and Ad Hoc Modes Wireless LAN”. EURASIP Journal on Wireless Communications and Networking (2005): 1-7.
  25. K WU and J Harms. “QoS Support in Mobile Ad Hoc Networks”. Crossing Boundaries an interdisciplinary journal 1.1 (2001).
  26. G Bolch., et al. Queueing networks and Markov chains: modeling and performance evaluation with computer science applications. Wiley-Blackwell (2006).
  27. A Mohammed., et al. “Weighted Round Robin Scheduling Algorithms in Mobile AD HOC Network”.
  28. Chen X, HM Jones and D Jayalath. “Channel Aware Routing in MANETs with Route Handoff”. in Proc. of IEEE Transactions on Mobile Computing 10.1 (2011): 108-121.
  29. NB Ramantt and I Guptat. “On Demand Routing Protocols for Mobile Ad Hoc Networks: A Review”. in Proc. of IEEE International Advance Computing Conference (IACC) (2009): 586-591.
  30. D Bruin., et al. “Fair channel dependent scheduling in CDMA systems”. in Proc. of IST Mobile & Wireless Communications Summit (2003): 737-741.
  31. R Nandakumar. “Review of Packet Scheduling Algorithm in MANET”. Infokara Research 9 (2019).
  32. D Ferrero and G Urvoy-Keller. “Size-based scheduling to improve fairness and performance in 802.11 networks”. Research Report RR-06183.
  33. BC Sherin and EM Anita. “A Survey of Scheduling Algorithms for Wireless Ad-hoc Networks”. International Journal of Advanced Science and Engineering 4.4 (2018): 776787.
  34. C Semeria. “Supporting Differentiated Service Classes: Queue Scheduling Disciplines, Juniper Networks”. (2001): 11-14.
  35. A Demers, S Keshav and S Shenker. “Analysis and simulation of a fair queueing algorithm”. (1989). [Online].
  36. T Balogh and M Medvecký. “Average Bandwidth Allocation Model of WFQ”. Modelling and Simulation in Engineering, vol. 2012.
  37. M Shreedhar and G Varghese. “ Efficient Fair Queueing using Deficit Round Robin”. in Proc. of ACM SIGCOMM (1995).
  38. “Low Latency Queuing Algorithm (LLQ).” [Online]. http://www.cisco.com/en/US/docs/ios/12_0t/12_0t7/feature/guide/pqcbwfq.pdf
  39. A Raj and PB Prince. “Round robin based secure-aware packet scheduling in wireless networks”. International Journal of Engineering Science and Technology 5.3 (2013).
  40. Z Chen, Z Ge and M Zhao. “Congestion aware scheduling algorithm for MANET”. WiCOM (2006).
  41. D Brunonas, A Tomas and B Aurelijus. “Analysis of QoS Assurance using Weighted Fair Queuing (WFQ) Scheduling Discipline with Low Latency Queue (LLQ)”. Proc. In: 28th International Conference Information Technology Interfaces June 19-22, IEEE, Croatia (2006).
  42. NIM Enzai, SS Rais and R Darus. “An Overview of Scheduling Algorithms in Mobile Ad-Hoc Networks”. in Proc. 2010 International Conference on Computer Applications and Industrial Electronics (ICCAIE 2010), Kuala Lumpur, Malaysia (2010).
  43. AK Parekh and RG Gallager. “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks”. in Proc. IEEE/ACM Transaction on Networking 2.2 (1994).
  44. C Bennett and H Zhang. “Wf2q: Worst-case fair weighted fair queueing”. in Proc. IEEE INFOCOM 96 (1996): 120-128.
  45. C Liu and JW Layland. “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment”. in Journal of ACM 20.1 (1973).
  46. V Sivaramani. “End-to-End Delay Service in High Speed Packet Networks using Earliest Deadline First Scheduling”. Ph.D. dissertation (2000).
  47. H Paloheimo., et al. “Challenges in Packet Scheduling in 4G Wireless Networks”. (2006).
  48. X Liui. “Opportunistic Scheduling in Wireless Communication Networks”. Ph.D. dissertation (2002).
  49. B Schroeder and M Harchol-Balter. “Web Servers Under Overload: How Scheduling Can Help”. ACM Transactions on Internet Technology 6 (2002): 2052.
  50. M Harchol-Balter. “Queueing Disciplines”. Wiley Encyclopedia of Operations Research and Management Science (2009).
  51. IA Rai and M Okopa. “Modeling and Evaluation of SWAP Scheduling Policy Under Varying Job Size Distributions”. in Proc.The Tenth International Conference on Networks (2011).
  52. J Nagle. SIGCOMM Comput. Commun. Rev 14.4 (1984): 61. [Online].
  53. DA Mahmood and G Ath. “A Simple Approximation for the Response times in the Two-class Weighted Fair Queueing System”. in Proc. Conference Paper in Lecture Notes in Computer Science (2017).
  54. S Lu and V Bharghavan. “Fair Scheduling in Wireless Packet Networks”. in Proc. IEEE/ACM Trans. Networking 7.4 (1999): 473-489.
  55. H Luo., et al. “A Self-Coordinating Approach to Distributed Fair Queueing in Ad Hoc Wireless Networks”.
  56. H Zhang and S Keshav. “Comparison of rate-based service disciplines”. in SIGCOMM (1991): 113-121.
  57. SM Scriba. “Analysis of the EDF family of schedulers”. Ph.D. dissertation, University of KwaZulu-Natal, Durban, South Africa (2009).
  58. K Chen and L Decreusefond. “An Approximate Analysis of Waiting Time in Multi-Classes M/G/1/./EDF Queues”. in Proc. the 1996 ACM SIGMETRICS international conference on Measurement and modeling of com, Las Vegas, NY,USA (1996).
  59. M Andrews. “Probabilistic end-to-end delay bounds for earliest deadline first scheduling”. in Proc. IEEE Infocom (2000): 603-612.
  60. V Sivaraman and FM Chiussi. “Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler”. Performance Evaluation 36-37.1-4 (1999): 457-470.
  61. MG Harbour and J Palencia. “Response time analysis for tasks scheduled under EDF within fixed priorities”. in Proc.24th IEEE RealTime Systems Symposium (2003): 200-209.
  62. K Albers and F Slomka. “Efficient feasibility analysis for real-time systems with EDF scheduling”. in Proc. IEEE Computer Society, Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (2005): 492-497.
  63. TP Baker. “An analysis of EDF schedulability on a multiprocessor”. IEEE Transactions on Parallel and Distributed Systems 16 (2005).
  64. M Kargahi and A Movaghar. “A Two-Class M/M/1 System with Preemptive Non Real-Time Jobs and Prioritized Real-Time Jobs under Earliest-Deadline-First Policy”. in Scientia Iranica 15.2 (2008): 252-265.
  65. Y Dehbi and N Mikou. “Priority assignment for multimedia packet scheduling in MANET”. in Proc. International Conference on Signal Image Technology and Internet Based Systems (2008).
  66. R Barhoun and A Namir. “Packet Scheduling of Two Classes Flow”. in International Journal of Computer Science and Information Technology (IJCSIT) 3.4 (2011).
  67. B Arunkumar, R Avudaiammal and A Swarnalatha. “QoS Based Packet Scheduler for Hybrid Wireless Networks”. in International Journal of Networks (IJN) 1 (2015).
  68. Chun and M Baker. “Evaluation of Packet Scheduling Algorithms in Mobile Ad-Hoc Networks”. ACM SIGMOBILE Mobile Computing and Communications Review (2018): 3649.
  69. M Rath, B Pati and BK Pattanayak. “Cross layer based QoS platform for multimedia transmission in MANET”. in Proc. 11th International Conference on Intelligent Systems and Control (ISCO) (2017).
  70. H Eric, IH Ming and L Hsu-Te. “Low Latency and Efficient Packet Scheduling for Streaming Applications.” Journal of Computer Communications 29.9 (2006): 1413-1421.
  71. A Jesus, V Perez and C Christian. A Network and Data Link Layer QoS Model to Improve Traffic Performance. Emerging Directions in Embedded and Ubiquitous Computing. Lecture Notes in Computer Science, Springer Berlin (2006).
  72. A Farzad, K Sahar and S Bahram. “A New Scheduling Algorithm Based on Traffic Classification using Imprecise Computation”. International Journal of Computer, Control, Quantum and Information Engineering 2.9 (2008): 78 82.
  73. B Shaimaa, B Fatma and D Gamal. “QoS Adaptation in Real Time Systems based on CBWFQ”. in Proc. 28th National Radio Science Conference (NRSC), Cairo (2011): 1 8.
  74. J Hyunchul, AK Jin and S Hwangjun. “ Urgency-based Packet Scheduling and Routing Algorithms for Video Transmission over MANETS.” IET International Communication Conference on Wireless Mobile and Computing (2011): 78 82.
  75. B Shaimaa, B Fatma and D Gamal. “Simulation based performance evaluation of queuing for e-learning real time system”. in Proc. International Conference on Education and e-learning innovations, IEEE (2012).
  76. C Jui-Chi. “Optimized Packet Scheduling Management: Maximizing Bandwidth Utilization for Next-Generation Mobile Multimedia Communications”. Wireless Peers Communication (2012): 613-630.
  77. P Rukmani and R Ganesen. “Scheduling Algorithm for Real Time Applications in Mobile Ad-Hoc Network with OPNET Modeler”. Procedia Engineering Journal 64 (2013): 94-103.
  78. AH Zakaria., et al. “Performance Analysis of Mobile Ad Hoc Networks using Queuing Theory”. Malaysia (2014).
  79. A Ali, N Singh and P Verma. “M/M/1/n+Flush/n Model to Enhance the QoS for Cluster Heads in MANETs”. International Journal of Advanced Computer Science and Applications 9.5 (2018).
  80. Kacem., et al. “A New Routing Approach for Mobile Ad Hoc Systems Based on Fuzzy Petri Nets and Ant System”. IEEE Access 6 (2018): 65 705-65 720.
  81. M Balter. “Queueing Disciplines”. in Wiley Encyclopedia of Operations Research and Management Science (2009).
  82. Q Zhang, L Ding and Z Liao. “A Novel Genetic Algorithm for Stable Multicast Routing in Mobile Ad Hoc Networks”. China Communications 16.8 (2019): 24-37.
  83. M Sivaram, V Porkodi and AS Mohammed. “Re-transmission DBTMA Protocol with Fast Re-transmission Strategy to Improve the Performance of MANETs”. IEEE Access 7 (2019): 85 098-85 109.
  84. Z Chen., et al. “An Adaptive on Demand Multipath Routing Protocol with QoS Support for High Speed MANET”. IEEE Access 8 (2020): 44 760-44 773.
  85. BUI Khan., et al. “A Game Theory-Based Strategic Approach to Ensure Reliable Data Transmission with Optimized Network Operations in Futuristic Mobile Adhoc Networks”. IEEE Access 8 (2020): 124 097-124 109.
  86. Z Scully, M Harchol-Balter and A Scheller-Wolf. SOAP: One Clean Analysis of All Age-Based Scheduling Policies. Carnegie Mellon University (2018).
  87. P Rukmani and R G. “Enhanced Low Latency Queuing Algorithm for Real Time Applications in Wireless Networks”. International Journal of Technology (2016): 663-672.
  88. A Sohail., et al. “Implementation of class-based low latency fair queueing (cbllfq) packet scheduling algorithm for hsdpa core network”. KSII Transactions on Internet and Information Systems 14.1 (2020): 473-494.
  89. M Katevenis, S Sidiropoulos and C Courcoubetis. “Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip”. IEEE Journal on Selected Areas in Communications 9.8 (1991).
  90. HM Chaskar and U Madhow. “Fair Scheduling with Tunable Latency: A Round-Robin Approach”. IEEE/ACM Transactions on Networking 11.4 (2003).
  91. Y Qian, Z Lu and Q Dou. “QoS Scheduling for NoCs: Strict Priority Queuing versus Weighted Round Robin”. in Proc. IEEE International Conference on Computer Design (2010): 52-59.
  92. B Tomá and M Martin. “ Mean Bandwidth Allocation Model of WRR for IP Networks”. in Proc.35rd International Conference on Telecommunications and Signal Processing (2012): 156-160.
  93. Tomas Balogh and Martin Medvecky. “Weighted Round Robin and Rate Limiter based Fair Queuing for WRR”. I. J. Computer Network and Information Security 5 (2015): 51-60.
  94. J Gautam., et al. “Efficient Traffic Scheduling and Congestion Control Mechanism in Wireless Networks “. International Journal for Scientific Research & Development 7 (2019).
  95. K Elsayed. “Enhancing the end-to-end schedulability condition of EDF scheduling for real-time applications”. in Proc.IEEE ATM Workshop Proceedings (1998): 75-79.
  96. K Zhu, Y Zhuang and Y Viniotis. “Achieving end-to-end delay bounds by EDF scheduling without traffic shaping”. IEEE INFO COM (2001): 1493-1501.
  97. J Lopez., et al. “Worst-case utilization bound for edf scheduling on real-time multiprocessor systems”. in Proc.12th Euromicro Conference on RealTime Systems, 2000 (Euromicro RTS 2000) (2000): 25-33.
  98. WL Winston. Operations Research: Applications and Algorithms, 2nd edition. PWS-Kent Publishing, Boston (1991).
  99. B Filipowicz and J Kwiecien. “Queueing systems and networks. Models and applications”. Department of Automatics, AGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Kraków, Poland (2008).
  100. S. Stidham, “Analysis, design and control of queueing systems”. Operations Research 50.1 (2002): 197-216.
  101. PN Inria. “Basic elements of queueing theory application to the modelling of computer systems”. Department of Networks, Faculty of Computing and Information Technology, Makerere University, 2004 route des Lucioles 06902 Sophia Antipolis, France, lecture Notes (2004).
  102. JG Han and Y Qian. “Queuing Theory Based Co-Channel Interference Analysis Approach for High-Density Wireless Local Area Networks”. Sensors (2016).
  103. J Zhang, GH and Y Qian. “Queuing Theory Based Co-Channel Interference Analysis Approach for High-Density Wireless Local Area Networks”. Sensors (2016).
  104. IA Rai. “QoS Support in Edge Routers”. Ph.D. dissertation, Paris Telcom, France (2004).
  105. E Larsen. “Increasing the Performance of MANETs Throughput and QoS Performance Enhancing Mechanisms for Unicast and Group Communication in Proactive Mobile Ad Hoc Networks”. Ph.D. dissertation, Norwegian University of Science and Technology (2011).
  106. M Hasib, J Schormans and T Timotijevic. “Accuracy of packet loss monitoring over networked CPE”. IET Communications 1 (2007): 507-513.
  107. JA Schormans and CM Leung. Measurement for guaranteeing QoS in broadband multiservice networks.
  108. T Timotijevic, CM Leung and J Schormans. “Accuracy of measurement techniques supporting QoS in packet-based intranet and extranet VPNs”. in Proc. IEE Proceedings-Communications 151 (2004): 89-94.
  109. M Roughan. “Fundamental bounds on the accuracy of network performance measurements”. in Proc. in Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, Banff, Alberta, Canada: ACM (2005).
  110. L Klienrock. Queuing Systems, Volume 1: Theory. John Wilev & Sons (1975).
  111. RK Jain. The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling: Wiley-Interscience (1991).
  112. JF Kurose and HT Mouftah. “Computer-aided modeling, analysis, and design of communication networks”. IEEE Journal on Selected Areas in Communications 6 (1988): 130-145.
  113. AM Law and WD Kelton. Simulation modeling and analysis, 3rd ed. London: McGraw-Hill (2000).
  114. SM Saleh. “Adaptive Security-Aware Scheduling for Packet Switched Networks Using Real-Time Multi-Agent Systems”. Ph.D. dissertation, Western Michigan University, Graduate Colleges (2012).
  115. MKGJW Liu. “Performance of Algorithms for Scheduling RealTime Systems with Overrun and Overload”. in Proc. in the Proceedings of the Eleventh Euromicro Conference on Real-Time Systems, held at University of York, England (1999).
  116. L George, P Muhletahler and N Rivierre. “Optimality and Nonpreemptive Real-time Scheduling Revisited”. technical Report 2516, INRIA (1995).
  117. L Georgiadis, R Guerin and AK Parekh. “Optimal Multiplexing on a Single Link: Delay and Buffer Requirements”. in Proc. Proceedings of the IEEE Transactions on Information Theory (1997).
  118. V Firoiu, J Kurose and D Towsley. “Efficient Admission Control for EDF Schedulers”. in Proc. Proceedings of IEEE INFOCOM (1997): 310-317.
  119. JKR Chipalkatti and D Towsley. “Scheduling Policies for Real-Time and Non-Real-Time Traffic in a Statistical Multiplexer”. in Proc. In Proceedings of INFOCOM89 3 (1989): 774-783.
  120. J Peha and F Tobagi. “Evaluation scheduling algorithms for traffic with heterogenous performance objectives”. in Proc. In Proceedings of GlobeCom 90 1 (1990): 21-27.
  121. V Sivaraman, FM Chiussi and M Gerlai. “End-to-end statistical delay service under GPS and EDF scheduling: A comparison study”. in Proc.In Proceedings of IEEE INFOCOM 01 (2001): 1113-1122.
  122. A Grilo, M Macedo and M Nunes. “A scheduling algorithm for QoS support in IEEE802.11e networks”. in Proc. In IEEE Wireless Communications 10 (2003): 36-43.
  123. MD Natale and A Mesch. “Scheduling messages with earliest deadline techniques”. In Journal Real-Time Syst 20 (2001): 255-285.
  124. L Kleinrock. Queueing Systems Volume 2: Computer Applications (1976).
  125. G Lee and J Jeon. “Analysis of an MMPP/G/1/K Finite Queue with Two-Level Threshold Overload Control”. Comm. Korean Math. Soc 14 (1999): 805-813.
  126. BK Asingwire, M Okopa and T Bulega. “Performance of VoIP Traffic over 802.11 Wireless Mesh Network Under Correlated Interarrival Times”. In the International Journal of Digital Information and Wireless Communications (IJDIWC) 6.2 (2016): 122-138.
  127. W Fischer and K Meier-Hellstern. “The Markov modulated Poisson process (MMPP) cookbook”. in Proc. Proceedings of the Performance Evaluation 18.2 (1993): 149-171.
  128. B Ciciani, A Santoro and P Romano. “Approximate Analytical Models for Networked Servers Subject to MMPP Arrival Processes”. in Proc. Proceedings of the 6th IEEE International Symposium on Network Computing and Applications (2007).
  129. PJ Kotian, P Vaishnavi and S Begum. “Review on Data Traffic in Real Time for MANETs”. International Research Journal of Engineering and Technology (IRJET) 4 (2017).
  130. MA Muwumba, OS Eyobu and J Ngubiri. “An Improved Low Latency Queueing Scheduling Algorithm for MANETs”. In K. Arai (Eds.) Advances in Information and Communication FICC 2023, Lecture Notes in Networks and Systems 651 (2023).
  131. A Wierman. “Scheduling for Today s Computer Systems: Bridging Theory and Practice”. Ph.D. dissertation, Pittsburgh, PA 15213 (2007).
  132. L Byeongchan. “Asymptotic tail distribution analysis of queueing systems with heavy-tailed input traffic”. Ph.D. dissertation, Korea Advanced Institute of Science and Technology, College of Natural Sciences (2018).
  133. L Clavier., et al. “Experimental Evidence for Heavy Tailed Interference in the IoT “. IEEE Communications Letters (2021): 692-695.