{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:04:09Z","timestamp":1773615849661,"version":"3.50.1"},"reference-count":21,"publisher":"Allerton Press","issue":"4","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.3103\/s0146411621040039","type":"journal-article","created":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T09:01:43Z","timestamp":1630659703000},"page":"319-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Data Storage and Name Look-Up in Named Data Networking Using Connected Dominating Set and Patricia Trie"],"prefix":"10.3103","volume":"55","author":[{"family":"Tanusree Chatterjee","sequence":"first","affiliation":[]},{"given":"Sushmita","family":"Ruj","sequence":"additional","affiliation":[]},{"given":"Sipra","family":"Das Bit","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2021,9,2]]},"reference":[{"key":"7356_CR1","unstructured":"Marr, B., Big data, 2014. https:\/\/www.slideshare.net\/BernardMarr\/big-data-25-facts\/7-Google_aloneprocesses_on_averageover_40. Cited September 5, 2020."},{"key":"7356_CR2","doi-asserted-by":"crossref","unstructured":"Zhu, Z. and Afanasyev, A., Let\u2019s ChronoSync: Decentralized dataset state synchronization in Named Data Networking, International Conference on Network Protocols (ICNP), IEEE, 2013, pp. 1\u201310.","DOI":"10.1109\/ICNP.2013.6733578"},{"key":"7356_CR3","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/SURV.2013.070813.00063","volume":"16","author":"G. Xylomenos","year":"2013","unstructured":"Xylomenos, G., Ververidis, C.N., Vasilios, S.A., Fotiou, N., Tsilopoulos, C., Vasilakos, X., Katsaros, K.V., and Polyzos, G.C., A survey of information-centric networking research, IEEE Commun. Surv. Tutorials, 2013, vol.\u00a016, no. 2, pp. 1024\u20131049.","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"7356_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MC.2018.1151010","volume":"51","author":"T. Chatterjee","year":"2018","unstructured":"Chatterjee, T., Ruj, S., and DasBit, S., Security issues in named data networks, IEEE Comput., 2018, vol. 51, no.\u00a01, pp. 66\u201375.","journal-title":"IEEE Comput."},{"key":"7356_CR5","doi-asserted-by":"crossref","unstructured":"Wang, L., Hoque, A.K.M.M., Yi, C., Alyyan, A., and Zhang, B., OSPFN: An OSPF Based Routing Protocol for Named Data Networking, NDN Technical Report NDN-0003, 2012, pp. 1\u201315.","DOI":"10.1145\/2491224.2491231"},{"key":"7356_CR6","unstructured":"Lehman, V., Hoque, A.K.M.M., Yu, Y., Wang, L., Zhang, B., and Zhang, L., A Secure Link State Routing Protocol for NDN, NDN Technical Report NDN-0037, 2016, pp. 1\u20139."},{"key":"7356_CR7","doi-asserted-by":"crossref","unstructured":"Song, T., Yuan, H., Crowley, P., and Zhang, B., Scalable name-based packet forwarding: From millions to billions, International Conference on Information-Centric Networking (ICN), ACM, 2015, pp. 19\u201328.","DOI":"10.1145\/2810156.2810166"},{"key":"7356_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F. Grandoni","year":"2006","unstructured":"Grandoni, F., A note on the complexity of minimum dominating set, J. Discrete Algorithms, 2006, vol. 4, no. 2, pp. 209\u2013214.","journal-title":"J. Discrete Algorithms"},{"key":"7356_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R., PATRICIA \u2013 practical algorithm to retrieve information coded in alphanumeric, J. ACM, 1968, vol. 15, no. 4, pp. 514\u2013534.","journal-title":"J. ACM"},{"key":"7356_CR10","doi-asserted-by":"crossref","unstructured":"Lehman, V., Gawande, A., Zhang, B., Zhang, L., Aldecoa, R., Krioukov, D.V., and Wang, L., An experimental investigation of hyperbolic routing with a smart forwarding plane in NDN, 2016 IEEE\/ACM 24th International Symposium on Quality of Service (IWQoS), 2016, pp. 1\u201310.","DOI":"10.1109\/IWQoS.2016.7590394"},{"key":"7356_CR11","doi-asserted-by":"crossref","unstructured":"Ghasemi, C., Yousef, H., Shin, K.G., and Zhang, B., MUCA: New routing for named data networking, IFIP Networking Conference (IFIP Networking) and Workshops, IEEE, 2018, pp. 289\u2013297.","DOI":"10.23919\/IFIPNetworking.2018.8697026"},{"key":"7356_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee, T., Ruj, S., and DasBit, S., LowSHeP: Low-overhead forwarding and update Solution in ndn with Hexadecimal Patricia trie, International Conference on Advanced Networks and Telecommunications Systems (ANTS), IEEE, 2019, pp. 1\u20136.","DOI":"10.1109\/ANTS47819.2019.9117924"},{"key":"7356_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/JIOT.2020.2966924","volume":"7","author":"M. Spyridon","year":"2020","unstructured":"Spyridon, M., Abderrahmen, M., Lee, J., and Misra, S., ICedge: When edge computing meets information centric networking, Internet Things J., 2020, vol. 7, no. 5, pp. 1\u201314. https:\/\/doi.org\/10.1109\/JIOT.2020.2966924","journal-title":"Internet Things J."},{"key":"7356_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, T., Ruj, S., and DasBit, S., Data forwarding and update propagation in grid network for NDN: A low-overhead approach, International Conference on Advanced Networks and Telecommunications Systems (ANTS), IEEE, 2018, pp. 1\u20136.","DOI":"10.1109\/ANTS.2018.8710136"},{"key":"7356_CR15","unstructured":"CAIDA, Get NFD Connected. 2015. https:\/\/named-data.net\/. Cited September 10, 2020."},{"key":"7356_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S. and Khuller, S., Approximation algorithms for connected dominating sets, Algorithmica, 1998, vol. 20, no. 4, pp. 374\u2013387.","journal-title":"Algorithmica"},{"key":"7356_CR17","unstructured":"Mancuso, N., Networkx documentation, 2013. https:\/\/networkx.github.io\/documentation. Cited September 15, 2020."},{"key":"7356_CR18","first-page":"290","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P. and R\u00e9nyi, A., On random graphs I, Publ. Math. (Debrecen), 1959, vol. 6, pp. 290\u2013297.","journal-title":"Publ. Math."},{"key":"7356_CR19","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"L.A. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, L.A. and Albert, R., Emergence of scaling in random networks, Science, 1999, vol. 286, no. 5439, pp.\u00a0509\u2013512.","journal-title":"Science"},{"key":"7356_CR20","unstructured":"Popular Websites across the Globe. https:\/\/www.kaggle.com\/bpali26\/popular-websites-across-the-globe. Cited September 22, 2020."},{"key":"7356_CR21","unstructured":"CPU Time Enquiry. https:\/\/www.gnu.org\/software\/libc\/manual\/html_node\/CPU-Time.html. Cited October 1, 2020."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621040039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411621040039","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621040039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:05:31Z","timestamp":1773612331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411621040039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["7356"],"URL":"https:\/\/doi.org\/10.3103\/s0146411621040039","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"16 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}