Citation Export
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Minsub | - |
dc.contributor.author | Bae, Minho | - |
dc.contributor.author | Yeo, Sangho | - |
dc.contributor.author | Park, Gyudong | - |
dc.contributor.author | Oh, Sangyoon | - |
dc.date.issued | 2018-01-01 | - |
dc.identifier.uri | https://aurora.ajou.ac.kr/handle/2018.oak/36244 | - |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85049952105&origin=inward | - |
dc.description.abstract | A message broker is an essential component of messaging services that connect information providers and consumers, message service clients, to enable the integrated message network. To support large scale message clients with the contracted service level, multiple brokers have to collaborate and form a federated broker cluster in many cases. For example, Kafka is one of the most popular messaging systems that allows multiple brokers co-working together. ZooKeeper, the distributed cluster coordinator, manages cluster nodes and stores metadata of messages for Kafka. Even though ZooKeeper does the coordination job well in a simple way, its half-centralized coordinating methods make the overall system less capable in survivability. In some domains such as military warfare and embedded sensor networks, we may lose the primary coordinator or lose more than a half of the coordinator machines. In these cases, we cannot support the minimum survivability to maintain the message network. To address this limited survivability problem, we propose a decentralized message broker federation architecture with distributed hash table. In our proposed architecture design, the decentralized coordinator supports the DHT exchanges between brokers to manage metadata of distributed message partitions. We built a prototype of a message broker federation based on our proposed decentralized metadata coordinator design to show the feasibility in terms of practical application. | - |
dc.description.sponsorship | Acknowledgement. This research is supported by C2 integrating and interfacing technologies laboratory of Agency for Defense Development (UD180010ED). | - |
dc.language.iso | eng | - |
dc.publisher | Springer Verlag | - |
dc.subject.mesh | Coordination scheme | - |
dc.subject.mesh | Distributed clusters | - |
dc.subject.mesh | Distributed Hash Table | - |
dc.subject.mesh | Information provider | - |
dc.subject.mesh | Message brokers | - |
dc.subject.mesh | Messaging services | - |
dc.subject.mesh | Messaging system | - |
dc.subject.mesh | Proposed architectures | - |
dc.title | Decentralized message broker federation architecture with multiple DHT rings for high survivability | - |
dc.type | Conference | - |
dc.citation.conferenceDate | 2018.7.2. ~ 2018.7.5. | - |
dc.citation.conferenceName | 18th International Conference on Computational Science and Its Applications, ICCSA 2018 | - |
dc.citation.edition | Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings | - |
dc.citation.endPage | 226 | - |
dc.citation.startPage | 218 | - |
dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.volume | 10964 LNCS | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.10964 LNCS, pp.218-226 | - |
dc.identifier.doi | 10.1007/978-3-319-95174-4_18 | - |
dc.identifier.scopusid | 2-s2.0-85049952105 | - |
dc.identifier.url | https://www.springer.com/series/558 | - |
dc.subject.keyword | Coordination scheme | - |
dc.subject.keyword | Distributed hash table | - |
dc.subject.keyword | Message broker federation | - |
dc.type.other | Conference Paper | - |
dc.description.isoa | false | - |
dc.subject.subarea | Theoretical Computer Science | - |
dc.subject.subarea | Computer Science (all) | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.