Scribd
Upload
45 views16 pages

Chapter 1 3newversion

Uploaded by

Agent Nawab
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
45 views16 pages

Chapter 1 3newversion

Uploaded by

Agent Nawab
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/ 16

DATA COMMUNICATIONS

AND COMPUTER
NETWORKS (DCN) CSC339
Instructor
Shahzad Rizwan
Assiatant Professor
COMSATS University Islamabad, Attock Campus

1
Last class Topics
 Chapter 1
 network edge; hosts,
access net,
• Different types of
access network
 Physical media
Computer
Networking: A Top
Down Approach
7th edition
Jim Kurose, Keith Ross
Pearson/Addison Wesley
April 2016

Transport Layer 3-2


Todays Topics
 Chapter 1
 Network core
 Circuit switching
 Packet switching

Computer
Networking: A Top
Down Approach
7th edition
Jim Kurose, Keith Ross
Pearson/Addison Wesley
April 2016

Transport Layer 3-3


A closer look at network structure:
 network edge: mobile network

• hosts: clients and servers


global ISP
• servers often in data
centers
home
 access networks, network
regional ISP
physical media: wired,
wireless
communication links
 network core:
• interconnected routers
• network of networks
• Two approaches institutional
network
• Circuit switching
• Packet switching Introduction 1-4
circuit segment idle if not used by call
circuit switching (no sharing)
commonly used in traditional
end-end resources allocated telephone networks
to, reserved for “call” For continuous nature communication
between source & dest: mobile network

 in diagram, each link 2MB


B global ISP
• A wants to communicate
with B, and needs 1.5MB
data rate home
 Call setup network
D regional ISP
 Transmit data
• C wants to D, need 1.5MB
 Call setup C
 No call setup
 dedicated resources: no sharing A
• circuit-like (guaranteed)
institutional
performance network
Introduction 1-5
Circuit switching: FDM versus TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-6
circuit switching

mobile network
A
communicate B global ISP
with B, and
needs home
1.5MB data network
D regional ISP
rate
Call setup
Transmit data C

institutional
network
Introduction 1-7
Packet-switching: store-and- segment idle can b used by others
forward commonly used in Internet
For bursty data
 in diagram, each link 2MB
• A wants to communicate
with B, and needs 1.5MB
data rate mobile network
 Transmit data B

• C wants to D, need 1.5MB global ISP

 Transmit data
 Sharing resources homeD
network
• No guaranteed delivery regional ISP

institutional
network Introduction 1-8
Packet-switching: store-and-forward
L bits L
per packet
R R R
source 3
destination

 divides into packet


 Each packet has full address
 takes L/R seconds to transmit one-hop numerical
(push out) L-bit packet into example:
link at R bps  L = 7.5 Mbits
 store and forward: entire  R = 1.5 Mbps
packet must arrive at router
before it can be transmitted  one-hop transmission
on next link delay = L/R= 5 sec
 End-to-end delay=
 end-end delay = 3L/R (assuming more on delay shortly …
zero propagation delay) 3L/R= 3*5= 15 seconds
Introduction 1-9
Switching Strategies

(a) Circuit switching (b) Message switching (c) Packet switching


Introduction 1-10
Packet Switching: queueing delay, loss

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

queuing and loss:


 if arrival rate (in bits) to link exceeds transmission rate of link
for a period of time:
• packets will queue, wait to be transmitted on link
• packets can be dropped (lost) if memory (buffer) fills up

Introduction 1-11
Packet switching versus circuit switching
is packet switching a “slam dunk winner?”
 great for bursty data
• resource sharing
• simpler, no call setup
 excessive congestion possible: 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 7)

Q: human analogies of reserved resources (circuit switching)


versus on-demand allocation (packet-switching)?
Introduction 1-12
Packet-switching: store-and-forward
L bits L
per packet R
R
R
source 3
destination

one-hop numerical example:


 L = 7.5 Mbits one-hop numerical
 Divide it in 5 packets, L1 , L2 , L3 , L4 , example:
L5 ,=7.5/5=1.5Mbps  L = 7.5 Mbits
 R = 1.5 Mbps
 R = 1.5 Mbps  one-hop transmission
 one-hop transmission delay = 5 sec delay = 5 sec
 3 hops delay = 3*5
 end-end delay = 3L/R (assuming more on delay shortly …
zero propagation delay) Introduction 1-13
Packet-switching: store-and-forward
5sec 6sec 7sec
L

L5 , L4 , L3 , L2 , L1 R L1 R R
L1
L2 destination
L3 L2 L L3 L2 L1
5sec4sec3sec2sec 1sec L4 L3 4

5 packets example: L5 L4 L5
L5
 L = 7.5 Mbits One packet example:
 Divide it in 5 packets, L1 , L2 , L3 , L4 ,  L = 7.5 Mbits
L5 ,=7.5/5=1.5Mbps  R = 1.5 Mbps
 one-hop transmission
delay = 5 sec
 3 hops delay = 3*5

Introduction 1-14
Switching Strategies

(a) Circuit switching (b) Message switching (c) Packet switching


Introduction 1-15
Two key network-core functions
routing: determines source-
destination route taken by forwarding: move packets
packets from router’s input to
 routing algorithms appropriate router output

routing algorithm

local forwarding table


header value output link
0100 3 1
0101 2
0111 2 3 2
1001 1
1
011

destination address in arriving


packet’s header
Introduction 1-16

You might also like