Thebes Higher Institute of

Thebes Academy

Computer & Management Sciences

CS 350 Computer Networks

3 Credit Hrs

Dr. Khaled El Sayed El Helow.

[email protected]
Chapter 1: roadmap

 What is the Internet?

 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
How do packet delay and loss occur?
 packets queue in router buffers, waiting for turn for transmission
▪ queue length grows when arrival rate to link (temporarily) exceeds output link capacity
▪ packet loss occurs when memory to hold queued packets fills up

packet being transmitted (transmission delay)

B
packets in buffers (queueing delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Packet delay: four sources
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal processing dqueue: queueing delay

▪ check bit errors ▪ time waiting at output link for
▪ determine output link transmission
▪ typically < microsecs ▪ depends on congestion level of
router
Packet delay: four sources
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission delay: dprop: propagation delay:
▪ L: packet length (bits) ▪ d: length of physical link
▪ R: link transmission rate (bps) ▪ s: propagation speed (~2x108 m/sec)
▪ dtrans = L/R ▪ dprop = d/s
dtrans and dprop
very different
Caravan analogy
100 km 100 km

ten-car caravan toll booth toll booth toll booth

(aka 10-bit packet) (aka link)

▪ car ~ bit; caravan ~ packet; toll ▪ time to “push” entire caravan

service ~ link transmission through toll booth onto
▪ toll booth takes 12 sec to service highway = 12*10 = 120 sec
car (bit transmission time) ▪ time for last car to propagate
▪ “propagate” at 100 km/hr from 1st to 2nd toll both:
100km/(100km/hr) = 1 hr
▪ Q: How long until caravan is lined
up before 2nd toll booth? ▪ A: 62 minutes
Caravan analogy
100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit packet) (aka router)

▪ suppose cars now “propagate” at 1000 km/hr

▪ and suppose toll booth now takes one min to service a car
▪ Q: Will cars arrive to 2nd booth before all cars serviced at first booth?
A: Yes! after 7 min, first car arrives at second booth; three cars still at
first booth
Packet queueing delay (revisited)
▪ a: average packet arrival rate

average queueing delay

▪ L: packet length (bits)
▪ R: link bandwidth (bit transmission rate)

L .a arrival rate of bits “traffic

:
R service rate of bits intensity” traffic intensity = La/R 1

▪ La/R ~ 0: avg. queueing delay small La/R ~ 0

▪ La/R -> 1: avg. queueing delay large

▪ La/R > 1: more “work” arriving is
more than can be serviced - average
delay infinite!
La/R -> 1
“Real” Internet delays and routes
▪ what do “real” Internet delay & loss look like?
▪ traceroute program: provides delay measurement from
source to router along end-end Internet path towards
destination. For all i:
• sends three packets that will reach router i on path towards
destination (with time-to-live field value of i)
• router i will return packets to sender
• sender measures time interval between transmission and reply

3 probes 3 probes

3 probes
Packet loss
▪ queue (aka buffer) preceding link in buffer has finite capacity
▪ packet arriving to full queue dropped (aka lost)
▪ lost packet may be retransmitted by previous node, by source end
system, or not at all
buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost

* Check out the Java applet for an interactive animation (on publisher’s website) of queuing and loss
 Throughput
▪ throughput: rate (bits/time unit) at which bits are being sent from
sender to receiver
• instantaneous: rate at given point in time
• average: rate over longer period of time

link capacity
pipe that can carry linkthat
pipe capacity
can carry
Rsfluid
bits/sec
at rate Rfluid
c bits/sec
at rate
serverserver,
sends with
bits
(fluid) into pipe (Rs bits/sec) (Rc bits/sec)
file of F bits
to send to client
Throughput
Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

bottleneck link
link on end-end path that constrains end-end throughput
Throughput: network scenario
▪ per-connection end-end
Rs throughput: min(Rc,Rs,R/10)
Rs Rs

R
▪ in practice: Rc or Rs is often
Rc Rc bottleneck
Rc

10 connections (fairly) share backbone * Check out the online interactive exercises for more examples:
http://gaia.cs.umass.edu/kurose_ross/
bottleneck link R bits/sec
Chapter 1: roadmap

 What is the Internet?

 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Network security
▪ Internet not originally designed with (much) security
in mind
• original vision: “a group of mutually trusting users
attached to a transparent network” ☺
• Internet protocol designers playing “catch-up”
• security considerations in all layers!
▪ We now need to think about:
• how bad guys can attack computer networks
• how we can defend networks against attacks
• how to design architectures that are immune to attacks
Network security
▪ Internet not originally designed with (much) security in
mind
• original vision: “a group of mutually trusting users attached to a
transparent network” ☺
• Internet protocol designers playing “catch-up”
• security considerations in all layers!
▪ We now need to think about:
• how bad guys can attack computer networks
• how we can defend networks against attacks
• how to design architectures that are immune to attacks
Bad guys: packet interception
packet “sniffing”:
▪ broadcast media (shared Ethernet, wireless)
▪ promiscuous network interface reads/records all packets (e.g.,
including passwords!) passing by

