Internet Internetwork of networks, each independently developed

o IP Internet protocol; ties the networks together

Network applications run on hosts (browser, server, etc.)
Protocols: HTTP, TCP, Skype, 802.11, etc.
o TCP Reliable
Web apps, email, games, banking
o UDP Unreliable, faster
VOIP
Network edge
o Consists of hosts (either client or server)
Client-server model
o Client = browser; Server = web server
o Client always initiates communication, server responds
Peer-to-Peer model
o Messages can go anywhere/any host can send messages
o Leads to messy and unorganized communication
IP Protocol
o Message is broken up into small packets
o Packets are a fixed size of L bits
o Access network has transmission rate R bits/second
Timetrans = L/R sec for each
Network Core
o Consists of many routers
o Each router decides how to forward packets towards destination
o Queue delay = how long packets wait in the queue to be
transmitted
Packets are dropped if memory fills up (packet loss)
o Routing algorithm: for each destination, find next best router
o Forwarding algorithm: for each destination, forward packet to the
next best router (using the routing table to know this)
o A network cannot support both circuit & packet switching
Packet switching
o Better performance
o Forwards a packet from a router; uses the entire bandwidth
o Store-and-forward technique. Each router waits for the entire
packet, before transmitting packet forward
o When to use
Having no delay is not importation
Not for Audio/video applications
Bursty traffic
o IP protocol supports packet switching; TCP provides congestion
control
o
 o
Circuit switching
o Does not store-and-forward
o Reserves a link/sets up a link
o Allows less traffic (must reserve resources)
Network performance metrics: delay, packet loss, throughput
Packet Delay
o Queueing delay dqueue depends on queue congestion
o Processing delay dproc looks at routing table to determine
destination
o Transmission delay dtrans
o Propogation delay dprop
o { dnodal = dproc + dqueue + dtrans + dprop }
Queueing Delay
o Depends on the congestion level
o To estimate queueing delay, estimate congestion level

Throughput
o Typically measure the average throughput (throughput varies a
lot over time)
o Slide 1-60?

L
Transmission delay :d=
R
Designing Network Protocols
Modularization
o Interface and implementation
are separated from each other
o Change in implementation does not affect the interface or other
modules. Maintainability
o Deadlock can occur!
o Interface: always well-known
o Implementation: hidden, always encapsulated
Hide from users so that you can change implementation
w/o affecting other modules
o The verification process is much simpler
Layering
o Avoids failure due to deadlock
o Restrictions:
No upcalls (lower layer cannot call higher layer)
Overhead in calling all the layer interfaces
(M1 wants something from M3, must go through M2)
To avoid upcalls, implement/replicate function in various
layers
(M3 wants functionality from M1. Implement M4 w/ fns like M1)
o Designing the layers
Each layer does a certain function
Different Reference models determine what goes into each
layer

Internet Model
4 main layers:

1.