English  |  正體中文  |  简体中文  |  Items with full text/Total items : 888/888 (100%)
Visitors : 13004943      Online Users : 177
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://ccur.lib.ccu.edu.tw/handle/A095B0000Q/573


    Title: 在內容核心網路中基於匈牙利演算法的內容放置機制;A Content Placement Scheme Based On Hungarian Algorithm For Content-Centric Network
    Authors: 劉名秦;Liu, MING-CHIN
    Contributors: 資訊工程研究所
    Keywords: 內容核心網路;Content-Centric Networking;Hungarian Algorithm
    Date: 2017
    Issue Date: 2019-07-17
    Publisher: 資訊工程研究所
    Abstract: 當前的網路架構是在1960年代被發明的,而網路是讓兩個地方可以做溝通來使用的。而在過去幾十年間,網路的使用者有著巨量的成長。而網路的用途也從溝通的媒介變成讓使用者取得他們所想要的資料。即使目前有許多額外的設計來讓網路可以更符合使用者的需求,但是這些設計也使的網路架構變得更為複雜,更難以維護。而內容核心網路(Content Centric-Networks)是一個新穎的網路架構且符合使用者的需求。在內容核心網路中,內容核心網路給予每一個資料一個獨一無二的ID,而使用者可以透過這個ID直接取得他們所想要的資料。此外,在內容核心網路中,路由器可以擁有一定的儲存空間來暫時存放所經過的資料。藉由這項特色,路由器如果有存放使用者想取得的資料可以直接提供給使用者,如此一來可以有效的減少網路流量。然而,如何讓路由器有效的暫存資料是內容核心網路中一項很重要的議題。在這篇論文中,我們提出一個基於匈牙利演算法的內容放置機制。在我們所提出的方法中,我們考慮了請求以及資料所傳遞的距離、資料的受歡迎程度以及資料的大小來決定資料所放置的位置。除此之外,我們同時也掌控了資料在網路中所放置的份數,減少過多冗餘的資料。透過實驗結果,我們的機制比目前現有的機制有著較好的表現結果。
    The network was create in the 1960s, and its goal is to contact two place. As time goes by, the users of network had increase very fast in the last decades. The goal of network also change to that provide data which is user want. Even though there are some patch to make network provide stable service, it make the network architecture more complicated and hard to maintain. Content Centric Network is a new paradigm of networking to meet the needs of users. It given every data a unique ID that make users can request the data directly. It also let routers has the cache capability to cache data. This feature make router can provide the data and also reduce the network traffic. However, how to cache data effectively is a big issue. In this paper, we model this cache problem as an assignment problem and propose a cache scheme which is based on the Hungarian Algorithm. Our cache scheme consider distance, content popularity and data size. We also allocate the number of data duplicates by considering their potential importance. We also make a simulation to verify. As shown in the simulation, our cache scheme has better performance than the others scheme.
    Appears in Collections:[資訊工程學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML316View/Open


    All items in CCUR are protected by copyright, with all rights reserved.


    版權聲明 © 國立中正大學圖書館網頁內容著作權屬國立中正大學圖書館

    隱私權及資訊安全政策

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback