论文信息 - Efficient Data Storage and Name Look-Up in Named Data Networking Using Connected Dominating Set and Patricia Trie - 字舞流文

Efficient Data Storage and Name Look-Up in Named Data Networking Using Connected Dominating Set and Patricia Trie

Sushmita Ruj | Sipra Das Bit | Tanusree Chatterjee | S. D. Bit | S. Ruj | Tanusree Chatterjee | S. Bit

[1] Satyajayant Misra,et al. ICedge: When Edge Computing Meets Information-Centric Networking , 2020, IEEE Internet of Things Journal.

[2] Sushmita Ruj,et al. Security Issues in Named Data Networks , 2018, Computer.

[3] Patrick Crowley,et al. Scalable Name-Based Packet Forwarding: From Millions to Billions , 2015, ICN.

[4] Nikos Fotiou,et al. A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[5] Fabrizio Grandoni,et al. A note on the complexity of minimum dominating set , 2006, J. Discrete Algorithms.

[6] Albert,et al. Emergence of scaling in random networks , 1999, Science.

[7] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[8] Donald R. Morrison,et al. PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.