Chapter 1

CS 5450: INTERNET
ARCHITECTURE
Eugene Bagdasaryan

1
Slides are an edited mashup of two books

Computer Networks: Computer Networking: A

A Systems Approach, 5e Top Down Approach
6th edition
Larry L. Peterson and Bruce S. Jim Kurose, Keith Ross
Davie Addison-Wesley
March 2012
Copyright © 2010, Elsevier Inc. All rights All material copyright 1996-2012
Reserved J.F Kurose and K.W. Ross, All Rights Reserved 2
 Chapter 1
Why is Internet Architecture relevant to you
n The Internet is our economies most critical infrastructure.
n The Internet is our economies most enabling metaphor.
n Objectives for student learning:
n What are the technical features that allowed the Internet to
become so pervasive and diverse during the course of your
lifetime.
n Understand its basic structure, and distill from it lessons for
(a) the use and governance of Internet technology in modern
organizations, and
(b) lessons for creation of other new technologies and
products.

3
Internet history

Chapter 1
1972-1980: Internetworking, new and proprietary nets
n 1970: ALOHAnet satellite network
in Hawaii Cerf and Kahn’s internetworking
n 1974: Cerf and Kahn - architecture principles:
for interconnecting networks n minimalism, autonomy -

n 1976: Ethernet at Xerox PARC no internal changes

required to interconnect
n late70’s: proprietary architectures: networks
DECnet, SNA, XNA n best effort service model

n late 70’s: switching fixed length n stateless routers

packets (ATM precursor) n decentralized control
n 1979: ARPAnet has 200 nodes define today’s Internet
architecture

Introduction 1-4 4
Internet history

Chapter 1
1980-1990: new protocols, a proliferation of networks

n 1983: deployment of n new national networks:

TCP/IP Csnet, BITnet, NSFnet,
n 1982: smtp e-mail Minitel
protocol defined n 100,000 hosts
n 1983: DNS defined for connected to
name-to-IP-address confederation of
translation networks
n 1985: ftp protocol
defined
n 1988: TCP congestion
control
Introduction 1-5 5
 Chapter 1
Internet history
1990, 2000’s: commercialization, the Web, new apps
n early 1990’s: ARPAnet late 1990’s – 2000’s:
decommissioned n more killer apps: instant
n 1991: NSF lifts restrictions on messaging, P2P file sharing
commercial use of NSFnet n network security to forefront
(decommissioned, 1995)
n est. 50 million host, 100
n early 1990s: Web million+ users
n hypertext [Bush 1945, Nelson
n backbone links running at
1960’s] Gbps
n HTML, HTTP: Berners-Lee

n 1994: Mosaic, later Netscape

n late 1990’s: commercialization

of the Web

Introduction 1-6 6
Internet history

Chapter 1
2005-present
n ~750 million hosts
n Smartphones and tablets
n Aggressive deployment of broadband access
n Increasing ubiquity of high-speed wireless access
n Emergence of online social networks:
n Facebook, Instagram, …

n Service providers (Google, Amazon) create their own networks

n Bypass Internet, providing “instantaneous” access to search,

email, etc.
n E-commerce, universities, enterprises running their services in
“cloud” (eg, Amazon EC2)

Introduction 1-7 7
 Chapter 1
What makes the Internet appear as single service

n Networks share common architecture and protocols that

enable communication within and among them.
n Architecture: how components of the networks interrelate
n Protocols: standards governing the interchange of data
n The architecture and protocols were and to some extent are
shaped by fundamental (and interrelated) design principles
adopted by early builders of the Internet.
n Hourglass
n End-to-End
n Distributed design and decentralized control
n Heterogeneity, Scalability

8
 Chapter 1
Connectivity Terminologies
n Link, Nodes
n Point-to-point, Multiple access
n Switched Network
n Circuit Switched
(a)
n Packet Switched: Store-
and-forward
n Cloud
n Hosts
n Switches
n internetwork
n Router/gateway
n Host-to-host connectivity
(b) n Address
n Routing
n Unicast/broadcast/multicast
(a) A switched network
(b) Interconnection of networks

9
 Chapter 1
Cost-Effective Resource Sharing

n FDM: Frequency Division

