Professional Documents
Culture Documents
Data Networks: Eytan Modiano
Data Networks: Eytan Modiano
Lecture 1
Introduction
Eytan Modiano
Eytan Modiano
Slide 1
6.263: Data Networks
Architecture
Layering
Topology design
Protocols
Pt.-to-Pt.
Multiple access
End-to-end
Algorithms
Error recovery
Routing
Flow Control
Analysis tools
Probabilistic modeling
Queueing Theory
Eytan Modiano
Slide 2
Course Information
Eytan Modiano
Slide 3
Tentative syllabus
LEC # TOPICS
3 Retransmission Algorithms
4 Retransmission Algorithms
7 Networks of queues
12 Quiz
Eytan Modiano
Slide 4
Tentative syllabus, continued
LEC # TOPICS
Final Exam during final exam week. Date and time to be announced.
Eytan Modiano
Slide 5
Network Applications
Resource sharing
Computing
Mainframe computer (old days)
Today, computers cheaper than comm (except LANS)
Printers, peripherals
Information
DB access and updates
E.g., Financial, Airline reservations, etc.
Services
Email, FTP, Telnet, Web access
Video conferencing
DB access
Client/server applications
Eytan Modiano
Slide 6
Network coverage areas
Synchronous
Session appears as a continuous stream of traffic (e.g, voice)
Usually requires fixed and limited delays
Asynchronous
Session appears as a sequence of messages
Typically bursty
E.g., Interactive sessions, file transfers, email
Connection oriented services
Long sustained session
Orderly and timely delivery of packets
E.g., Telnet, FTP
Connectionless services
One time transaction (e.g., email)
QoS
Eytan Modiano
Slide 8
Switching Techniques
Circuit Switching
Dedicated resources
Packet Switching
Shared resources
Virtual Circuits
Datagrams
Eytan Modiano
Slide 9
Circuit Switching
Eytan Modiano
Slide 10
Problems with circuit switching
The rate allocated to the session must be large enough to meet the
delay requirement. This allocated capacity is idle when the session
has nothing to send
If communication is expensive, then circuit switching is
uneconomic to meet the delay requirements of bursty traffic
Eytan Modiano
Slide 11
Circuit Switching Example
L = message lengths
= arrival rate of messages
R = channel rate in bits per second
X = message transmission delay = L/R
R must be large enough to keep X small
Bursty traffic => x << 1 => low utilization
Example
L = 1000 bytes (8000 bits)
= 1 message per second
X < 0.1 seconds (delay requirement)
=> R > 8000/0.1 = 80,000 bps
Utilization = 8000/80000 = 10%
Eytan Modiano
Slide 12
Packet Switched Networks
PS PS
PS
Packet Network
PS
PS
PS
Buffer
Packet
PS Switch
Eytan Modiano
Slide 13
Packet Switching
Eytan Modiano
Slide 14
Virtual Circuits Packet Switching
VC7
3 9
VC4
VC13
Merits of virtual circuits 5 8
Save on route computation VC3
VC7
Need only be done once VC3
at start of session 6 2
Save on header size Node 5 table
Facilitate QoS provisioning
(3,5) VC13 -> (5,8) VC3
More complex (3,5) VC7 -> (5,8) VC4
Less flexible (6,5) VC3 -> (5,8) VC7
Eytan Modiano
Slide 15
Circuit vs packet switching
Eytan Modiano
Slide 16
Circuit vs Packet Switching
Guaranteed bandwidth
Guaranteed delays
Guaranteed delay variations
Packet loss rate
Etc...
Eytan Modiano
Slide 17
7 Layer OSI Reference Model
Application Application
Presentation Presentation
Virtual session
Session Session
Transport Transport
Physical link
Presentation layer
Provides character code conversion, data encryption, data compression,
etc.
Session layer
Obtains virtual end to end message service from transport layer
Provides directory assistance, access rights, billing functions, etc.
Eytan Modiano
Slide 19
Transport Layer
The network layer provides a virtual end to end packet pipe to the
transport layer.
Eytan Modiano
Slide 21
Link Layer
Framing
Determine the start and end of packets
Error detection
Determine which packets contain transmission errors
Error correction
Retransmission schemes (Automatic Repeat Request (ARQ))
Eytan Modiano
Slide 22
Physical Layer
Propagation delays
Time it takes the signal to travel from the source to the destination
Signal travel approximately at the speed of light, C = 3x108 meters/second
E.g.,
LEO satellite: d = 1000 km => 3.3 ms prop. delay
GEO satellite: d = 40,000 km => 1/8 sec prop. delay
Ethernet cable: d = 1 km => 3 s prop. delay
Transmission errors
Signals experience power loss due to attenuation
Transmission is impaired by noise
Simple channel model: Binary Symmetric Channel
1-P
P = bit error probability 0 0
Independent from bit to bit P P
In reality channel errors are often bursty 1 1
1-P
Eytan Modiano
Slide 23
Internet Sub-layer
ROUTER
IP IP Protocol IP Protocol IP
IP
Eytan Modiano
Slide 25
Encapsulation
user data
Application
Appl
header user data
TCP
TCP application data
header
TCP segment IP
IP TCP application data
header header
IP datagram Ethernet
driver
Ethernet IP TCP Ethernet
header header header application data trailer
Ethernet
14 20 20 4
Ethernet frame
46 to 1500 bytes
Eytan Modiano
Slide 26