Performance Guarantee in a New Hybrid Push-Pull Scheduling Algorithm

Navrati Saxena, Cristina M. Pinotti

Abstract

The rapid growth of web services has already given birth to a set of data dissemination applications. Efficient scheduling techniques are necessary to endow such applications with advanced data processing capability. In this paper we have effectively combined broadcasting of very popular (push) data and dissemination of less popular (pull) data to develop a new hybrid scheduling scheme. The separation between the push and the pull data is called cut-off point. The clients send their request to the server, which ignores the request for the push items but queues the requests for the pull items. At every instance of time, the item to be broadcast is designated by applying a pure-push scheduling. On the other hand, the item to be pulled is the one stored in the pull-queue having the highest number of pending requests. Fixed a value for the cut-off point, an analytic model, validated by simulation, evaluates the average system performance. On the top of that, the major novelty of our system lies in its capability of offering a performance guarantee to the clients. For each request, the client specifies, along with the data item requested, the maximum interval of time it can afford to wait before its request will be served. Based on this particular access-time and on the analytic model, our hybrid system computes the cut-off point to fulfill the specific need of the client. The system offers a great flexibility for clients. It improves significantly upon a pure push system and some existing hybrid systems in terms of average waiting time spent by a client.

References

  1. S. Acharya, R. Alonso, M. Franklin and S. Zdonik. Braodcast Disks: Data Management for Asymmetric Communication Environments. In In the proceedings of ACM SIGMOD Conf., San Jose, May 1995.
  2. S. Acharya, M. Franklin and S. Zdonik. Dissemination-Based Data Delivery using Broadcast Disks. In IEEE Personal Communications, pages 50-60, Dec 1995.
  3. S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In Proceedings of the ACM SIGMOD Conference, Tuscon, Arizona, pages 183-193, May, 1997.
  4. D. Aksoy and M. Franklin. RxW: A scheduling approach for large scale on-demand data broadcast. In IEEE/ACM Transactions on Networking, Vol. 7, No. 6, Dec, 1999.
  5. A. Bar-Noy, J. S. Naor and B. Schieber. Pushing Dependent Data in Clients-ProvidersServers Systems. In Mobile Networks and Applications, Vol. 9, pages 421-430, 2003.
  6. J. C. R. Bennett and H. Zhang. Hierarchical packet fair queueing algorithms In Proceedings of ACM SIGCOMM, pages 43-56, 1996.
  7. J. Gecsei, The architecture of videotex systems Englewood Cliffs, NJ, Prentice-Hall, 1983
  8. D. Gross and C. M. Harris, Fundamentals of Queuing Theory John Wiley & Sons Inc.
  9. Y. Guo, S. K. Das and M. C. Pinotti. A new Hybrid Broadcast scheduling Algorithm for Asymmetric Communication Systems: Push and Pull Data based on Optimal Cut-Off Point. In Mobile Computing and Communications Review (MC2R), Vol. 5, No. 4, 2001.
  10. S. Hameed and N. H. Vaidya. Ef cient algorithms for scheduling data broadcast In Wireless Networks, Vol. 5, pages 183-193, 1999.
  11. S. Hameed and N. H. Vaidya. Scheduling data broadcast in asymmetric communication environments In Wireless Networks, Vol. 5, pages 171-182, 1999.
  12. R. Jain and J. Werth. Airdisks and airraid: Modeling and scheduling periodic wireless data broadcast (extended abstract) In DIMACS Technical Report 95-11, Rutgers University, 1995.
  13. M. C. Pinotti and N. Saxena. Push less and pull the current highest demaned data item to decrease the waiting time in asymmetric communication environments. In 4th International Workshop on Distributed and Mobile Computing, (IWDC), Calcutta, India pages 203-213. Springer-Verlag 2002; LNCS 2571, Dec 28-31, 2002.
  14. W. C. Peng and M. S. Chen. Dynamic generation of data broadcasting programs for a broadcast disk array in a mobile computing environment. In Proceedings of the ACM 9th Conference on Information and Knowledge Management, pages 38-45, Nov. 2000.
  15. W. C. Peng, J. L. Huang and M. S. Chen. Dynamic Levelling: Adaptive Data Broadcasting in a Mobile Computing Environment. In Mobile Networks and Applications, Vol. 8, pages 355-364, 2003.
  16. K. Stathatos and N. Roussopoulos and J. S. Baras. Adaptive data broadcast in hybrid networks In Proceedings of 23rd International Conference on Very Large Data Bases, Athens, Greece, pages 326-335, 1997
Download


Paper Citation


in Harvard Style

Saxena N. and M. Pinotti C. (2004). Performance Guarantee in a New Hybrid Push-Pull Scheduling Algorithm . In Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 1: WIS, (ICEIS 2004) ISBN 972-8865-02-3, pages 50-62. DOI: 10.5220/0002674500500062


in Bibtex Style

@conference{wis04,
author={Navrati Saxena and Cristina M. Pinotti},
title={Performance Guarantee in a New Hybrid Push-Pull Scheduling Algorithm},
booktitle={Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 1: WIS, (ICEIS 2004)},
year={2004},
pages={50-62},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002674500500062},
isbn={972-8865-02-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Workshop on Wireless Information Systems - Volume 1: WIS, (ICEIS 2004)
TI - Performance Guarantee in a New Hybrid Push-Pull Scheduling Algorithm
SN - 972-8865-02-3
AU - Saxena N.
AU - M. Pinotti C.
PY - 2004
SP - 50
EP - 62
DO - 10.5220/0002674500500062