Network Layer I Flashcards

To understand: • The Network layer key functions • Forwarding / Routing • Routing algorithms

1
Q

what is the Network layer

A
  • Network layer protocol provides for logical communication between hosts.
  • The network layer can be decomposed into two interacting parts, the data plane
    and the control plane.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is the data plane

A
  • The data plane functions include per-router functions in the network layer that
    determine how a datagram arriving on one of a router’s input links is forwarded
    to one of that router’s output links
  • Traditionally, the control plane routing protocols and the data plane forwarding
    functions have been implemented together, monolithically, within a router
  • Software-defined networking (SDN) explicitly separates the data plane and the
    control plane by implementing the control plane functions as a separate service,
    e.g. in a remote “controller.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the control plane

A
  • The control plane functions include the network-wide logic that controls how a
    datagram is routed among routers along an end-to-end path from the source
    host to the destination host (using routing algorithms).
  • Traditionally, the control plane routing protocols and the data plane forwarding
    functions have been implemented together, monolithically, within a router
  • Software-defined networking (SDN) explicitly separates the data plane and the
    control plane by implementing the control plane functions as a separate service,
    e.g. in a remote “controller.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How the network layer protocol runs

A
  • The network layer protocols run in every host and
    router.
  • On the sending side, the network layer takes
    segments from the transport layer, encapsulates each
    segment into a datagram, and then sends the
    datagrams to its nearby router.
  • On the receiving side, the network layer receives the
    datagrams from its nearby router, extracts the
    transport layer segments, and delivers the segments
    up to the transport layer
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Two key network layer functions

A

Forwarding
Routing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Forwarding

A
  • When a packet arrives at a router’s input link, the router must move the packet
    to the appropriate output link.
  • For example, a packet arriving from a host to the nearby router must be
    forwarded to the next router on a path. Forwarding is the most common and
    important one function in the data plane. Other functions include blocking
    packets from exiting a router (if, for example, the packet originated at a known
    malicious sending host, or is destined to a forbidden destination host) or
    duplicating packets and sent over multiple outgoing links
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Routing

A
  • The network layer must determine the route or path taken by packets as they
    flow from a sender to a receiver.
  • The algorithms that calculate these paths are referred to as routing algorithms.
  • Routing is implemented in the control plane of the network layer
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Forwarding and Routing

A
  • Forwarding refers to the router-local action of transferring a packet from an input link
    interface to the appropriate output link interface. Forwarding takes place at very short
    timescales (typically a few nanoseconds), and thus is typically implemented in
    hardware.
  • Routing refers to the network-wide process that determines the end-to-end paths
    that packets take from source to destination. Routing takes place on much longer
    timescales (typically seconds), and is often implemented in software.
  • A key element in every network router is its forwarding table. A router forwards a
    packet by examining the value of one or more fields in the arriving packet’s header,
    and then using these header values to index into its forwarding table. The value stored
    in the forwarding table entry for those values indicates the outgoing link interface at
    that router to which that packet is to be forwarded
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

how the router’s forwarding
tables are configured?

A

Traditional approach
SDN approach

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

SDN approach

A
  • The routing algorithm that determines the contents of the routers’ forwarding
    tables runs in a physically separated remote controller that computes and
    distributes the forwarding tables to be used by each and every router.
  • The routing device performs forwarding only, while the remote controller
    computes and distributes forwarding tables. The remote controller might be
    implemented in a remote data centre with high reliability and redundancy, and
    might be managed by the ISP or some third party.
  • How might the routers and the remote controller communicate?
  • By exchanging messages containing forwarding tables and other pieces of
    routing information.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Traditional approach

A
  • The routing algorithm that determines the contents of the routers’ forwarding
    tables runs in each and every router and both forwarding and routing functions
    are contained within a router.
  • The routing algorithm function in one router communicates with the routing
    algorithm function in other routers to compute the values for its forwarding
    table.
  • How is this communication performed?
  • By exchanging routing messages containing routing information according to a
    routing protocol.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Router architecture

A
  • A router consists of four router components.
    Input ports. An input port performs the physical layer function of terminating an incoming
    physical link at a router.
  • An input port also performs link layer functions needed to interoperate with the link
    layer at the other side of the incoming link.
  • It also performs a lookup function where the forwarding table is consulted to determine
    the router output port to which an arriving packet will be forwarded via the switching
    fabric.
  • Control packets (for example, packets carrying routing protocol information) are
    forwarded from an input port to the routing processor.
  • The number of ports supported by a router can range from a relatively small number in
    enterprise routers to hundreds of high speed ports in a router at an ISP’s edge.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Switching fabric

A

The switching fabric connects the router’s input ports to its output ports.
This switching fabric is completely contained within the router

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Output ports

A

An output port stores packets received from the switching fabric and
transmits these packets on the outgoing link by performing the necessary link-layer and
physical-layer functions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Routing processor

A
  • In traditional routers, it executes the routing protocols, maintains routing tables and
    attached link state information, and computes the forwarding table for the router.
  • In SDN routers, the routing processor is responsible for communicating with the remote
    controller in order to (among other activities) receive forwarding table entries computed
    by the remote controller, and install these entries in the router’s input ports.
  • The routing processor also performs the network management functions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Routing algorithms

A
  • The goal of a routing algorithm is to determine “good” paths (routes) from senders to
    receivers through the network of routers. A path is the sequence of routers packets will
    traverse in going from source to destination. A good path is the one that has the least cost
    (fastest, least congested, etc)
17
Q

Routing algorithms can be classified as

A
  • Centralised: all routers have the complete
    topology of a network (“link state” algorithms),
    or
  • Decentralised: a router knows only the physical
    connected neighbouring routers (“distance
    vector” algorithms).
  • Static: routes change very slowly over time.
  • Dynamic: change the routing paths as the
    network traffic loads or topology change.
  • Load-sensitive: link costs vary dynamically to
    reflect the current level of congestion in the
    underlying link.
  • Load insensitive: a link’s cost does not explicitly
    reflect its current (or recent past) level of
    congestion.