λ³Έλ¬Έ λ°”λ‘œκ°€κΈ°
⭐ Group_Study/Networking

[7μ£Όμ°¨] Hierarchical Routing

by ν¬μŠ€νŠΈμ‰μ΄ν¬ 2022. 11. 9.

Hierarchical Routing

Interconnected ASes


βœ” AS(Autonomous Systems): 각각의 λ„€νŠΈμ›Œν¬λ“€ λ‚΄λΆ€λŠ” 독립적인(자체적인) λΌμš°νŒ… μ‹œμŠ€ν…œ(μ•Œκ³ λ¦¬μ¦˜)을 가진닀.
βœ” λ„€νŠΈμ›Œν¬λ“€μ€ λ‹€μ‹œ κ³„μΈ΅μ μœΌλ‘œ μ—°κ²°λ˜μ–΄μžˆλ‹€.

Intra-AS routing

βœ” AS λ‚΄λΆ€μ—μ„œ λ™μž‘ν•˜λŠ” λΌμš°νŒ… ν”„λ‘œν† μ½œ
βœ” Distance Vector, Link State
βœ” μ΅œμ†Œ λΉ„μš©, μ΅œλ‹¨ κ²½λ‘œλΌλŠ” ν™•μ‹€ν•œ λͺ©μ 

Inter-AS routing

βœ” κ³„μΈ΅μ μœΌλ‘œ μ—°κ²°λœ AS듀을 μž‡λŠ” λΌμš°νŒ… ν”„λ‘œν† μ½œ
βœ” Hierarchical routing (BGP)
βœ” μ •μΉ˜μ , 경제적 μ΄μœ λ“€λ‘œ μ΅œλ‹¨/μ΅œμ†ŒλΉ„μš© 경둜 λͺ©μ  x

Relationships Between Networks

Provider - Customer 관계


βœ” AS 사이에도 Provider - Customer 관계가 μ‘΄μž¬ν•œλ‹€.
βœ” μƒλŒ€μ μΈ 관계!

Peer-Peer 관계


βœ” λ‘˜μ΄ λΉ„μŠ·ν•œ 관계일 경우 (ex - 두 톡신사 κ°„ 관계)



βœ” 검은색 점선은 경제적 λ…Όλ¦¬λ‘œ 인해 연결이 λ˜μ§€ μ•ŠλŠ”λ‹€.(이득이 μ—†μŒ)


βœ” ν•΄λ‹Ή 검은색 점선을 μ΄μ–΄μ£ΌλŠ” 게 BGP!

BGP

κ°œμš”

βœ” BGP - Border Gateway Protocol
βœ” Policy Based routing protocol

ex) AT&T Research-> Samsung Electronics


βœ” λ§Žμ€ 고객을 얻을 수 μžˆλŠ” path 선택
βœ” 경둜λ₯Ό 선택할 λ•Œ path λ‚΄μ˜ λ„€νŠΈμ›Œν¬ host도 κ³ λ €ν•΄μ„œ νŒλ‹¨ν•˜κ²Œ λœλ‹€(Policy Based).
βœ” Customer > Peer > Provider

Many choices


βœ” μ΅œλ‹¨ κ²½λ‘œκ°€ μ•„λ‹ˆλΌ μžμ‹ μ΄ providerκ°€ λ˜λ„λ‘ ν•˜λŠ” pathλ₯Ό μ„ νƒν•œλ‹€.

βœ” κ²°κ΅­ BGPλŠ” μ΅œλ‹¨/μ΅œμ†ŒλΉ„μš© κ²½λ‘œκ°€ μ•„λ‹Œ 경제적/정책적 μš”μΈλ“€μ„ κ³ λ €ν•œ 경둜λ₯Ό κ²°μ •ν•œλ‹€.

'⭐ Group_Study > Networking' μΉ΄ν…Œκ³ λ¦¬μ˜ λ‹€λ₯Έ κΈ€

[8μ£Όμ°¨] LANs: Ethernet  (0) 2022.11.16
[8μ£Όμ°¨] Link Layer : Introduction  (0) 2022.11.15
[7μ£Όμ°¨] Routing Algorithm: Distance Vector Algorithm  (0) 2022.11.08
[6μ£Όμ°¨] Routing Algorithm : Link State  (1) 2022.11.03
[6μ£Όμ°¨] ICMP, IPv6  (0) 2022.11.01

λŒ“κΈ€