{"id":"https://openalex.org/W23113228","doi":null,"title":"A FRAMEWORK FOR PERFORMANCE CHARACTERIZATION AND ENHANCEMENT OF THE OSPF ROUTING PROTOCOL","display_name":"A FRAMEWORK FOR PERFORMANCE CHARACTERIZATION AND ENHANCEMENT OF THE OSPF ROUTING PROTOCOL","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W23113228","mag":"23113228"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.3096","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.3096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.ryerson.ca/~jaseem/OSPF_euroIMSA05.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5017149914","display_name":"Hesham El\u2010Sayed","orcid":"https://orcid.org/0000-0002-7488-0915","observed_orcids":["https://orcid.org/0000-0002-7488-0915","https://orcid.org/0000-0003-3341-937X"]},"institutions":[{"id":"https://openalex.org/I201726411","display_name":"United Arab Emirates University","ror":"https://ror.org/01km6p862","country_code":"AE","type":"education","lineage":["https://openalex.org/I201726411"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"H. El-sayed","raw_affiliation_strings":["United Arab Emirates University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"United Arab Emirates University","institution_ids":["https://openalex.org/I201726411"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024698376","display_name":"Maamoun Ahmed","orcid":"https://orcid.org/0000-0001-8808-4576","observed_orcids":["https://orcid.org/0000-0001-8808-4576"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Ahmed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088631236","display_name":"Muhammad Jaseemuddin","orcid":"https://orcid.org/0000-0003-4511-1436","observed_orcids":["https://orcid.org/0000-0003-4511-1436"]},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. Jaseemuddin","raw_affiliation_strings":["(Ryerson University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(Ryerson University","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036878532","display_name":"Dorina Corina Petriu","orcid":"https://orcid.org/0000-0003-4688-9370","observed_orcids":["https://orcid.org/0000-0003-4688-9370"]},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"D. Petriu","raw_affiliation_strings":["(Carleton University)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(Carleton University)","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9965999722480774,"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.9965999722480774,"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/T12127","display_name":"Software System Performance and Reliability","score":0.0007999999797903001,"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.00039999998989515007,"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/ospf","display_name":"OSPF","score":0.9860000014305115},{"id":"https://openalex.org/keywords/interior-gateway-protocols","display_name":"interior gateway protocols","score":0.7080000042915344},{"id":"https://openalex.org/keywords/routing-protocol-performance","display_name":"routing protocol performance","score":0.6470000147819519},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.890999972820282},{"id":"https://openalex.org/keywords/routing-convergence-time","display_name":"routing convergence time","score":0.8069999814033508},{"id":"https://openalex.org/keywords/routing-protocol-optimization","display_name":"routing protocol optimization","score":0.5899999737739563},{"id":"https://openalex.org/keywords/data-structures","display_name":"data structures","score":0.4560000002384186}],"concepts":[{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.8922312259674072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7979412078857422},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5846090912818909},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5764607191085815},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.575724720954895},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4728791117668152},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4523310959339142},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.43436452746391296},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.42897775769233704},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.42895835638046265},{"id":"https://openalex.org/C144674526","wikidata":"https://www.wikidata.org/wiki/Q5688460","display_name":"Hazy Sighted Link State Routing Protocol","level":5,"score":0.4128563106060028},{"id":"https://openalex.org/C52837422","wikidata":"https://www.wikidata.org/wiki/Q431028","display_name":"Interior gateway protocol","level":5,"score":0.4124303162097931},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3682015538215637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11226731538772583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.3096","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.3096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.ryerson.ca/~jaseem/OSPF_euroIMSA05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1273397165","https://openalex.org/W1557418999","https://openalex.org/W2062939617","https://openalex.org/W2126863958","https://openalex.org/W2150519657","https://openalex.org/W2169528473","https://openalex.org/W2234903813","https://openalex.org/W2248064281","https://openalex.org/W2415532514"],"related_works":["https://openalex.org/W2036159655","https://openalex.org/W2123529252","https://openalex.org/W1605483777","https://openalex.org/W2105037085","https://openalex.org/W2392952148","https://openalex.org/W2131197566","https://openalex.org/W4239829907","https://openalex.org/W7096802195","https://openalex.org/W2367002942","https://openalex.org/W3199348078"],"abstract_inverted_index":{"Open":[0],"Shortest":[1,115],"Path":[2,116],"First":[3,117],"(OSPF)":[4],"is":[5,135],"a":[6,60,77],"popular":[7],"Interior":[8],"Gateway":[9],"Protocol":[10],"widely":[11],"used":[12],"inside":[13],"large":[14],"IP":[15],"routing":[16,54,66],"domains.":[17],"Recent":[18],"studies":[19],"have":[20],"shown":[21],"that":[22],"the":[23,41,49,52,107],"time":[24],"consumed":[25],"by":[26,129,137],"local":[27],"SPF":[28,151],"computations":[29],"must":[30],"be":[31],"controlled":[32,78],"to":[33,72,96,123,148],"achieve":[34,124],"millisecond":[35],"convergence":[36],"time.":[37],"This":[38],"paper":[39],"presents":[40],"authors":[42],"'":[43],"experience":[44],"in":[45,76,127],"measuring":[46],"and":[47,84,101,143],"improving":[48],"performance":[50,62,67,90,108,128],"of":[51,91,110],"OSPF":[53],"protocol":[55],"software.":[56],"First,":[57],"we":[58,87,105],"propose":[59],"reusable":[61],"characterization":[63],"framework":[64],"for":[65,140],"study,":[68],"which":[69],"allowed":[70],"us":[71],"perform":[73],"reproducible":[74],"experiments":[75],"environment":[79],"with":[80],"different":[81],"network":[82],"topologies":[83],"workloads.":[85],"Then":[86],"present":[88,106],"relative":[89],"several":[92],"low-level":[93],"optimizations":[94],"suggested":[95],"optimize":[97],"route":[98],"computation":[99],"code":[100,141],"data":[102,146],"structures.":[103],"Finally,":[104],"benefit":[109],"algorithm-level":[111],"optimization":[112,142],"using":[113,130,144],"Incremental":[114],"algorithm":[118],"(ISPF).":[119],"We":[120],"are":[121],"able":[122],"substantial":[125],"gains":[126],"ISPF,":[131],"more":[132],"than":[133],"what":[134],"possible":[136],"employing":[138],"techniques":[139],"efficient":[145],"structures":[147],"implement":[149],"Dijkstra's":[150],"(DSPF)":[152],"algorithm.":[153]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}