Abstract
It is very easy for the nodes in Named Data Networking to ignore the neighbor nodes. To solve this issue, this paper proposes a leading routing mechanism for neighbor content store. Firstly, through building the interest clusters, the nodes are partitioned to different reigns to announce the information of content store. Secondly, the packets and the fast routing tables are designed. Finally, the best path is chosen to send the interest packets. The theoretical analysis and the simulation results show that this mechanism adequately uses the neighbor content and effectively decreases the average network delay. The server load is reduced by 30%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
REFERENCES
Carofiglio, G., Gallo, M., Muscariello, L.: Bandwidth and Storage Sharing Performance in Information Centric Networking[C]. In: Proceedings of ACM SIGCOMM ICN Workshop, 26–31(2011)
Tsilopoulos, C., Xylomenos, G.: Supporting Diverse Traffic Types in Information Centric Networks . In: Proceedings of ACM SIGCOMM ICN Workshop, 13–18(2011)
Chiocchetti, Raffaele, Rossi, Dario, Carofiglio, Giovanna, et al.: Exploit the Known or Explore the Unknown? Hamlet-Like Doubts in ICN[C]. Proceedings of ACM SIGCOMM ICN Workshop, Helsinki, Finland (2012)
Zhang Li-xia, Jacobson V, Tsudik Gene, et al. Named Data Networking (NDN) Project [R/OL] (2013). http://named-data.org
Shanbhag, S., Schwan, N., Rimac, I., et al.: SoCCeR: services over content-centric routing. ACM SIGCOMM Workshop on Information-Centric Networking, Toronto, Canada (2011)
Eum, S., Nakauchi, K., Murata, M., et al.: CATT: Potential Based Routing with Content Caching for ICN. ACM SIGCOMM Workshop on Information-Centric Networking, Helsinki, Finland (2012)
Ye, R.: M. Xu, Neighbor Cache Explore Routing Strategy in NDN, Journal of Frontiers of Computer. Science and Technology 6, 593–601 (2012)
Wang, Y., Lee, K.: Advertising cached contents in the control plane: Necessity and feasibility. In IEEE INFOCOM, NOMEN Workshop (2012)
Sripanidkulchai, K, Maggs, B, Zhang, H.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In: Proceedings of IEEE INFOCOM (2003)
Pireddo, L., Nascimento, M.A.: Taxonomy-Based Routing Indices for Peer-to-Peer Networks. In: Proceedings of the Workshop on Peer-to-Peer Information Retrieval, 27th International Annual ACM SIGIR Conference (2004)
Mcpherson, M., Lovin, L., Cook, J.: Birds of a feather: Homophily in social networks. In Annual Review of Sociology (2001)
Zhang, Y., Zhao, J., Cao, G., et al.: On Interest Locality in Content-Based Routing for Large-scale MANETs(2009)
Masinter, L., Berners-Lee, T., Fielding, R.T.: Uniform resource identifier (URI): Generic syntax (2005)
Wang, Y, Lee, K., Venkataraman, B., et al. Advertising cached contents in the control plane: Necessity and feasibility[C]//Computer Communications Workshops (INFOCOM WKSHPS), 2012 IEEE Conference on.(2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Chuan-zhen, D., Yan, Z., Ju-long, L. (2014). A leading routing mechanism for neighbor content store. In: Leung, V., Chen, M., Wan, J., Zhang, Y. (eds) Testbeds and Research Infrastructure: Development of Networks and Communities. TridentCom 2014. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 137. Springer, Cham. https://doi.org/10.1007/978-3-319-13326-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-13326-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13325-6
Online ISBN: 978-3-319-13326-3
eBook Packages: Computer ScienceComputer Science (R0)