期刊文献+

Little for more: An Active Discovery Strategy for Content Routing in ICN

Little for more: An Active Discovery Strategy for Content Routing in ICN
下载PDF
导出
摘要 While receiving a certain packet with unknown destination, a router either simply drops it or sends queries around as a remedy.Dropping it sacrifices transmission stability, but sending queries may cause too much overload.Such situation can be seen more frequently in Information-Centric Networking(ICN) since it has a larger namespace for routing destinations.In this paper, we propose the neighboring chunk aware discovery(NCAD), an active discovery strategy for content routing. NCAD can reduce the cost of resolving unknown contents, which is not yet considered by the conventional routing mechanism. The idea behind NCAD is to ask the nodes to report back more possession information about the queried content in prediction of later use. To this end, we de-sign NCAD with several different considerations,and balance the tradeoff between effectiveness in conjunction with the overhead to achieve optima on the whole. Extensive experiments are conducted on a small typical topology and a large real-world Internet AS-level topology.Experimental results show an overall superiority of NCAD in terms of both effectiveness and overhead. While receiving a certain packet with unknown destination, a router either simply drops it or sends queries around as a remedy.Dropping it sacrifices transmission stability, but sending queries may cause too much overload.Such situation can be seen more frequently in Information-Centric Networking(ICN) since it has a larger namespace for routing destinations.In this paper, we propose the neighboring chunk aware discovery(NCAD), an active discovery strategy for content routing. NCAD can reduce the cost of resolving unknown contents, which is not yet considered by the conventional routing mechanism. The idea behind NCAD is to ask the nodes to report back more possession information about the queried content in prediction of later use. To this end, we de-sign NCAD with several different considerations,and balance the tradeoff between effectiveness in conjunction with the overhead to achieve optima on the whole. Extensive experiments are conducted on a small typical topology and a large real-world Internet AS-level topology.Experimental results show an overall superiority of NCAD in terms of both effectiveness and overhead.
出处 《China Communications》 SCIE CSCD 2016年第S1期54-64,共11页 中国通信(英文版)
基金 supported by the National Basic Research Program of China (973 Program) under Grant No. 2012CB315904 the National Natural Science Foundation of China under Grant No. 61179028 the Basic Research of Shenzhen under Grant No. JCYJ20140417144423192, No. JCYJ20140509093817684 and JCYJ201506 26110611869
关键词 prevailing approach ACTIVE DISCOVERY STRATEGY neighboring CHUNK alternative TRADEOFF prevailing approach active discovery strategy neighboring chunk alternative tradeoff
  • 相关文献

参考文献16

  • 1Chiocchetti R,Perino D,Carofiglio G,et al.INFORM:a dynamic Interest Forwarding Mechanism for Information Centric Networking. ACM SIGCOMM Workshop on Information-Centric Networking . 2013
  • 2Sukdea Yu,Gihwan Cho.A Selective Flooding Method for propagating emergency messages in vehicle safety communications. Proceedings of the2006International Conference on Hybrid Information Technology . 2006
  • 3Cheng Yi,Alexander Afanasyev,Lan Wang,Beichuan Zhang,Lixia Zhang.??Adaptive forwarding in named data networking(J)ACM SIGCOMM Computer Communication Review . 2012 (3)
  • 4Teemu Koponen,Mohit Chawla,Byung-Gon Chun,Andrey Ermolinskiy,Kye Hyun Kim,Scott Shenker,Ion Stoica.A data-oriented (and beyond) network architecture[J]. ACM SIGCOMM Computer Communication Review . 2007 (4)
  • 5Bari, Md. Faizul,Chowdhury, Shihabur Rahman,Ahmed, Reaz,Boutaba, Raouf,Mathieu, Bertrand.A survey of naming and routing in information-centric networks. IEEE Communications Magazine . 2012
  • 6L. Stojmenovic,Xu Lin.Loop-free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks. IEEETransactions on Parallel and Distributed Systems . 2001
  • 7LEE M,CHO K,PARK K,et al.SCAN:Scalable Content Routing for Content-Aware Networking.. Proceedings of IEEE ICC . 2011
  • 8Liu H,Foy X D,Zhang D.A Multi-Level DHT Routing Framework with Aggregation. Proc of ACMSIGCOMMworkshop on ICN . 2012
  • 9WANG Y,LEE K,VENKATARAMAN B,et al.Advertising cached contents in the control plane:Necessity and feasibili-ty. IEEE INFOCOM Workshops . 2012
  • 10Dannewitz C,Golic J,Ohlman B,et al.Secure naming for a network of information. Proc of INFOCOMWorkshops . 2010

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部