{"id":"https://openalex.org/W2129843861","doi":"https://doi.org/10.1109/infcom.2002.1019334","title":"Optimal configuration of OSPF aggregates","display_name":"Optimal configuration of OSPF aggregates","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2129843861","doi":"https://doi.org/10.1109/infcom.2002.1019334","mag":"2129843861"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2002.1019334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2002.1019334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111810032","display_name":"R. Rastogi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Rastogi","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ","Bell Laboratories, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053675091","display_name":"Yuri Breitbart","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Y. Breitbart","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ","Bell Laboratories, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023079617","display_name":"Minos Garofalakis","orcid":"https://orcid.org/0000-0003-0285-3907"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Garofalakis","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Kumar","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ","Bell Laboratories, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"874","last_page":"882"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9921000003814697,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9921000003814697,"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.9912999868392944,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9909999966621399,"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/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.8998411893844604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7035790681838989},{"id":"https://openalex.org/keywords/subnet","display_name":"Subnet","score":0.6780853271484375},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6657930612564087},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5077594518661499},{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.48216623067855835},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4701271951198578},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.46778640151023865},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4596734642982483},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44133251905441284},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43557208776474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4212590754032135},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4208522439002991},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3467020094394684},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32898110151290894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2953615188598633},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28797584772109985},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.23787373304367065},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.1780393421649933},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08007076382637024}],"concepts":[{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.8998411893844604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7035790681838989},{"id":"https://openalex.org/C21099817","wikidata":"https://www.wikidata.org/wiki/Q7631721","display_name":"Subnet","level":2,"score":0.6780853271484375},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6657930612564087},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5077594518661499},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.48216623067855835},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4701271951198578},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.46778640151023865},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4596734642982483},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44133251905441284},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43557208776474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4212590754032135},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4208522439002991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3467020094394684},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32898110151290894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2953615188598633},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28797584772109985},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.23787373304367065},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.1780393421649933},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08007076382637024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/infcom.2002.1019334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2002.1019334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.3669","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.3669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~minos/Papers/infocom02-cam.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.7028","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7028","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/2002/papers/324.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.4944","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.4944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www1.bell-labs.com/user/minos/Papers/ton03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W198692012","https://openalex.org/W1557418999","https://openalex.org/W2011039300","https://openalex.org/W2096655151","https://openalex.org/W2129843861","https://openalex.org/W2161835730"],"related_works":["https://openalex.org/W2072125400","https://openalex.org/W2962525871","https://openalex.org/W2124145727","https://openalex.org/W2523719706","https://openalex.org/W2586673650","https://openalex.org/W2126978988","https://openalex.org/W2161835730","https://openalex.org/W2167426328","https://openalex.org/W2115563213","https://openalex.org/W2541249923"],"abstract_inverted_index":{"Open":[0],"shortest":[1,36,85,112],"path":[2,37,86],"first":[3,44,169],"(OSPF)":[4],"is":[5,114,142,167],"a":[6,66],"popular":[7],"protocol":[8],"for":[9,69,88,120,131,191],"routing":[10],"within":[11],"an":[12,46,53],"autonomous":[13],"system":[14],"(AS)":[15],"domain.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20,94,147],"address":[21,171],"the":[22,32,58,70,73,79,84,96,106,110,132,138,156,160,168,172,176],"important":[23],"practical":[24,193],"problem":[25,97,134,140],"of":[26,60,98,162,178],"configuring":[27],"OSPF":[28,35,102,179],"aggregates":[29,61,75,103,180],"to":[30,40,62,101,149,154,170,182],"minimize":[31],"error":[33,82,108],"in":[34,78,83,109],"computations":[38,87],"due":[39],"subnet":[41,91],"aggregation.":[42],"We":[43,116],"develop":[45],"optimal":[47,129,190],"dynamic":[48],"programming":[49],"algorithm":[50],"that,":[51,118],"given":[52],"upper":[54],"bound":[55],"k":[56,74],"on":[57,151],"number":[59],"be":[63,136],"advertised":[64],"and":[65,181],"weight-assignment":[67,133,157],"function":[68],"aggregates,":[71],"computes":[72],"that":[76,105,187],"result":[77],"minimum":[80],"cumulative":[81,107,126],"all":[89],"source-destination":[90],"pairs.":[92],"Subsequently,":[93],"tackle":[95],"assigning":[99],"weights":[100],"such":[104],"computed":[111],"paths":[113],"minimized.":[115],"demonstrate":[117],"while":[119],"certain":[121],"special":[122],"cases":[123],"(e.g.,":[124],"unweighted":[125],"error)":[127],"efficient":[128,184],"algorithms":[130,186],"can":[135],"devised,":[137],"general":[139],"itself":[141],"/spl":[143],"Nscr//spl":[144],"Pscr/-hard.":[145],"Consequently,":[146],"have":[148],"rely":[150],"search":[152],"heuristics":[153],"solve":[155],"problem.":[158],"To":[159],"best":[161],"our":[163,165],"knowledge,":[164],"work":[166],"algorithmic":[173],"issues":[174],"underlying":[175],"configuration":[177,185],"propose":[183],"are":[188],"provably":[189],"many":[192],"scenarios.":[194]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}