{"id":"https://openalex.org/W2049029582","doi":"https://doi.org/10.1109/drcn.2009.5339999","title":"Near-optimal FIPP p-cycle network designs using general path-protecting p-cycles and combined GA-ILP methods","display_name":"Near-optimal FIPP p-cycle network designs using general path-protecting p-cycles and combined GA-ILP methods","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2049029582","doi":"https://doi.org/10.1109/drcn.2009.5339999","mag":"2049029582"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2009.5339999","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2009.5339999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 7th International Workshop on Design of Reliable Communication Networks","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/A5032758074","display_name":"Diane Prisca Onguetou","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Diane Prisca Onguetou","raw_affiliation_strings":["ECE Department, University of Alberta, Edmonton, Canada","TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"ECE Department, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065882809","display_name":"Dimitri Baloukov","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dimitri Baloukov","raw_affiliation_strings":["ECE Department, University of Alberta, Edmonton, Canada","TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"ECE Department, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087988640","display_name":"W.D. Grover","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wayne D. Grover","raw_affiliation_strings":["ECE Department, University of Alberta, Edmonton, Canada","TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"ECE Department, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032758074"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":1.1963,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80092212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"243","last_page":"250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998000264167786,"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.9998000264167786,"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.9890999794006348,"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.9562000036239624,"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/disjoint-sets","display_name":"Disjoint sets","score":0.739367663860321},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6710140705108643},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.6514009833335876},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.601313054561615},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5865882635116577},{"id":"https://openalex.org/keywords/spare-part","display_name":"Spare part","score":0.5776649713516235},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5643993020057678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5342776775360107},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5105479955673218},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4978466033935547},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42575210332870483},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41355395317077637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3268146514892578},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1418572962284088},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09217941761016846},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07753992080688477}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.739367663860321},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6710140705108643},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.6514009833335876},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.601313054561615},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5865882635116577},{"id":"https://openalex.org/C194648553","wikidata":"https://www.wikidata.org/wiki/Q1364774","display_name":"Spare part","level":2,"score":0.5776649713516235},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5643993020057678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5342776775360107},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5105479955673218},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4978466033935547},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42575210332870483},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41355395317077637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3268146514892578},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1418572962284088},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09217941761016846},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07753992080688477},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/drcn.2009.5339999","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2009.5339999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 7th International Workshop on Design of Reliable Communication Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321588","display_name":"Concordia University","ror":"https://ror.org/0420zvk78"},{"id":"https://openalex.org/F4320323175","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W66274240","https://openalex.org/W597246096","https://openalex.org/W1991526073","https://openalex.org/W2106714732","https://openalex.org/W2138131874","https://openalex.org/W2146049426","https://openalex.org/W2153764491","https://openalex.org/W2158376963","https://openalex.org/W2169207197","https://openalex.org/W6602744461"],"related_works":["https://openalex.org/W2376859990","https://openalex.org/W2912704652","https://openalex.org/W2381161177","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"Recent":[0],"work":[1,103],"on":[2],"failure":[3,45,56],"independent":[4],"path-protecting":[5,36],"p-cycles":[6,225],"(FIPP)":[7],"has":[8],"revealed":[9,94],"some":[10],"new,":[11],"relatively":[12],"simple":[13],"and":[14,63,152],"possibly":[15],"cost-effective":[16],"approaches":[17],"for":[18,140,143],"FIPP":[19,75,153,174,197,227],"p-cycle":[20,37,76,198],"network":[21],"design.":[22],"The":[23,49,150],"first":[24],"step":[25,51],"of":[26,31,44,53,90,101,107,111,138,159,223],"the":[27,42,55,60,65,88,92,105,108,120,145,157,173,181,191,230],"proposed":[28],"strategy":[29],"consists":[30,52],"solving":[32],"a":[33,72,220],"more":[34],"general":[35],"(GPP)":[38],"problem":[39,130],"in":[40,184,196,202,208,213],"which":[41,91,123,144],"constraint":[43,58,195],"independence":[46,57],"is":[47,78,104],"relaxed.":[48],"second":[50],"imposing":[54],"onto":[59],"GPP":[61,121,129,151],"solution":[62,77],"identifying":[64],"working":[66],"paths":[67],"that":[68,189],"become":[69],"unprotected":[70],"as":[71,165,167,203,205],"result.":[73],"A":[74],"extracted":[79],"by":[80,172],"capacitating":[81],"additional":[82],"cycles":[83],"to":[84,95,119,126,218],"protect":[85],"these":[86],"paths,":[87],"number":[89],"results":[93,182],"never":[96],"exceed":[97],"three.":[98],"Another":[99],"contribution":[100],"this":[102,185,214],"adaptation":[106],"novel":[109],"combination":[110],"genetic":[112],"algorithms":[113],"with":[114,156,226],"integer":[115],"linear":[116],"programming":[117],"(GA-ILP)":[118],"concept,":[122],"allowed":[124],"us":[125],"solve":[127],"large":[128],"instances.":[131],"GA-ILP":[132,160],"solutions":[133,147,154],"were":[134,148,161],"typically":[135],"within":[136],"1%":[137],"optimality":[139],"smaller":[141],"networks":[142,199],"exact":[146],"known.":[149],"obtained":[155,171,183],"assistance":[158],"considerably":[162],"better":[163],"(by":[164],"much":[166,204],"23%)":[168],"than":[169],"those":[170],"disjoint":[175,192],"route":[176,193],"set":[177,194],"(DRS)":[178],"method.":[179],"Furthermore,":[180],"paper":[186],"also":[187],"showed":[188],"relaxing":[190],"can":[200],"result":[201],"9%":[206],"decrease":[207],"spare":[209],"capacity":[210,231],"cost.":[211],"Also":[212],"paper,":[215],"we":[216],"ventured":[217],"provide":[219],"true":[221],"comparison":[222],"span-protecting":[224],"p-cycles,":[228],"from":[229],"efficiency":[232],"perspective.":[233]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}