{"id":"https://openalex.org/W2509851194","doi":"https://doi.org/10.17487/rfc9107","title":"BGP Optimal Route Reflection (BGP ORR)","display_name":"BGP Optimal Route Reflection (BGP ORR)","publication_year":2021,"publication_date":"2021-08-01","ids":{"openalex":"https://openalex.org/W2509851194","doi":"https://doi.org/10.17487/rfc9107","mag":"2509851194"},"language":"en","primary_location":{"id":"doi:10.17487/rfc9107","is_oa":false,"landing_page_url":"https://doi.org/10.17487/rfc9107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"report"},"type":"report","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/A5096846103","display_name":"C. Cassar","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"C. Cassar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5096846104","display_name":"E. \u00c5man","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E. \u00c5man","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5034330479","display_name":"K. Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. Wang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5096846103"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"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.9944000244140625,"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.9944000244140625,"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/T10651","display_name":"IPv6, Mobility, Handover, Networks, Security","score":0.9821000099182129,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9708999991416931,"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/reflection","display_name":"Reflection (computer programming)","score":0.6259998083114624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5134037733078003}],"concepts":[{"id":"https://openalex.org/C65682993","wikidata":"https://www.wikidata.org/wiki/Q1056451","display_name":"Reflection (computer programming)","level":2,"score":0.6259998083114624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5134037733078003},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.17487/rfc9107","is_oa":false,"landing_page_url":"https://doi.org/10.17487/rfc9107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880"],"abstract_inverted_index":{"This":[0,41,51],"document":[1],"proposes":[2],"a":[3,85],"solution":[4,52,63],"for":[5,16,43,97],"BGP":[6],"route":[7,59,120],"reflectors":[8,67],"to":[9,11,36],"allow\nthem":[10],"choose":[12],"the":[13,20,26,90,95],"best":[14,45],"path":[15,76,108],"their":[17],"clients":[18,99],"that":[19],"clients\nthemselves":[21],"would":[22],"have":[23],"chosen":[24],"under":[25],"same":[27,96],"conditions,":[28],"without\nrequiring":[29],"further":[30],"state":[31],"or":[32,100,104],"any":[33],"new":[34],"features":[35],"be":[37,94,112],"placed":[38],"on":[39,84],"the\nclients.":[40],"facilitates,":[42],"example,":[44],"exit":[46],"point":[47],"policy":[48],"(hot\npotato":[49],"routing).":[50],"is":[53,78],"primarily":[54],"applicable":[55],"in":[56,80,89,118],"deployments\nusing":[57],"centralized":[58],"reflectors.":[60],"The":[62],"relies":[64],"upon":[65],"all\nroute":[66],"learning":[68],"all":[69,98],"paths":[70],"which":[71],"are":[72],"eligible":[73],"for\nconsideration.":[74],"Best":[75,107],"selection":[77,109],"performed":[79,113],"each":[81,119],"route\nreflector":[82],"based":[83,114],"configured":[86,116],"virtual":[87],"location":[88],"IGP.":[91],"The\nlocation":[92],"can":[93,110],"different":[101],"per":[102,105],"peer/update\ngroup":[103],"peer.":[106],"also":[111],"on\nuser":[115],"policies":[117],"reflector.":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
