What is Packet Switching?


Untitled

<aside> πŸ“– Packet

A self-contained unit of data that carries information necessary for it to reach its destination.

</aside>

<aside> πŸ“– Packet Switching

Independently for each arriving packet, pick its outgoing link. If the link is free, send it. Else hold the packet for later.

</aside>

Two consequences


1 Simple packet forwarding

<aside> πŸ“– Flow

A collection of datagrams belonging to the same end- to-end communication, e.g. a TCP connection.

</aside>

Packet switching don’t need state for each flow, and each packet is self-contained. Which also means that:

  1. No per-flow state to be added or removed
  2. No per-flow state to be stored
  3. No per-flow state to be changed upon failure

2 Efficient sharing of links

Data traffic is bursty, therefore, packet switching allows flows to

  1. use all available link capacity
  2. share link capacity

which is called Statistical Multiplexing

<aside> πŸ“– Statistical Multiplexing

Taking a single resource and sharing it across multiple users in a probabilistic or statistical way.

</aside>