2013 IEEE 38th Conference on Local Computer Networks (LCN 2013) (2013)
Oct. 21, 2013 to Oct. 24, 2013
Saran Tarnoi , Dept. of Inf., Grad. Univ. For Adv. Studies, Tokyo, Japan
Kalika Suksomboon , Nat. Inst. of Inf., 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
A typical Forwarding Information Based (FIB) construction in the Content Centric Networking (CCN) architecture relies on the name prefix dissemination following the shortest path manner. However, routing based on the shortest path may not fully exploit the benefits of forwarding and data planes of the CCN architecture since different content requester routers may use disjoint paths to forward their interest packets, even though these packets aim at the same content. To exploit this opportunity, we propose a cooperative routing protocol for CCN, which focuses on a FIB reconstruction based on the content retrieval statistics to improve the in-network caching utilization. A binary linear optimization problem is formulated for calculating the optimal path for the cooperative routing. The simulation results show an improvement in the server load and round-trip time provided by the cooperative routing scheme compared with that of the conventional shortest path routing scheme.
Routing, Routing protocols, Servers, Optimization, Computer architecture, YouTube, Cascading style sheets
S. Tarnoi, K. Suksomboon, W. Kumwilaisak and Yusheng Ji, "Cooperative routing protocol for Content-Centric Networking," 2013 IEEE 38th Conference on Local Computer Networks (LCN 2013)(LCN), Sydney, Australia, 2014, pp. 699-702.