CS6250 – Class 3 - 8.27.

2002

Fundamental concepts
&
Network architecture
 Reminders
• Assignment #0 is due today!
• Registration issues?
• Assignment #1 questions?
• Assignment #1 is due on Sep-5
• Chapter-1 homework: problems 13, 15, 20
 Requirements from a
network architecture
• Connectivity
• Scalability
• Cost-effective resource sharing
• Support for commonly needed services
• Reliability and Availability
• Performance
• Generality
• …and much more
 Connectivity
• Links and nodes
• Point-to-point links
• Multiple-access links
(a)

(b) …
 Switched networks
• Circuit-switching
• Packet-switching
• Switches/routers vs hosts
• Messages vs packets
• Store-and-forward packet switching
• Cut-through packet switching
Chapter 1, Figure 2
 Internetworks
• Connection of independent networks
• Internet versus internet
• Addressing
• Unicast – Broadcast - Multicast
Chapter 1, Figure 3
 Cost-effective resource sharing
• How to share a link between multiple hosts?
• Time-Division Multiplexing (TDM)
• Frequency-Division Multiplexing (FDM)
• Wavelength-Division Multiplexing (WDM)
• Limitations of TDM/FDM/WDM systems?
• Statistical multiplexing
– Source activity pattern: ON/OFF
– Messages vs packets
– How to arbitrate between concurrent sessions?
– Congestion and Quality-of-Service (QoS)
L1 R1

L2 R2

Switch 1 Switch 2
L3 R3

Chapter 1, Figure 4
 …

Chapter 1, Figure 5
 Support for common services
• Implement common services in network
• Application programmers can build their
applications using those services
• Network should simply provide logical channels
to application-level processes
• But which are these “common services”?
– Reliable byte-stream delivery?
– Time-bounded message delivery?
– Unreliable message delivery?
• End-to-end principle
 Host Host

Application

Host
Channel
Application

Host Host

Chapter 1, Figure 6
 Reliability
• Hosts and link fail (temp or permanently)
• Bit errors occur in links due to electrical noise,
interference, etc
– 1 in a million in copper cables
– 1 in a trillion in optical fibers
• Independent vs bursty errors
• Packet losses due to congestion
• A network has to mask certain kinds of failures,
based on definition of logical channels
 Network performance
• Bandwidth (throughput)
– Bits-per-second (versus hertz)
– 10BaseT Ethernet: 10Mbps
– T1 link: 1.5Mbps
– Max bandwidth (capacity) depends on physical
constraints of transmission medium and equipment
• Latency (delay)
– 300K km/s in vacuum, 230K in cable, 200K in fiber
– One-way delay versus Round-Trip Time (RTT)
– One-way delay across US: about 20-30 msec
(a)

1 second

(b)

1 second

Chapter 1, Figure 8
 Network delay components
• Propagation delay
– physical distance / speed of propagation
• Transmission time
– message size / link capacity
• Queueing delay
• Processing delay in routers/switches
• Transmission time dominates for large
messages
• Propagation delay dominates for small
messages
 10,000
5000

2000

1000
Perceived latency (ms)
500

1-MB object, 1.5-Mbps link

200
1-MB object, 10-Mbps link
100 2-KB object, 1.5-Mbps link
2-KB object, 10-Mbps link
50
1-byte object, 1.5-Mbps link
1-byte object, 10-Mbps link
20

10

1
10 100
RTT (ms)

Chapter 1, Figure 9
 Bandwidth-Delay product
• Think of link as pipe carrying data
• How much data are in flight?
– one-way delay: 50ms,
– bandwidth: 45Mbps,
– BD-product = 280KB
• Why do we care for the BD-product?
 Delay

Bandwidth

Chapter 1, Figure 10
 Application performance needs
• Average bandwidth (rate)
• Peak bandwidth and burst size
• Maximum one-way delay
• Delay jitter
• Packet loss rate
 Layering
• Networked systems are complicated!
• Instead of a monolithic system, implement
several “layers”, each responsible for one
part of the communication
• Additionally, layering supports modularity
(replace one layer implementation without
affecting others)
• Protocols: abstract objects that make up
the layers of a network
 Application programs

Process-to-process channels

Host-to-host connectivity

Hardware

Chapter 1, Figure 12
 Application programs
Request/reply Message stream
channel channel
Host-to-host connectivity

Hardware

Chapter 1, Figure 13
 Protocol interfaces
• Service interface: operations from local
objects that use the protocol
• Peer interface: operations/messages from
remote protocol peers
• Protocol specification
– Algorithm description
– State diagrams
– Packet/message formats
 Host 1 Host 2

Service
High-level interface High-level
object object

Protocol Protocol
Peer -to-peer
interface

Chapter 1, Figure 14
 Host 1 Host 2

File Digital Video File Digital Video

application library application application library application
application application

RRP MSP RRP MSP

HHP HHP

Chapter 1, Figure 15
 Encapsulation and Demultiplexing
• Each protocol attaches a header to the
message payload -> encapsulation
• Protocol header determines
processing/attributes of message at the
corresponding layer
• Protocol header also determines recipient
of message (higher layer protocol) at
remote peer -> demultiplexing
 Host 1 Host 2
Application Application
program program

Data Data

RRP RRP

RRP Data RRP Data

HHP HHP

HHP RRP Data

Chapter 1, Figure 16
 OSI architecture
• OSI architecture developed by ITU as a
reference model for implementation of
data networks
• Canonical implementations: X.25, X.400,
X.500, etc
• First specify, then implement..
• Never widely deployed
 End host End host

Application Application

Presentation Presentation

Session Session

Transport Transport

Network Network Network Network

Data link Data link Data link Data link

Physical Physical Physical Physical

One or more nodes

within the network

Chapter 1, Figure 17
 Internet architecture
• Based on ARPA DoD project in early 70s
• Mostly focusing on network and transport
layers (TCP/IP, UDP/IP)
• Prototype, test, refine, evolve..
• Limited violation of layering is allowed
• Current standardization by Internet
Engineering Task Force (IETF)
FTP HTTP NV TFTP

TCP UDP

IP

NET1 NET2 … NETn

Chapter 1, Figure 18
 Application

TCP UDP

IP

Network

Chapter 1, Figure 19