Multiplexing
n Statistical Multiplexing
n Data is transmitted based
on demand of each flow.
n What is a flow?
n Packets vs. Messages
n FIFO, Round-Robin,
Priorities (Quality-of-
Service (QoS))
n Congested?
A switch multiplexing packets from
multiple sources onto one shared
n LAN, MAN, WAN
link n SAN (System Area
Networks

10
 Chapter 1
Support for Common Services

n Logical Channels
n Application-to-Application communication path or a
pipe

Process communicating over an

abstract channel

11
 Chapter 1
Reliability challenge

n Network software should hide (inevitable) errors

from applications
n Bits are lost
n Bit errors (1 to a 0, and vice versa)
n Burst errors – several consecutive errors
n Packets are dropped (largely Congestion)
n Links and Node failures
n Messages are delayed
n Messages are delivered out-of-order
n Third parties eavesdrop

12
 Chapter 1
Protocols

n Protocol defines the interfaces between the

layers in the same system and with the layers of
peer system
n Building blocks of a network architecture
n Each protocol object has two different interfaces
n service interface: operations on this protocol
n peer-to-peer interface: messages exchanged with
peer
n Term “protocol” is overloaded
n specification of peer-to-peer interface
n module that implements this interface

13
 Chapter 1
Internet Architecture

Alternative view of the

Internet architecture. The
Internet Protocol Graph “Network” layer shown here
is sometimes referred to as
the “sub-network” or “link”
layer.

14
 Chapter 1
Description of (Lower) Layers

n Physical Layer
n Handles the transmission of raw bits over a communication link
n Data Link Layer
n Collects a stream of bits into a larger aggregate called a frame
n Network adaptor along with device driver in OS implement the
protocol in this layer
n Frames are actually delivered to hosts
n Network Layer
n Handles routing among nodes within a packet-switched network
n Unit of data exchanged between nodes in this layer is called a
packet

The lower three layers are implemented on all network nodes

15
 Chapter 1
Description of (Higher) Layers

n Transport Layer
n Implements a process-to-process channel
n Unit of data exchanges in this layer is called a message
n Session Layer
n Provides a name space that is used to tie together the potentially
different transport streams that are part of a single application
n Presentation Layer
n Concerned about the format of data exchanged between peers
n Application Layer
n Standardize common type of exchanges

The transport layer and the higher layers typically run only on end-
hosts and not on the intermediate switches and routers

16
 Chapter 1
Encapsulation

High-level messages are encapsulated inside of low-level messages

17
 Chapter 1
source Encapsulation
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

Introduction 1-1818
 Chapter 1
Internet Architecture

n Does not imply strict layering. The

application is free to bypass the defined
transport layers and to directly use IP or
other underlying networks
n An hour-glass shape – wide at the top,
narrow in the middle and wide at the bottom.
IP serves as the focal point for the
architecture
n In order for a new protocol to be officially
included in the architecture, there needs to
be both a protocol specification and at least
one (and preferably two) representative
implementations of the specification
n IETF Governance
n “rough consensus and running code”

19
 Chapter 1
[email protected]

USE YOU CORNELL EMAIL!

20
 Chapter 1
Benefits of Hourglass architecture

n Internet designed to operate over different underlying

communications technologies, including those yet to be
introduced, and to support multiple and evolving applications
and services.
n Does not impede or restrict particular applications (although
users, ISPs may make optimizations)
n Enables developers to write applications without
knowing/adapting to details of underlying networks
n Enables users to adopt applications without
involvement/approval from network operators
n Critical separation between network technology and higher-
level services through which users actually interact with the
Internet visualized as hourglass
n IP as minimal viable agreement/min common denominator
maximizes flexibility

21
Why a narrow waist is important metaphor for new

Chapter 1
systems, products …
n Tim O’Reilly:
n do as little as possible….the less you include the easier it will be to agree
and you dont tie yourself down…because we dont know what will come
[sic: in this case less is more]
n Build a system and let it evolve
n Create architecture for participation—iTUNES, App Store…[sic: it started
with Internet, Includes maps mashups and APIs!!]
n TBL didnt have to ask anyones permission to put up WWW on the
net…they would have said no…’http is poorly designed protocol..will never
scale’
n Tolerate as much failure and participation as needed to introduce new
systems/innovations rapidly/iteratively and innovate
n Naughton:
n Allow innovation to be tried for free

22
 Chapter 1
End-to-end architecture
n Edge-based innovation derives from early design decision that the Internet
should have an end-to-end architecture:
n The network provides communications fabric connecting the many
computers at its ends
n Network offers very basic level of service, data transport
n Beyond transporting data—locate special features needed to support specific
applications in or close to applications/devices at network edge.
n Only put feature lower down if performance improvement justifies it
n E2E design facilitates
n designing for: failure, change, dynamics, decentralized control, rolling
asynchronous adoption, of components
n scalability and therefore longevity of architecture
n QUESTION – Reliable transport of data – Packet level hop by hop, Packet level
end to end (Process), Message/File level end to end (Application).

23
 Chapter 1
Scalability

n Internet’s design enabled it to support a growing amount of

communications:
n Growth in number of users and attached devices
n Growth in volume of communications per device and total

n Scale implies… heterogeneity…designing for Heterogeneity is a good step

in future proofing

24
 Chapter 1
Performance

n Latency = Propagation + transmit + queue

n Propagation = distance/speed of light
n Transmit = size/bandwidth

n One bit transmission => propagation is important

n Large bytes transmission => bandwidth is important

25
 Chapter 1
Bandwidth

n Width of the frequency band

n Number of bits per second that can be
transmitted over a communication link
n 1 Mbps: 1 x 106 bits/second = 1x220
bits/sec
n 1 x 10-6 seconds to transmit each bit
or imagine that a timeline, now each
bit occupies 1 micro second space.
n On a 2 Mbps link the width is 0.5
micro second.
n Smaller the width more will be
transmission per unit time.

26
 Chapter 1
Four sources of packet delay

transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

(1) dproc: nodal processing (2) dqueue: queueing delay

§ check bit errors § time waiting at output link for
transmission
§ determine output link § depends on congestion level of
§ typically < msec router

Introduction 28
 Chapter 1
Four sources of packet delay

transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

(3) dtrans: transmission delay: (4) dprop: propagation delay:

§ L: packet length (bits) § d: length of physical link
§ R: link bandwidth (bps) § s: propagation speed in medium
§ dtrans = L/R (~2x108 m/sec)
dtrans and dprop § dprop = d/s
very different
Introduction 29
 Chapter 1
Queueing delay -- Congestion

average queueing
n R: link bandwidth (bps)

delay
n L: packet length (bits)
n a: average packet
arrival rate
traffic intensity
= La/R

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

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

v La/R > 1: more “work” arriving
than can be serviced, average delay infinite!
La/R -> 1

Introduction 30
 Chapter 1
Packet loss

n queue (aka buffer) preceding link in buffer has finite

capacity
n packet arriving to full queue dropped (aka lost)
n 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

Introduction 31
 Chapter 1
Throughput

n throughput: rate (bits/time unit) at which bits

transferred between sender/receiver
n instantaneous: rate at given point in time

n average: rate over longer period of time

n bottleneck link on end to end path constrains

throughput

server,
server withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
file of into
(fluid) F bitspipe Rs bits/sec
fluid at rate Rc bits/sec
fluid at rate
to send to client Rs bits/sec) Rc bits/sec)

