{"id":"https://openalex.org/W2116417407","doi":"https://doi.org/10.1109/infcom.2011.5935216","title":"Analysis and algorithms for partial protection in mesh networks","display_name":"Analysis and algorithms for partial protection in mesh networks","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2116417407","doi":"https://doi.org/10.1109/infcom.2011.5935216","mag":"2116417407"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5935216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","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/A5059240370","display_name":"Greg Kuperman","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg Kuperman","raw_affiliation_strings":["MIT LIDS, Cambridge, MA, USA","MIT LIDS, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"MIT LIDS, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT LIDS, Cambridge, MA 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036587377","display_name":"Eytan Modiano","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eytan Modiano","raw_affiliation_strings":["MIT LIDS, Cambridge, MA, USA","MIT LIDS, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"MIT LIDS, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT LIDS, Cambridge, MA 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066084521","display_name":"Aradhana Narula\u2010Tam","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aradhana Narula-Tam","raw_affiliation_strings":["MIT Lincoln Laboratories, Lexington, MA, USA","[MIT Lincoln Laboratory, Lexington, MA 02420, USA]"],"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratories, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"[MIT Lincoln Laboratory, Lexington, MA 02420, USA]","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059240370"],"corresponding_institution_ids":["https://openalex.org/I4210110987","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.6496,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90633068,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"516","last_page":"520"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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.9970999956130981,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9957000017166138,"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.6602686643600464},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.588365375995636},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5865739583969116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5418305397033691},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.533638596534729},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4774818420410156},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.463975727558136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39567041397094727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23180606961250305},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2218489646911621}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6602686643600464},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.588365375995636},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5865739583969116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5418305397033691},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.533638596534729},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4774818420410156},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.463975727558136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39567041397094727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23180606961250305},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2218489646911621},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2011.5935216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5935216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W111740604","https://openalex.org/W1524993602","https://openalex.org/W1977545325","https://openalex.org/W2021435086","https://openalex.org/W2115149658","https://openalex.org/W2116583676","https://openalex.org/W2131856621","https://openalex.org/W2140297344","https://openalex.org/W2143252927","https://openalex.org/W2153261891","https://openalex.org/W2159445174","https://openalex.org/W4210463984","https://openalex.org/W4213060235","https://openalex.org/W4242709256","https://openalex.org/W6655644888","https://openalex.org/W6659093168"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W3129272755","https://openalex.org/W2138685729","https://openalex.org/W26693340","https://openalex.org/W1963777171","https://openalex.org/W2132864204"],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"a":[3,10,17,20,26,80],"mesh":[4],"network":[5],"protection":[6,54,117,129],"scheme":[7,23],"that":[8,25,90],"guarantees":[9,24],"quantifiable":[11],"minimum":[12],"grade":[13],"of":[14,29,96,102,122],"service":[15],"upon":[16],"failure":[18],"within":[19,94],"network.":[21],"The":[22],"fraction":[27],"q":[28,57,77],"each":[30],"demand":[31,52],"remains":[32],"after":[33],"any":[34],"single":[35],"link":[36],"failure.":[37],"A":[38],"linear":[39,112],"program":[40],"is":[41,70,88],"developed":[42,71,89,119],"to":[43,49,124],"find":[44],"the":[45,65,106,111,115],"minimum-cost":[46,107],"capacity":[47],"allocation":[48,69],"meet":[50],"both":[51],"and":[53,68,98],"requirements.":[55],"For":[56,76],"\u2264":[58],"1/2,":[59,79],"an":[60],"exact":[61],"algorithmic":[62],"solution":[63,108],"for":[64],"optimal":[66],"routing":[67,87],"using":[72],"multiple":[73],"shortest":[74],"paths.":[75],">;":[78],"heuristic":[81],"algorithm":[82],"based":[83],"on":[84,92],"disjoint":[85],"path":[86],"performs,":[91],"average,":[93],"1.4%":[95],"optimal,":[97],"runs":[99],"four":[100],"orders":[101],"magnitude":[103],"faster":[104],"than":[105],"achieved":[109],"via":[110],"program.":[113],"Moreover,":[114],"partial":[116],"strategies":[118],"achieve":[120],"reductions":[121],"up":[123],"82%":[125],"over":[126],"traditional":[127],"full":[128],"schemes.":[130]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}