A C

src:B dest:A payload

B

Wireshark software used for our end-of-chapter labs is a (free) packet-sniffer

Bad guys: fake identity
IP spoofing: injection of packet with false source address

A C

src:B dest:A payload

B
Bad guys: denial of service
Denial of Service (DoS): attackers make resources (server,
bandwidth) unavailable to legitimate traffic by
overwhelming resource with bogus traffic

1. select target
2. break into hosts
around the network
(see botnet)
3. send packets to target target

from compromised
hosts
Lines of defense:
▪ authentication: proving you are who you say you are
• cellular networks provides hardware identity via SIM card; no such
hardware assist in traditional Internet
▪ confidentiality: via encryption
▪ integrity checks: digital signatures prevent/detect tampering
▪ access restrictions: password-protected VPNs
▪ firewalls: specialized “middleboxes” in access and core
networks:
▪ off-by-default: filter incoming packets to restrict senders, receivers,
applications
▪ detecting/reacting to DOS attacks

… lots more on security (throughout, Chapter 8)

Chapter 1: roadmap

 What is the Internet?

 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Protocol “layers” and reference models
Networks are complex, Question: is there any
with many “pieces”: hope of organizing
▪ hosts structure of network?
▪ routers ▪and/or our discussion
▪ links of various media of networks?
▪ applications
▪ protocols
▪ hardware, software
Example: organization of air travel
end-to-end transfer of person plus baggage
ticket (purchase) ticket (complain)
baggage (check) baggage (claim)
gates (load) gates (unload)
runway takeoff runway landing
airplane routing airplane routing
airplane routing

How would you define/discuss the system of airline travel?

▪ a series of steps, involving many services
Example: organization of air travel

ticket (purchase) ticketing service ticket (complain)

baggage (check) baggage service baggage (claim)
gates (load) gate service gates (unload)
runway takeoff runway service runway landing
airplane routing routing service
airplane routing airplane routing

layers: each layer implements a service

▪ via its own internal-layer actions
▪ relying on services provided by layer below
Why layering?
Approach to designing/discussing complex systems:
▪ explicit structure allows identification,
relationship of system’s pieces
• layered reference model for discussion
▪ modularization eases maintenance,
updating of system
• change in layer's service implementation:
transparent to rest of system
• e.g., change in gate procedure doesn’t
affect rest of system
Layered Internet protocol stack
▪ application: supporting network applications
• HTTP, IMAP, SMTP, DNS
application
application
▪ transport: process-process data transfer
• TCP, UDP transport
transport
▪ network: routing of datagrams from source to
destination network
• IP, routing protocols
link
▪ link: data transfer between neighboring
network elements physical
• Ethernet, 802.11 (WiFi), PPP
▪ physical: bits “on the wire”
ISO/OSI reference model
▪ presentation: allow
applications to interpret application
meaning of data, e.g.,
encryption, compression, presentation
machine-specific session
conventions
▪ session: synchronization, transport
checkpointing, recovery of network
data exchange
▪ Internet stack “missing” link
these layers! physical
• these services, if needed,
must be implemented in
application
• needed?
 source Encapsulation: an
end-end view
message M application
segment Ht M transport
datagram Hn Ht M network
frame Hl Hn Ht M link
physical
link
physical

switch

destination Hn Ht M network
M application Hl Hn Ht M link Hn Ht M
Ht M transport physical
Hn Ht M network
Hl Hn Ht M link router
physical
 Services, Layering and Encapsulation
M
application Application exchanges messages to implement some application
application service using services of transport layer
Ht M
transport Transport-layer protocol transfers M (e.g., reliably) transport
from one process to another, using services of
network layer
network ▪ transport-layer protocol encapsulates network
application-layer message, M, with
link transport layer-layer header Ht to link
create a transport-layer segment
• Ht used by transport layer protocol
physical to implement its service physical

source destination
 Services, Layering and Encapsulation
M
application application
Ht M
transport Transport-layer protocol transfers M (e.g., reliably) transport
from one process to another, using services of
network layer
network Hn Ht M network
Network-layer protocol transfers transport-layer
segment [Ht | M] from one host to another, using link
link layer services link
▪ network-layer protocol encapsulates
transport-layer segment [Ht | M] with
physical network layer-layer header Hn to physical
create a network-layer datagram
source • Hn used by network layer protocol destination
to implement its service
 Services, Layering and Encapsulation
M
application application
Ht M
transport transport