Introduction 1-3232
 Chapter 1
Relationship between bandwidth and latency

Note: assuming cross-country propagation delay = 100 ms

A 1-MB file would fill the 1-Mbps link 80 times,

but only fill the 1-Gbps link 1/12 of one time

33
 Chapter 1
Delay X Bandwidth

n We think the channel between a pair of processes as a

hollow pipe
n Latency (delay) length of the pipe and bandwidth the
width of the pipe
n Delay of 50 ms and bandwidth of 45 Mbps
Þ 50 x 10-3 seconds x 45 x 106 bits/second
Þ 2.25 x 106 bits = 280 KB data.

Network as a pipe

34
 Chapter 1
Delay X Bandwidth

n Relative importance of bandwidth and latency depends on

application
n For large file transfer, bandwidth is critical

n For small messages (HTTP, NFS, etc.), latency is critical

n Variance in latency (jitter) can also affect some applications (e.g.,

audio/video conferencing)
n How many bits the sender must/could transmit before the first bit
arrives at the receiver
n Takes another one-way latency to receive a response from the

receiver
n If the sender does not fill the pipe—send a whole delay ×

bandwidth product’s worth of data before it stops to wait for a

signal—the sender will not fully utilize the network
n Control travels over same network as data – latency impairs

feedback which impairs thruput

35
 Chapter 1
https://cs5450.github.io

36