Scribd
Upload
4 views

4,5

The document covers foundational concepts in networking, focusing on addressing and routing within the TCP/IP model, including physical (MAC) and logical (IP) addressing. It also discusses network performance analysis, emphasizing bandwidth, latency, and the impact of round-trip time (RTT) on perceived latency. Additionally, it highlights the importance of performance requirements for applications like streaming video and audio.

Uploaded by

prudhvitaduvai
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
4 views

4,5

The document covers foundational concepts in networking, focusing on addressing and routing within the TCP/IP model, including physical (MAC) and logical (IP) addressing. It also discusses network performance analysis, emphasizing bandwidth, latency, and the impact of round-trip time (RTT) on perceived latency. Additionally, it highlights the importance of performance requirements for applications like streaming video and audio.

Uploaded by

prudhvitaduvai
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/ 24

Topic 1: Foundation

Lecture 3

Part 1: Addressing; Routing;


Part 2: Network’s Performance Analysis
Reca Layered
p Communication
TCP/IP model
Application layer GET / HTML/1.1

Source Port | Destination Port Payload


Transport layer > 1024 | 80

Internet layer
Source IP | Destination IP Payload

Link layer 202.125.157.150 | 202.125.157.196

Source MAC address | Destination MAC address Payload FCS


23:34:aa:bb:cc:dd | 12:34:aa:bb:cc:dd
Part 1:
Addressing, Routing
Addressing
Each station must be addressable
Two kinds of addresses:
1) Physical addressing (MAC addresses)
2) Logical addressing (IP addresses)
The communicating applications (source/
destination applications) must also be identifiable
Identified through TCP ports
A socket (IP address + TCP port) identifies
both an application and the machine it’s on.
Physical addressing: MAC
MAC Address: 48 bits (Ethernet)
Flat addressing -> does not facilitate routing
Usually non-configurable but hackable
Logical addressing: IP
IP Version 4; Address: 32 bits 4,294,967,296
possible addresses = 2
32

IP Version 6; Address: 128 bits


Hierarchical addressing
2 parts (variable bits): network, host.
Machines in a LAN have same network part
How do we know how many bits of an IP
address represents the network?
Subnet mask
IP addressing: example
IP Address
192.168.15.2 (decimal)
11000000 10101000
00001111 00000010 (binary)
Subnet Mask:
255.255.255.0 (decimal)
11111111 11111111
11111111 00000000 (binary)

Network part Host part


IP addressing example
(contd.)
Range: 192.168.15.0 to 192.168.15.255;
For our example:
Two addresses are reserved in every.254 network
192.168.15.255
1) host bits  all
- zeros (for representing the network)
2) host bits  all ones (for the broadcast address)
> broadcast
address;
Packet sent to 192.168.15.0/24
broadcast address
.1
A packet sent to broadcast address will be
received by all nodes.
Communication in same
LAN (same network)
Application Application
Transport Transport
Network Network
Data Link Data Link
Bits Bits

Source Host Destination


Bridges/ Host
Repeater/
Switches
(Same LAN)
Hub

Device used in a single LAN: hub, bridge, switch


Internetworking LANs

Application Application
Routers/
Transport Gateway Transport
Network Network
Data Link Data Link
Bits Bits

Source Host Destination Host


(Different network)
Internetworking example

Source

Destination
Internetworking example
(contd)

Fragmentation
Part 2:
Network Performance
Analysis
Bandwidth (throughput)*
* Refer to textbook’s discussion

1 Mbps; each bit 1 uS wide

2 Mbps; each bit .5 uS wide


Latency (delay)
transmission
A
propagation

B
nodal
processing queueing

Latency = Propagation + Transmit + Queue

Propagation = Distance/ Speed of Light

Transmit = Size/ Bandwidth


Caravan (analogy)
100 100
km km
ten-car caravan toll toll
booth booth

• Cars “propagate” at 100 km/hr


• Toll booth takes 12 sec to service car
(transmission time)
• Analogy: car ~ bit; caravan ~ packet
How long until caravan is lined up before 2nd toll
booth? * From Kurose and Ross
Caravan (analogy)
100 100
km km
ten-car caravan toll toll
booth booth

• Time to “push” entire caravan through toll


booth onto highway = 12*10 = 120 sec
• Time for last car to propagate from 1st to 2nd
toll both: 100km/(100km/hr)= 1 hr
Answer: 62 minutes
Effect of RTT and
link throughput
on perceived
latency
Delay x Bandwidth
product

Delay depends on distance covered and is limited by


laws of physics (speed of light)

Typical delay - Transcontinental link: 100 ms


High Speed Networks
1 MB of data; RTT: 100 ms

RTT becomes more important than Bandwidth


Throughput
Throughput = Transfer Size/ Transfer Time

= RTT + Transfer Size/ Bandwidth

= 100 ms + 8 ms (for 1 Gbps link)

= 108 ms

Throughput = 1 MB/ 108 ms = 74.1 Mbps

RTT becomes the limiting factor for throughput


Throughput increases for large size transfers (limiting
case -> 1 Gbps)
Application need for
performance
Streaming video/ audio; Video on Demand

Requirements:
Packet loss is tolerable but sequencing is important
Jitter (variable delay) should be minimized

You might also like