Journal of the Korea Academia-Industrial cooperation Society (한국산학기술학회논문지)

The Korea Academia-Industrial cooperation Society (한국산학기술학회)
권호 표지
DOI QR코드

DOI QR Code

Adaptive Upstream Backup Scheme based on Throughput Rate in Distributed Spatial Data Stream System

분산 공간 데이터 스트림 시스템에서 연산 처리율 기반의 적응적 업스트림 백업 기법

  • Jeong, Weonil (Dept. of Information Security Engineering, Hoseo University)
  • Received : 2013.07.04
  • Accepted : 2013.10.10
  • Published : 2013.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

In distributed spatial data stream processing, processed tuples of downstream nodes are replicated to the upstream node in order to increase the utilization of distributed nodes and to recover the whole system for the case of system failure. However, while the data input rate increases and multiple downstream nodes share the operation result of the upstream node, the data which stores to output queues as a backup can be lost since the deletion operation delay may be occurred by the delay of the tuple processing of upstream node. In this paper, the adaptive upstream backup scheme based on operation throughput in distributed spatial data stream system is proposed. This method can cut down the average load rate of nodes by efficient spatial operation migration as it processes spatial temporal data stream, and it can minimize the data loss by fluid change of backup mode. The experiments show the proposed approach can prevent data loss and can decrease, on average, 20% of CPU utilization by node monitoring.

분산 공간 데이터 스트림 처리에서는 분산 노드의 활용도를 높이고 고장이 발생한 경우 신속하게 시스템을 복구하기 위해 하위 노드에서 처리된 튜플에 대해 상위 노드로 데이터를 백업한다. 그러나 데이터의 유입량이 증가하고 노드의 연산 결과를 다수의 하위 노드들과 공유할 때 튜플 처리가 지연되면 상위 노드의 삭제 지연으로 인해 백업 데이터의 손실을 야기할 수 있다. 본 논문에서는 노드들의 데이터 유입량과 하위 노드의 연산 처리율을 분석하고 적응적 업스트림 백업 방법을 적용하여 노드의 평균 부하율을 감소시키고, 노드 연산 결과의 공유에 따른 데이터 손실을 최소화하는 방법을 제안한다. 그리고 실험에서는 제안 기법을 통해 데이터 손실을 방지하고, 노드 모니터링에 소요되는 CPU 사용률을 평균 20% 감소시키는 결과를 나타낸다.

Keywords

References

  1. S. R. Ahuja, K. D. Hong, K. S. Hong, "The Rapport Multimedia Conferencing System", Proc. of 2nd IEEE Conference on Computer Workstations, pp. 52-58, March, 1988. DOI: http://dx.doi.org/10.1109/COMWOR.1988.4800
  2. S. Prabhakar et. al, "Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects", IEEE Transactions on Computers Vol. 51 No. 10, pp. 1124-1140, 2002. 10. DOI: http://dx.doi.org/10.1109/TC.2002.1039840
  3. C. Park, D. Hong, C. Park and K. Han, "Design and Implementation of a Spatial DSMS based on STREAM", Proc. of KSIS, pp. 131-136, 2006. 11.
  4. B. Gedik, L. Liu, "MobiEyes: Distributed processing of continuou sly moving queries on moving objects in a mobile system", Proc. of the International Conference on Extending Database Technology, 2004. DOI: http://dx.doi.org/10.1007/978-3-540-24741-8_6
  5. C.S Jensen, D. Lin, B.C. Ooi, "Query and update efficient B+-tree based indexing of moving objects", Proc. of the International Conference on Very Large Data Bases, pp. 768-779, 2004.
  6. Hu H, Xu J, Lee D.L, "A generic framework for monitoring continuous spatial queries over moving objects", Proc. of the ACM International Conference on Management of Data, SIGMOD, Baltimore, 2005. DOI: http://dx.doi.org/10.1145/1066157.1066212
  7. Iwerks G.S, Samet H, Smith K, "Continuous K-nearest neighbor queries for continuously moving points with updates", Proc. of the International Conference on Very Large Data Bases, VLDB, 2003.
  8. Jensen C.S, Lin D, Ooi B.C, "Query and update efficient B+-tree based indexing of moving objects", Proc. of the ACM international Conference on Very Large Data Bases, VLDB, 2004.
  9. M. A. Shah, J. M. Hellerstein, and E. Brewer. Highly-available, fault-tolerant, parallel dataflows. In Proc. of the 2004 ACM SIGMOD, June 2004. DOI: http://dx.doi.org/10.1145/1007568.1007662
  10. Weonil Chung, "Spatial Operation Allocation Scheme over Common Query Regions for Distributed Spatial Data Stream Processing," KAIS Journal, Vol. 13, No, 6, pp. 2713-2719, 2012. DOI: http://dx.doi.org/10.5762/KAIS.2012.13.6.2713
  11. J.H. Hwang, M. Balazinsk, A. Rasin, U. Cetintem-el, M. Stonebraker, and S. Zdonik. High-availability algorithms for distributed stream processing. In Proc. of the 21st ICDE Conf., Apr. 2005. DOI: http://dx.doi.org/10.1109/ICDE.2005.72
  12. J. Barlett, J. Gray, and B. Horst. Fault tolerance in Tandem computer systems. Technical Report 86.2, Tandem Computers, Mar. 1986.
  13. J. Gray. Why do computers stop and what can be done about it? Technical Report 85.7, Tandem Computers, 1985.
  14. "Tiger/Line Shapefiles.", www.census.gov/geo/www/ tiger/tgrshp2007/tgrshp2007.html, 2007.