0% found this document useful (0 votes)
12 views

Lecture 01 - 05 Introduction

Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Lecture 01 - 05 Introduction

Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 72

COMPUTER COMMUNICATIONS

AND NETWORKS

Course Instructor:

Dr. Waseem Abbass


[email protected]
COURSE AND REFERENCE
BOOKS
 Text Book:
 Computer Networking: A Top Down Approach, Kurose, J.F. &Ross, K.W., 7 th Edition
(2017), Addison Wesley.
 Reference Books:
 Computer Networks and Internets, Comer, D.E., 6th Edition (2014), Addison
Wesley.
 Networking: A Beginner's Guide, Hallberg, B., 6th Edition (2013), McGraw Hill.
 Computer Networks, Tannenbaum, 5th Edition (2010), Andrew S. Tenanbaum,
David J.Wetherall
TOPICS COVERED
 Introduction and overview: Internet?, Network edge: Client Server Programs;
Access Networks and Physical Media; Network Core: Circuit Switching vs. Packet
switching; Protocol layers and their service models: Layered Architecture,
Messages, Segments, Datagrams and Frames
 Application Layer: HTTP, FTP, DNS, P2P file distribution
 Transport Layer: Transport Layer Services, Multiplexing, De-multiplexing; UDP:
segment structure, Checksum; Connection Oriented TCP: Connection, segment
structure, RTT estimation and timeout
 Network Layer: Virtual Circuits and datagram networks; IP protocol: Datagram
format; Routing algorithms: Distance Vector and Link state routing protocols
 Link Layer: Link layer services; Error detection techniques; Multiple access
protocols; Random Access Protocols; link layer addressing (ARP); link layer
switches
 Physical Layer: Analog and Digital Data; Transmission Impairments; Wireless
and Mobile Networks
 Mobility management principles and Security in Computer Networks
EVALUATION CRITERIA
TENTATIVE
Theory (100 %)

Quizzes (4) 20 %

Assignments (4) 10 %

Mid Term (1) 20


%
Project (1) 10 %

Terminal (1) 40 %
Note: Strict policy for the cheating in any of the artifact especially assignments.
4
LECTURE
# 1:
INTRODUC
TION
Chapter 1: Introduction, Computer Networking: A Top-Down
Approach,
8th edition, Jim Kurose, Keith Ross, Pearson, 2020
CONTENTS
 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
The Internet: a “nuts and bolts”
view
Billions of connected mobile network
computing devices: national or global ISP
 hosts = end systems
 running network apps at
Internet’s “edge”

Packet switches: forward


local or
packets (chunks of data) Internet
regional ISP
 routers, switches
home network content
Communication links provider
network datacenter
 fiber, copper, radio, satellite network

 transmission rate: bandwidth


Networks enterprise
 collection of devices, routers, network
links: managed by an organization
Introduction: 1-7
The Internet: a “nuts and bolts”
view
mobile network
4G
 Internet: “network of networks” national or global ISP

• Interconnected ISPs
Streaming
 protocols are everywhere Skype
IP
video
• control sending, receiving of
local or
messages regional ISP
• e.g., HTTP (Web), streaming video,
home network
Skype, TCP, IP, WiFi, 4G, Ethernet content
provider
 Internet standards HTTP network datacenter
network
Ethernet
• RFC: Request for Comments
• IETF: Internet Engineering Task TCP
Force enterprise
network

WiFi
Introduction: 1-8
What’s a protocol?
Human protocols: Network protocols:
 “what’s the time?”  computers (devices) rather than humans
 “I have a question”  all communication activity in Internet
 introductions governed by protocols

… specific messages sent


Protocols define the format, order of
… specific actions taken
when message received, messages sent and received among
or other events network entities, and actions taken
on msg transmission, receipt

Introduction: 1-9
What’s a protocol?
A human protocol and a computer network protocol:

Hi TCP connection
request
Hi TCP connection
response
Got the
time? GET http://gaia.cs.umass.edu/kurose_ross
2:00
<file>
time

Q: other human protocols?


Introduction: 1-10
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
Introduction: 1-11
A closer look at Internet
structure
mobile network

Network edge: national or global ISP

 hosts: clients and servers


 servers often in data centers
local or
regional ISP

home network content


provider
network datacenter
network

enterprise
network

Introduction: 1-12
A closer look at Internet
structure
mobile network

Network edge: national or global ISP

 hosts: clients and servers


 servers often in data centers
local or
Access networks, physical media: regional ISP

 wired, wireless communication links home network content


provider
network datacenter
network

enterprise
network

Introduction: 1-13
A closer look at Internet
structure
mobile network

