참가자가 밀집된 환경에서의 게재/구독을 위한분산 해쉬 기반의 고속 서비스 탐색 기법 Distributed Hashing-based Fast Discovery Scheme for a Publish/Subscribe System with Densely Distributed Participants
Pub/sub system enables data users to access any necessary data without knowledge of the data producer andsynchronization with the data producer. It is widely used as the middleware technology for the data-centricservices. DDS (Data Distribution Service) is a standard middleware supported by the OMG (Object ManagementGroup), one of global standardization organizations. It is considered quite useful as a standard middleware for USmilitary services. However, it is well-known that it takes considerably long time in searching the Participants andEndpoints in the system, especially when the system is booting up. In this paper, we propose a discovery schemeto reduce the latency when the participants and Endpoints are densely distributed in a small area. We propose tomodify the standard DDS discovery process in three folds. First, we integrate the Endpoint discovery process with the Participant discovery process. Second, we reduce the number of connections per participant during thediscovery process by adopting the concept of successors in Distributed Hashing scheme. Third, instead of UDP,the participants are connected through TCP to exploit the reliable delivery feature of TCP. We evaluated theperformance of our scheme by comparing with the standard DDS discovery process. The evaluation resultsshow that our scheme achieves quite lower discovery latency in case that the Participants and the Endpointsare densely distributed in a local network.
Pub/sub system enables data users to access any necessary data without knowledge of the data producer andsynchronization with the data producer. It is widely used as the middleware technology for the data-centricservices. DDS (Data Distribution Service) is a standard middleware supported by the OMG (Object ManagementGroup), one of global standardization organizations. It is considered quite useful as a standard middleware for USmilitary services. However, it is well-known that it takes considerably long time in searching the Participants andEndpoints in the system, especially when the system is booting up. In this paper, we propose a discovery schemeto reduce the latency when the participants and Endpoints are densely distributed in a small area. We propose tomodify the standard DDS discovery process in three folds. First, we integrate the Endpoint discovery process with the Participant discovery process. Second, we reduce the number of connections per participant during thediscovery process by adopting the concept of successors in Distributed Hashing scheme. Third, instead of UDP,the participants are connected through TCP to exploit the reliable delivery feature of TCP. We evaluated theperformance of our scheme by comparing with the standard DDS discovery process. The evaluation resultsshow that our scheme achieves quite lower discovery latency in case that the Participants and the Endpointsare densely distributed in a local network.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.