Network Layer, Router

gmkimยท2023๋…„ 12์›” 5์ผ
0

Network

๋ชฉ๋ก ๋ณด๊ธฐ
6/9
post-thumbnail

๐Ÿ“ŒNetwork Layer

  • transport segment from sending to receiving host

    • sender: encapsulates segments into datagrams, passes to link layer
    • receiver: delivers segments to transport layer protocol
  • network layer protocols in every Internet device: hosts, routers

Network Layer ํ•ต์‹ฌ ๊ธฐ๋Šฅ

Forwarding

HW; Data Plane ์˜์—ญ

  • move packets from a routerโ€™s input link to appropriate router output link

Routing

SW; Control Plane ์˜์—ญ

  • determine route taken by packets from source to destination

Data Plane & Control Plane

  • Data Plane : ํŒจํ‚ท ์†ก์ˆ˜์‹  ๊ธฐ๋Šฅ ๋‹ด๋‹น. (forwarding ๊ธฐ๋Šฅ)
    • local, per-router function
    • determines how datagram arriving on router input port is forwarded to router output port
  • Control Plane : ํŒจํ‚ท ๊ฒฝ๋กœ ์„ค์ •, ๊ด€๋ฆฌ ๋ฐ ์ œ์–ดํ•˜๋Š” ๊ธฐ๋Šฅ ๋‹ด๋‹น. (routing ๊ธฐ๋Šฅ)
    • network-wide logic
    • determines how datagram is routed among routers along end-end path from source host to destination host
    • 2๊ฐ€์ง€ Control plane์— ๋Œ€ํ•œ ์ ‘๊ทผ:
      • ์ „ํ†ต์  ๋ผ์šฐํŒ… ์•Œ๊ณ ๋ฆฌ์ฆ˜ : ๋ผ์šฐํ„ฐ ์•ˆ์—์„œ forwarding, routing ๋ชจ๋‘ ๋‹ค ํ•จ
      • SDN(Software-defined network) : ์˜ค๋ฒ„ํ—ค๋“œ๊ฐ€ ํฐ routing์„ ๋”ฐ๋กœ ๋ถ„๋ฆฌํ•˜์—ฌ remote-server์—์„œ ๊ด€๋ฆฌ

Per-router Control Plane

์˜ˆ์ „ ๋ฐฉ์‹

Individual routing algorithm components in each and every router interact in the control plane

์—…๋กœ๋“œ์ค‘..

Logically Centralized Control Plane

์ตœ๊ทผ ๋ฐฉ์‹

A remote controller computes, installs forwarding tables in routers by interacting with local control agents (CAs)

์—…๋กœ๋“œ์ค‘..

Network Layer Service Model

defines the characteristics of e2e transport of packets between sending & receiving hosts


๐Ÿ“ŒRouter

์—…๋กœ๋“œ์ค‘..

์—…๋กœ๋“œ์ค‘..

Input Port : Data Plane

์—…๋กœ๋“œ์ค‘..

  • Decentralized switching:
    • Given datagram, using header field(dest. IP addr.) values, lookup output port using forwarding table in input port memory (โ€œmatch plus actionโ€)
    • Goal: complete input port processing at โ€˜line speedโ€™
    • Input port queuing: if datagrams arrive faster than forwarding rate into switch fabric (if the switch fabric is not fast enough, then input queueing delay or loss due to buffer overflow)

Destination-based Forwarding

Based only on destination IP address (traditional)

Generalized Forwarding

Based on any set of header field values

Switching Fabrics : Data Plane

์—…๋กœ๋“œ์ค‘..

  • transfer packet from input buffer to appropriate output buffer
  • switching rate: rate at which packets can be transfer from inputs to outputs
    • N inputs: switching rate N times line rate (R) desirable
    • often measured as multiple of input/output line rate (NR)

Switching via Memory

Switching via Bus

Switching via Interconnection (Crossbar)

Output Port

์—…๋กœ๋“œ์ค‘..

  • Buffering required when datagrams arrive from fabric faster than link transmission rate. Drop policy: which datagrams to drop if no free buffers?

    • Datagrams can be lost due to congestion, lack of buffers
  • Scheduling discipline chooses among queued datagrams for transmission

    • Priority scheduling โ€“ who gets best performance, network neutrality

Output Port Queueing โ†’ Buffering

Scheduling Mechanism

Priority

RR Scheduling

Weightened Fair Queuing (WFQ)

profile
๐ŸŒŠ Flooding loads of work

0๊ฐœ์˜ ๋Œ“๊ธ€