增加資料命名網路中轉送資訊庫的搜尋公平性
No Thumbnail Available
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
新一代網路架構資料命名網路的出現，將傳統以 IP 位址傳送資料轉變成以命名為基礎的連線方式，讓使用者能夠以描述資料內容的方式獲取自己想要的資料。然而隨著物聯網的出現，將會有更多的資訊以及內容在網路當中流通，但是也因為資料命名網路並沒有統一的命名方式和限制內容長度，因此在物聯網當中的眾多應用結合之下，將會造成每一個名字在路由器當中搜尋所需要的時間會有極大的差異，而這樣的差異會使得每一個使用者必須經過非常不一樣的時間才能夠獲取資料，而產生不公平的現象。因此我們針對路由器當中 FIB 的搜尋提出一個方法 DePT (Dispersed eminent Patricia Trie), 其結合兩種演算法的優點去解決在路由器當中搜尋不公平的現象，這個方法除了能夠使得每一個資料名稱在路由器中能夠更公平的搜尋之外，同時也能夠減少搜尋所花費的時間以增加搜尋速率。最後也因為使用也別於其他研究所提到的 Patricia Trie 作為資料結構，所以也比較節省記憶體空間，進一步的降低硬體上的負擔。
The novel network architecture Named Data Networking (NDN) has been proposed. The way of information transfer will be pass by name content rather than IP address. Users could get the content by directly describe the information. However, with the appearance of Internet of Things (IoT), there will be more information in the network flow. On the other hand, names do not have the same length and content, the lookup time of names in router would be very different. The difference of lookup time may result in that every user will get his data by during very different waiting time. Therefore, the “unfair” situation happened. In order to solve the fairness issue, we propose a method “DePT (Dispersed eminent Patricia Trie)” which based on two basic methods. This proposed method will make each name have about the same lookup time in FIB. Besides, the lookup efficiency will be better and the memory consumption will be lower. It will reduce the burden on the hardware.
The novel network architecture Named Data Networking (NDN) has been proposed. The way of information transfer will be pass by name content rather than IP address. Users could get the content by directly describe the information. However, with the appearance of Internet of Things (IoT), there will be more information in the network flow. On the other hand, names do not have the same length and content, the lookup time of names in router would be very different. The difference of lookup time may result in that every user will get his data by during very different waiting time. Therefore, the “unfair” situation happened. In order to solve the fairness issue, we propose a method “DePT (Dispersed eminent Patricia Trie)” which based on two basic methods. This proposed method will make each name have about the same lookup time in FIB. Besides, the lookup efficiency will be better and the memory consumption will be lower. It will reduce the burden on the hardware.
Description
Keywords
搜尋, 資料命名網路, FIB, 公平, FIB, Fairness, Named Data Networking