簡易檢索 / 詳目顯示

研究生: 古育銘
Yu-Ming Gu
論文名稱: 具有多於二種服務速率之發布/訂閱系統研究
A Study on the Pub/Sub System with More Than Two Service Rates
指導教授: 鍾順平
Shun-Ping Chung
口試委員: 王乃堅
Nai-Jian Wang
林永松
Yeong-Sung Lin
學位類別: 碩士
Master
系所名稱: 電資學院 - 電機工程系
Department of Electrical Engineering
論文出版年: 2021
畢業學年度: 109
語文別: 英文
論文頁數: 150
中文關鍵詞: 物聯網中介器發布/訂閱系統間歇性排隊模型生存期限服務速率到達速率
外文關鍵詞: Internet of Things, broker, pub/sub system, intermittent queueing model, lifetime limit, service rate, arrival rate
相關次數: 點閱:192下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著科技的發展,物聯網更是廣泛利用在生活中。物聯網時常應用在工業、交通、和行動通訊系統像是5G。一方面,傳統的點對點流量增長導致頻寬不足和壅塞。另一方面,長的端到端距離降低了服務品質。因此,如何實現良好的端到端的機器對機器的通訊變成是很重要的課題。人們提出一種稱為發布/訂閱系統 (pub/sub system) 的架構。發布/訂閱系統由發布器、中介器(broker)和訂閱器組成。它可以讓機器對機器(發布器與訂閱器)在空間與時間上進行去耦合。在發布/訂閱系統中,發布器到中介器的距離和中介器到訂閱器的距離是時變的。具有兩種服務狀態,也就是,ON和OFF的間歇性排隊模型被用來對上述情況進行建模。不同的服務狀態有不同的服務速率。在我們的研究中,我們提出擁有三種服務狀態,也就是,ON、Mid和OFF,的間歇性排隊模型來進一步改善通訊服務品質。中介器由一個M/M/1/K佇列和一個間歇性佇列串聯而成。在中間件層的整個發布/訂閱系統由兩個M/M/1/K佇列和兩個間歇性佇列串聯而成。除此之外,為了表示事件的緊急性,發布的事件具有生存期限。當事件在佇列裡過期時,會立即離開系統。再者,當事件進入不同的佇列,它會重新產生生存期限。首先,我們推導所考慮系統的解析模型。接下來,我們使用疊代演算法來找到穩態機率分佈和感興趣的效能指標。其次,我們撰寫了模擬程式來證明解析結果的準確性。第三,我們研究了系統參數,例如到達速率,對感興趣的效能指標的影響。最後,我們比較具有兩個服務狀態的間歇性佇列和具有三個服務狀態的間歇性佇列的感興趣效能指標。


    With the development of science and technology, the Internet of Things is widely used in life. The Internet of Things is often used in industry, transportation, and mobile communication systems such as 5G. On one hand, the traditional point-to-point traffic growth has led to bandwidth shortage and congestion. On the other hand, the long end-to-end distance degrades the quality of service. Therefore, how to achieve good end-to-end machine-to-machine communication has become a very important topic. People proposed an architecture called pub/sub system. The pub/sub system consists of publishers, brokers, and subscribers. It allows machine-to-machine (publisher and subscriber) to decouple in space and time. In a pub/sub system, the distance from publisher to broker and that from broker to subscriber is time-varying. The intermittent queuing model with two service states, i.e., ON and OFF, has been used to model the above situation. A different service state has a different service rate. In our research, we propose an intermittent queuing model with three service states, i.e., ON, Mid, and OFF to further improve the communication quality of service. The broker is composed of an M/M/1/K queue and an intermittent queue in series. The entire pub/sub system in the middleware layer is composed of two M/M/1/K queues and two intermittent queues in series. In addition, to indicate the emergency of the events, the published event has a lifetime limit. When the event expires in the queue, it will immediately leave the system. Furthermore, when the event enters a different queue, it will regenerate the lifetime limit. First, we derive the analytical models for the considered system. Next, an iterative algorithm is used for finding the steady state probability distribution and the interested performance measures. Second, we write simulation programs to verify the accuracy of the analytical results. Third, we study the influence of system parameters, e.g., the arrival rate, on interested performance measures. Finally, we compare the interested performance measures for the intermittent queue with two service states and that with three states.

    Contents 摘要 I Abstract II Contents III List of Figures VI 1. Introduction 1 2. System Model 3 2.1 Broker 3 2.2 Entire pub/sub system 4 3. Analytical Model 5 3.1 M/M/1/K queue with lifetime limits 5 3.1.1 Model description 5 3.1.2 State balance equations 5 3.1.3 Iterative algorithm 6 3.1.4 Performance measures 6 3.2 Intermittent queue with lifetime limits-2rate 8 3.2.1 Model description 8 3.2.2 State balance equations 9 3.2.3 Iterative algorithm 10 3.2.4 Performance measures 11 3.3 Intermittent queue with lifetime limits-3rate 16 3.3.1 Model description 16 3.3.2 State balance equations 17 3.3.3 Iterative algorithm 19 3.3.4 Performance measures 20 3.4 Broker 26 3.4.1 Model description 26 3.4.2 State balance equations 27 3.4.3 Iterative algorithm 28 3.4.4 Performance measures 28 3.5 Entire pub/sub system 28 3.5.1 Model description 29 3.5.2 State balance equations 30 3.5.3 Iterative algorithm 30 3.5.4 Performance measures 31 4. Simulation Model 32 4.1 Broker-2rate 32 4.1.1 Main program 32 4.1.2 Arrival event 33 4.1.3 Departure event from the first server 33 4.1.4 Departure event from the second server 34 4.1.5 Second server is turned on 34 4.1.6 Impatient event 35 4.1.7 Performance measures 35 4.2 Broker-3rate 43 4.2.1 Main program 43 4.2.2 Arrival event 43 4.2.3 Departure event from the first server 44 4.2.4 Departure event from the second server 45 4.2.5 Second server is turned on 45 4.2.6 Impatient event 45 4.2.7 Performance measures 46 4.3 Entire pub/sub system-2rate 54 4.3.1 Main program 54 4.3.2 Arrival event 55 4.3.3 Departure event from the publisher’s server 55 4.3.4 Publisher’s server is turned on 56 4.3.5 Departure event from the first server of the broker 56 4.3.6 Departure event from the second server of the broker 57 4.3.7 Second server of the broker is turned on 58 4.3.8 Departure event from the subscriber’s server 58 4.3.9 Impatient event 58 4.3.10 Performance measures 59 4.4 Entire pub/sub system-3rate 70 4.4.1 Main program 70 4.4.2 Arrival event 71 4.4.3 Departure event from the publisher’s server 71 4.4.4 Publisher’s server is turned on 72 4.4.5 Departure event from the first server of the broker 72 4.4.6 Departure event from the second server of the broker 73 4.4.7 Second server of the broker is turned on 74 4.4.8 Departure event from the subscriber’s server 74 4.4.9 Impatient event 75 4.4.10 Performance measures 75 5. Numerical Results 86 5.1 Intermittent queue with lifetime limits 86 5.1.1 The arrival rate 87 5.1.2 The mean service rate 91 5.1.3 The impatient time 95 5.2 Broker 99 5.2.1 The arrival rate 99 5.2.2 The mean service rate 105 5.2.3 The impatient time 110 5.3 Entire pub/sub system 115 5.3.1 The arrival rate 115 5.3.2 The mean service rate 122 5.3.3 The impatient time 128 6. Conclusions 134 References 136

    References
    [1] A. Zanella, N. Bui, A. Castellani, L. Vangelista, and M. Zorzi, "Internet of things for smart cities," IEEE Internet of Things journal, vol. I, pp. 22-32, 2014.
    [2] L. Chettri and R. Bera, " A Comprehensive Survey on Internet of Things (IoT) Toward 5G Wireless Systems," IEEE Internet of Things journal, vol. 7, pp. 16-32, 2020.
    [3] P. H. Su, c.-s. Shih, J. Y-J. Hsu, K-J. Lin, and Y-C. Wang, "Decentralized fault tolerance mechanism for intelligent iot/m2m middleware," in IEEE WF-IoT, 2014.
    [4] S. Akkermans, R. Bachiller, N. Matthys, W. Joosen, D. Hughes, "Towards Efficient Publish-Subscribe Middleware in the IoT with IPv6 Multicast," in IEEE ICC, 2016, DOI: 10.1109/ICC.2016.7511254.
    [5] Andrew Banks and Rahul Gupta. 2014. MQTT Version 3.1. 1. OASIS standard (2014).
    [6] Pivotal, "RabbitMQ", https://www.rabbitmq.coml. 2018.
    [7] Apache Kafka. 2018. http://kafka.apache.org/.
    [8] P. Bellavista, A. Corradi, and A. Reale. 2014. Quality of Service in Wide Scale Publish-Subscribe Systems. IEEE Communications Surveys & Tutorials (2014).
    [9] R. Gomes, G. Bouloukakis, F. Costa, N. Georgantas, and R. Da Rocha, "Qos-aware resource allocation for mobile iot pub/sub systems," in iCIOT. Springer, Cham, Seattle, USA, 2018.
    [10] G. Bouloukakis, N. Georgantas, A. Kattepur, and V. Issarny, "Timeliness evaluation of intermittent mobile connectivity over pub/sub systems," in ACMISPEC ICPE, L'Aquila, Italy, Apr. 2017.
    [11] G. Bouloukakis, A. Kattepur, N. Georgantas, and V. Issarny, "Queueing network modeling patterns for reliable and unreliable publish/subscribe protocols," in MobiQuitous, New York, USA, 2018.
    [12] G. Bouloukakis, I. Moscholios, and N. Georgantas, "Probabilistic Event Dropping for Intermittently Connected Subscribers Over Pub/Sub Systems," in IEEE ICC, 2019, DOI: 10.1109/ICC.2019.8761557.
    [13] C. E. Shannon, "A mathematical theory of communication," ACM SIGMOBILE mobile computing and communication review, vol. 5, no. 1, pp. 3-55, 2001.
    [14] D. Gross, J.F.Shortle, J. M. Thomposon, and C. M. Harris, "Fundamentals of Queueing Theory".
    [15] H. Takagi, "Waiting Time in THE M/M/m/(m + c) Queue with Impatient Customers," International Journal of Pure and Applied Mathematics, vol. 90, no. 4, pp. 519-559, Feb. 2014.

    無法下載圖示 全文公開日期 2024/08/02 (校內網路)
    全文公開日期 2031/08/02 (校外網路)
    全文公開日期 2031/08/02 (國家圖書館:臺灣博碩士論文系統)
    QR CODE