Skip to main content
SpringerLink
Log in

An Efficient Intelligent Time Slice Based Round Robin Scheduling Algorithm for ATM Using ISBP

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Asynchronous transfer mode (ATM) tends to be the most mature infrastructure to serve the imminent media broadband networks and is intended to eliminate network latency and improve traffic output versatility. In Weighted Round Robin (WRR) scheme, the main cause of concern is the delay that is being caused by high volumes of workloads at the wireless source nodes. In this paper, proposed an efficient intelligent time slice based round Robin scheduling algorithm for ATM with the use of integrated speed bit protocol (ISBP). The intelligent time slice offers priority, the blast of the CPU, and the time meaning transfer. The speed bit manager is maintained by the ISBP that contains prioritized objects. Then the intelligent time slice is done to generate the quantum time value. The purpose of this paper to enhance network performance in ATM networks by improving the throughput and average end-to-end delay. The new proposed scheme also offers a significant reduction in the average end-to-end delay when compared to the existing WRR scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Khalil E. A. (2012). Comparative performance of high-speed networks carrying multimedia. International Journal of Engineering Sciences and Emerging Technologies, 3(1), 9–21.

    Google Scholar 

  2. Agarwal, S., & Gautam, A. K. (2012). Alternate Multi Path Routing Architecture for ATM Networks. International Journal of Computer Science and Communication Engineering, 1(2), 37–42.

    Google Scholar 

  3. Mishra, B., Baudha, S., & Pandey, S. (2012). Changing data rate during handoff in GSM–ATM networks. International Journal of Advanced Research in Computer Engineering and Technology, 1(3), 170–176.

    Google Scholar 

  4. Ojesanmi, O.A. (2011). Asynchronous Transfer Mode (ATM). Georgian Electronic Scientific Journal: Computer Science and Telecommunications, 6.

  5. Bali, V., & Rathore, R. S. (2010). Performance analysis of priority scheme in ATM network. International Journal of Computer Applications, 1(13), 26–31.

    Article  Google Scholar 

  6. Shanmuganathan, C., & Raviraj, P. (2012). Performance measures of wireless protocols for ATM networks. International Journal of Mobile Network Communications & Telematics, 2(2), 31–44.

    Article  Google Scholar 

  7. Sasirekha, V., & Chandrasekar, C. (2011). Enhancing security in atm networks through congestion control technique. Journal of Computer Applications, 4(2), 63–67.

    Google Scholar 

  8. Subhransu S. K. (2014). ATM congestion control & call admission control using admission factor and DIFA (Database Info Fuzzy Logic). International Journal for Science and Emerging Technologies with Latest Trends, 17–21.

  9. Bhatia, K., Pal, A.K., & Anu Chaudhary. (2009). Performance Analysis of High-speed Data Networks Using Priority Discipline. BVICAM’s International Journal of Information Technology, 1(2).

  10. El-Madbouly, H. (2007). Bandwidth allocation in ATM Network for different QOS Requirements. International Journal of Electrical, Electronic Science and Engineering, 1(8), 68–71.

    Google Scholar 

  11. Huang, S.-J., & Lin, C.-C. (2014). Application of ATM-based network for an integrated distribution SCADA-GIS system. IEEE Transactions on Power Systems, 17(1).

  12. Susmi R. (2010). An enhanced genetic algorithm for dynamic routing in ATM networks. Journal of Theoretical and Applied Information Technology, 16(2), 153–159.

    Google Scholar 

  13. Agarwal, S., & Gautam, A.K. (2012). Alternate multi path routing architecture for ATM networks. International Journal of Computer Science and Communication Engineering, 1(2), 37–42.

    Google Scholar 

  14. Riaz Ahamed, S.S. (2008). The role of ATM technology in future data communication systems. Journal of Theoretical and Applied Information Technology, 624–628.

  15. Sreenivasulu, M., Prasad, E. V., & Raju, G. S. S. (2011). Performance evaluation of rate based congestion control schemes for ATM networks. International Journal of Computer Science and Network Security, 11(6), 190–196.

    Google Scholar 

  16. Usha Rani, M., & Sailaja, K. (2013). Implementation of fast restoration mechanisms in ATM networks. International Journal of Advanced Research in Computer Science and Software Engineering, 3(7), 1299–1306.

    Google Scholar 

  17. Zheng, Q. (2013). An enhanced timed-round-Robin traffic control scheme For ATM networks. IEEE.

  18. Srirm, K. (1992). Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networks. IEEE.

  19. Gupta, S., & El Zarki, M. Traffic classification for round-Robin scheduling schemes in ATM networks. IEEE.

  20. Oladeji, F., Oyetunji, M., & Okunoye, O. (2012). CWRR: A scheduling algorithm for maximizing performance of quality of service network router. International Journal of Computers and Applications, 41(2), 30–34.

    Article  Google Scholar 

  21. Sreenivasulu, M., Prasad, E. V., & Raju, G. S. S. (2011). Enhanced ERICA congestion control scheme for ATM Networks. International Journal of Computer Science and Network Security, 11(5), 133–140.

    Google Scholar 

  22. Mohanty, R., Himansu S. B., Khusbu P., Monisha D., & Lakshmi P. M. (2011). Priority based dynamic round robin (PBDRR) algorithm with intelligent time slice for soft real time systems. arXiv preprint arXiv:1105.1736.

  23. Jamin, S., Peter D. B., Scott S., & Lixia Z. (1995). A measurement-based admission control algorithm for integrated services packet networks. ACM, 25(4).

  24. Wu, H., & Xinjun W. (2016). ISBP: Understanding the security rule of users' information-sharing behaviors in partnership. PloS one, 11(3), e0151002.

Download references

Author information

Authors and Affiliations

  1. Computer Science & Engineering, Principal Global College of Engineering & Technology, KADAPA, 516162, India

    Sunil V. K. Gaddam

  2. School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, 110067, India

    D. K. Lobial

  3. School of Computer and Information Sciences, Indira Gandhi National Open University, New Delhi, 110068, India

    Manohar Lal

Authors
  1. Sunil V. K. Gaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. K. Lobial
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manohar Lal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sunil V. K. Gaddam.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gaddam, S.V.K., Lobial, D.K. & Lal, M. An Efficient Intelligent Time Slice Based Round Robin Scheduling Algorithm for ATM Using ISBP. Wireless Pers Commun 122, 1–21 (2022). https://doi.org/10.1007/s11277-021-08806-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-021-08806-4

Keywords

Search

Navigation