MIT OCW DATA COMMUNICATION CONTENTS Lectures 2 The Data Link Layer: Framing and Error Detection Lectures 3 4 The Data link layer: arQ Protocols Lectures 5 6 Introduction to Queueing Theory Lectures 8&9 M/G/I Queues
Must choose routes for various origin destination pairs(O/D pairs) or for various sessions - Datagram routing: route chosen on packet by packet basis Using datagram routing is an easy way to split paths Virtual circuit routing: route chosen a session by session basis Static routing: route chosen in a prearranged way based on O/D pairs Eytan Modiano
Optimal Routing View routing as\global\ optimization problem Assumptions: The cost of using a link is a function of the flow on that link The total network cost is the sum of the link costs The required traffic rate between each source-destination pair is known in advance Traffic between source-destination pair can be split along multiple paths with infinite precision
Carrier Sense Multiple Access(CSMA) In certain situations nodes can hear each other by listening to the channel “Carrier Sensing CSMA: Polite version of Aloha Nodes listen to the channel before they start transmission Channel idle=> Transmit Channel busy = Wait (join backlog) When do backlogged nodes transmit? When channel becomes idle backlogged nodes attempt transmission with probability q=1 Persistent protocol, q=1 Non-persistent protocol,< 1