Name
Abstract | ||
|---|---|---|
Data distribution service (DDS) is a middleware for data distribution and supports large-scale applications such as Internet service and military systems. However, the reliability and quality of service feature of DDS standard requires an entity to have the complete picture of the participants and endpoints in the network. Thus, the discovery process of the DDS is not scalable and causes noticeable long delay as the number of entities in the network increases. In this paper, we present a scalable fast discovery scheme by exploiting the DHT-like overlay network. Our scheme integrates the participant and endpoint discovery processes and significantly reduces the number of messages for the discovery process. Simulation results indicate that our scheme is faster and requires quite less overhead compared with the simple discovery protocol (SDP) of the DDS standard. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-26010-0_15 | Communications in Computer and Information Science |
Keywords | Field | DocType |
DDS,DHT-like overlay network,fast discovery | Middleware,Data Distribution Service,Computer science,Computer network,Military systems,Quality of service,Internet service,Business process discovery,Overlay network,Scalability | Conference |
Volume | ISSN | Citations |
256 | 1865-0929 | 3 |
PageRank | References | Authors |
0.47 | 2 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sung Yoon Chae | 1 | 14 | 1.40 |
| Sinae Ahn | 2 | 3 | 0.47 |
| Kyungran Kang | 3 | 37 | 7.82 |
| Jaehyuk Kim | 4 | 5 | 0.89 |
| Soo-hyung Lee | 5 | 13 | 2.52 |
| Won-Tae Kim | 6 | 141 | 19.32 |