{"id":"https://openalex.org/W7124849513","doi":"https://doi.org/10.1109/cloudcom67567.2025.11331534","title":"Temporal-$\\alpha$ Coverage: Cost-Efficient and Accurate Failure Detection in Data Center Networks","display_name":"Temporal-$\\alpha$ Coverage: Cost-Efficient and Accurate Failure Detection in Data Center Networks","publication_year":2025,"publication_date":"2025-11-14","ids":{"openalex":"https://openalex.org/W7124849513","doi":"https://doi.org/10.1109/cloudcom67567.2025.11331534"},"language":null,"primary_location":{"id":"doi:10.1109/cloudcom67567.2025.11331534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cloudcom67567.2025.11331534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 lEEE International Conference on Cloud Computing Technology and Science (CloudCom)","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/A5123409089","display_name":"Zheyu Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136793","display_name":"Peng Cheng Laboratory","ror":"https://ror.org/03qdqbt06","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210136793"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zheyu Chen","raw_affiliation_strings":["Pengcheng Laboratory,Shenzhen,China"],"affiliations":[{"raw_affiliation_string":"Pengcheng Laboratory,Shenzhen,China","institution_ids":["https://openalex.org/I4210136793"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5123409089"],"corresponding_institution_ids":["https://openalex.org/I4210136793"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.83456759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.5769000053405762,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.5769000053405762,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.24719999730587006,"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.051100000739097595,"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/granularity","display_name":"Granularity","score":0.6001999974250793},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5961999893188477},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5295000076293945},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47029998898506165},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4657000005245209},{"id":"https://openalex.org/keywords/data-center","display_name":"Data center","score":0.4510999917984009},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4072999954223633},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.39820000529289246},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.3734000027179718}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7353000044822693},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.6144000291824341},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.6001999974250793},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5961999893188477},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5295000076293945},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4657000005245209},{"id":"https://openalex.org/C153740404","wikidata":"https://www.wikidata.org/wiki/Q671224","display_name":"Data center","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4117000102996826},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.39820000529289246},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C81877898","wikidata":"https://www.wikidata.org/wiki/Q1965787","display_name":"Network monitoring","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3294999897480011},{"id":"https://openalex.org/C200749887","wikidata":"https://www.wikidata.org/wiki/Q1165574","display_name":"System monitoring","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C119666444","wikidata":"https://www.wikidata.org/wiki/Q5977280","display_name":"Temporal resolution","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28209999203681946},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cloudcom67567.2025.11331534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cloudcom67567.2025.11331534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 lEEE International Conference on Cloud Computing Technology and Science (CloudCom)","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":7,"referenced_works":["https://openalex.org/W1990249073","https://openalex.org/W2040924621","https://openalex.org/W2902702928","https://openalex.org/W2903107001","https://openalex.org/W4401175863","https://openalex.org/W4401752517","https://openalex.org/W4413757557"],"related_works":[],"abstract_inverted_index":{"Active":[0],"probing":[1,21,33,80,123],"in":[2,13,202],"monitoring":[3,112,206],"systems":[4],"is":[5],"widely":[6],"used":[7],"to":[8,54,67,110,191,208],"collect":[9],"network":[10,42],"state":[11],"information":[12],"data":[14,214],"center":[15,215],"networks,":[16],"but":[17,39,71],"designing":[18],"an":[19,118],"effective":[20],"strategy":[22],"involves":[23],"a":[24,92,134,140],"trade-off":[25],"between":[26],"measurement":[27,126],"granularity":[28],"and":[29,37,82,101,116,146,158,174],"system":[30],"overhead.":[31],"High-frequency":[32],"improves":[34],"detection":[35,171],"accuracy":[36,172],"timeliness":[38],"generates":[40,139],"significant":[41],"traffic,":[43],"potentially":[44],"impacting":[45],"normal":[46],"operations.":[47],"Existing":[48],"solutions":[49],"either":[50],"constrain":[51],"probe":[52,65,98,144,186],"rates":[53],"limit":[55],"overhead-at":[56],"the":[57,197,209],"cost":[58,124],"of":[59,143,199,212],"coarse":[60],"temporal":[61,84,102],"granularity-or":[62],"selectively":[63],"reduce":[64],"paths":[66],"lower":[68],"task":[69],"counts,":[70],"still":[72],"rely":[73],"on":[74,129],"fixed-rate":[75],"scheduling,":[76],"which":[77],"introduces":[78],"unnecessary":[79],"traffic":[81],"restricts":[83],"resolution.":[85],"To":[86],"address":[87],"these":[88],"chal-lenges,":[89],"we":[90,132],"propose":[91],"novel":[93],"framework":[94],"that":[95,121,137,166],"jointly":[96],"considers":[97],"path":[99],"selection":[100],"scheduling.":[103],"We":[104],"introduce":[105],"Temporal-<tex":[106,150],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[107,151,155,160],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\alpha$</tex>":[108,152],"Coverage":[109],"quantify":[111],"performance":[113],"over":[114],"time":[115,182],"formulate":[117],"optimization":[119],"problem":[120],"balances":[122],"with":[125],"precision.":[127],"Based":[128],"this":[130],"formulation,":[131],"develop":[133],"heuristic":[135],"algorithm":[136],"efficiently":[138],"minimal":[141],"set":[142],"tasks":[145],"their":[147],"schedules,":[148],"ensuring":[149],"Link-Coverage,":[153],"<tex":[154,159],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\gamma$</tex>":[156],"-Frequency,":[157],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\beta$</tex>":[161],"-Identifiability.":[162],"Extensive":[163],"simulations":[164],"demonstrate":[165],"our":[167,200],"approach":[168],"achieves":[169],"high":[170],"(99%)":[173],"fast":[175],"failure":[176],"localization":[177],"(within":[178],"fewer":[179],"than":[180],"2":[181],"slots),":[183],"while":[184],"reducing":[185],"overhead":[187],"by":[188],"62%":[189],"compared":[190],"state-of-the-art":[192],"algorithms.":[193],"These":[194],"results":[195],"confirm":[196],"effectiveness":[198],"solution":[201],"delivering":[203],"cost-efficient,":[204],"fine-grained":[205],"tailored":[207],"stringent":[210],"requirements":[211],"modern":[213],"networks.":[216]},"counts_by_year":[],"updated_date":"2026-01-22T23:29:09.771500","created_date":"2026-01-21T00:00:00"}