kth.sePublications KTH
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Evaluating Simulation Accuracy for Suboptimal BGP Routing in IP Anycast: A Case Study of I-root
KTH, School of Electrical Engineering and Computer Science (EECS).
2026 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Utvärdering av simuleringsnoggrannhet för suboptimal BGP‑routing i IP‑Anycast : En fallstudie av I-root (Swedish)
Abstract [en]

The I-root, managed by Netnod, achieves robust global availability through the use of Internet Protocol (IP) Anycast. Inter-domain routing, which is governed by routers employing the Border Gateway Protocol (BGP) protocol, is primarily determined by BGP attributes and administrative policies rather than by real-time performance metrics such as latency. Specifically, routing decisions are based on rules such as local preference that prioritizes certain exit points and AS-Path length that which selects the path with the fewest AS hops. Router-specific mechanisms such as longest prefix matching directs traffic to the most specific IP blocks which can also influence the routing. This can result situations with suboptimal routing, where traffic is directed to distant nodes despite the presence of closer alternatives. This thesis investigates whether publicly available data sources construct a comprehensive understanding of these routing scenarios and evaluates the accuracy of network simulations in replicating them. By utilizing RIPE Atlas measurements, Autonomous System (AS)-specific Looking Glasses (LGs), and other publicly available sources, three real-world cases were constructed based on instances of suboptimal routing in regions with high availability. These cases were subsequently reconstructed in a controlled simulation environment using Netlab and FRRouting. The findings shows that public data are generally sufficient for identifying and modeling certain routing behaviors. The simulations closely reflected real-world routing behavior, with only minor discrepancies related to undisclosed internal BGP configurations. In summary, this research demonstrates that network emulators are effective tools for operators when aiming to analyze and optimize internet infrastructures without risking live network stability.

Abstract [sv]

I-root, som drivs av Netnod, uppnår robust global tillgänglighet genom användning av IP Anycast. Routing mellan domäner, som styrs av routrar som tillämpar BGP, avgörs främst av BGP-attribut och administrativa policyer snarare än av prestandamått i realtid såsom latens. Specifikt baseras routningsbeslut på regler såsom “local preference” som sätter prioritering för vissa exitpunkter och AS-Path-längd, som väljer den väg med minst antal AS-hopp. Routerspecifika mekanismer såsom längsta prefixmatchning styr trafiken till de mest specifika IP-blocken vilket också kan påverka routingen. Detta kan leda till situationer med suboptimal routing, där trafik dirigeras till avlägsna noder trots att närmare alternativ finns. Detta examensarbete undersöker om publikt tillgängliga datakällor möjliggör en fullständig förståelse av dessa routningsscenarier och utvärderar hur väl nätverkssimuleringar kan replikera dem. Genom att använda RIPE Atlas-mätningar, AS-specifika LGs och andra publika källor konstruerades tre verkliga fall baserade på tillfällen då suboptimal routing sker i områden med hög tillgänglighet. Dessa fall återskapades sedan i en kontrollerad simuleringsmiljö med hjälp av Netlab och FRRouting. Resultaten visar att publika data är relativt tillräckligt för att identifiera och modellera ett visst routningsbeteende. Simuleringarna återspeglade verkligt routningsbeteende väl, med endast mindre avvikelser kopplade till icke-publika interna BGP-konfigurationer. Sammanfattningsvis visar denna forskning att nätverksemulatorer är effektiva för operatörer som vill analysera och optimera internet infrastrukturer utan att riskera nätverk stabiliteten.

Place, publisher, year, edition, pages
2026. , p. 68
Series
TRITA-EECS-EX ; 2026:397
Keywords [en]
Routing, IP Anycast, BGP Path Selection, Anycast Catchment, Routing Instability, Latency Inflation, Peering Strategies, Internet Exchange Points, BGP Tie-breaking, BGP Attributes
Keywords [sv]
Routing, IP-anycast, BGP-ruttval, Anycast-upptagningsområde, Routinginstabilitet, Latensinflation, Peeringstrategier, Internetknutpunkter, BGP-tie-breaking, BGP-attribut
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-391263OAI: oai:DiVA.org:kth-391263DiVA, id: diva2:2112303
External cooperation
Netnod AB
Educational program
Bachelor of Science in Engineering - Computer Engineering
Supervisors
Examiners
Available from: 2026-11-03 Created: 2026-10-22 Last updated: 2026-11-03Bibliographically approved

Open Access in DiVA

fulltext(1761 kB)35 downloads
File information
File name FULLTEXT01.pdfFile size 1761 kBChecksum SHA-512
caa924f7fa68216cc218111e5662a0e909b7fd7a35101eec74941e424266611ad8f3111e0a9d4b4219245adf4ee429382e14e88f0385229e960d125f08ff527b
Type fulltextMimetype application/pdf

By organisation
School of Electrical Engineering and Computer Science (EECS)
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 35 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 1659 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf