Routing Must choose routes for various origin destination pairs (O/D pairs) or for various sessions – Datagram routing: route chosen on a packet by packet basis Using datagram routing is an easy way to split paths – Virtual circuit routing: route chosen a session by session basis
Broadcast Routing Route a packet from a source to all nodes in the network Possible solutions: – Flooding: Each node sends packet on all outgoing links Discard packets received a second time – Spanning Tree Routing: Send packet along a tree that includes all of the nodes in the network
DestinationAddress Output port number or VC number A packet switch consists of a routing engine (table look-up), a switch scheduler, and a switch fabric
Multiple Access Shared Transmission Medium a receiver can hear multiple transmitters a transmitter can be heard by multiple receivers the major problem with multi-access is allocating the channel between the users; the nodes do not know when the other nodes
Responsible for reliable transmission of packets over a link – Framing: Determine t he star t and end of packets (sec 2.5) – Error Detection: Determine w hen a packet contains errors (sec 2.3) – Error recovery: Retransmissio n of packets containing errors (sec 2..4)