Publication:
TOWARD SAFE AND VERIFIABLE INTER-DOMAIN ROUTING

Simple item page
dc.contributor.advisorLixin Gao
dc.contributor.advisorHossein Pishro-Nik
dc.contributor.advisorArun Venkataramani
dc.contributor.advisorDaniel Holcomb
dc.contributor.authorShao, Xiaozhe
dc.contributor.departmentUniversity of Massachusetts Amherst
dc.date2024-03-27T17:54:56.000
dc.date.accessioned2024-04-26T15:52:32Z
dc.date.available2024-04-26T15:52:32Z
dc.date.submittedFebruary
dc.date.submitted2022
dc.description.abstractInterdomain routing enables each autonomous system (AS) to decide the routes toward any destination and exchange routing information with its neighboring ASs on the Internet. The Border Gateway Protocol (BGP), as the de facto routing protocol for interdomain routing, allows the administrators/operators to independently decide the routing policies for their ASs and each AS to select routes to destinations based on the locally determined routing policies. The Internet has evolved from a hierarchical and multi-tiered interconnection network to a meshed network, where ASs are interconnected with a dense topology and more and more potential paths can be used to reach a destination. Although each AS has the freedom to set up its routing policies, it is challenging to understand how a network’s routing policies might impact the resulting routing system. On one hand, the freedom in configuring local routing policies might jeopardize the safeness of the routing system. That is, configuring routing policies without constraints or coordination among ASs causes persistent interdomain routing oscillations on the Internet. On the other hand, these independently configured routing policies might not necessarily meet the intent of the network administrators/operators. Therefore, it is essential to ensure that the routing system is guaranteed to converge and to know whether the routing system satisfies the routing intent of network administrators/operators. This research aims to improve the understanding of the routing systems that are derived from the locally determined routing policies. To do that, three interesting topics are explored in this dissertation: (1) policy-rich interdomain routing through local coordination, (2) verifying inter-domain routing at Internet scale, (3) routing policy anonymization for verification.
dc.description.degreeDoctor of Philosophy (PhD)
dc.description.departmentElectrical and Computer Engineering
dc.identifier.doihttps://doi.org/10.7275/26245891.0
dc.identifier.orcidhttps://orcid.org/0000-0001-6097-5713
dc.identifier.urihttps://hdl.handle.net/20.500.14394/18806
dc.relation.urlhttps://scholarworks.umass.edu/cgi/viewcontent.cgi?article=3481&context=dissertations_2&unstamped=1
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.source.statuspublished
dc.subjectComputer Networks
dc.subjectInter-domain Routing
dc.subjectNetwork Verification
dc.subjectRouting Oscillation
dc.subjectUtility-preserving Anonymization
dc.subjectOS and Networks
dc.titleTOWARD SAFE AND VERIFIABLE INTER-DOMAIN ROUTING
dc.typeopenaccess
dc.typearticle
dc.typedissertation
digcom.contributor.authorisAuthorOfPublication|email:sxz1069@gmail.com|institution:University of Massachusetts Amherst|Shao, Xiaozhe
digcom.identifierdissertations_2/2473
digcom.identifier.contextkey26245891
digcom.identifier.submissionpathdissertations_2/2473
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
dissertation.pdf
Size:
3.84 MB
Format:
Adobe Portable Document Format
Name: dissertation.pdf
Size: 3.84 MB
Kind: Adobe PDF
Collections
Dissertations