簡易檢索 / 詳目顯示

研究生: 簡伯勳
Po-hsun Chien
論文名稱: 在延遲容忍網路中利用發佈訂閱協定達成有時效性的資料散播研究
A Study of Time-Constrained Publish-Subscribe Protocol for Data Dissemination in Delay-Tolerant Networks
指導教授: 邱舉明
Ge-ming Chiu
口試委員: 吳秀陽
Shiow-yang Wu
陳秋華
Chyau-Hwa Chen
金台齡
Tai-lin Chin
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2010
畢業學年度: 99
語文別: 英文
論文頁數: 45
中文關鍵詞: 延遲容忍網路發佈訂閱系統資料散播時效性路由
外文關鍵詞: DTN, Delay tolerant network, publish-subscribe, time-constrained
相關次數: 點閱:248下載:3
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在延遲容忍網路之中,資料散播是一個重要的應用,不論是廣告與新聞的發佈或是在戰場上的軍事用途溝通皆是屬於這個範疇。資料散播是一種資料導向的傳輸方式,資料導向的傳輸通常都是利用發佈訂閱系統來達成的,在發佈訂閱系統中,每個發佈出來的資料都會傳輸到有興趣的訂閱者身上。
    在這篇論文之中,我們將研究如何利用發佈訂閱系統在一個資料有時效性的延遲容忍網路中做資料散播。我們認為縱使延遲容忍網路字面上是可容忍傳輸的延遲,但多數的應用中其延遲必定有一個可容忍的上限,並非無限長的。故此篇論文的目標即是將有時效性的資料在其到期前盡可能的散播出去。其困難處在於行動節點有諸多的限制,像是有限的容量、有限的頻寬以及有限的電力。如何在種種的限制下挑選恰當的資料做交換傳輸是本論文的重點。
    本論文提出了一個基於製作複本的延遲容忍網路路由協定來實作發佈訂閱系統。在這系統之中,各個發行物的複本數量會依據其目前之重要性來做動態的增減,而發行物的重要性則是依據評分機制來計算的。本論文提出了四種不同的評分方式,每一種評分有其不同的考量,像是時間急迫性、資料熱門度、以及公平性。最後,我們透過模擬的結果來評估選擇這四種評分方式對於資料有時效性的發佈訂閱系統在延遲容忍網路之中會產生什麼樣的影響。


    Data dissemination is an important application in DTNs. There are a large demand for data dissemination applications, such as advertisement and news publishing in urban areas or military communication in battle fields. Data-driven communication often rely on publish-subscribe paradigm which can deliver specific data to interested subscribers.
    In this thesis, we study the problem of data dissemination with time-constrained through a publish-subscribe protocol in a DTN. Few researches have addressed the issue of time-constrained data dissemination in a DTN. Although a DTN is delay tolerant by definition, we consider the case in which there is an upper bound on allowable delivery latency for a publication. Our goal is to deliver as much as possible publications before they expired. However, there are few limitations for mobile nodes in a DTN, such as limited storage, limited bandwidth, and limited battery. The problem is how we choose an appropriate set of publication for exchange.
    We proposed a replication–based DTN protocol for publish-subscribe which can dynamically increase or decrease the number of replica of a publication in system based on its importance. The importance is determined by the utility function. We proposed four different utility functions to rank the publications. Each utility functions is designed with different consideration in mind, such as time urgency, popularity, and fairness. We evaluate the effect of choosing different utility functions on the performance of a time-constrained publish-subscribe system in a DTN.

    Abstract I 摘要 II Acknowledgments III Table of Contents IV List of Figures V 1.Introduction 1 1.1 Background 1 1.2 Thesis Objectives 4 1.3 Organization of Thesis 6 2.Related Work 7 3.Protocol 10 3.1 Network Model and Assumptions 10 3.2 Protocol Overview 11 3.3 Estimating Current System Status 12 3.3.1 Estimating Subscribed Ratio in System 12 3.3.2 Estimating Satisfied Ratio and Replica Ratio of Publications 14 3.3.3 Aging Aggregation for Estimated Information 16 3.4 Utility Computation 18 4.Performance Evaluation 22 4.1 Simulation Setup 22 4.2 Performance Metrics 23 4.3 Simulation Results 24 5.Conclusion and Future Work 35

    [1] Balasubramanian, B. Levine, and A. Venkataramani, "DTN Routing as A Resource Allocation Problem," SIGCOMM Computer Communication Review, vol. 37, pp. 373-384, 2007.
    [2] Balasubramanian, B. N. Levine, and A. Venkataramani, "Replication Routing in DTNs: A Resource Allocation Approach," IEEE/ACM Transactions on Networking, vol. 18, pp. 596-609, 2010.
    [3] E. Bulut, W. Zijian, and B. K. Szymanski, "Time Dependent Message Spraying for Routing in Intermittently Connected Networks," in Proceedings of IEEE Global Telecommunications Conference. GLOBECOM 2008, New Orleans, LA, USA, 2008, pp. 1-6.
    [4] Burcea, H. A. Jacobsen, E. de Lara, V. Muthusamy, and M. Petrovic, "Disconnected Operation in Publish/Subscribe Middleware," in Proceedings of IEEE International Conference on Mobile Data Management. MDM 2004, Berkeley, California, USA, 2004, pp. 39-50.
    [5] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks," in Proceedings of 25th IEEE International Conference on Computer Communications. INFOCOM 2006, Barcelona, Spain, 2006, pp. 1-11.
    [6] P. Costa, C. Mascolo, M. Musolesi, and G. P. Picco, "Socially-Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks," IEEE Journal on Selected Areas in Communications, vol. 26, no. 5, pp. 748-760, 2008.
    [7] G. Cugola and H.-A. Jacobsen, "Using Publish/Subscribe Middleware for Mobile Systems," SIGMOBILE Mobile Computing and Communication Review, vol. 6, pp. 25-33, 2002.
    [8] E. M. Daly and M. Haahr, "Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs," in Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc'07, Montreal, Quebec, Canada, 2007, pp. 32-40.
    [9] E. M. Daly and M. Haahr, "Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs," IEEE Transactions on Mobile Computing, vol. 8, pp. 606-621, 2009.
    [10] Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of A Fair Queueing Algorithm," in Proceedings of Symposium of Communications Architectures & Protocols, Austin, TX, USA, 1989, pp. 1-12.
    [11] K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany, 2003, pp. 27-34.
    [12] L. Fiege, F. C. Gartner, O. Kasten, and A. Zeidler, "Supporting Mobility in Content-Based Publish/Subscribe Middleware," in Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware, Rio de Janeiro, Brazil, 2003, pp. 103-122.
    [13] W. Guizhu, W. Bingting, and G. Yongzhi, "Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network," in Proceedings of International Conference on Communications and Mobile Computing, Shenzhen, China, 2010, pp. 452-456.
    [14] Y. Huang and H. Garcia-Molina, "Publish/Subscribe in a Mobile Environment," Wireless Networks, vol. 10, pp. 643-652, 2004.
    [15] S. Jain, K. Fall, and R. Patra, "Routing in a Delay Tolerant Network," in Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Portland, Oregon, USA, 2004, pp. 145-158.
    [16] X. Jingfeng, F. Xiumei, C. Yuanda, F. Ji, and L. Jiansheng, "Spray and Wait Routing Based on Average Delivery Probability in Delay Tolerant Network," in Proceedings of International Conference on Networks Security, Wireless Communications and Trusted Computing. NSWCTC '09, Wuhan, China, 2009, pp. 500-502.
    [17] D. B. Johnson, "Routing in Ad Hoc Networks of Mobile Hosts," in Proceedings of Workshop on Mobile Computing Systems and Applications, Santa Cruz, CA, 1994, pp. 158-163.
    [18] A. Krifa, C. Baraka, and T. Spyropoulos, "Optimal Buffer Management Policies for Delay Tolerant Networks," in Proceedings of 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008. SECON '08, California, USA, 2008, pp. 260-268.
    [19] Lindgren, A. Doria, and O. Schelen, "Probabilistic Routing in Intermittently Connected Networks," Service Assurance with Partial and Intermittent Resources, pp. 239-254, 2004.
    [20] M. Musolesi and C. Mascolo, "CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks," IEEE Transactions on Mobile Computing, vol. 8, pp. 246-260, 2009.
    [21] E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in Proceedings of Second IEEE Workshop on Mobile Computing Systems and Applications, 1999. WMCSA '99, New Orleans, Louisiana, 1999, pp. 90-100.
    [22] Podnar and I. Lovrek, "Supporting mobility with persistent notifications in publish/subscribe systems," in Proceedings of the 3rd Int. Workshop on Distributed Event-Based Systems (DEBS), Nashville, TN, USA, 2004, p. 80.
    [23] G. Sollazzo, M. Musolesi, and C. Mascolo, "TACO-DTN: A Time-aware Content-based Dissemination System for Delay Tolerant Networks," in Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking, San Juan, Puerto Rico, 2007, pp. 83-90.
    [24] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks," in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, Philadelphia, Pennsylvania, USA, 2005, pp. 252-259.
    [25] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case," IEEE/ACM Transactions on Networking, vol. 16, pp. 77-90, 2008.
    [26] Vahdat and D. Becker, "Epidemic Routing for Partially-Connected Ad Hoc Networks," Technical Report CS-200006, Duke University, Apr., 2000.
    [27] Wolfson, B. Xu, and R. M. Tanner, "Mobile Peer-to-Peer Data Dissemination with Resource Constraints," in Proceedings of the 8th International Conference on Mobile Data Management. MDM 2007, Mannheim, Germany, 2007, pp. 16-23.
    [28] E. Yoneki, P. Hui, S. Chan, and J. Crowcroft, "A Socio-Aware Overlay for Publish/Subscribe Communication in Delay Tolerant Networks," in Proceedings of the 10th ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. MSWiM '07, Chania, Crete Island, Greece, 2007, pp. 225-234.
    [29] Q. Yuan and J. Wu, "Drip: A Dynamic Voronoi Regions-Based Publish/Subscribe Protocol in Mobile Networks," in Proceedings of 27th Conference on Computer Communications. INFOCOM 2008, Phoenix, AZ, USA, 2008, pp. 2110-2118.

    QR CODE