學術產出-Theses
Article View/Open
Publication Export
-
題名 基於命名資料網路在延遲容忍網路之任播機制設計
Design of Anycast Mechanism for NDN in DTN作者 蘇俊憲
Su, Chun-Hsien貢獻者 蔡子傑
Tsai, Tzu-Chieh
蘇俊憲
Su, Chun-Hsien關鍵詞 任播路由
命名資料網路
延遲容忍網路
可達性
邊緣運算
無線隨意網路
Anycast
NDN
DTN
Possibility
Edge Computing
Mobile ad hoc network日期 2023 上傳時間 1-Sep-2023 15:25:35 (UTC+8) 摘要 從人文創新的角度，建立分散式的資料蒐集和邊緣運算平台可以更好地滿足使用者的需求，提供個性化和有效的智慧應用服務。本研究專注於設計一個適用於無線隨意網路的任播路由機制。此機制旨在滿足資料生產者或使用者能夠以更低的請求成本與更高的成功率，透過智慧移動裝置將產出的內容或推薦請求，透過無線網路將資料上傳至距離最近最好的邊緣伺服器或進行所需的推薦運算，並將結果回傳給使用者。本研究採取命名資料網路(Named Data Networking，NDN)，使用以內容為中心的路由演算法，考慮到節點稀疏可能會造成連線斷線，導入了延遲容忍網路(Delay-tolerant networking, DTN)的概念去儲存-攜帶-轉發封包，並針對 NDN 實作 DTN 的困難處提出解決方法，此外為了降低原有泛洪極度耗費成本的做法，本研究提出了一個利用可達性(Possibility)的路由演算法來幫助減少 Overhead 與達成任播的目的。最後實驗使用商圈中的地下街作為研究情境，將方法配合情境使用在任播機制上。實驗數據表明，本研究提出的方法與其他方法相比，不論在邊緣伺服器的數量或是人群的數量增減下，本研究提出的方法都能夠有效控制開銷，並且效率能夠幾乎比肩 Flooding 與 Epidemic Routing。
From a perspective of humanistic innovation, establishing a decentralized data collection and edge computing platform can better meet to user`s needs and provide personalized smart application services.As for data collection, this research focuses on designing an anycast routing mechanism applicable to wireless ad hoc networks. The mechanism aims to satisfy the requirement of data producers or users to achieve lower request costs and higher success rates. It enables the upload of content or recommendation requests generated by smart mobile devices via wireless networks to the nearest and optimal edge server that facilitates the required recommendation calculations. And sends the results back to the users.We adopt Named Data Networking (NDN) with content-centric routing algorithms. Considering the disconnections of nodes due to sparsity, we incorporate the concept of Delay-Tolerant Networking (DTN) for storing-carrying-forwarding packets. We propose solutions to address the challenges of implementing DTN within NDN. Additionally, to reduce the excessive overhead associated with flooding, we introduce a routing algorithm based on "possibility" to help minimize overhead and achieve the objectives of anycast.In our experiments, we utilize an underground mall in a commercial district as the research scenario and apply our methods to the anycast mechanism within this context. The results demonstrate that the proposed approach effectively controls costs and achieves efficiency comparable to Flooding and Epidemic Routing, regardless of variations in the number of edge servers or the size of the population.參考文獻 [1] M. Chowdhury, J. A. Khan, and L. Wang, “Leveraging content connectivity and location awareness for adaptive forwarding in ndn-based mobile ad hoc networks,” in Proceedings of the 7th ACM Conference on Information-Centric Networking, ser. ICN ’20. New York, NY, USA: Association for Computing Machinery, 2020, p.59–69. [Online]. Available:https://doi.org/10.1145/3405656.3418713[2] “5g at the edge,” 2019, https://www.5gamericas.org/5g-at-the-edge/.[3] “ndnsim.net,” https://ndnsim.net/current/index.html.[4] L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, k. claffy, P. Crowley,C. Papadopoulos, L. Wang, and B. Zhang, “Named data networking,” SIGCOMM Comput. Commun. Rev., vol. 44, no. 3, p. 66–73, jul 2014. [Online]. Available:https://doi.org/10.1145/2656877.2656887[5] V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L.Braynard, “Networking named content,” in Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, ser. CoNEXT’09. New York, NY, USA: Association for Computing Machinery, 2009, p. 1–12.[Online]. Available: https://doi.org/10.1145/1658939.1658941[6] “Nsf future internet architecture project 2010,” 2010, http://www.nets-fia.net/.[7] Y. Liu, A. Dowling, and L. Huie, “Benchmarking network performance in named data networking (ndn),” in 2020 29th Wireless and Optical Communications Conference (WOCC), 2020, pp. 1–6.[8] J. A. Khan and Y. Ghamri-Doudane, “Strive: Socially-aware three-tier routing in information-centric vehicular environment,” in 2016 IEEE Global Communications Conference (GLOBECOM), 2016, pp. 1–7.[9] Y.-T. Yu, R. B. Dilmaghani, S. Calo, M. Y. Sanadidi, and M. Gerla, “Interest propagation in named data manets,” in 2013 International Conference on Computing,Networking and Communications (ICNC), 2013, pp. 1118–1122.[10] G. Grassi, D. Pesavento, G. Pau, R. Vuyyuru, R. Wakikawa, and L. Zhang, “Vanet via named data networking,” in 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2014, pp. 410–415.[11] G. Grassi, D. Pesavento, G. Pau, L. Zhang, and S. Fdida, “Navigo: Interest forwarding by geolocations in vehicular named data networking,” in 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks(WoWMoM), 2015, pp. 1–10.[12] M. Kuai, X. Hong, and Q. Yu, “Density-aware delay-tolerant interest forwarding in vehicular named data networking,” in 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall), 2016, pp. 1–5.[13] T. Yu, Z. Zhiyi, E. Newberry, A. Afanasyev, G. Pau, L. Wang, and L. Zhang, “Names to rule them all: Unifying mobile networking via named secured data,” Technical Report NDN-0072. NDN. http://named-data. net/techreports. html …, Tech. Rep.,2022.[14] T.-C. Tsai and W.-T. Teng, “A large scale cooperative localization method,” in 2012 1st IEEE International Conference on Communications in China (ICCC), 2012, pp.722–727.[15] J. Shi and B. Zhang, “Ndnlp: A link protocol for ndn,” NDN, NDN Technical Report NDN-0006, 2012.[16] S. Mastorakis, A. Afanasyev, and L. Zhang, “On the evolution of ndnsim: An open-source simulator for ndn experimentation,” SIGCOMM Comput. Commun.Rev., vol. 47, no. 3, p. 19–33, sep 2017. [Online]. Available: https://doi.org/10.1145/3138808.3138812[17] F. Angius, M. Gerla, and G. Pau, “Bloogo: Bloom filter based gossip algorithm for wireless ndn,” in Proceedings of the 1st ACM Workshop on Emerging NameOriented Mobile Networking Design - Architecture, Algorithms, and Applications, ser. NoM ’12. New York, NY, USA: Association for Computing Machinery, 2012, p. 25–30. [Online]. Available: https://doi.org/10.1145/2248361.2248369 描述 碩士
國立政治大學
資訊科學系
110753158資料來源 http://thesis.lib.nccu.edu.tw/record/#G0110753158 資料類型 thesis dc.contributor.advisor 蔡子傑 zh_TW dc.contributor.advisor Tsai, Tzu-Chieh en_US dc.contributor.author (Authors) 蘇俊憲 zh_TW dc.contributor.author (Authors) Su, Chun-Hsien en_US dc.creator (作者) 蘇俊憲 zh_TW dc.creator (作者) Su, Chun-Hsien en_US dc.date (日期) 2023 en_US dc.date.accessioned 1-Sep-2023 15:25:35 (UTC+8) - dc.date.available 1-Sep-2023 15:25:35 (UTC+8) - dc.date.issued (上傳時間) 1-Sep-2023 15:25:35 (UTC+8) - dc.identifier (Other Identifiers) G0110753158 en_US dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/147037 - dc.description (描述) 碩士 zh_TW dc.description (描述) 國立政治大學 zh_TW dc.description (描述) 資訊科學系 zh_TW dc.description (描述) 110753158 zh_TW dc.description.abstract (摘要) 從人文創新的角度，建立分散式的資料蒐集和邊緣運算平台可以更好地滿足使用者的需求，提供個性化和有效的智慧應用服務。本研究專注於設計一個適用於無線隨意網路的任播路由機制。此機制旨在滿足資料生產者或使用者能夠以更低的請求成本與更高的成功率，透過智慧移動裝置將產出的內容或推薦請求，透過無線網路將資料上傳至距離最近最好的邊緣伺服器或進行所需的推薦運算，並將結果回傳給使用者。本研究採取命名資料網路(Named Data Networking，NDN)，使用以內容為中心的路由演算法，考慮到節點稀疏可能會造成連線斷線，導入了延遲容忍網路(Delay-tolerant networking, DTN)的概念去儲存-攜帶-轉發封包，並針對 NDN 實作 DTN 的困難處提出解決方法，此外為了降低原有泛洪極度耗費成本的做法，本研究提出了一個利用可達性(Possibility)的路由演算法來幫助減少 Overhead 與達成任播的目的。最後實驗使用商圈中的地下街作為研究情境，將方法配合情境使用在任播機制上。實驗數據表明，本研究提出的方法與其他方法相比，不論在邊緣伺服器的數量或是人群的數量增減下，本研究提出的方法都能夠有效控制開銷，並且效率能夠幾乎比肩 Flooding 與 Epidemic Routing。 zh_TW dc.description.abstract (摘要) From a perspective of humanistic innovation, establishing a decentralized data collection and edge computing platform can better meet to user`s needs and provide personalized smart application services.As for data collection, this research focuses on designing an anycast routing mechanism applicable to wireless ad hoc networks. The mechanism aims to satisfy the requirement of data producers or users to achieve lower request costs and higher success rates. It enables the upload of content or recommendation requests generated by smart mobile devices via wireless networks to the nearest and optimal edge server that facilitates the required recommendation calculations. And sends the results back to the users.We adopt Named Data Networking (NDN) with content-centric routing algorithms. Considering the disconnections of nodes due to sparsity, we incorporate the concept of Delay-Tolerant Networking (DTN) for storing-carrying-forwarding packets. We propose solutions to address the challenges of implementing DTN within NDN. Additionally, to reduce the excessive overhead associated with flooding, we introduce a routing algorithm based on "possibility" to help minimize overhead and achieve the objectives of anycast.In our experiments, we utilize an underground mall in a commercial district as the research scenario and apply our methods to the anycast mechanism within this context. The results demonstrate that the proposed approach effectively controls costs and achieves efficiency comparable to Flooding and Epidemic Routing, regardless of variations in the number of edge servers or the size of the population. en_US dc.description.tableofcontents 第一章 緒論 1第一節 研究背景與動機 1第二節 研究目的 4第二章 相關研究探討 5第一節 命名資料網路 5第二節 延遲容忍網路 12第三節 相關文獻探討 13第三章 問題定義與研究方法 15第一節 基於邊緣運算架構的 ICN 分散式資料管理與服務 15第二節 研究挑戰 20第三節 路由演算法背景與問題定義 23第四節 路由設計 30第五節 路由演算法 39第四章 研究結果 45第一節 實驗環境 45第二節 實驗評估 49第三節 實驗一：兩個邊緣伺服器 50第四節 實驗二：比較 Possibility 兩種假設 54第五節 實驗三：四個邊緣伺服器 58第五章 結論與未來展望 63第一節 結論 63第二節 未來展望 64參考文獻 65 zh_TW dc.format.extent 4999976 bytes - dc.format.mimetype application/pdf - dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G0110753158 en_US dc.subject (關鍵詞) 任播路由 zh_TW dc.subject (關鍵詞) 命名資料網路 zh_TW dc.subject (關鍵詞) 延遲容忍網路 zh_TW dc.subject (關鍵詞) 可達性 zh_TW dc.subject (關鍵詞) 邊緣運算 zh_TW dc.subject (關鍵詞) 無線隨意網路 zh_TW dc.subject (關鍵詞) Anycast en_US dc.subject (關鍵詞) NDN en_US dc.subject (關鍵詞) DTN en_US dc.subject (關鍵詞) Possibility en_US dc.subject (關鍵詞) Edge Computing en_US dc.subject (關鍵詞) Mobile ad hoc network en_US dc.title (題名) 基於命名資料網路在延遲容忍網路之任播機制設計 zh_TW dc.title (題名) Design of Anycast Mechanism for NDN in DTN en_US dc.type (資料類型) thesis en_US dc.relation.reference (參考文獻) [1] M. Chowdhury, J. A. Khan, and L. Wang, “Leveraging content connectivity and location awareness for adaptive forwarding in ndn-based mobile ad hoc networks,” in Proceedings of the 7th ACM Conference on Information-Centric Networking, ser. ICN ’20. New York, NY, USA: Association for Computing Machinery, 2020, p.59–69. [Online]. Available:https://doi.org/10.1145/3405656.3418713[2] “5g at the edge,” 2019, https://www.5gamericas.org/5g-at-the-edge/.[3] “ndnsim.net,” https://ndnsim.net/current/index.html.[4] L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, k. claffy, P. Crowley,C. Papadopoulos, L. Wang, and B. Zhang, “Named data networking,” SIGCOMM Comput. Commun. Rev., vol. 44, no. 3, p. 66–73, jul 2014. [Online]. Available:https://doi.org/10.1145/2656877.2656887[5] V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L.Braynard, “Networking named content,” in Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, ser. CoNEXT’09. New York, NY, USA: Association for Computing Machinery, 2009, p. 1–12.[Online]. Available: https://doi.org/10.1145/1658939.1658941[6] “Nsf future internet architecture project 2010,” 2010, http://www.nets-fia.net/.[7] Y. Liu, A. Dowling, and L. Huie, “Benchmarking network performance in named data networking (ndn),” in 2020 29th Wireless and Optical Communications Conference (WOCC), 2020, pp. 1–6.[8] J. A. Khan and Y. Ghamri-Doudane, “Strive: Socially-aware three-tier routing in information-centric vehicular environment,” in 2016 IEEE Global Communications Conference (GLOBECOM), 2016, pp. 1–7.[9] Y.-T. Yu, R. B. Dilmaghani, S. Calo, M. Y. Sanadidi, and M. Gerla, “Interest propagation in named data manets,” in 2013 International Conference on Computing,Networking and Communications (ICNC), 2013, pp. 1118–1122.[10] G. Grassi, D. Pesavento, G. Pau, R. Vuyyuru, R. Wakikawa, and L. Zhang, “Vanet via named data networking,” in 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2014, pp. 410–415.[11] G. Grassi, D. Pesavento, G. Pau, L. Zhang, and S. Fdida, “Navigo: Interest forwarding by geolocations in vehicular named data networking,” in 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks(WoWMoM), 2015, pp. 1–10.[12] M. Kuai, X. Hong, and Q. Yu, “Density-aware delay-tolerant interest forwarding in vehicular named data networking,” in 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall), 2016, pp. 1–5.[13] T. Yu, Z. Zhiyi, E. Newberry, A. Afanasyev, G. Pau, L. Wang, and L. Zhang, “Names to rule them all: Unifying mobile networking via named secured data,” Technical Report NDN-0072. NDN. http://named-data. net/techreports. html …, Tech. Rep.,2022.[14] T.-C. Tsai and W.-T. Teng, “A large scale cooperative localization method,” in 2012 1st IEEE International Conference on Communications in China (ICCC), 2012, pp.722–727.[15] J. Shi and B. Zhang, “Ndnlp: A link protocol for ndn,” NDN, NDN Technical Report NDN-0006, 2012.[16] S. Mastorakis, A. Afanasyev, and L. Zhang, “On the evolution of ndnsim: An open-source simulator for ndn experimentation,” SIGCOMM Comput. Commun.Rev., vol. 47, no. 3, p. 19–33, sep 2017. [Online]. Available: https://doi.org/10.1145/3138808.3138812[17] F. Angius, M. Gerla, and G. Pau, “Bloogo: Bloom filter based gossip algorithm for wireless ndn,” in Proceedings of the 1st ACM Workshop on Emerging NameOriented Mobile Networking Design - Architecture, Algorithms, and Applications, ser. NoM ’12. New York, NY, USA: Association for Computing Machinery, 2012, p. 25–30. [Online]. Available: https://doi.org/10.1145/2248361.2248369 zh_TW
