{"id":"https://openalex.org/W2112203058","doi":"https://doi.org/10.1109/infcom.2003.1208666","title":"Robust monitoring of link delays and faults in IP networks","display_name":"Robust monitoring of link delays and faults in IP networks","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2112203058","doi":"https://doi.org/10.1109/infcom.2003.1208666","mag":"2112203058"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2003.1208666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","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/A5063656034","display_name":"Yigal Bejerano","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y. Bejerano","raw_affiliation_strings":["Lucent Technologies, Bell Laboratories, Murray Hill, NJ, USA","Lucent Technol. Bell Labs., Murray Hill, NJ, USa"],"affiliations":[{"raw_affiliation_string":"Lucent Technologies, Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Lucent Technol. Bell Labs., Murray Hill, NJ, USa","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111717871","display_name":"Rajeev Rastogi","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajeev Rastogi","raw_affiliation_strings":["Lucent Technologies, Bell Laboratories, Murray Hill, NJ, USA","Lucent Technol. Bell Labs., Murray Hill, NJ, USa"],"affiliations":[{"raw_affiliation_string":"Lucent Technologies, Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Lucent Technol. Bell Labs., Murray Hill, NJ, USa","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063656034"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":null,"apc_paid":null,"fwci":12.2043,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.98678894,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"1","issue":null,"first_page":"134","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10138","display_name":"Network Traffic and Congestion Control","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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9997000098228455,"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.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6963623762130737},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6331606507301331},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6237198114395142},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.595186710357666},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5858131051063538},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49907422065734863},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4186370372772217},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.402206152677536},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3722589313983917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33931368589401245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25893455743789673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12508007884025574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6963623762130737},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6331606507301331},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6237198114395142},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.595186710357666},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5858131051063538},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49907422065734863},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4186370372772217},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.402206152677536},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3722589313983917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33931368589401245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25893455743789673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12508007884025574},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2003.1208666","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2003.1208666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.5097","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.5097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-infocom.org/2003/papers/04_02.PDF","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W132742350","https://openalex.org/W1543783240","https://openalex.org/W1824518693","https://openalex.org/W1840847875","https://openalex.org/W1948981515","https://openalex.org/W2000261911","https://openalex.org/W2031094253","https://openalex.org/W2067058937","https://openalex.org/W2122551473","https://openalex.org/W2135055886","https://openalex.org/W2139684699","https://openalex.org/W2157054705","https://openalex.org/W2295395236","https://openalex.org/W2489143987","https://openalex.org/W2503900403","https://openalex.org/W3198712592","https://openalex.org/W4244249437","https://openalex.org/W6638641328","https://openalex.org/W6678311596"],"related_works":["https://openalex.org/W2202486749","https://openalex.org/W2383500046","https://openalex.org/W2019216770","https://openalex.org/W1752647939","https://openalex.org/W4376639562","https://openalex.org/W2950944401","https://openalex.org/W2161973620","https://openalex.org/W2044914352","https://openalex.org/W2087937221","https://openalex.org/W238058561"],"abstract_inverted_index":{"In":[0,42],"this":[1],"paper,":[2],"we":[3,49,80],"develop":[4],"failure-resilient":[5],"techniques":[6],"for":[7,131,140,157],"monitoring":[8,29,58],"link":[9,73,96],"delays":[10,97],"and":[11,98,136],"faults":[12],"in":[13,68,76],"a":[14,54,82,127,137],"service":[15],"provider":[16],"or":[17],"enterprise":[18],"IP":[19],"network.":[20],"Our":[21],"two-phased":[22],"approach":[23],"attempts":[24],"to":[25,39,94,152],"minimize":[26],"both":[27,105],"the":[28,35,43,51,69,77,92,106,113,132,141,153],"infrastructure":[30],"costs":[31],"as":[32,34,110,112],"well":[33,111],"additional":[36],"traffic":[37],"due":[38],"probe":[40,86,114,142],"messages.":[41],"first":[44],"phase":[45],"of":[46,53,57,71,85],"our":[47],"approach,":[48],"compute":[50,81],"locations":[52],"minimal":[55,83],"set":[56,84],"stations":[59,93],"such":[60],"that":[61,88,104,125],"all":[62],"network":[63,100],"links":[64],"are":[65,89,117,148],"covered,":[66],"even":[67],"presence":[70],"several":[72],"failures.":[74],"Subsequently,":[75],"second":[78],"phase,":[79],"messages":[87],"transmitted":[90],"by":[91],"measure":[95],"isolate":[99],"faults.":[101],"We":[102,119],"show":[103],"station":[107,133],"selection":[108,134],"problem":[109,116,135],"assignment":[115,143],"NP-hard.":[118],"then":[120],"propose":[121],"greedy":[122],"approximation":[123,129,146],"algorithms":[124],"achieve":[126],"logarithmic":[128],"factor":[130,139],"constant":[138],"problem.":[144],"These":[145],"ratios":[147],"provably":[149],"very":[150],"close":[151],"best":[154],"possible":[155],"bounds":[156],"any":[158],"algorithm.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}