Академический Документы
Профессиональный Документы
Культура Документы
Networks
Introduction
Dr Ali H. El-Mousa
elmousa@ju.edu.jo
Overview
Course Administration issues
Syllabus
Networking: An overview of ideas and issues
Whos Who
Instructor:
Dr Ali El-Mousa
elmousa@ju.edu.jo
23003
Room 415 CPE Dept
Web Resources
Course:
http://uojcourses.awardspace.com/Comp%20ne
ts%202011/index.html
CPE Department:
http://fetweb.ju.edu.jo/cpe
Text book:
http://vig.pearsoned.co.uk/catalog/academi
c/product/0,1144,0321497708,00.html
Text book:
Computer Networking, A top-Down Approach
By: James Kurose and Keith Ross,
Addison Wesley, 2013 (6th Edition)
Answers to FAQ
Course material focuses on concepts rather
than technologies. Therefore you WILL NOT
become an expert in installing and running
Windows 2003 server as a result of this course.
There are no make ups for missed quizzes or
exams under any circumstance. So do not be
absent.
Exams will be closed notes and books and they
will be time-limited.
Course material is NOT all from the text book.
Answers to FAQ
Focus of exam and quizzes will be on
conceptual understanding, and problem-solving
skill.
There will be around five quizzes.
ALL quizzes will be counted.
Every student HAS TO attend the class he/she
registered in. Please DO NOT ASK for changing
classes internally.
Attendance is mandatory. If you are absent for 8
classes or more then you will be banned form
the final exam.
Information, Computers,
Networks
Information: anything that is represented in bits
Form (can be represented as bits) vs.
Substance (cannot be represented as bits)
Properties:
Infinitely replicable
Computers can manipulate information
Networks create access to information
Networks
Potential of networking:
move bits everywhere, cheaply, and with
desired performance characteristics
Break the space barrier for information
What is Connectivity ?
Direct or indirect access to every other node
in the network
Connectivity is the magic needed to
communicate if you do not have a direct pt-pt
physical link.
Tradeoff: Performance characteristics worse than
true physical link!
Connectivity 1
Building Blocks
links: coax cable, optical fiber...
nodes: general-purpose workstations...
Direct connectivity:
point-to-point
multiple access
Connectivity 2
Indirect Connectivity
switched networks
=> switches
inter-networks
=> routers
Connectivity 3
Internet:
Best-effort
(no performance guarantees)
Packet-by-packet
A pt-pt physical link:
Always-connected
Fixed bandwidth
Fixed delay
Zero-jitter
Point-to-Point
Connectivity
A
...
Bus
Full mesh
Filtering, forwarding
Filtering: choose a subset of elements
from a set
Filtering is the key to efficiency & scaling
Connecting N users:
Indirectly
Star
Connecting N users:
Indirectly
Ring: Reliability to link failure,
near-minimal links
All nodes do forwarding and
filtering
Ring
Inter-Networks: Networks
of Networks
Internet
Inter-Networks: Networks
of Networks
Internetworking involves two fundamental
problems: heterogeneity and scale
Concepts:
Translation, overlays, address & name
resolution, fragmentation: to handle
heterogeneity
Hierarchical addressing, routing, naming,
address allocation, congestion control: to
handle scaling
Fragmentation
Switching, bridging, routing
Naming, addressing
Congestion control, traffic
management
Reliability
millions of connected
server
computing devices:
hosts = end systems
wireless
laptop
running network
cellular
handheld
apps
communication links
fiber, copper,
access
points
radio, satellite
wired
links
transmission
rate = bandwidth
routers: forward
router
packets (chunks of
data)
Mobile network
Global ISP
Home network
Regional ISP
Institutional network
1-25
Internet phones
1-26
Mobile network
Global ISP
Internet: network of
networks
loosely hierarchical
public Internet versus private
intranet
Home network
Regional ISP
Institutional network
Internet standards
RFC: Request for comments
IETF: Internet Engineering
Task Force
1-27
29
How to do system
design ?
Time
Computation
Money
Labor
Building blocks:
Multiplexing
Multiplexing = sharing
Statistical Multiplexing
Reduce resource requirements by exploiting
statistical knowledge of the system.
E.g.: average rate service rate peak
rate
If service rate < average rate, then
system becomes unstable!!
First design to ensure system stability!!
Stability of a Multiplexed
System
Whats a performance
tradeoff ?
Switch packets at
intermediate nodes
Resource reservation
Store-and-forward if bandwidth
is not immediately available.
Packet Switching
10 Mbs
Ethernet
A
B
statistical multiplexing
1.5 Mbs
queue of packets
waiting for output
link
45 Mbs
FDM
4 users
frequency
time
TDM
frequency
time
1-39
TCP connection
req.
Hi
TCP connection
reply.
Got the
time?
2:00
<file>
time
ticket (complain)
baggage (check)
baggage (claim)
gates (load)
gates (unload)
runway takeoff
runway landing
airplane routing
airplane routing
airplane routing
ticket (complain)
baggage (check)
baggage (claim)
gates (load)
gates (unload)
runway takeoff
runway landing
airplane routing
airplane routing
airplane routing
interface
ticket (purchase)
ticket (complain)
baggage (check)
baggage (claim)
gates (load)
gates (unload)
runway takeoff
runway landing
airplane routing
airplane routing
airplane routing
airplane routing
arriving airport
Departing airport
Distributed implementation of
layers
Protocol Implementations
Are building blocks of a network architecture
Each protocol object has two different interfaces
service interface: defines operations on this
protocol
peer-to-peer interface: defines messages
exchanged with peer
Li+1
Li+1
service interface
Li
peer interface
Li
TCP/IP Protocols
Application
Transport
TCP
UDP
Internetwork
IP
Host to
Network
application
transport
network
link
physical
Layering: logical
communication
E.g.: transport
take data from app
add addressing,
reliability check info
to form datagram
send datagram to
peer
wait for peer to ack
receipt
analogy: post office
data
application
transport
transport
network
link
physical
application
transport
network
link
physical
ack
data
network
link
physical
application
transport
network
link
physical
data
application
transport
transport
network
link
physical
Layering: physical
communication
data
application
transport
network
link
physical
application
transport
network
link
physical
network
link
physical
application
transport
network
link
physical
data
application
transport
network
link
physical
application
transport
network
link
physical
destination
application
Ht
transport
Hn Ht
network
Hl Hn Ht
link
physical
message
segment
M
M
datagram
frame
Design Perspectives
Network users: services that their
applications need, e.g., guarantee that each
message it sends will be delivered without
error within a certain amount of time
Network designers: cost-effective design
e.g., that network resources are efficiently
utilized and fairly allocated to different users
Network providers: system that is easy to
administer and manage e.g., that faults can be
easily isolated and it is easy to account for
usage
A
B
1-53
2. queueing
time waiting at output
link for transmission
depends on congestion
level of router
transmission
propagation
nodal
processing
queueing
1-54
transmission
4. Propagation delay:
d = length of physical link
s = propagation speed in
medium (~2x108 m/sec)
propagation delay = d/s
Note: s and R are very
different quantities!
propagation
nodal
processing
queueing
1-55
Caravan analogy
100 km
ten-car
caravan
toll
booth
cars propagate at
100 km/hr
toll booth takes 12 sec to
service car (transmission
time)
car~bit; caravan ~ packet
Q: How long until caravan is
lined up before 2nd toll
booth?
100 km
toll
booth
toll
booth
100 km
toll
booth
1-57
Nodal delay
1-59
3 probes
3 probes
1-60
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)
A
B
packet arriving to
full buffer is lost
1-62
Throughput
throughput: rate (bits/time unit) at which bits
transferred between sender/receiver
instantaneous: rate at given point in time
average: rate over long(er) period of time
link
capacity
that
can carry
server,
server
sendswith
bits pipe
fluid
at rate
file of
F bits
(fluid)
into
pipe
Rs bits/sec
to send to client
Rs bits/sec)
link that
capacity
pipe
can carry
at rate
Rfluid
c bits/sec
Rc bits/sec)
1-63
Throughput (more)
Rs < Rc What is average end-end throughput?
Rs bits/sec
Rs
Rc bits/sec
Rc bits/sec
bottleneck link
link on end-end path that constrains end-end throughput
1-64
Rs
Rs
Rs
R
Rc
Rc
Rc
Summary
Administrative heads-up
Networks, connectivity, topologies
A selection of networking concepts
and problems to be explored
(hopefully)in this course ...