Call for Paper

CAE solicits original research papers for the April 2023 Edition. Last date of manuscript submission is March 31, 2023.

Read More

Comparative Analysis of On-Demand (Pull) Scheduling Algorithm

R. Kavitha, S. Krishna Mohan Rao. Published in Algorithms.

Communications on Applied Electronics
Year of Publication: 2017
Publisher: Foundation of Computer Science (FCS), NY, USA
Authors: R. Kavitha, S. Krishna Mohan Rao

R Kavitha and Krishna Mohan S Rao. Comparative Analysis of On-Demand (Pull) Scheduling Algorithm. Communications on Applied Electronics 6(6):40-44, January 2017. BibTeX

	author = {R. Kavitha and S. Krishna Mohan Rao},
	title = {Comparative Analysis of On-Demand (Pull) Scheduling Algorithm},
	journal = {Communications on Applied Electronics},
	issue_date = {January 2017},
	volume = {6},
	number = {6},
	month = {Jan},
	year = {2017},
	issn = {2394-4714},
	pages = {40-44},
	numpages = {5},
	url = {},
	doi = {10.5120/cae2017652490},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


The two most important issues that have to be handled in data dissemination are efficiently exploit the available bandwidth and conserver the energy of mobile devices. In the previous research, Optimal Round Robin (ORR) Scheduling Algorithm for dissemination of varied length data items was proposed. In this paper, another scheduling algorithm which is similar to ORR is proposed and prove that it has better performance when compared in terms of access time. The existing metric stretch is used to propose new algorithm. The analytical model for the proposed algorithm show that it performs well.


  1. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik. Broadcast disks: Data management for asymmetric communications environments. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 199–210, San Jose,CA, USA, May 1995
  2. D. Aksoy and M. Franklin. R x W: A scheduling approach for large scale on demand data broadcast.IEEE/ACM Transactions on Networking, 7(6):846–860, December 1999.
  3. S. Acharya and S. Muthukrishnan. Scheduling on demand broadcasts: New metrics and algorithms. October 1998.
  4. S. Hameed and N. H. Vaidya. Efficient algorithms for scheduling data broadcast In Wireless Networks, Vol. 5, pages 183-193, 1999.
  5. H. D. Dykeman, M. Ammar, and J. W. Wong. Scheduling algorithms for videotext systems under broadcast delivery. In Proceedings of IEEE International Conference on Communications (ICC’86), pages 1847–1851, Toronto, Canada, June 1986.
  6. J. W. Wong. Broadcast delivery. Proceedings of the IEEE, 76(12):1566–1577, December 1988
  7. G. K. Zipf. Human Behaviour and the Principle of Least Effort. Addison Wesley, MA, USA, 1949
  8. D. Aksoy and M. Franklin. R x W: A scheduling approach for largescaleondemand data broadcast. IEEE/ACM Transactions on Networking, 7(6):846–860, December 1999
  9. Q. L. Hu, D. L. Lee, and W.C. Lee. Performance evaluation of a wireless hierarchical data dissemination system. In Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’99), pages 163–173, Seattle, WA, USA, August 1999.
  10. Y. Wu and G. Cao. Stretch-Optimal Scheduling for On-Demand Data Broadcasts. IEEE International Conference on Computer Communications and Networks, pages 500.504, Oct. 2005.
  11. A. Silberschatz and P. Galvin. Operating System Concepts. Addison Wesley, 1997.
  12. R. Kavitha, S.Krishna Mohan Rao “,Optimal Round Robin (ORR) Scheduling for On-Demand Broadcast in Mobile Computing Environment” , IJARCSSE , vol 3, sep-2013, pp-1014-1019


Access time, bandwidth, broadcast schedule, round robin, waiting time