Journal of the Korean Data and Information Science Society

The Korean Data and Information Science Society (한국데이터정보과학회)
권호 표지

Design and evaluation of a GQS-based time-critical event dissemination for distributed clouds

  • Bae, Ihn-Han (School of Computer and Information Communication Engineering, Catholic University of Daegu)
  • Received : 2011.08.29
  • Accepted : 2011.09.19
  • Published : 2011.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

Cloud computing provides computation, software, data access, and storage services that do not require end-user knowledge of the physical location and configuration of the system that delivers the services. Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers around the world. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a group quorum system (GQS)-based dissemination for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed GQS-based method organizes these distributed clouds into a group quorum ring overlay to support a constant event dissemination latency. Our numerical results show that the GQS-based method improves the efficiency as compared with Chord-based and Plume methods.

Keywords

References

  1. DeCandia, G., Hastorun, D., Jamd, M. and Vogels, W. (2007). Dynamo: Amazon's highly available key-value store. Proceeding of 21st ACM Symposium on Operating Systems Principles, 205-220.
  2. Dikaiakos, M. D., Katsaros, D., Mehra, P., Pallis, G. and Vakali, A. (2009). Cloud computing: Distributed internet computing for IT and scientific research. IEEE Internet Computing, 13, 10-13.
  3. Endo, P. T., de Almeida Palhares, A. V., Pereira, N. N., Goncalves, G. E., Sadok, D., Kelner, J., Melander, B. and Mangs, J.-E. (2011). Resource allocation for distributed cloud: Concepts and research challenges. IEEE Network Magazine, 25, 42-46. https://doi.org/10.1109/MNET.2011.5958007
  4. Joung, Y-J. (2003). Quorum-based algorithms for group mutual exclusion. IEEE Transaction on Parallel and Distributed Systems, 14, 463-476. https://doi.org/10.1109/TPDS.2003.1199064
  5. Laoutaris, N., Rodriguez, P. and Massoulie, L. (2008). ECHOS: Edge capacity hosting overlays of nano data centers. ACM SIGCOMM Computer Communication Review , 38, 51-54.
  6. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F. and Balakrishnan, H. (2001) Chord: A scalable peer-to-peer lookup service for internet applications. Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 149-160.
  7. Terpstra, W. W., Behnel, S., Fiege, L., Zeidler, A. and Buchmann, A. P. (2003). A peer-to-peer approach to content-based publish/subscribe. Proceedings of the 2nd International Workshop on Distributed Event-Based Systems, 1-8.
  8. Wu, C-J., Ho, J-M. and Chen, M-S. (2011). Time-critical event dissemination in geographically distributed clouds. IEEE Conference on Computer Communications Workshops, 654-659.