Optimal cooperative routing protocol for efficient in-network cache management in content-centric networks
Journal article
Authors/Editors
Strategic Research Themes
No matching items found.
Publication Details
Author list: Tarnoi S., Kumwilaisak W., Ji Y.
Publisher: Institute of Electronics, Information and Communication Engineers
Publication year: 2014
Journal: IEICE Transactions on Communications (0916-8516)
Volume number: E97B
Issue number: 12
Start page: 2627
End page: 2640
Number of pages: 14
ISSN: 0916-8516
eISSN: 1745-1345
Languages: English-Great Britain (EN-GB)
View in Web of Science | View on publisher site | View citing articles in Web of Science
Abstract
This paper presents an optimal cooperative routing protocol (OCRP) aiming to improve the in-network cache utilization of the Content-Centric Networking (CCN). The objective of OCRP is to selectively aggregate the multiple flows of interest messages onto the same path in order to improve the cache utilization while mitigating the cache contention of the Content Stores (CSs) of CCN routers on the routing path. The proposed routing protocol consists of three processes: (1) Prefix Popularity Observation; (2) Prefix Group (Un)Subscription; and (3) Forwarding Information Base (FIB) Reconstruction. Prefix Popularity Observation observes the popularly cited prefixes to activate a prefix group (un)subscription function, which lets the Designated Router (DR) know which requester router wants to either join or leave a prefix group. Prefix Group (Un)Subscription lets the DR know which requester router is demanding to join or leave which prefix group. FIB Reconstruction reconstructs the FIB entries of the CCN routers involved in the newly computed optimal cooperative path of all prefix groups. The optimal routing path is obtained by binary linear optimization under a flow conservation constraint, cache contention mitigating constraint, and path length constraint. Two metrics of server load and round-trip hop distance are used to measure the performance of the proposed routing protocol. Simulation results from various network scenarios and various settings show advantages over the shortest path routing and our previously proposed cooperative routing schemes. Copyright ฉ 2014 The Institute of Electronics, Information and Communication Engineers.
Keywords
Cache management, Cooperative routing, Route Optimization
Contact Information