Networks Lecture 3

Download as pdf or txt
Download as pdf or txt
You are on page 1of 25

Computer Networks

Lecture 3
By: Dr. Dina Fawzy

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Agenda
• Network performance parameters: delay, loss and throughput
• Networks security
• Protocol Layers and Service Models
• Internet Protocol Stack
• ISO/OSI Model

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters
• We can measure the good performance of the network using the
following parameters:
1. Loss
2. Delay
3. Throughput

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters
• In computer networks, a queue is a collection of data packets
collectively waiting to be transmitted by a network device using a per-
defined structure methodology.

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters
• Network congestion (overloading) leads to network delay and packet
loss.
• Network Delay occurs if the size of the queue is large, and each
packet has to wait until its delivery in excessive network traffic.
• Packets Loss occurs when the network discarded some packets
because the queue reaches its maximum capacity and can’t
accommodate any more packets.

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Loss
• queue preceding link in buffer has finite capacity
• packet arriving to full queue dropped
• lost packet may be retransmitted by previous node (large network) or
by source end system (small network) dependent on the type of
network.
Network Performance Parameters: Delay
• There are four types of time delay transmission
1. Processing: the time taken by the switch to read data packet header
information (source, destination, and length L).
2. Queueing: the waiting time of packet in the queue.
3. Transmission: the time taken to get all the bits into the wire in the first
place ( packet length (L) /transmission rate R ).
4. Propagation: the time taken one bit to travel from one end of the wire to
the other. It's proportional to the length of the wire.
dprop: propagation delay:
dtrans: transmission delay: ▪ d: length of physical link in
▪ L: packet length (bits) meter
▪ R: link bandwidth (bps) ▪ s: propagation speed (to be
▪ dtrans = L/R given or assume~3x108
Book Reference: Jim Kurose, Keith Ross, “ Computer m/sec)
▪ dprop = d/s
Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Delay
• Queuing and transmission are the most dominant time delays.
• Processing and propagation are very small values.
• Queuing time is dependent on:
1. R: link bandwidth (bps) Transmission rate (L/R)
2. L: packet length (bits) Transmission rate > a = small queuing time
3. a: average packet arrival rate Transmission rate < a = large queuing time

4. N: Number of packet
Queuing time of packet (N):
Dqueue(N)= (N-1) * (L/R)
Book Reference: Jim Kurose, Keith Ross, “ Computer
Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Delay
• Transmission time and propagation time are NOT the same.
• Transmission time depends on packet length L.
• Propagation time depends on wire length.

Hint
• 1 kbps = 103 Bits per second
• 1 Mbps = 106 Bits per second
• 1 Gbps = 109 Bits per second
Book Reference: Jim Kurose, Keith Ross, “ Computer
Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Delay
Exercise 1
• Suppose sender(A) and receiver (B) are separated by 1000 kilometers
and connected by a direct link of R = 2 Mbps. Suppose the
propagation speed over the link is 2.5 x 108 meters/sec.
a-Calculate the propagation delay
b- calculate the transmission delay of sending a packet of 2000 bytes
from A to B.

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Delay
Answer
a) Propagation delay = Distance/prop speed = 1000,000/2.5x10^8 =
0.004 secs
b) Transmission delay= L/R= 16000 /2x106= 0.008 secs

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Delay
Exercise 2
• Suppose there are 45 packets entering a queue at the same time.
Each packet is size 3 KBits. The link transmission rate is 1.3 \kbps.
What is the queuing delay of packet number 19?

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Delay
Answer
Queuing delay of packet N:
dqueue= (N-1) * (L/R)
= (19-1) * (3*1000 / 1.3*1000) = 0.128 s

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Network Performance Parameters: Throughput
• Throughput: rate (bits/time unit) at which bits transferred between
sender/receiver.
• Throughput could be measured in two ways:
• Instantaneous: rate at given point in time
• Average: rate over longer period of time
Network Performance Parameters: Throughput
• The pipe or link with the lower throughput rate is the dominant.

Rs

Rc
Network Security
• Network attacks could be Malware and Spyware.
• Malware can get in host from:
• virus: self-replicating infection by receiving/executing object (e.g., e-mail
attachment)
• worm: self-replicating infection by passively receiving object that gets itself
executed
• Spyware can record keystrokes, web sites visited, upload info to
collection site.
Network Security
• Distributed Denial of Service (DDoS): attackers make resources
(server, bandwidth) unavailable to legitimate traffic by
overwhelming resource with bogus traffic.

1. select server target

2. break into hosts around


the network
3. send packets to target from
compromised hosts
Network Security
• packet “sniffing”:
▪ broadcast media (shared Ethernet, wireless)
▪ promiscuous network interface reads/records all packets

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Protocol Layers and Service Models
• Networks are complex with many pieces:
➢hosts
➢routers
➢links of various media
➢applications
➢protocols
➢hardware, software

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Protocol Layers and Service Models
• Internet services as a layering of airline functionality

ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

airplane routing airplane routing airplane routing airplane routing airplane routing

departure intermediate air-traffic arrival


airport control centers airport

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012
Internet Protocol Stack
1. Application: supporting user applications
FTP, SMTP, HTTP
2. Transport: process-process data transfer
TCP, UDP
3. Network: routing of data (datagrams) from source to
destination
IP, routing protocols
4. Link: data transfer between neighboring network
elements
Ethernet cable, 802.111 (WiFi)
5. Physical: bits “on the wire”
ISO/OSI model
• Presentation: allow applications to interpret
meaning of data, e.g., encryption, compression,
machine-specific conventions
• Session: synchronization, checkpointing, recovery
of data exchange
ISO/OSI model
source
Different message M application
names of the segment Ht M transport
data at each
datagram Hn Ht M network
layer
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-24
Any Questions?
Thank you

Book Reference: Jim Kurose, Keith Ross, “ Computer


Networking: A Top Down Approach”, 6th edition, Addison-
Wesley, 2012

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy