0% found this document useful (0 votes)
66 views55 pages

COMP 361 - "Networks ": WWW - Cs.ust - HK/ Golin

Uploaded by

Rafia Shoukat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
66 views55 pages

COMP 361 - "Networks ": WWW - Cs.ust - HK/ Golin

Uploaded by

Rafia Shoukat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 55

COMP 361 – “Networks ”

 Instructor: Mordecai Golin www.cs.ust.hk/~golin

 http://course.cs.ust.hk/comp361/fall2003/html/comp361.html
(or via instructor’s web site) contains all notes,
announcements, etc. Check it regularly!

 Class meets Tuesday/Thursday 9:10:20 Rm 2407

 Labs: Friday 12-12:50 and 17:17:50 Rm 4214

Comp361, Fall 2003 Chapter 1: Introduction 1


Textbook: James Kurose and Keith Ross
Computer Networks: A Top Down Approach Featuring The Internet,
2nd ed., Addison Wesley, 2002

Course material is based on lecture notes and chapters in the textbook.


You are responsible to read the corresponding book chapters.

There is one project (to be announced at start of Oct. Will take one month)

Labs are actually tutorials to review material and time to work on project.
You will be given homework questions to practice on but they will not be
marked

Class Grading Scheme:


Midterm Examination 30 points
Final Examination 40 points
Course Project  30 points

Comp361, Fall 2003 Chapter 1: Introduction 2


Other Stuff
You must have a CS department UG UNIX account (not a windows
account) in order to work on the project.

The project will have to be written in Java. Please see the notes
section of the web site
http://course.cs.ust.hk/comp361/spr2003/html/spr03sch.html
under Lab notes (week 1) for a tutorial (re)introduction to Java.

The textbook has a an accompanying web site


http://wps.aw.com/aw_kurose_network_2/
with useful resource material, e.g., illustrative applets.
Protected section of the site also has self-study quizzes.

Comp361, Fall 2003 Chapter 1: Introduction 3


Copyright Notice
Material that follows is substantially based on
powerpoint slides developed and copyrighted
by J.F. Kurose and K.W. Ross, 1996-2002.

Comp361, Fall 2003 Chapter 1: Introduction 4


Philosophical Quandary: Top Down or Bottom Up?

Two ways to teach


 Bottom Up: Start with Physical (e.g.,
application
wires) layer and move up to Application
(e.g., mail, web browsers) layer
transport explaining how known resources can be
used to implement requested services
network  Top Down : Start with Application layer
and move down to Physical layer,
link explaining how required applications can
be implemented
physical
We teach top down!

Comp361, Fall 2003 Chapter 1: Introduction 5


Chapter 1: Computer Networks and the Internet

Chapter goal: Overview:


 get context, overview,  1.1 what’s the Internet?
“feel” of networking  1.2 what’s a protocol?
 more depth, detail later  1.3 network edge – end devices
in course  1.4 network core – circuit, packet, and
 approach: message switching
 descriptive  1.5 access networks & physical media
 use Internet as  1.6 performance: loss, delay
example  1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 6


What’s the Internet: “nuts and bolts” view
 Internet: “network of networks” router workstation
 loosely hierarchical: company
networks, access networks, server
local ISPs (Internet Service
mobile
To backbone
Providers), regional ISPs local ISP provider
 millions of connected
computing devices: hosts, end-
systems Ac
ce
 pc’s workstations, servers ss
N regional ISP
 PDA’s phones, toasters et
w or
running network applications k
 communication links made up
of different physical media:
 fiber, copper, radio, satellite
 routers: forward packets
(chunks) of data thru network company
network
Comp361, Fall 2003 Chapter 1: Introduction 7
1.1 What’s the Internet: “nuts and bolts” view
 protocols control the sending and receiving of information
(messages) within the Internet
 e.g., TCP, IP, HTTP, FTP, PPP
 Internet standards
 IETF, the Internet Engineering Task Force, is where much of
“standards” in used in the Internet today were discussed and
created. IETF is a forum that is open to any interested individuals.
The standards it created are contained in documents known as
RFC, Request for comments.
 Important websites:
• Internet Engineering Task Force (IETF) – www.ietf.org
• Internet Society – www.isoc.org
• The World Wide Web Consortium (W3C) – www.w3.org/Consortium
and others listed in section 1.1.3 of the text.

Comp361, Fall 2003 Chapter 1: Introduction 8


What’s the Internet: a service view
 communication infrastructure
enables distributed applications:
 WWW, email, games, e-
commerce, database, voting,
 more?

 communication services
provided:
 Connectionless
Vs.
 Connection-oriented

 The dichotomy of
connectionless/connection-oriented
service can be applied to different
communication layers. We will return
later to the concept of layering.

Comp361, Fall 2003 Chapter 1: Introduction 9


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 10


1.2 What’s a protocol?
protocols define format, order of … specific msgs (messages)
messages sent and received among sent
network entities, and actions taken … specific actions taken when
on msg transmission, receipt msgs received, or other
events

network protocols:
human protocols:  machines rather than
 “what’s the time?”
humans
 “I have a question”  all communication activity in
 introductions Internet governed by
protocols
 An important concept is that Communication protocols are
structured in layers. Each protocol layer makes uses of the
services provided by the layer below and provides a service to
the layer above.
Comp361, Fall 2003 Chapter 1: Introduction 11
What’s a protocol?
a human protocol and a computer network protocol:

Hi TCP connection
req.
Hi
TCP connection
Got the reply.
time? Get http://gaia.cs.umass.edu/index.htm
2:00
<file>
time

Q: Other human protocol?


Comp361, Fall 2003 Chapter 1: Introduction 12
A closer look at network structure:
 network edge:
applications and hosts
 network core:
 routers
 network of networks
 access networks,
physical media:
communication links

Comp361, Fall 2003 Chapter 1: Introduction 13


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 14


1.3 The network edge:
 end systems (hosts):
 run application programs
 e.g., WWW, email
 at “edge of network”
 client/server model
 client initiates requests to and
receives service from server
 e.g., WWW client (browser)/
server; email client/server
 peer-peer model:
 host interaction is symmetric
 e.g.: teleconferencing

Comp361, Fall 2003 Chapter 1: Introduction 15


Network edge: connection-oriented service

Goal: data transfer between TCP


end sys.
service [RFC 793]
 handshaking: setup (prepare
 for) data in-order
reliable, transfer byte-
ahead
of time stream data transfer
 Hello, hello back human protocol
loss: acknowledgements
 set up “state” in two communicating hosts
and retransmissions
 TCP - Transmission Control Protocol
 flow control:
 Internet’s connection-oriented service
 sender won’t overwhelm
receiver
 congestion control:
 senders “slow down sending
rate” when network
congested

Comp361, Fall 2003 Chapter 1: Introduction 16


Network edge: connectionless service
Goal: data transfer
between end systems App’s using TCP:
 same as before!  HTTP (WWW), FTP (file
 UDP - User Datagram transfer), Telnet (remote
Protocol [RFC 768]: login), SMTP (email)
Internet’s connectionless
service App’s using UDP:
 unreliable data  streaming media,
transfer teleconferencing,
 no flow control Internet telephony
 no congestion control
 but faster!

Comp361, Fall 2003 Chapter 1: Introduction 17


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 18


1.4 Network Core

Circuit Switching vs. Packet Switching


 the fundamental question: how is data transferred through net?
Circuit switching: dedicated circuit per call: telephone net
 Packet switching: data sent thru net in discrete “chunks”
 In circuit switching, a channel of fixed rate (bandwidth) is provided
between the communicating end-points. In packet switching, packets
are exchanged only as needed.
 In circuit switching, identity of the data being transferred is provided
implicitly by its time slot or frequency assignment. In packet switching,
identity of data must be explicitly specified by a header.
 Circuit switching must be connection-oriented. Packet switching can
be connectionless (datagram), or connection-oriented (virtual circuit).
 Modern computer communication is based on packet switching

Comp361, Fall 2003 Chapter 1: Introduction 19


Clarification
Transport Layer
TCP and UDP are Transport Layer protocols that provide connection-
oriented and connectionless services to Application Layer clients

Switching Paradigm
Circuit Switching vs Packet Switching (or Message Switching) occurs at
the physical switching layer. Circuit Switching is the system usually
used by telephone networks but is not used in the Internet (except, e.g.,
when you dial up to an ISP using a modem).

Network Layer (Assuming Packet Switching)


Datagram and Virtual Circuits are network service models at the Network
Layer. Current Internet architecture only provides a Datagram service.

Comp361, Fall 2003 Chapter 1: Introduction 20


Network Core - Circuit Switching

Circuit Switching
 call setup (and tear-down)
required
 split bandwidth into “pieces”
by
 frequency division or
 time division
 Bandwidth and switch
resources reserved for the
duration of a call
 dedicated resources:
no sharing
 circuit-like (guaranteed)
performance
 Ex: telephone network

Comp361, Fall 2003 Chapter 1: Introduction 21


Network Core: Packet Switching
each end-end data stream resource contention:
divided into packets  aggregate resource
 user A, B packets share demand can exceed
network resources amount available
 each packet transmitted at  congestion: packets
full link bandwidth queue, wait for link use
 resources used as needed,  store and forward:
packets move one hop
at a time
Bandwidth division into “pieces”  transmit over link
Dedicated allocation  wait turn at next link
Resource reservation

Comp361, Fall 2003 Chapter 1: Introduction 22


Network Core: Packet Switching
10 Mbs
A Ethernet statistical multiplexing C

1.5 Mbs
B
queue of packets 45 Mbs
waiting for output
link

D E

Packet-switching versus circuit switching: human


restaurant analogy

Comp361, Fall 2003 Chapter 1: Introduction 23


Packet switching versus circuit switching
Is packet switching a “slam dunk winner?”
 Great for bursty data
 resource sharing
 no call setup
 Excessive congestion: packet delay and loss
 protocols needed for reliable data transfer,
congestion control
 Q: How to provide circuit-like behavior?
 bandwidth guarantees needed for audio/video apps

still an unsolved problem (chapter 6)

Comp361, Fall 2003 Chapter 1: Introduction 24


Packet-switched networks: routing
 Goal: move packets among routers from source to
destination
 we’ll study several path selection algorithms (chapter 4)
 datagram network:
 destination address determines next hop
 routes may change during session
 analogy: driving, asking directions

 virtual circuit network:


 each packet carries tag (virtual circuit ID), tag determines next
hop
 fixed path determined at call setup time, remains fixed thru call
 routers maintain per-call state

Comp361, Fall 2003 Chapter 1: Introduction 25


Clarification
Transport Layer
TCP and UDP are Transport Layer protocols that provide connection-
oriented and connectionless services to Application Layer clients

Switching Paradigm
Circuit Switching vs Packet Switching (or Message Switching) occurs at
the physical switching layer. Circuit Switching is the system usually
used by telephone networks but is not used in the Internet (except, e.g.,
when you dial up to an ISP using a modem).

Network Layer (Assuming Packet Switching)


Datagram and Virtual Circuits are network service models at the Network
Layer. Current Internet architecture only provides a Datagram service.

Comp361, Fall 2003 Chapter 1: Introduction 26


Core Network - Summary

Comp361, Fall 2003 Chapter 1: Introduction 27


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 28


1.5 Access networks and physical media
Q: How to connect end
systems to edge router?
 residential access nets
 institutional access
networks (school,
company)
 mobile access networks

Keep in mind:
 bandwidth (bits per
second) of access
network?
 shared or dedicated?

Comp361, Fall 2003 Chapter 1: Introduction 29


Residential access
Cable Modem
Point-to-point  HFC: hybrid fiber coax
 Dialup via modem  asymmetric: up to 10Mbps
 up to 56Kbps direct access to upstream, 1 Mbps downstream
 network of cable and fiber attaches
router (conceptually)
 ISDN: integrated services digital homes to ISP router
 shared access to router among
network: 128Kbps all-digital
homes
connect to router
 issues: congestion, dimensioning
 ADSL: asymmetric digital
 deployment: available via cable
subscriber line
companies
 up to 1 Mbps home-to-router
 up to 8 Mbps router-to-home

Comp361, Fall 2003 Chapter 1: Introduction 30


Institutional access: local area networks
 company/univ local area
network (LAN) connects end
system to edge router
 Ethernet:
 shared or dedicated
cable connects end
system and router
 10 Mbs, 100Mbps,
Gigabit Ethernet
 deployment: institutions,
home LANs soon
 LANs: chapter 5

Comp361, Fall 2003 Chapter 1: Introduction 31


Wireless access networks
 shared wireless access
network connects end
system to router router
 wireless LANs:
 radio spectrum replaces base
wire station
 e.g., Lucent Wavelan 10
Mbps
 wider-area wireless
access
 CDPD: wireless access to mobile
ISP router via cellular hosts
network

Comp361, Fall 2003 Chapter 1: Introduction 32


Physical Media
Twisted Pair (TP)
 physical link: transmitted data bit propagates across
 two insulated copper
link
wires
 guided media:
 Category 3: traditional
 signals propagate in solid media: copper,
phonefiber
wires, 10 Mbps
 unguided media: Ethernet
 Category 5 TP: 100Mbps
 signals propagate freely, e.g., radio
Ethernet

Comp361, Fall 2003 Chapter 1: Introduction 33


Physical Media: coax, fiber
Coaxial cable: Fiber optic cable:
 wire (signal carrier) within a
concentric shield  glass fiber carrying light
 Baseband (50 ohm): single pulses
channel on cable. ~1cm
thick, popular in old 10 Mbs  high-speed operation:
Ethernet  100Mbps Ethernet
 Broadband (75 ohm):
multiple channels on cable,
 high-speed point-to-point
each channel shifted to a transmission (e.g., 10 Gps)
different frequency band.  low error rate
Thick and stiffer, common in
cable TV systems.
 bidirectional

Comp361, Fall 2003 Chapter 1: Introduction 34


Physical media: radio
 signal carried in Radio link types:
electromagnetic  microwave
spectrum  e.g. up to 45 Mbps channels

 no physical “wire”  LAN (e.g., waveLAN)


 bidirectional  2Mbps, 11Mbps
 propagation environment  wide-area (e.g., cellular)
 e.g. CDPD, 10’s Kbps
effects:
 reflection  satellite
 obstruction by objects  up to 50Mbps channel (or
 interference multiple smaller channels)
 270 Msec end-end delay
 geosynchronous versus
LEOS
Comp361, Fall 2003 Chapter 1: Introduction 35
Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 36


1.6 Delay & Loss in packet-switched networks

packets queue in router buffers


 packet arrival rate to link exceeds output link capacity
 packets queue, wait for turn

packet being transmitted (delay)

B
packets queuing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Comp361, Fall 2003 Chapter 1: Introduction 37
Delay in packet-switched networks
packets experience delay  1. nodal processing:
 check bit errors
on end-to-end path
 determine output link
 four sources of delay at
 2. queuing:
each hop  time waiting at output link
for transmission
 depends on congestion
level of router
transmission
A propagation

B
nodal
processing queuing

Comp361, Fall 2003 Chapter 1: Introduction 38


“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
 router i will return packets to sender
 sender times interval between transmission and reply.

3 probes 3 probes

3 probes

Comp361, Fall 2003 Chapter 1: Introduction 39


Packet loss
 queue (aka buffer) preceding link in buffer
has finite capacity
 when packet arrives to full queue, packet is
dropped (aka lost)
 lost packet may be retransmitted by previous
node, by source end system, or not
retransmitted at all

Comp361, Fall 2003 Chapter 1: Introduction 40


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 41


1.7 - Protocol “Layers”
Networks are complex! Layering breaks a complex problem
 many “pieces”: into smaller pieces with clear
 hosts
relationships
 explicit structure allows identification,
 routers
relationship of complex system’s
 links of various media
pieces
 applications  Provide a reference model for
 protocols discussion
 hardware, software  modularization eases maintenance,

Question: updating of system


 Allow changes in implementation
Is there any hope of organizing
structure of network? of a layer without affecting the rest
of the system
Or at least our discussion of
networks?

Comp361, Fall 2003 Chapter 1: Introduction 42


Protocol Layering and Data
Each protocol layer:
 Contains “entities” implementing layer functions at each node,
which may include: Error Control, Flow Control, Segmentation and
Reassembly, Multiplexing, and Connection Setups.
 entities perform actions and exchange messages known as
Protocol Data Units (PDU) with peers. Layer n entities would
exchange n-PDU using the service of layer n-1.
 Each layer takes data from above
 adds layer header information to create new data unit
 passes new data unit to layer below

source destination
M Layer 5 M 5-PDU
Layer 5
H4 M Layer 4 Layer 4 H4 M 4-PDU
H3H4 M Layer 3 Layer 3 H3H4 M 3-PDU
H2 H3H4 M Layer 2 Layer 2 H2 H3H4 M 2-PDU
Layer 1 Layer 1

Comp361, Fall 2003 Chapter 1: Introduction 43


Internet protocol stack
 application: supporting network applications
 ftp, smtp, http

 transport: host-host data transfer application


 tcp, udp
 network: routing of datagrams from source
transport
to destination
 ip, routing protocols Host
 link: data transfer between neighboring network
network elements
 ppp, ethernet
link Router
 physical: bits “on the wire”, modulation
scheme, line-coding format, electrical &
physical specifications, etc. physical
 Routers in the network operate only up to
the Network Layer

Comp361, Fall 2003 Chapter 1: Introduction 44


Example of Layering: logical communication
data
E.g.: transport application
 take data from app transport
transport
network
 add addressing,
link
reliability check info physical
to form “datagram” ack network
 send datagram to application link
transport data physical
peer using service network
provided by the link data
Network Layer physical application application
 wait for peer to transport transport
transport
acknowledge network network
receipt link link
physical physical

Comp361, Fall 2003 Chapter 1: Introduction 45


Layering: physical communication
data
application
transport
network
link
physical
network
application link
transport physical
network
link
physical data
application application
transport transport
network network
link link
physical physical

Comp361, Fall 2003 Chapter 1: Introduction 46


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 47


1.8 Internet structure: network of networks
 roughly hierarchical
 national/international
local
backbone providers (NBPs) ISP
 e.g. BBN/GTE, Sprint, AT&T, regional ISP
IBM, UUNet
 interconnect (peer) with each NBP B
other privately, or at public
Network Access Point (NAPs) NAP NAP
 regional ISPs NBP A
 connect into NBPs
regional ISP
 local ISP, company local
 connect into regional ISPs ISP

Comp361, Fall 2003 Chapter 1: Introduction 48


National Backbone Provider
e.g. BBN/GTE US backbone network

Comp361, Fall 2003 Chapter 1: Introduction 49


Chapter 1: Computer Networks and the Internet

 1.1 what’s the Internet?


 1.2 what’s a protocol?
 1.3 network edge – end devices
 1.4 network core – circuit, packet, and message
switching
 1.5 access networks & physical media
 1.6 performance: loss, delay
 1.7 protocol layers & service models
 1.8 Internet backbones, NAPs, ISPs
 1.9 history

Comp361, Fall 2003 Chapter 1: Introduction 50


1.9 Internet History
1961-1972: Early packet-switching principles
 1961: Kleinrock - queueing  1972:
theory shows effectiveness  ARPAnet demonstrated
of packet-switching publicly
 1964: Baran - packet-  NCP (Network Control
switching in military nets Protocol) first host-host
 1967: ARPAnet conceived protocol
by Advanced Research  first e-mail program
Projects Agency  ARPAnet has 15 nodes
 1969: first ARPAnet node
operational

Comp361, Fall 2003 Chapter 1: Introduction 51


Internet History
1972-1980: Internetworking, new and proprietary nets
 1970: ALOHAnet satellite
Cerf and Kahn’s internetworking
network in Hawaii principles:
 1973: Metcalfe’s PhD thesis  minimalism, autonomy -
proposes Ethernet no internal changes
 1974: Cerf and Kahn - required to interconnect
architecture for interconnecting networks
networks  best effort service model
 late70’s: proprietary  stateless routers
architectures: DECnet, SNA,  decentralized control
XNA

define today’s Internet
late 70’s: switching fixed length
architecture
packets (ATM precursor)
 1979: ARPAnet has 200 nodes

Comp361, Fall 2003 Chapter 1: Introduction 52


Internet History
1980-1990: new protocols, a proliferation of networks

 1983: deployment of  new national networks:


TCP/IP Csnet, BITnet, NSFnet,
 1982: smtp e-mail Minitel
protocol defined  100,000 hosts
 1983: DNS defined for connected to
name-to-IP-address confederation of
translation networks
 1985: ftp protocol
defined
 1988: TCP congestion
control
Comp361, Fall 2003 Chapter 1: Introduction 53
Internet History
1990’s: commercialization, the WWW
 Early 1990’s: ARPAnet
Late 1990’s & 2000’s:
decommissioned
 est. 50 million computers
 1991: NSF lifts restrictions on
commercial use of NSFnet on Internet
(decommissioned, 1995)  est. 100 million+ users
 early 1990s: WWW  backbone links running at
 hypertext [Bush 1945, 1 Gbps
Nelson 1960’s]
 HTML, http: Berners-Lee Chapter 1: Summary
 1994: Mosaic, later
Netscape You now hopefully have:
 late 1990’s:  context, overview, “feel” of

commercialization of the networking


WWW  more depth, detail later in course

Comp361, Fall 2003 Chapter 1: Introduction 54


Chapter 1: Summary
Covered a “ton” of You now hopefully have:
material!  context, overview,
 Internet overview “feel” of networking
 what’s a protocol?
 more depth, detail later
 network edge, core,
in course
access network
 performance: loss, delay
 layering and service
models
 backbones, NAPs, ISPs
 history
 ATM network

Comp361, Fall 2003 Chapter 1: Introduction 55

You might also like