The Community for Technology Leaders
2014 IEEE 39th Conference on Local Computer Networks (LCN) (2014)
Edmonton, AB, Canada
Sept. 8, 2014 to Sept. 11, 2014
ISBN: 978-1-4799-3778-3
pp: 414-417
Saran Tarnoi , Dept. of Inf., Grad. Univ. For Adv. Studies, Tokyo, Japan
Wuttipong Kumwilaisak , King Mongkut's Univ. of Technol. Thonburi, Bangkok, Thailand
Yusheng Ji , Dept. of Inf., Grad. Univ. For Adv. Studies, Tokyo, Japan
ABSTRACT
This paper presents an optimal cooperative routing protocol (OCRP) for Content Centric Networking (CCN) aiming to improve the in-network cache utilization. The objective of OCRP is to selectively aggregate the multiple flows of interest messages onto the same path. This improves the cache utilization while mitigating the cache contention in the Content Store (CS) of CCN routers on the routing path. The optimal routing path is obtained by binary linear optimization under threes constraints: flow conservation constraint, cache contention mitigating constraint, and path length constraint. Our simulation results of OCRP show the reduction in the server load and round-trip hop distance in comparison to those of the shortest path routing and our previously proposed cooperative routing schemes.
INDEX TERMS
Routing, Routing protocols, Servers, Educational institutions, Optimization, Indexes, Cascading style sheets
CITATION

S. Tarnoi, W. Kumwilaisak and Yusheng Ji, "Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking," 2014 IEEE 39th Conference on Local Computer Networks (LCN), Edmonton, AB, Canada, 2014, pp. 414-417.
doi:10.1109/LCN.2014.6925805
186 ms
(Ver 3.3 (11022016))