A multicast algorithm in overlapped process group environments

중첩된 프로세스 그룹 환경에서의 멀티캐스트 알고리즘

  • 권봉경 (광운대학교 전자통신공학과 신기술연구소) ;
  • 정광수 (광운대학교 전자통신공학과 신기술연구소) ;
  • 현동환 (한국전자통신연구소 멀티미디어표준연구실) ;
  • 함진호 (한국전자통신연구소 멀티미디어표준연구실)
  • Published : 1996.04.01

Abstract

In this paper, we proposed a new multicast algorithm which is efficiently applicable to overlapped process group environments where one process may be involved in several process groups. Unlike the esisting algorithms, the proposed one provides an efficient group communication mechanism by generating the processgroup information in two-level tree. Using this algorithm, we improved the shortcoming of the existing algorithms by reducing the overhead in passing through unnecessary processes for message ordering. We have provided the causal ordering method as well as the total ordering method in group communication environments. As a result, we allow one process to deliver message to other processes with a short delay time, and reduced the overhead required for the message ordering. Also, we logically proved the proposed causal ordering method, and compared the performance of the proposed algorithm with ones of other existing algorithms by computer simulation.

Keywords