1. NCCU Academic Hub
  2. Publications
  3. College of Informatics
  4. Theses
  5. Item

Publications-Theses

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 以資料為中心延遲中斷網路架構下參考興趣的路由機制
Information Centric Disruption Tolerant Network Interest-based Routing
作者 陳羿丞
Chen, Yi-Cheng
貢獻者 蔡子傑
陳羿丞
Chen, Yi-Cheng
關鍵詞 內容中心延遲中斷容忍網路
命名資料網路
激勵機制
路由機制
Information Centric DTN
NDN
Incentive
Routing
日期 2023
上傳時間 1-Sep-2023 15:24:50 (UTC+8)
摘要 隨著軟硬體技術的進步與成熟，智慧服務已經在日常生活中大幅的擴展，發展出巨量資料、邊緣運算等科技應用，而上述這些智慧服務的應用，低延遲即為關鍵的特性之一，而如何更有效率地傳遞訊息，以及節省時間成本，成為一個值得關注的議題。\n基於彈性及快速部署的考量，我們假設網路環境是在連線不穩定、節點容易斷線的情境。因此本篇論文結合內容中心概念並以內容中心延遲中斷容忍網路(ICDTN：Information Centric Disruption Tolerant Network )為基礎，設計出根據節點興趣取向與封包主題內容的路由演算法，並且提出利用延遲中斷容忍網路(DTN)既有的緩衝區實作內容中心的命名資料網路(NDN)的快取功能的方法。\n本研究的應用情境以智慧商圈為背景，基於邊緣運算和分散式運算架構，以驗證本研究提出之路由優化和激勵機制的解決方案。實驗結果顯示，本文提出之路由演算法提高了訊息傳遞效率和節點合作度，並達到了低延遲，這將使得在商圈中能實現更好的服務體驗和資源利用。
With the advancement and maturity of software and hardware technology, smart services have been greatly expanded in daily life, and technological applications such as huge amounts of data and edge computing have been developed. Low latency is one of the key features of the above-mentioned smart service applications. However, how to transmit information more efficiently and save time and cost has become an issue worthy of attention.\n\nConsiderably flexibility and fast deployment, we assume that the network environment is unstable where nodes are prone to disconnection. This thesis combines the concept of the data center, with the Information Centric Disruption Tolerant Network (ICDTN) and proposes a routing algorithm based on node interest orientation and packet subject content. This method also uses DTN`s existing buffer to implement Information Centric Name Data Networking(NDN) cache function.\nThe application scenario of this research is based on the smart business circle, with the edge computing and distributed computing architecture, to verify the routing enhancement and incentive mechanism solutions proposed in this research. It is expected to improve the efficiency of message transmission and node cooperation, which will help in the business circle, better service experience and resource utilization are realized.
參考文獻 [1] Van Jacobson, Diana K Smetters, James D Thornton, Michael F Plass, Nicholas H\nBriggs, and Rebecca L Braynard. Networking named content. In Proceedings of the\n5th international conference on Emerging networking experiments and technologies,\npages 1–12, 2009.\n[2] Aruna Balasubramanian, Brian Levine, and Arun Venkataramani. Dtn routing as\na resource allocation problem. In Proceedings of the 2007 conference on Applications,\ntechnologies, architectures, and protocols for computer communications,\npages 373–384, 2007.\n[3] Evan PC Jones, Lily Li, and Paul AS Ward. Practical routing in delay-tolerant networks.\nIn Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant\nnetworking, pages 237–243, 2005.\n[4] Kevin Fall. A delay-tolerant network architecture for challenged internets. In Proceedings\nof the 2003 conference on Applications, technologies, architectures, and\nprotocols for computer communications, pages 27–34, 2003.\n[5] CC Sobin, Vaskar Raychoudhury, Gustavo Marfia, and Ankita Singla. A survey of\nrouting and data dissemination in delay tolerant networks. Journal of Network and\nComputer Applications, 67:128–146, 2016.\n[6] Gareth Tyson, John Bigham, and Eliane Bodanese. Towards an information-centric\ndelay-tolerant network. In 2013 IEEE Conference on Computer Communications\nWorkshops (INFOCOM WKSHPS), pages 387–392, 2013.\n[7] Waldir Moreira and Paulo Mendes. Survey on opportunistic routing for de-lay/disruption tolerant networks. Dept. Inform. Syst. Technol., Univ. Lusófona, Lisbon,\nPortugal, Tech. Rep. SITI-TR-11-02, 2011.\n[8] Amin Vahdat, David Becker, et al. Epidemic routing for partially connected ad hoc\nnetworks, 2000.\n[9] Anders Lindgren, Avri Doria, and Olov Schelén. Probabilistic routing in intermittently\nconnected networks. ACM SIGMOBILE mobile computing and communications\nreview, 7(3):19–20, 2003.\n[10] John Burgess, Brian Gallagher, David D Jensen, Brian Neil Levine, et al. Maxprop:\nRouting for vehicle-based disruption-tolerant networks. In Infocom, volume 6.\nBarcelona, Spain, 2006.\n[11] Prateek K. Singh, Koushik Kar, and Charles Kamhoua. Reputation routing in manets.\nIn 2017 IEEE 86th Vehicular Technology Conference (VTC-Fall), pages 1–7, 2017.\n[12] You Lu, Mario Gerla, Tuan Le, Vince Rabsatt, and Haik Kalantarian. Community\naware content retrieval in disruption-tolerant networks. In 2014 13th Annual\nMediterranean Ad Hoc Networking Workshop (MED-HOC-NET), pages 172–179.\nIEEE, 2014.\n[13] George Xylomenos, Christopher N Ververidis, Vasilios A Siris, Nikos Fotiou, Christos\nTsilopoulos, Xenofon Vasilakos, Konstantinos V Katsaros, and George C Polyzos.\nA survey of information-centric networking research. IEEE communications\nsurveys & tutorials, 16(2):1024–1049, 2013.\n[14] Ying Zhu, Bin Xu, Xinghua Shi, and Yu Wang. A survey of social-based routing in\ndelay tolerant networks: Positive and negative social effects. IEEE Communications\nSurveys & Tutorials, 15(1):387–401, 2012.\n[15] Himanshu Jethawa and Sanjay Madria. Reputation and credit based incentive mechanism\nfor data-centric message delivery in dtns. In 2018 19th IEEE international\nconference on mobile data management (MDM), pages 207–216. IEEE, 2018.\n[16] LINE Corporation. 搜客經濟. https://linecorp.com/zh-hant/pr/news/zh-hant/\n2021/3969.\n[17] Eric Chiejina, Hannan Xiao, and Bruce Christianson. A dynamic reputation management\nsystem for mobile ad hoc networks. Computers, 4(2):87–112, 2015.\n[18] Teng Liang, Ju Pan, Md Ashiqur Rahman, Junxiao Shi, Davide Pesavento, Alexander\nAfanasyev, and Beichuan Zhang. Enabling named data networking forwarder to\nwork out-of-the-box at edge networks. In 2020 IEEE International Conference on\nCommunications Workshops (ICC Workshops), pages 1–6, 2020.\n[19] Douglas McGeehan, Dan Lin, and Sanjay Madria. Chitchat: An effective message\ndelivery method in sparse pocket-switched networks. In 2016 IEEE 36th International\nConference on Distributed Computing Systems (ICDCS), pages 457–466.\nIEEE, 2016.\n[20] Ari Keränen, Jörg Ott, and Teemu Kärkkäinen. The one simulator for dtn protocol\nevaluation. In Proceedings of the 2nd international conference on simulation tools\nand techniques, pages 1–10, 2009.\n[21] Mordechai Haklay and Patrick Weber. Openstreetmap: User-generated street maps.\nvolume 7, pages 12–18, 2008.
描述 碩士
國立政治大學
資訊科學系
110753138
資料來源 http://thesis.lib.nccu.edu.tw/record/#G0110753138
資料類型 thesis
dc.contributor.advisor 蔡子傑zh_TW
dc.contributor.author (Authors) 陳羿丞zh_TW
dc.contributor.author (Authors) Chen, Yi-Chengen_US
dc.creator (作者) 陳羿丞zh_TW
dc.creator (作者) Chen, Yi-Chengen_US
dc.date (日期) 2023en_US
dc.date.accessioned 1-Sep-2023 15:24:50 (UTC+8)-
dc.date.available 1-Sep-2023 15:24:50 (UTC+8)-
dc.date.issued (上傳時間) 1-Sep-2023 15:24:50 (UTC+8)-
dc.identifier (Other Identifiers) G0110753138en_US
dc.identifier.uri (URI) https://ah.lib.nccu.edu.tw/item?item_id=166508-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 資訊科學系zh_TW
dc.description (描述) 110753138zh_TW
dc.description.abstract (摘要) 隨著軟硬體技術的進步與成熟，智慧服務已經在日常生活中大幅的擴展，發展出巨量資料、邊緣運算等科技應用，而上述這些智慧服務的應用，低延遲即為關鍵的特性之一，而如何更有效率地傳遞訊息，以及節省時間成本，成為一個值得關注的議題。\n基於彈性及快速部署的考量，我們假設網路環境是在連線不穩定、節點容易斷線的情境。因此本篇論文結合內容中心概念並以內容中心延遲中斷容忍網路(ICDTN：Information Centric Disruption Tolerant Network )為基礎，設計出根據節點興趣取向與封包主題內容的路由演算法，並且提出利用延遲中斷容忍網路(DTN)既有的緩衝區實作內容中心的命名資料網路(NDN)的快取功能的方法。\n本研究的應用情境以智慧商圈為背景，基於邊緣運算和分散式運算架構，以驗證本研究提出之路由優化和激勵機制的解決方案。實驗結果顯示，本文提出之路由演算法提高了訊息傳遞效率和節點合作度，並達到了低延遲，這將使得在商圈中能實現更好的服務體驗和資源利用。zh_TW
dc.description.abstract (摘要) With the advancement and maturity of software and hardware technology, smart services have been greatly expanded in daily life, and technological applications such as huge amounts of data and edge computing have been developed. Low latency is one of the key features of the above-mentioned smart service applications. However, how to transmit information more efficiently and save time and cost has become an issue worthy of attention.\n\nConsiderably flexibility and fast deployment, we assume that the network environment is unstable where nodes are prone to disconnection. This thesis combines the concept of the data center, with the Information Centric Disruption Tolerant Network (ICDTN) and proposes a routing algorithm based on node interest orientation and packet subject content. This method also uses DTN`s existing buffer to implement Information Centric Name Data Networking(NDN) cache function.\nThe application scenario of this research is based on the smart business circle, with the edge computing and distributed computing architecture, to verify the routing enhancement and incentive mechanism solutions proposed in this research. It is expected to improve the efficiency of message transmission and node cooperation, which will help in the business circle, better service experience and resource utilization are realized.en_US
dc.description.tableofcontents 第一章緒論 1\n第一節研究背景與動機 1\n第二節研究目的 2\n第二章文獻回顧 4\n第一節命名式資料網路 4\n第二節延遲中斷容忍網路及路由演算法 5\n第三章研究方法 13\n第一節邊緣運算服務 13\n第二節完整資料流程 18\n第三節封包定義 20\n第四節節點資訊維護 23\n第五節路由演算法 27\n第四章研究結果 37\n第一節實驗環境 37\n第二節實驗結果 45\n第五章結論與建議 55\n第一節結論 55\n第二節未來展望 56\n參考文獻 57zh_TW
dc.format.extent 6183318 bytes-
dc.format.mimetype application/pdf-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0110753138en_US
dc.subject (關鍵詞) 內容中心延遲中斷容忍網路zh_TW
dc.subject (關鍵詞) 命名資料網路zh_TW
dc.subject (關鍵詞) 激勵機制zh_TW
dc.subject (關鍵詞) 路由機制zh_TW
dc.subject (關鍵詞) Information Centric DTNen_US
dc.subject (關鍵詞) NDNen_US
dc.subject (關鍵詞) Incentiveen_US
dc.subject (關鍵詞) Routingen_US
dc.title (題名) 以資料為中心延遲中斷網路架構下參考興趣的路由機制zh_TW
dc.title (題名) Information Centric Disruption Tolerant Network Interest-based Routingen_US
dc.type (資料類型) thesisen_US
dc.relation.reference (參考文獻) [1] Van Jacobson, Diana K Smetters, James D Thornton, Michael F Plass, Nicholas H\nBriggs, and Rebecca L Braynard. Networking named content. In Proceedings of the\n5th international conference on Emerging networking experiments and technologies,\npages 1–12, 2009.\n[2] Aruna Balasubramanian, Brian Levine, and Arun Venkataramani. Dtn routing as\na resource allocation problem. In Proceedings of the 2007 conference on Applications,\ntechnologies, architectures, and protocols for computer communications,\npages 373–384, 2007.\n[3] Evan PC Jones, Lily Li, and Paul AS Ward. Practical routing in delay-tolerant networks.\nIn Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant\nnetworking, pages 237–243, 2005.\n[4] Kevin Fall. A delay-tolerant network architecture for challenged internets. In Proceedings\nof the 2003 conference on Applications, technologies, architectures, and\nprotocols for computer communications, pages 27–34, 2003.\n[5] CC Sobin, Vaskar Raychoudhury, Gustavo Marfia, and Ankita Singla. A survey of\nrouting and data dissemination in delay tolerant networks. Journal of Network and\nComputer Applications, 67:128–146, 2016.\n[6] Gareth Tyson, John Bigham, and Eliane Bodanese. Towards an information-centric\ndelay-tolerant network. In 2013 IEEE Conference on Computer Communications\nWorkshops (INFOCOM WKSHPS), pages 387–392, 2013.\n[7] Waldir Moreira and Paulo Mendes. Survey on opportunistic routing for de-lay/disruption tolerant networks. Dept. Inform. Syst. Technol., Univ. Lusófona, Lisbon,\nPortugal, Tech. Rep. SITI-TR-11-02, 2011.\n[8] Amin Vahdat, David Becker, et al. Epidemic routing for partially connected ad hoc\nnetworks, 2000.\n[9] Anders Lindgren, Avri Doria, and Olov Schelén. Probabilistic routing in intermittently\nconnected networks. ACM SIGMOBILE mobile computing and communications\nreview, 7(3):19–20, 2003.\n[10] John Burgess, Brian Gallagher, David D Jensen, Brian Neil Levine, et al. Maxprop:\nRouting for vehicle-based disruption-tolerant networks. In Infocom, volume 6.\nBarcelona, Spain, 2006.\n[11] Prateek K. Singh, Koushik Kar, and Charles Kamhoua. Reputation routing in manets.\nIn 2017 IEEE 86th Vehicular Technology Conference (VTC-Fall), pages 1–7, 2017.\n[12] You Lu, Mario Gerla, Tuan Le, Vince Rabsatt, and Haik Kalantarian. Community\naware content retrieval in disruption-tolerant networks. In 2014 13th Annual\nMediterranean Ad Hoc Networking Workshop (MED-HOC-NET), pages 172–179.\nIEEE, 2014.\n[13] George Xylomenos, Christopher N Ververidis, Vasilios A Siris, Nikos Fotiou, Christos\nTsilopoulos, Xenofon Vasilakos, Konstantinos V Katsaros, and George C Polyzos.\nA survey of information-centric networking research. IEEE communications\nsurveys & tutorials, 16(2):1024–1049, 2013.\n[14] Ying Zhu, Bin Xu, Xinghua Shi, and Yu Wang. A survey of social-based routing in\ndelay tolerant networks: Positive and negative social effects. IEEE Communications\nSurveys & Tutorials, 15(1):387–401, 2012.\n[15] Himanshu Jethawa and Sanjay Madria. Reputation and credit based incentive mechanism\nfor data-centric message delivery in dtns. In 2018 19th IEEE international\nconference on mobile data management (MDM), pages 207–216. IEEE, 2018.\n[16] LINE Corporation. 搜客經濟. https://linecorp.com/zh-hant/pr/news/zh-hant/\n2021/3969.\n[17] Eric Chiejina, Hannan Xiao, and Bruce Christianson. A dynamic reputation management\nsystem for mobile ad hoc networks. Computers, 4(2):87–112, 2015.\n[18] Teng Liang, Ju Pan, Md Ashiqur Rahman, Junxiao Shi, Davide Pesavento, Alexander\nAfanasyev, and Beichuan Zhang. Enabling named data networking forwarder to\nwork out-of-the-box at edge networks. In 2020 IEEE International Conference on\nCommunications Workshops (ICC Workshops), pages 1–6, 2020.\n[19] Douglas McGeehan, Dan Lin, and Sanjay Madria. Chitchat: An effective message\ndelivery method in sparse pocket-switched networks. In 2016 IEEE 36th International\nConference on Distributed Computing Systems (ICDCS), pages 457–466.\nIEEE, 2016.\n[20] Ari Keränen, Jörg Ott, and Teemu Kärkkäinen. The one simulator for dtn protocol\nevaluation. In Proceedings of the 2nd international conference on simulation tools\nand techniques, pages 1–10, 2009.\n[21] Mordechai Haklay and Patrick Weber. Openstreetmap: User-generated street maps.\nvolume 7, pages 12–18, 2008.zh_TW