{"id":"https://openalex.org/W4207004403","doi":"https://doi.org/10.1109/gcwkshps52748.2021.9681968","title":"Nearly Optimal Algorithm for Placing Content-Replication in Elastic Optical Networks","display_name":"Nearly Optimal Algorithm for Placing Content-Replication in Elastic Optical Networks","publication_year":2021,"publication_date":"2021-12-01","ids":{"openalex":"https://openalex.org/W4207004403","doi":"https://doi.org/10.1109/gcwkshps52748.2021.9681968"},"language":"en","primary_location":{"id":"doi:10.1109/gcwkshps52748.2021.9681968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gcwkshps52748.2021.9681968","pdf_url":null,"source":{"id":"https://openalex.org/S4363605397","display_name":"2021 IEEE Globecom Workshops (GC Wkshps)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Globecom Workshops (GC Wkshps)","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/A5013296031","display_name":"Tatsuo Miyamura","orcid":"https://orcid.org/0000-0003-1520-9686"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takashi Miyamura","raw_affiliation_strings":["NTT Network Service Systems Labs, NTT Corporation, Musashino, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Network Service Systems Labs, NTT Corporation, Musashino, Tokyo, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063224761","display_name":"Akira Misawa","orcid":null},"institutions":[{"id":"https://openalex.org/I116680314","display_name":"Chitose Institute of Science and Technology","ror":"https://ror.org/037xccs34","country_code":"JP","type":"education","lineage":["https://openalex.org/I116680314"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akira Misawa","raw_affiliation_strings":["Chitose Institute of Science and Technology, Chitose, Hokkaido, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chitose Institute of Science and Technology, Chitose, Hokkaido, Japan","institution_ids":["https://openalex.org/I116680314"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3092,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44678218,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998999834060669,"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":0.9998999834060669,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.998199999332428,"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.8487519025802612},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7149795293807983},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5580697059631348},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5336960554122925},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.5250449180603027},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5027453899383545},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5008647441864014},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4998352527618408},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4543735682964325},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4382413625717163},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4369587004184723},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4358304738998413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3424341082572937},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.335606187582016},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.242290198802948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09865987300872803},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08419379591941833}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8487519025802612},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7149795293807983},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5580697059631348},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5336960554122925},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.5250449180603027},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5027453899383545},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5008647441864014},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4998352527618408},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4543735682964325},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4382413625717163},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4369587004184723},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4358304738998413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3424341082572937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.335606187582016},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.242290198802948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09865987300872803},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08419379591941833},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/gcwkshps52748.2021.9681968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gcwkshps52748.2021.9681968","pdf_url":null,"source":{"id":"https://openalex.org/S4363605397","display_name":"2021 IEEE Globecom Workshops (GC Wkshps)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Globecom Workshops (GC Wkshps)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2004676892","https://openalex.org/W2026612103","https://openalex.org/W2067187560","https://openalex.org/W2089983976","https://openalex.org/W2128478380","https://openalex.org/W2153863240","https://openalex.org/W2209484911","https://openalex.org/W2319313589","https://openalex.org/W2463012949","https://openalex.org/W2477030020","https://openalex.org/W2811942412","https://openalex.org/W2901019810","https://openalex.org/W2903305149","https://openalex.org/W2911742269","https://openalex.org/W3028417392","https://openalex.org/W3161272982"],"related_works":["https://openalex.org/W4205713785","https://openalex.org/W3016766501","https://openalex.org/W2901033488","https://openalex.org/W2031325922","https://openalex.org/W3086458689","https://openalex.org/W4287666211","https://openalex.org/W2025865172","https://openalex.org/W2152099439","https://openalex.org/W2898161671","https://openalex.org/W2249859249"],"abstract_inverted_index":{"We":[0,18,131],"propose":[1],"a":[2,83,114],"network-aware":[3],"light-weight":[4],"content-replication":[5],"placement":[6],"algorithm":[7,118],"(NetLCP)":[8],"for":[9,31],"efficient":[10,32],"large-scale":[11,33],"content":[12,34,60],"distribution":[13],"in":[14,54,61],"elastic":[15,25],"optical":[16,26,70],"networks.":[17],"previously":[19],"proposed":[20],"an":[21],"architecture":[22],"of":[23,48,69,81,124,150],"information-centric":[24],"transport":[27],"networks":[28],"called":[29,119],"i-CEON":[30],"delivery.":[35],"In":[36,72],"i-CEON,":[37],"we":[38,76,112],"deploy":[39],"in-network":[40],"cache":[41],"functions":[42],"(ICFs)":[43],"to":[44,56,65,101],"reduce":[45],"redundant":[46],"use":[47],"network":[49,103,125],"resources.":[50],"The":[51],"key":[52],"lies":[53],"how":[55],"adequately":[57],"place":[58],"replicated":[59],"ICFs":[62],"so":[63],"as":[64,85],"improve":[66],"the":[67,78,91,96,155],"efficiency":[68,123],"paths.":[71],"our":[73],"previous":[74,92],"work,":[75],"formulated":[77],"joint":[79],"optimization":[80],"such":[82],"problem":[84],"mixed":[86],"integer":[87],"linear":[88],"programming.":[89],"Though":[90],"method":[93],"always":[94,140],"finds":[95],"optimal":[97,116,143,156],"solutions,":[98],"it":[99],"fails":[100],"ensure":[102],"scalability":[104],"and":[105,136,145],"quick":[106],"responsiveness.":[107],"To":[108],"overcome":[109],"this":[110],"issue,":[111],"develop":[113],"nearly":[115,142],"heuristic":[117],"NetLCP":[120,139],"that":[121,138],"improves":[122],"resources":[126],"with":[127,154],"practical":[128],"computational":[129],"overhead.":[130],"conducted":[132],"intensive":[133],"numerical":[134],"experiments":[135],"demonstrated":[137],"found":[141],"solutions":[144],"indicated":[146],"fewer":[147],"than":[148],"10%":[149],"approximation":[151],"errors":[152],"compared":[153],"solutions.":[157]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}