network Hn Ht M network
Network-layer protocol transfers transport-layer
segment [Ht | M] from one host to another, using link
link H Hlayer
l H services
n M t link
Link-layer protocol transfers datagram [Hn| [Ht |M]
from host to neighboring host, using network-layer
physical services physical
▪ link-layer protocol encapsulates
network datagram [Hn| [Ht |M], with
source link-layer header Hl to create a link- destination
layer frame
 Encapsulation
Matryoshka dolls (stacking dolls)

message segment datagram frame

Credit: https://dribbble.com/shots/7182188-Babushka-Boi
 Services, Layering and Encapsulation

application message M M application

transport segment Ht M Ht M transport

network datagram Hn Ht M Hn Ht M network

link frame Hl Hn Ht M Hl Hn Ht M link

physical physical

source destination
Chapter 1: roadmap

 What is the Internet?

 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Internet history
1961-1972: Early packet-switching principles
▪ 1961: Kleinrock - queueing ▪ 1972:
theory shows effectiveness of • ARPAnet public demo
packet-switching • NCP (Network Control Protocol)
▪ 1964: Baran - packet-switching first host-host protocol
in military nets • first e-mail program
▪ 1967: ARPAnet conceived by • ARPAnet has 15 nodes
Advanced Research Projects
Agency
▪ 1969: first ARPAnet node
operational
Internet history
1972-1980: Internetworking, new and proprietary networks
▪ 1970: ALOHAnet satellite
Cerf and Kahn’s internetworking
network in Hawaii principles:
▪ 1974: Cerf and Kahn - ▪ minimalism, autonomy - no
architecture for interconnecting internal changes required to
networks interconnect networks
▪ best-effort service model
▪ 1976: Ethernet at Xerox PARC ▪ stateless routing
▪ late70’s: proprietary ▪ decentralized control
architectures: DECnet, SNA, XNA define today’s Internet architecture
▪ 1979: ARPAnet has 200 nodes
Internet history
1980-1990: new protocols, a proliferation of networks
▪ 1983: deployment of TCP/IP ▪ new national networks: CSnet,
▪ 1982: smtp e-mail protocol BITnet, NSFnet, Minitel
defined ▪ 100,000 hosts connected to
▪ 1983: DNS defined for name- confederation of networks
to-IP-address translation
▪ 1985: ftp protocol defined
▪ 1988: TCP congestion control
Internet history
1990, 2000s: commercialization, the Web, new applications
▪ early 1990s: ARPAnet late 1990s – 2000s:
decommissioned ▪ more killer apps: instant
▪ 1991: NSF lifts restrictions on messaging, P2P file sharing
commercial use of NSFnet ▪ network security to forefront
(decommissioned, 1995)
▪ est. 50 million host, 100 million+
▪ early 1990s: Web users
• hypertext [Bush 1945, Nelson 1960’s]
• HTML, HTTP: Berners-Lee ▪ backbone links running at Gbps
• 1994: Mosaic, later Netscape
• late 1990s: commercialization of the
Web
Internet history
2005-present: scale, SDN, mobility, cloud
▪ aggressive deployment of broadband home access (10-100’s Mbps)
▪ 2008: software-defined networking (SDN)
▪ increasing ubiquity of high-speed wireless access: 4G/5G, WiFi
▪ service providers (Google, FB, Microsoft) create their own networks
• bypass commercial Internet to connect “close” to end user, providing
“instantaneous” access to social media, search, video content, …
▪ enterprises run their services in “cloud” (e.g., Amazon Web Services,
Microsoft Azure)
▪ rise of smartphones: more mobile than fixed devices on Internet (2017)
▪ ~15B devices attached to Internet (2023, statista.com)
Chapter 1: summary
We’ve covered a “ton” of
material!
▪ Internet overview You now have:
▪ what’s a protocol? ▪ context,
▪ network edge, access network, core overview,
• packet-switching versus circuit- vocabulary,
switching “feel” of
• Internet structure
networking
▪ performance: loss, delay, throughput
▪ more depth,
detail, and fun to
▪ layering, service models follow!
▪ security
▪ history
Additional Chapter 1 slides
 ISO/OSI reference model
Two layers not found in Internet
application
protocol stack!
▪ presentation: allow applications to presentation
interpret meaning of data, e.g., session
encryption, compression, machine- transport
specific conventions
network
▪ session: synchronization, checkpointing,
recovery of data exchange link
▪ Internet stack “missing” these layers! physical
• these services, if needed, must be
The seven layer OSI/ISO
implemented in application reference model
• needed?
More than seven OSI layers
 Services, Layering and Encapsulation
M
application M application
message
Ht M
transport Ht M transport
segment
network Hn Ht M Hn Ht M network
datagram

link Hl Hn Ht M Hl Hn Ht M link
frame

physical physical

source destination
Wireshark
application
(www browser,
packet
email client)
analyzer
application

OS
packet Transport (TCP/UDP)
Network (IP)
capture copy of all
Ethernet frames Link (Ethernet)
(pcap) sent/received
Physical