Network edge: national or global ISP

 hosts: clients and servers


 servers often in data centers
local or
Access networks, physical media: regional ISP

 wired, wireless communication links home network content


provider
network datacenter

Network core:
network

 interconnected routers
 network of networks enterprise
network

Introduction: 1-14
Access networks and physical
media
Q: How to connect end systems mobile network

to edge router?
national or global ISP

 residential access nets


 institutional access networks (school,
company)
local or
 mobile access networks (WiFi, 4G/5G) regional ISP

What to look for: home network content


provider
network
 transmission rate (bits per second) of access datacenter
network
network?
 shared or dedicated access among users?
enterprise
network

Introduction: 1-15
LECTURE
# 2:
INTRODUC
TION
Chapter 1: Introduction, Computer Networking: A Top-Down
Approach,
8th edition, Jim Kurose, Keith Ross, Pearson, 2020
Wireless access networks
Shared wireless access network connects end system to router
 via base station aka “access point”

Wireless local area networks Wide-area cellular access networks


(WLANs)  provided by mobile, cellular network
 typically within or around operator (10’s km)
building (~100 ft)  10’s Mbps
 802.11b/g/n (WiFi): 11, 54, 450  4G cellular networks (5G coming)
Mbps transmission rate

to Internet
to Internet
Introduction: 1-17
Host: sends packets of data
host sending function:
 takes application message
 breaks into smaller chunks, known two packets,
as packets, of length L bits L bits each
 transmits packet into access
network at transmission rate R 2 1

• link transmission rate, aka link host


capacity, aka link bandwidth R: link transmission rate

packet time needed to L (bits)


transmission = transmit L-bit =
delay packet into link R (bits/sec)
Introduction: 1-18
Links: physical media
 bit: propagates between Twisted pair (TP)
transmitter/receiver pairs  two insulated copper wires
 physical link: what lies • Category 5: 100 Mbps, 1 Gbps Ethernet
between transmitter & • Category 6: 10Gbps Ethernet
receiver
 guided media:
• signals propagate in solid
media: copper, fiber, coax
 unguided media:
• signals propagate freely,
e.g., radio
Introduction: 1-19
Links: physical media
Wireless radio Radio link types:
 signal carried in  terrestrial microwave
electromagnetic spectrum • up to 45 Mbps channels

 no physical “wire”  Wireless LAN (WiFi)


• Up to 100’s Mbps
 broadcast and “half-duplex”  wide-area (e.g., cellular)
(sender to receiver)
• 4G cellular: ~ 10’s Mbps
 propagation environment  satellite
effects: • up to 45 Mbps per channel
• reflection • 270 msec end-end delay
• obstruction by objects
• interference
Introduction: 1-21
LECTURE
# 3:
INTRODUC
TION
Chapter 1: Introduction, Computer Networking: A Top-Down
Approach,
8th edition, Jim Kurose, Keith Ross, Pearson, 2020
Topics from shared video
 Five components of data communication
 Data Flow
 Topologies

Introduction: 1-23
FIVE COMPONENTS OF DATA
COMMUNICATION
Data flow can occur in three ways:
 Simplex: In simplex mode, the communication is unidirectional. only
one of the devices on a link can transmit, the other can only receive. e.g.
keyboards, monitors, etc.
 Half-duplex: In this mode, each station can both transmit and receive,
but not at the same time. When one device is sending, the other can
only receive, and vice-versa. e.g. walkie-talkies etc.
 Full Duplex : In full duplex mode, both stations can transmit and receive
simultaneously. One common example of full duplex is the Telephone
network. When two people are communicating by a telephone line,
both can talk and listen at the same time. The full-duplex mode is used
when communication in both directions is required all the time.

Introduction: 1-26
Data flow can occur in three ways:

Introduction: 1-27
Network Topologies
 Physically or logically connected  Four basic criteria
nodes or devices • Basic cost
 Star, ring, bus, tree, hybrid • Expense required to link various
nodes or devices in system
 Topology trade-offs • Communication cost
• Need for fast communication • Time required to send message from
among all nodes or devices one node or device to another
• Tolerance of failure at a site or • Reliability
communication link • Assurance of nodes or devices
communication if link fails
• Cost of long communication lines
• User environment
• Difficulty connecting one node to • Critical parameters for successful
large number of other nodes business investment
https://www.networkstraining.com/compare-and-contrast-network-topologies/ 28
https://www.studytonight.com/computer-networks/network-topology-types
Wired Network Topologies: Bus
Topology
 Bus topology has a network
