{"id":"https://openalex.org/W2115720304","doi":"https://doi.org/10.1109/icnp.2003.1249771","title":"An efficient algorithm for OSPF subnet aggregation","display_name":"An efficient algorithm for OSPF subnet aggregation","publication_year":2004,"publication_date":"2004-06-21","ids":{"openalex":"https://openalex.org/W2115720304","doi":"https://doi.org/10.1109/icnp.2003.1249771","mag":"2115720304"},"language":"en","primary_location":{"id":"doi:10.1109/icnp.2003.1249771","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2003.1249771","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","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/A5101433738","display_name":"Aman Shaikh","orcid":"https://orcid.org/0000-0001-5745-7915"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Shaikh","raw_affiliation_strings":["Computer Engineering, University of California, Santa Cruz, CA, USA","Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100408271","display_name":"Dongmei Wang","orcid":"https://orcid.org/0000-0001-7629-7857"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dongmei Wang","raw_affiliation_strings":["AT and T Research Laboratories, Florham Park, NJ, USA","AT&T Labs--Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs--Research","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062105912","display_name":"Guangzhi Li","orcid":"https://orcid.org/0009-0004-9197-7737"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guangzhi Li","raw_affiliation_strings":["AT and T Research Laboratories, Florham Park, NJ, USA","AT&T Labs--Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs--Research","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077473264","display_name":"Jennifer Yates","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Yates","raw_affiliation_strings":["AT and T Research Laboratories, Florham Park, NJ, USA","AT&T Labs--Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs--Research","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068255100","display_name":"Charles Kalmanek","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Kalmanek","raw_affiliation_strings":["AT and T Research Laboratories, Florham Park, NJ, USA","AT&T Labs--Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT and T Research Laboratories, Florham Park, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs--Research","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.499,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73924105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"209"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7787027359008789},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.7421301603317261},{"id":"https://openalex.org/keywords/subnet","display_name":"Subnet","score":0.6520841121673584},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6169162392616272},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5592063665390015},{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.5566020011901855},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4956780672073364},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4730474352836609},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4650574326515198},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4534008204936981},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.4340091347694397},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4323870539665222},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42880114912986755},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.42843097448349},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.37684953212738037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36827346682548523},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3669580817222595},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.33217692375183105},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.18370401859283447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18212687969207764},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17299777269363403},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16060054302215576},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08559104800224304}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7787027359008789},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.7421301603317261},{"id":"https://openalex.org/C21099817","wikidata":"https://www.wikidata.org/wiki/Q7631721","display_name":"Subnet","level":2,"score":0.6520841121673584},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6169162392616272},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5592063665390015},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.5566020011901855},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4956780672073364},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4730474352836609},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4650574326515198},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4534008204936981},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.4340091347694397},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4323870539665222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42880114912986755},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.42843097448349},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.37684953212738037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36827346682548523},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3669580817222595},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.33217692375183105},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.18370401859283447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18212687969207764},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17299777269363403},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16060054302215576},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08559104800224304},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icnp.2003.1249771","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2003.1249771","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"11th IEEE International Conference on Network Protocols, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.1300","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.1300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-icnp.org/2003/papers/6-3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.524.9876","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.524.9876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.research.att.com/~ashaikh/papers/ospf-aggr-icnp03.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/W1557418999","https://openalex.org/W2129843861","https://openalex.org/W2168065751","https://openalex.org/W2169528473","https://openalex.org/W2248064281","https://openalex.org/W6691190440"],"related_works":["https://openalex.org/W2161835730","https://openalex.org/W2165808384","https://openalex.org/W2129550502","https://openalex.org/W2092513144","https://openalex.org/W4308805336","https://openalex.org/W4318147792","https://openalex.org/W2115720304","https://openalex.org/W4360831358","https://openalex.org/W3111684308","https://openalex.org/W135180951"],"abstract_inverted_index":{"Multiple":[0],"addresses":[1],"within":[2],"an":[3,118,151],"OSPF":[4,41,168],"area":[5,152,160],"can":[6,102,147],"be":[7,103],"aggregated":[8],"and":[9,22,30,33,55,78,86,184],"advertised":[10],"together":[11],"to":[12,25,34,52,99,129],"other":[13,171],"areas.":[14],"This":[15,88],"process":[16],"is":[17,23,48,143,173,211],"known":[18],"as":[19,220,222],"address":[20,46],"aggregation":[21,47],"used":[24],"reduce":[26,35],"router":[27],"computational":[28],"overheads":[29],"memory":[31],"requirements":[32],"the":[36,71,74,79,92,109,115,123,156,159,167,175,180,185,188,196,209,215],"network":[37,145],"bandwidth":[38],"consumed":[39],"by":[40,219],"messages.":[42],"The":[43,64,170,192],"downside":[44],"of":[45,61,73,126,140,158,166,182,213,217,230],"that":[49,91,121,144,174,205],"it":[50],"leads":[51],"information":[53],"loss":[54],"consequently":[56],"sub-optimal":[57],"(non-shortest":[58],"path)":[59],"routing":[60],"data":[62],"packets.":[63],"resulting":[65],"difference":[66],"(path":[67],"selection":[68,94,134,190,233],"error)":[69],"between":[70,83,179],"length":[72],"actual":[75],"forwarding":[76],"path":[77,81,93,133,189,232],"shortest":[80],"varies":[82],"different":[84],"sources":[85],"destinations.":[87],"paper":[89,116,193],"proves":[90],"error":[95],"from":[96],"any":[97,100],"source":[98],"destination":[101,110],"bounded":[104],"using":[105],"only":[106,225],"parameters":[107],"describing":[108],"area.":[111],"Based":[112],"on":[113,155,187,199],"this,":[114],"presents":[117],"efficient":[119],"algorithm":[120,142,176,210],"generates":[122],"minimum":[124],"number":[125,181,216],"aggregates":[127,149,183,218],"subject":[128],"a":[130,226],"maximum":[131,231],"allowed":[132],"error.":[135,191,234],"A":[136],"major":[137],"operational":[138],"benefit":[139,172],"our":[141],"administrators":[146],"select":[148],"for":[150],"based":[153],"solely":[154],"topology":[157],"without":[161],"worrying":[162],"about":[163],"remaining":[164],"areas":[165],"network.":[169],"enables":[177],"trade-offs":[178],"bound":[186],"also":[194],"evaluates":[195],"algorithm's":[197],"performance":[198],"random":[200],"topologies.":[201],"Our":[202],"results":[203],"show":[204],"in":[206],"some":[207],"cases,":[208],"capable":[212],"reducing":[214],"much":[221],"50%":[223],"with":[224],"relatively":[227],"small":[228],"introduction":[229]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}