English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109952/140891 (78%)
Visitors : 46236898      Online Users : 866
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/145940
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/145940


    Title: MQTT 分散式主題切片訊息處理架構
    MQTT Extensions for Distributed Topic Sharding
    Authors: 姚惠馨
    Yao, Hui-Hsin
    Contributors: 廖峻鋒
    Liao, Chun-Feng
    姚惠馨
    Yao, Hui-Hsin
    Keywords: 物聯網
    MQTT
    分散式架構
    切片機制
    Internet of Things
    MQTT
    Distribution architecture
    Sharding
    Date: 2023
    Issue Date: 2023-07-06 17:04:17 (UTC+8)
    Abstract: 近年來,物聯網(Internet of Things,IoT)技術蓬勃發展,其 IoT 裝置已無所不在。這些裝置利用物聯網傳輸協定將資料傳送至服務端進行分析來提供各種服務。其中,MQTT 是最常被使用的物聯網通訊協定之一,它在設計上非常精簡且具備一定程度的彈性,非常適合在資源受限或網路頻寬有限的物聯網環境使用。然而,隨著物聯網裝置數量的快速增長,這些裝置所產出的大量訊息往往使得單一 MQTT 伺服器不堪負荷。因此,如何分散負荷以減輕單一 MQTT 伺服器的壓力,是目前必須面臨的重要課題。分散負荷的第一步通常是使用多個 MQTT 伺服器來分散交通量,但目前 MQTT 缺乏多伺服器的輔助機制,尤其是欠缺對分散式回執機制的支援。針對這個問題,本研究提出一個 MQTT 的分散式主題(Topic)切片訊息處理架構,此架構可協調將 Topic 的交通量以切片(Sharding)方式分散在多個 MQTT 伺服器中,並且提供 Topic Binding 機制,使得分散式 MQTT Broker 機制得以實現。最後,將對提出的解決方案進行實作,並評估其系統在不同使用情境下的可行性和效能表現,以驗證可在不影響原有功能的情況下提供額外功能,改善系統資源的使用情況。
    In recent years, the Internet of Things (IoT) technology has been flourishing, and IoT devices are ubiquitous. These devices utilize IoT communication protocols to transmit data to the server for analysis and provide various services. Among them, MQTT is one of the most commonly used IoT communication protocols. It is designed to be lightweight and flexible, making it ideal for IoT environments with limited resources or network bandwidth. However, with the rapid growth of IoT devices, the large volume of messages generated by these devices often overwhelms a single MQTT server. Therefore, how to distribute the load and alleviate the pressure on a single MQTT server has become an important issue to address.The first step in load distribution is typically to use multiple MQTT servers to distribute the traffic. However, MQTT currently lacks built-in mechanisms for multi-server support, particularly the lack of support for distributed acknowledgment mechanisms. To address this problem, this study proposes a distributed topic sharding message processing architecture for MQTT. This architecture coordinates the distribution of topic traffic among multiple MQTT servers using sharding techniques and provides a topic binding mechanism to enable a distributed MQTT broker mechanism. Finally, the proposed solution will be implemented and evaluated for its feasibility and performance in different usage scenarios to validate its ability to provide additional functionality without affecting the existing features and improve the utilization of system resources.
    Reference: [1] F. Hmissi and S. Ouni, “A review of application protocol enhancements for internet of things,” UBICOMM 2021 : The Fifteenth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, pp. 8–13, October 2021.
    [2] Yassein, M. B., & Shatnawi, M. Q. (2016, September). Application layer protocols for the Internet of Things: A survey. In 2016 International Conference on Engineering & MIS (ICEMIS) (pp. 1-4). IEEE.
    [3] Vinoski, S. (2006). Advanced message queuing protocol. IEEE Internet Computing, 10(6), 87-89.
    [4] Colitti, W., Steenhaut, K., De Caro, N., Buta, B., & Dobrota, V. (2011, October). Evaluation of constrained application protocol for wireless sensor networks. In 2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN) (pp. 1-6). IEEE.
    [5] Pardo-Castellote, G. (2003, May). Omg data-distribution service: Architectural overview. In 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings. (pp. 200-206). IEEE.
    [6] D. Thangavel, X. Ma, A. Valera, H.-X. Tan, and C. K.-Y. Tan, “Performance evaluation of mqtt and coap via a common middleware,” pp. 1–6, 2014.
    [7] Longo, E., Redondi, A. E. C., Cesana, M., & Manzoni, P. (2022). BORDER: A benchmarking framework for distributed MQTT brokers. IEEE Internet of Things Journal, 9(18), 17728-17740.
    [8] Rausch, T., Nastic, S., & Dustdar, S. (2018, April). Emma: Distributed qos-aware mqtt middleware for edge computing applications. In 2018 IEEE International Conference on Cloud Engineering (IC2E) (pp. 191-197). IEEE.
    [9] Bellavista, P., Foschini, L., Ghiselli, N., & Reale, A. (2019, June). MQTT-based middleware for container support in fog computing environments. In 2019 IEEE Symposium on Computers and Communications (ISCC) (pp. 1-7). IEEE.
    [10] Coppen, R. J., Banks, A., Gupta, R., & Cybersecurity, I. (2013). MQTT Version 3.1. 1.
    [11] Tantitharanukul, N., Osathanunkul, K., Hantrakul, K., Pramokchon, P., & Khoenkaw, P. (2017, March). MQTT-topics management system for sharing of open data. In 2017 International Conference on Digital Arts, Media and Technology (ICDAMT) (pp. 62-65). IEEE.
    [12] Hmissi, F., & Ouni, S. (2022, May). TD-MQTT: Transparent Distributed MQTT Brokers for Horizontal IoT Applications. In 2022 IEEE 9th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT) (pp. 479-486). IEEE.
    [13] Longo, E., Redondi, A. E., Cesana, M., Arcia-Moret, A., & Manzoni, P. (2020, June). MQTT-ST: a spanning tree protocol for distributed MQTT brokers. In ICC 2020-2020 IEEE International Conference on Communications (ICC) (pp. 1-6). IEEE.
    [14] Staglianò, L., Longo, E., & Redondi, A. E. (2021, August). D-MQTT: design and implementation of a pub/sub broker for distributed environments. In 2021 IEEE International Conference on Omni-Layer Intelligent Systems (COINS) (pp. 1-6). IEEE.
    [15] Wang, Y., Zheng, Z., & Shi, C. (2022, December). Routing Distribution Model Based on Node Role for MQTT Broker. In 2022 4th International Academic Exchange Conference on Science and Technology Innovation (IAECST) (pp. 736-739). IEEE.
    [16] Scott, D., Gamov, V., & Klein, D. (2022). Kafka in Action. Simon and Schuster.
    [17] Shapira, G., Palino, T., Sivaram, R., & Petty, K. (2021). Kafka: the definitive guide. " O`Reilly Media, Inc.".
    [18] F. P. Junqueira, B. C. Reed, and M. Serafini, “Zab: Highperformance broadcast for primary-backup systems,” in 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN). IEEE, 2011, pp. 245–256.
    [19] D. Ongaro and J. Ousterhout, “In search of an understandable consensus algorithm,” in 2014 {USENIX} Annual Technical Conference ({USENIX}{ATC} 14), 2014, pp. 305–319.
    Description: 碩士
    國立政治大學
    資訊科學系
    110753135
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0110753135
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    313501.pdf3759KbAdobe PDF267View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback