{"id":"https://openalex.org/W2586658388","doi":"https://doi.org/10.1109/sarnof.2016.7846754","title":"Lowest-cost network node identification for data caching for information centric networks","display_name":"Lowest-cost network node identification for data caching for information centric networks","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2586658388","doi":"https://doi.org/10.1109/sarnof.2016.7846754","mag":"2586658388"},"language":"en","primary_location":{"id":"doi:10.1109/sarnof.2016.7846754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sarnof.2016.7846754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 37th Sarnoff Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043479887","display_name":"Zhengqi Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhengqi Jiang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061391892","display_name":"Di Wu","orcid":"https://orcid.org/0000-0001-8697-1817"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Di Wu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076241092","display_name":"Roberto Rojas\u2010Cessa","orcid":"https://orcid.org/0000-0001-6075-9869"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roberto Rojas-Cessa","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2954,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68411227,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2016","issue":null,"first_page":"193","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8209629654884338},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7900264263153076},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.7420332431793213},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6638489961624146},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6408481001853943},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5926972031593323},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5241478085517883},{"id":"https://openalex.org/keywords/identification-scheme","display_name":"Identification scheme","score":0.521361231803894},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5187675952911377},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5059382319450378},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4825836718082428},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4265665113925934},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42391419410705566},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1818954348564148},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11408579349517822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1137775182723999},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08568179607391357},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07283192873001099}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8209629654884338},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7900264263153076},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7420332431793213},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6638489961624146},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6408481001853943},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5926972031593323},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5241478085517883},{"id":"https://openalex.org/C2778922385","wikidata":"https://www.wikidata.org/wiki/Q3475620","display_name":"Identification scheme","level":3,"score":0.521361231803894},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5187675952911377},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5059382319450378},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4825836718082428},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4265665113925934},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42391419410705566},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1818954348564148},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11408579349517822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1137775182723999},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08568179607391357},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07283192873001099},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sarnof.2016.7846754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sarnof.2016.7846754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 37th Sarnoff Symposium","raw_type":"proceedings-article"},{"id":"mag:2750564421","is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/en/public/20090422/201702252913392507","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1987749451","https://openalex.org/W2014952121","https://openalex.org/W2019145168","https://openalex.org/W2027416321","https://openalex.org/W2037397041","https://openalex.org/W2040340473","https://openalex.org/W2054237513","https://openalex.org/W2084619708","https://openalex.org/W2109983959","https://openalex.org/W2119811250","https://openalex.org/W2147118406","https://openalex.org/W2150093579","https://openalex.org/W2156104365","https://openalex.org/W2161797643","https://openalex.org/W2168903090","https://openalex.org/W2169659341","https://openalex.org/W2532634027","https://openalex.org/W2549082795","https://openalex.org/W3014642337","https://openalex.org/W4240755715"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"We":[0,54,79,116,125,147],"present":[1],"the":[2,11,21,26,56,64,86,108,111,128,138,144,155,160,165],"lowest-path":[3],"cost":[4],"to":[5,32,39,62,84,131],"destination":[6],"scheme":[7,19,36,130],"for":[8,15,29],"identification":[9,109],"of":[10,58,66,110,119,157,162],"most":[12,139],"suitable":[13],"node":[14,23,135],"data":[16,31,48,67],"caching.":[17],"The":[18],"identifies":[20],"network":[22,70],"that":[24,44,99,149],"yields":[25],"lowest-cost":[27],"path":[28,87],"delivering":[30],"demanding":[33],"users.":[34],"This":[35],"is":[37,151],"applied":[38],"information":[40],"centric":[41],"networks":[42],"(ICN)":[43],"consider":[45,55],"two":[46,81],"different":[47,82,120],"consumption":[49],"modes:":[50],"frequently":[51],"and":[52,72,91,122,159],"sporadically.":[53],"use":[57],"Software-Defined":[59],"Networking":[60],"(SDN)":[61],"realize":[63],"distribution":[65],"on":[68],"identified":[69],"nodes":[71,141],"enable":[73],"routing":[74],"towards":[75],"ICN":[76,113],"caching":[77,114],"nodes.":[78,115],"apply":[80,127],"methods":[83],"evaluate":[85],"costs:":[88],"Dijkstra":[89],"algorithm":[90],"Integer":[92],"Linear":[93],"Programming":[94],"(ILP).":[95],"Our":[96],"results":[97],"show":[98,148],"both":[100],"adopted":[101],"schemes":[102],"provide":[103,117],"similar":[104],"results,":[105],"converging":[106],"into":[107],"same":[112],"example":[118],"scenarios":[121],"resulting":[123],"costs.":[124],"also":[126],"proposed":[129,145],"identify":[132],"a":[133,152],"stand-by":[134],"in":[136,164],"case":[137],"economical":[140],"fails,":[142],"using":[143],"scheme.":[146],"there":[150],"trade-off":[153],"between":[154],"extent":[156],"demand":[158],"location":[161],"routers":[163],"network.":[166]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}