{"id":"https://openalex.org/W2069991221","doi":"https://doi.org/10.1109/icc.2011.5962965","title":"On the Scalability of Path Exploration Using Opportunistic Path-Vector Routing","display_name":"On the Scalability of Path Exploration Using Opportunistic Path-Vector Routing","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2069991221","doi":"https://doi.org/10.1109/icc.2011.5962965","mag":"2069991221"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5962965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","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/A5011743591","display_name":"Hasan T. Karaoglu","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hasan T. Karaoglu","raw_affiliation_strings":["University of Nevada,\uc2a0Reno, Reno, NV, USA","University of Nevada, Reno, Reno, NV, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"University of Nevada, Reno, Reno, NV, USA#TAB#","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026786267","display_name":"Murat Y\u00fcksel","orcid":"https://orcid.org/0000-0003-0387-7038"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Murat Yuksel","raw_affiliation_strings":["University of Nevada,\uc2a0Reno, Reno, NV, USA","University of Nevada, Reno, Reno, NV, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"University of Nevada, Reno, Reno, NV, USA#TAB#","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082657663","display_name":"Mehmet Hadi G\u00fcne\u015f","orcid":"https://orcid.org/0000-0002-3351-7685"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mehmet H. Gunes","raw_affiliation_strings":["University of Nevada,\uc2a0Reno, Reno, NV, USA","University of Nevada, Reno, Reno, NV, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nevada,\uc2a0Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"University of Nevada, Reno, Reno, NV, USA#TAB#","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":0.572,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.59500794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9995999932289124,"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.7804315090179443},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.7229908108711243},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6731293201446533},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.6677405834197998},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6661441922187805},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6097926497459412},{"id":"https://openalex.org/keywords/border-gateway-protocol","display_name":"Border Gateway Protocol","score":0.5401666760444641},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4757506549358368},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4574427604675293},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4211430549621582}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7804315090179443},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.7229908108711243},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6731293201446533},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.6677405834197998},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6661441922187805},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6097926497459412},{"id":"https://openalex.org/C178086212","wikidata":"https://www.wikidata.org/wiki/Q11155","display_name":"Border Gateway Protocol","level":5,"score":0.5401666760444641},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4757506549358368},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4574427604675293},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4211430549621582},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2011.5962965","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.6896","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.6896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unr.edu/~mgunes/papers/ICC11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307108","display_name":"Deloitte","ror":"https://ror.org/03xkm6e60"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1572272766","https://openalex.org/W1977572424","https://openalex.org/W2051466130","https://openalex.org/W2083793737","https://openalex.org/W2104941874","https://openalex.org/W2106324434","https://openalex.org/W2107527903","https://openalex.org/W2134511866","https://openalex.org/W2147575919","https://openalex.org/W2155952763","https://openalex.org/W2158988339","https://openalex.org/W6676127679"],"related_works":["https://openalex.org/W2030140188","https://openalex.org/W288328875","https://openalex.org/W1534342069","https://openalex.org/W2108305519","https://openalex.org/W1558646768","https://openalex.org/W1242343826","https://openalex.org/W1971663816","https://openalex.org/W4241849776","https://openalex.org/W2113362813","https://openalex.org/W2182195922"],"abstract_inverted_index":{"It":[0],"can":[1,96,152],"be":[2,97],"argued":[3],"that,":[4],"BGP,":[5],"de-facto":[6],"inter-domain":[7,77],"routing":[8,69,79,86,118],"protocol,":[9],"provides":[10,63],"fairly":[11],"stable":[12],"routes.":[13],"Path":[14],"stability":[15],"is":[16,83],"a":[17,89,102,128],"desired":[18],"product":[19],"of":[20,24,27,46,91],"that":[21,124,150],"limited":[22],"level":[23,78],"deterministic":[25],"performance":[26,32],"BGP.":[28],"To":[29],"attain":[30],"this":[31,53],"level,":[33],"BGP":[34],"relies":[35],"on":[36,112,144],"keeping":[37],"up-to-date":[38],"(aggregated)":[39],"global":[40,103],"information":[41],"by":[42],"incurring":[43],"the":[44],"cost":[45],"control":[47,161],"traffic":[48,162],"and":[49,71,133],"delayed":[50],"convergence.":[51],"In":[52],"work,":[54],"we":[55],"developed":[56],"an":[57],"Opportunistic":[58],"Path-Vector":[59],"(OPVR)":[60],"protocol":[61],"which":[62,95],"nice":[64],"trade-offs":[65],"between":[66,131],"path":[67,72,156],"stability,":[68],"scalability":[70,132],"quality":[73],"to":[74,84,114],"enable":[75],"flexible":[76],"services.":[80],"Our":[81,121,140],"approach":[82],"redefine":[85],"problem":[87],"as":[88],"set":[90],"smaller":[92],"scale":[93],"problems":[94,119],"solved":[98],"locally":[99],"without":[100],"requiring":[101],"coordination":[104],"but":[105],"local":[106],"communication.":[107],"We":[108],"also":[109],"provide":[110,127,153],"guidelines":[111],"how":[113],"solve":[115],"these":[116],"localized":[117],"efficiently.":[120],"analysis":[122],"show":[123,148],"our":[125],"method":[126],"good":[129],"compromise":[130],"opportunity":[134],"through":[135],"smartly":[136],"randomized":[137],"(non-deterministic)":[138],"choices.":[139],"experiments":[141],"with":[142,159],"OPVRs":[143,151],"Internet":[145],"AS-level":[146],"topology":[147],"us":[149],"non-deterministic,":[154],"scalable":[155],"exploration":[157],"mechanisms":[158],"reasonable":[160],"cost.":[163]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}