JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Distributed Hashing-based Fast Discovery Scheme for a Publish/Subscribe System with Densely Distributed Participants
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Distributed Hashing-based Fast Discovery Scheme for a Publish/Subscribe System with Densely Distributed Participants
Ahn, Si-Nae; Kang, Kyungran; Cho, Young-Jong; Kim, Nowon;
  PDF(new window)
 Abstract
Pub/sub system enables data users to access any necessary data without knowledge of the data producer and synchronization with the data producer. It is widely used as the middleware technology for the data-centric services. DDS (Data Distribution Service) is a standard middleware supported by the OMG (Object Management Group), one of global standardization organizations. It is considered quite useful as a standard middleware for US military services. However, it is well-known that it takes considerably long time in searching the Participants and Endpoints in the system, especially when the system is booting up. In this paper, we propose a discovery scheme to reduce the latency when the participants and Endpoints are densely distributed in a small area. We propose to modify 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 the discovery 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 the performance of our scheme by comparing with the standard DDS discovery process. The evaluation results show that our scheme achieves quite lower discovery latency in case that the Participants and the Endpoints are densely distributed in a local network.
 Keywords
publish/subscribe system;middleware;distributed hash;DDS;peer discovery;
 Language
Korean
 Cited by
 References
1.
Object Management Group, Data Distribution Service for real-time systems specification, Ver. 1.2, 2007.

2.
RTI, RTI DDS, retrieved Mar, 1, 2011, from http://www.rti.com.

3.
Object Management Group, The real-time publish-subscribe wire protocol DDS interoperability wire protocol specification, Ver. 2.1, 2009.

4.
S. Chae, S. Ahn, K. Kang, J. Kim, S. Lee, and W. Kim, "Fast discovery scheme using DHT-like overlay network for a large-scale DDS," Commun. Comput. Inform. Sci., vol. 256, pp. 128-137, Dec. 2011. crossref(new window)

5.
S. Ahn, N. Kim, K. Kang, and Y. Cho, "Fast discovery scheme using overlay network for DDS device," in Proc. Korea Inform. Commun. Soc. (KICS) Conf., pp. 329-330, Seoul, Korea, Nov. 2012.

6.
S. El-Ansary, L. Alima, P. Brand, and S. Haridi, "Efficient broadcast in structured P2P networks," in Proc. Int. Workshop Peer-To-Peer Syst. (IPTPS), pp. 304-314, Berkeley, U.S.A., Feb. 2003.

7.
J. S. Monedero, "A DDS discovery protocol based on Bloom filters," M.S. Thesis, Dept. Inform. Sci. Telecommun. Eng., Universidad de Granada, Sep. 2009.

8.
M. Christensen, K. Kimball, and F. Solensky, Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches, IETF RFC 4541, May 2006.

9.
I. Stoica, R. Morris, D.R. Karger, M.F. Kaashoek, and H. Balakrishinan, "Chord: a scalable peer-to-peer lookup service for internet applications," in Proc. ACM SIGCOMM, pp. 149-160, San Diego, U.S.A., Aug. 2001.

10.
Scalable Network Technologies, The Simulator: QualNet, retrieved Mar., 1, 2011, from http://www.qualnet.com.