arrangement where nodes
make use of a single
communication line for data
transmission.
 Many networks at the
beginning of computer
networking era made use of
this topology due to easy
implementation

29
Bus Topology
 Advantages
• Since there is a single communication line, means the same medium is shared.
Therefore, the major advantage of using this topology is its simplicity.
• Easy to setup and extend.
• Less costly. Less cabling needs.
 Disadvantages
• On the other hand, having a single communication line for data transmission makes it
easier for collision to occur, which is seen as a disadvantage of using this network
topology.
• If the single network cable has a problem or disconnection, the whole network breaks.
• Difficult to identify a problem.
• All devices receive all signals from every other host. This is not efficient.

30
Wired Network Topologies: Star
Topology
 The star network topology is one of the
most commonly used topologies today
because of its simplicity and efficiency.
 In this kind of topology, a centralized
node is located at the core of the
network topology, in which all the other
nodes must communicate through.
 This topology is mostly used in homes
and offices today. For example, the
classic Ethernet LAN networks are using
the Star Topology. There is an Ethernet
Switch (centralized node) on which all
computers and network devices are
connected to.
31
Star Topology
 Advantages
• Easy to install and implement with wiring etc.
• Easy to troubleshoot and detect problems in the network.
• If one device fails, it does not affect the other devices in the network.
• You can easily add or remove devices without affecting the rest of the network.
• Centralized management and monitoring through the central switch/hub.
 Disadvantages
• Cost of installation is high.
• Expensive to use.
• If the hub fails, then the whole network is stopped because all the nodes depend on
the hub.
• Performance is based on the hub capability
32
Wired Network Topologies: Ring
Topology
 It is called ring topology because it forms a ring as each computer is connected to
another computer, with the last one connected to the first.
• Exactly two neighbors for each device.
 Features of Ring Topology
• A number of repeaters are used for Ring topology with large number of nodes, because if
someone wants to send some data to the last node in the ring topology with 100 nodes, then
the data will have to pass through 99 nodes to reach the 100th node. Hence to prevent data
loss repeaters are used in the network.
• The transmission is unidirectional, but it can be made bidirectional by having 2 connections
between each Network Node, it is called Dual Ring Topology.
• In Dual Ring Topology, two ring networks are formed, and data flow is in opposite direction in
them. Also, if one ring fails, the second ring can act as a backup, to keep the network up.
• Data is transferred in a sequential manner that is bit by bit. Data transmitted, has to pass
through each node of the network, till the destination node.

33
Wired Network Topologies: Ring
Topology

Dual Ring Topology


34
Ring Topology
 Advantages
• The advantage of using this network topology is the ability to have fast network
throughput.
• Less packet collisions.
• High speed transfers.
• Token is used between nodes thus making this performing better than bus
topology.
 Disadvantage
• The disadvantage is the point of failure, as a single node can break the
transmission of data on the network.
• Troubleshooting is difficult in ring topology.
• Adding or deleting the computers disturbs the network activity.
35
Wired Network Topologies: Tree
Topology
 Collection of buses connected by
branching cable
• No closed loops
 Designers create networks using bridges
 Message from any site
• Received by all other sites until reaching
end point
 Reaches end point controller without
acceptance
• Host absorbs message
 Advantage
• Message traffic still flows even if single node
fails
36
Tree Topology
 Advantages of Tree Topology
• Extension of bus and star topologies.
• Expansion of nodes is possible and easy.
• Easily managed and maintained.
• Error detection is easily done.
 Disadvantages of Tree Topology
• Heavily cabled.
• Costly.
• If more nodes are added maintenance is difficult.
• Central hub fails, network fails.

37
Wired Network Topologies: Mesh
Topology
 It is a point-to-point connection
to other nodes or devices. All
the network nodes are
connected to each other.
 There are two techniques to
transmit data over the Mesh
topology, they are :
• Routing
• Flooding

38
Mesh Topology
 Advantages of Mesh Topology
• Each connection can carry its own data load.
• It is robust.
• Fault is diagnosed easily.
• Provides security and privacy.
 Disadvantages of Mesh Topology
• Installation and configuration is difficult.
• Cabling cost is more.
• Bulk wiring is required.

39
Wired Network Topologies:
Hybrid Topology
 It is two different types of topologies which is a mixture of two or more topologies. For
example if in an office in one department ring topology is used and in another star topology is
used, connecting these topologies will result in Hybrid Topology (ring topology and star
topology).

40
Hybrid Topology
 Advantages of Hybrid Topology
• Reliable as Error detecting and trouble shooting is easy.
• Effective.
• Scalable as size can be increased easily.
• Flexible.
 Disadvantages of Hybrid Topology
• Complex in design.
• Costly.

41
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
Introduction: 1-42
The network core
 mesh of interconnected mobile network
national or global ISP
routers
 packet-switching: hosts break
application-layer messages
into packets local or
regional ISP

• forward packets from one router home network content


to the next, across links on path provider
network datacenter
from source to destination network

• each packet transmitted at full


link capacity enterprise
network

Introduction: 1-43
Packet-switching: store-and-
forward
L bits
per packet
3 2 1
source destination
R bps R bps

 Transmission delay: takes L/R seconds to


transmit (push out) L-bit packet into link at R One-hop numerical example:
bps  L = 10 Kbits
 Store and forward: entire packet must arrive at  R = 100 Mbps
router before it can be transmitted on next link  one-hop transmission delay
 End-end delay: 2L/R (above), assuming zero = 0.1 msec
propagation delay (more on delay shortly)
Introduction: 1-44
Packet-switching: queueing
delay, loss
R = 100 Mb/s
A C

D
B R = 1.5 Mb/s
E
queue of packets
waiting for output link

Packet queuing and loss: if arrival rate (in bps) to link exceeds
transmission rate (bps) of link for a period of time:
 packets will queue, waiting to be transmitted on output link
 packets can be dropped (lost) if memory (buffer) in router fills
up
Introduction: 1-45
Two key network-core functions

routing algorithm Routing:


 global action:
Forwarding: local forwarding table
header value output link determine source-
 local action: move 0100 3
destination paths
arriving packets 0101 2

from router’s
0111
1001
2
1 taken by packets
input link to  routing algorithms
appropriate 1
router output link 3 2
1
011

destination address in arriving


packet’s header
Introduction: 1-46
Alternative to packet switching: circuit
switching

end-end resources allocated to,


reserved for “call” between source
and destination
 in diagram, each link has four circuits.
• call gets 2nd circuit in top link and 1st
circuit in right link.
 dedicated resources: no sharing
• circuit-like (guaranteed) performance
 circuit segment idle if not used by call (no
sharing)
 commonly used in traditional telephone
networks
Introduction: 1-47
LECTURE
# 4:
INTRODUC
TION
Chapter 1: Introduction, Computer Networking: A Top-Down
Approach,
8th edition, Jim Kurose, Keith Ross, Pearson, 2020
Circuit switching: FDM and TDM
Frequency Division Multiplexing
(FDM) 4 users

frequency
 optical, electromagnetic frequencies
divided into (narrow) frequency
bands
 each call allocated its own band, can
transmit at max rate of that narrow time
band
Time Division Multiplexing (TDM)

frequency
 time divided into slots
 each call allocated periodic slot(s),
can transmit at maximum rate of
(wider) frequency band, but only time
during its time slot(s)
Introduction: 1-49
Internet structure: a “network of networks”

 Hosts connect to Internet via access Internet Service


Providers (ISPs)
• residential, enterprise (company, university, commercial) ISPs
 Access ISPs in turn must be interconnected
• so that any two hosts can send packets to each other
 Resulting network of networks is very complex
• evolution was driven by economics and national policies
 Let’s take a stepwise approach to describe current
Internet structure

Introduction: 1-50
Internet structure: a “network of networks”
Question: given millions of access ISPs, how to connect them together?

access
… access
net
access
net …
net
access
access net
net
access
access net
net


access access
net net

access
net
access
net

access
net
access
… net
access access …
net access net
net

Introduction: 1-51
Internet structure: a “network of networks”
Question: given millions of access ISPs, how to connect them together?

access
… access
net
access
net …
net
access
access
net
… … net

access
access net
net

connecting each access ISP to



each other directly doesn’t scale:


O(N2) connections.
access access

net net

access
net
access
net

access
net
access
… access
… … net
access
net access net
net

Introduction: 1-52
Internet structure: a “network of networks”
Option: connect each access ISP to one global transit ISP?
Customer and provider ISPs have economic agreement.

access
… access
net
access
net …
net
access
access net
net
access
access net
net


global
access
net
ISP access
net

access
net
access
net

access
net
access
… net
access access …
net access net
net

Introduction: 1-53
Internet structure: a “network of networks”
But if one global ISP is viable business, there will be competitors ….

access
… access
net
access
net …
net
access
access net
net
access
access net
net
ISP A


access
net ISP B access
net

access
net
ISP C
access
net

access
net
access
… net
access access …
net access net
net

Introduction: 1-54
Internet structure: a “network of networks”
But if one global ISP is viable business, there will be competitors …. who will
want to be connected
Internet exchange point
access
… access
net
access
net …
net
access
access net
net
IXP access
access net
net
ISP A


access
net
IXP ISP B access
net

access
net
ISP C
access
net

access
net
peering link
access
… net
access access …
net access net
net

Introduction: 1-55
Internet structure: a “network of networks”
… and regional networks may arise to connect access nets to ISPs

access
… access
net
access
net …
net
access
access net
net
IXP access
access net
net
ISP A


access
net
IXP ISP B access
net

access
net
ISP C
access
net

access
net
regional ISP access
… net
access access …
net access net
net

Introduction: 1-56
Internet structure: a “network of networks”
… and content provider networks (e.g., Google, Microsoft, Akamai) may
run their own network, to bring services, content close to end users
… access
… access
net
access
net

net
access
access net
net
IXP access
access net
net
ISP A


Content provider network
access
net
IXP ISP B access
net

access
net
ISP C
access
net

access
net
regional ISP access
… net
access access …
net access net
net

Introduction: 1-57
Internet structure: a “network of networks”

Tier 1 ISP Tier 1 ISP Google

IXP IXP IXP


Regional ISP Regional ISP

access access access access access access access access


ISP ISP ISP ISP ISP ISP ISP ISP

At “center”: small # of well-connected large networks


 “tier-1” commercial ISPs (e.g., Level 3, Sprint, AT&T, NTT), national & international coverage
 content provider networks (e.g., Google, Facebook): private network that connects its
data centers to Internet, often bypassing tier-1, regional ISPs
Introduction: 1-58
LECTURE
# 5:
INTRODUC
TION
Chapter 1: Introduction, Computer Networking: A Top-Down
Approach,
8th edition, Jim Kurose, Keith Ross, Pearson, 2020
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
Introduction: 1-60
Protocol “layers” and reference models

Networks are complex,


with many “pieces”: Question:
 hosts is there any hope of
 routers organizing structure of
 links of various media network?
 applications
 protocols
 hardware, software …. or at least our
discussion of networks?

Introduction: 1-61
Example: organization of air travel

ticket (purchase) ticket (complain)


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

airline travel: a series of steps, involving many services


Introduction: 1-62
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 Q: describe in words


 via its own internal-layer actions the service provided
 relying on services provided by layer below in each layer above

Introduction: 1-63
Why layering?
dealing with complex systems:
 explicit structure allows identification, relationship of
complex 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

Introduction: 1-64
Internet protocol stack
 application: supporting network applications
• IMAP, SMTP, HTTP
application
 transport: process-process data transfer
• TCP, UDP 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”
Introduction: 1-65
source
message M application Encapsulation
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-66
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
Introduction: 1-67
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
Introduction: 1-68
Internet history
1972-1980: Internetworking, new and proprietary nets
 1970: ALOHAnet satellite network
Cerf and Kahn’s internetworking
in Hawaii principles:
 1974: Cerf and Kahn - architecture  minimalism, autonomy - no
for interconnecting networks internal changes required to
 1976: Ethernet at Xerox PARC interconnect networks
 best-effort service model
 late70’s: proprietary architectures:
 stateless routing
DECnet, SNA, XNA  decentralized control
 late 70’s: switching fixed length
define today’s Internet architecture
packets (ATM precursor)
 1979: ARPAnet has 200 nodes
Introduction: 1-69
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

Introduction: 1-70
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]
 backbone links running at Gbps
• HTML, HTTP: Berners-Lee
• 1994: Mosaic, later Netscape
• late 1990s: commercialization of the
Web
Introduction: 1-71
Internet history
2005-present: more new applications, Internet is “everywhere”
 ~18B devices attached to Internet (2017)
• rise of smartphones (iPhone: 2007)
 aggressive deployment of broadband access
 increasing ubiquity of high-speed wireless access: 4G/5G, WiFi
 emergence of online social networks:
• Facebook: ~ 2.5 billion users
 service providers (Google, FB, Microsoft) create their own networks
• bypass commercial Internet to connect “close” to end user, providing
“instantaneous” access to search, video content, …
 enterprises run their services in “cloud” (e.g., Amazon Web Services,
Microsoft Azure)
Introduction: 1-72
Chapter 1: summary
We’ve covered a “ton” of material!
 Internet overview
 what’s a protocol? You now have:
 network edge, access network, core  context, overview,
• packet-switching versus circuit-
switching vocabulary, “feel”
• Internet structure of networking
 performance: loss, delay, throughput  more depth,
 layering, service models detail, and fun to
 security follow!
 history
Introduction: 1-73

You might also like