Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
10 views46 pages

Introduction

The CS306L Computer Networks course at I.I.T Tirupati, taught by Dr. Venkata Ramana Badarla, aims to introduce fundamental networking concepts, performance evaluation techniques, and packet switching technologies. Key topics include the OSI Reference Model, TCP/IP Protocol Stack, and performance metrics such as data rate and latency. The course also covers various switching technologies and provides exercises to reinforce understanding of these concepts.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views46 pages

Introduction

The CS306L Computer Networks course at I.I.T Tirupati, taught by Dr. Venkata Ramana Badarla, aims to introduce fundamental networking concepts, performance evaluation techniques, and packet switching technologies. Key topics include the OSI Reference Model, TCP/IP Protocol Stack, and performance metrics such as data rate and latency. The course also covers various switching technologies and provides exercises to reinforce understanding of these concepts.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 46

About the course Introduction Packet Switching Technologies

CS306L Computer Networks

Dr. Venkata Ramana Badarla

I.I.T Tirupati
About the course Introduction Packet Switching Technologies

Outline of the Lectures

1 About the course

2 Introduction
OSI Reference Model (1983)
Internet Protocol
Performance Metrics

3 Packet Switching Technologies


About the course Introduction Packet Switching Technologies

About the course

Objective:
1 To introduce the fundamental concepts of networking, including data
transmission, network protocols, communication models, and the
principles of network design.
2 To introduce the performance evaluation techniques, focusing on factors
like bandwidth, latency, and throughput
Books;
1 Computer Networks: A Systems Approach
Larry L. Peterson, Bruce S. Davie
Morgan Kaufmann; 5th edition (2011)
2 Computer Networking: A Top - Down Approach
James F. Kurose
Pearson Education; 5th edition (2012)
3 Data and Computer Communications
William Stallings
Pearson Education India; 10th edition (2013)
About the course Introduction Packet Switching Technologies

Key elements of a Network

Router
Standalone
Wide Area Network
Mainframe
(e.g. ATM)

Local Area
Network Router
Router

Wide Area Network


(e.g. ATM) Local Area
Ethernet Network
switch
Ethernet
switch

Router

Information LAN PCs


server and workstations
About the course Introduction Packet Switching Technologies

Layered Architecture - Open Systems Interconnection Model

Layer 7
(Application)


• Service to
Layer N+1

Protocol
Total Layer N Layer N with peer
Communication entity Layer N
Function Decompose
(modularity,
information-hiding) •
• Service from
Layer N–1

Layer 1
(Physical)

OSI-wide standards
(e.g., network management, security)

Figure 2.8 The OSI Architecture as a Framework for Standardization


About the course Introduction Packet Switching Technologies

OSI Reference Model


About the course Introduction Packet Switching Technologies

(Cont.)
About the course Introduction Packet Switching Technologies

Functional aspects of each layer

Application Layer
• Enabling users to access the network services/resource
About the course Introduction Packet Switching Technologies

Functional aspects of each layer

Application Layer
• Enabling users to access the network services/resource
Presentation Layer
• Translation, Encryption, Compression
About the course Introduction Packet Switching Technologies

Functional aspects of each layer

Application Layer
• Enabling users to access the network services/resource
Presentation Layer
• Translation, Encryption, Compression
Session Layer
• Dialog Control, Synchronization
About the course Introduction Packet Switching Technologies

Functional aspects of each layer

Application Layer
• Enabling users to access the network services/resource
Presentation Layer
• Translation, Encryption, Compression
Session Layer
• Dialog Control, Synchronization
Transport Layer
• Service-point addressing, Segmentation and reassembly,
Connection control, Flow control, Error control
About the course Introduction Packet Switching Technologies

(Cont.)

Network Layer
• Logical addressing - global address, Forwarding, Routing
About the course Introduction Packet Switching Technologies

(Cont.)

Network Layer
• Logical addressing - global address, Forwarding, Routing
Data Link Layer
• Framing, Physical addressing - local address, Flow control,
Error control, Access control
About the course Introduction Packet Switching Technologies

(Cont.)

Network Layer
• Logical addressing - global address, Forwarding, Routing
Data Link Layer
• Framing, Physical addressing - local address, Flow control,
Error control, Access control
Physical Layer
• Physical characteristics of interfaces and media
• Representation of bits
• Transmission of bits as signals
• Data rate - number of bits per second
• Synchronization between sender and receiver
• Transmission mode - simplex/half duplex/duplex
About the course Introduction Packet Switching Technologies

Host-to-Host/Node-to-Node & PDUs


About the course Introduction Packet Switching Technologies

Packet Structure
About the course Introduction Packet Switching Technologies

TCP/IP Protocol Stack (1970, 1983-)

OSI TCP/IP

Application

Application
Presentation

Session
Transport
Transport (host-to-host)

Internet
Network
Network
Data Link Access

Physical Physical

A Comparison of the OSI and TCP/IP Protocol Architectures


About the course Introduction Packet Switching Technologies

(Cont.)

MIME

BGP FTP HTTP SMTP TELNET SNMP

TCP UDP

ICMP IGMP OSPF RSVP

IP

BGP = Border Gateway Protocol OSPF = Open Shortest Path First


FTP = File Transfer Protocol RSVP = Resource ReSerVation Protocol
HTTP = Hypertext Transfer Protocol SMTP = Simple Mail Transfer Protocol
ICMP = Internet Control Message Protocol SNMP = Simple Network Management Protocol
IGMP = Internet Group Management Protocol TCP = Transmission Control Protocol
IP = Internet Protocol UDP = User Datagram Protocol
MIME = Multipurpose Internet Mail Extension

Some Protocols in the TCP/IP Protocol Suite


About the course Introduction Packet Switching Technologies

(Cont.)

Application
User data
byte stream

TCP TCP
header segment

IP IP
header datagram

Network Network-level
header packet

Protocol Data Units (PDUs) in the TCP/IP Architecture


About the course Introduction Packet Switching Technologies

Performance Metrics
• Data Rate : Number of bits per second
• Throughput: Amount of data transmitted over time
• Latency = Transmission Time + Propagation Time +
Queuing Time
• Transmission Time: Time to emit the data on to medium =
DataSize
DataRate
• Propagation Time: Time taken to propagate bits from the
Distance
transmitter to the receiver = SpeedOfLight
• Speed of Light in Vacuum 3 × 108 m/s
• Speed of Light in Copper 2.3 × 108 m/s
• Speed of Light in Fiber 2 × 108 m/s
• Round Trip Time is roughly 2×Latency
• BDP (Bandwidth Delay Product) aka Data Rate × Latency
About the course Introduction Packet Switching Technologies

Units and Confusion

How do you interpret the following:


32-KB message over a 10-Mbps channel
About the course Introduction Packet Switching Technologies

Units and Confusion

How do you interpret the following:


32-KB message over a 10-Mbps channel
• 32 × 210 × 8 bits are being transmitted at a rate of 10 × 106 bits per
second
About the course Introduction Packet Switching Technologies

Exercise Problem 1

How “wide” is a bit on a 1-Gbps link? How long is a bit in copper


wire, where the speed of propagation is 2.3 × 108 m/s?
About the course Introduction Packet Switching Technologies

Exercise Problem 2

Calculate the total time required to transfer a 1000-KB file in the


following cases, assuming an RTT of 100 ms, a packet size of 1
KB and an initial 2 × RTT of “handshaking” before data is sent.
1 The bandwidth is 1.5 Mbps, and data packets can be sent continuously.

2 The bandwidth is 1.5 Mbps, but after we finish sending each data packet
we must wait one RTT before sending the next.
3 The bandwidth is ”infinite,” meaning that we take transmit time to be
zero, and up to 20 packets can be sent per RTT.
About the course Introduction Packet Switching Technologies

Exercise Problem 3

Consider a point-to-point link 50 km in length. At what bandwidth


would propagation delay (at a speed of 2 × 108 m/s) equal
transmit delay for 100-byte packets?
About the course Introduction Packet Switching Technologies

Exercise Problem 4

Hosts A and B are each connected to a switch S via 10-Mbps links.


The propagation delay on each link is 20 µs. S is a
store-and-forward device; it begins retransmitting a received packet
35 µs after it has finished receiving it. Calculate the total time
required to transmit 10,000 bits from A to B for the following two
scenarios.
1 as a single packet

2 as two 5000-bit packets sent one right after the other


About the course Introduction Packet Switching Technologies

Switching Technologies
• Often the hosts communicating may be connected via one or more
intermediate nodes
• Intermediate nodes: hubs, switches
• Topology: arrangment of a communication elements (hosts and
intermediate nodes)
• Typical arrangements: Bus, Ring, Star, Mesh
• Switching technique
• a method of transmitting data which are connected via intermediate
nodes
• Circuit/Message/packet
About the course Introduction Packet Switching Technologies

Circuit Switching

Long-distance Long-distance
office office

End Office
End Office

Subscriber Loop

Connecting Trunk Intercity Trunk


Connecting Trunk

Digital PBX

Figure 10.2 Example Connection Over a Public Circuit-Switching Network

• A dedicate path between the end points via the intermediate nodes is
established
• Example, telephone call
• Continuous transmission of bits
• Resources are reserved exclusively for this communication

About the course Introduction Packet Switching Technologies

Switching Technologies (Cont.)

(a) Circuit switching (b) Virtual circuit packet switching (c) Datagram packet switching

propagation processing
Call delay delay Call
request request
signal packet
Pkt1
Call Call
accept accept Pkt2
signal packet Pkt1
Pkt3
Pkt2
Pkt1
Pkt3
Pkt2
User Pkt1
data Pkt3
Pkt2
Pkt1
Acknowledge-
ment signal Pkt3
Pkt2
Pkt1
Pkt3
Pkt2

Pkt3 Acknowledge-
ment packet

link link link

Nodes: 1 2 3 4 1 2 3 4 1 2 3 4
About the course Introduction Packet Switching Technologies

Virtual Circuit (VC) Switching

Mainframe

C
Personal Server
computer

B D
Personal
computer

Personal
computer
Packet-Switching E
Network
Personal
computer

A
Solid line = physical link
Dashed line = virtual circuit F
Figure 10.13 The Use of Virtual Circuits
About the course Introduction Packet Switching Technologies

(Cont.)

3 2
1

(a)

3
2
1

(b)

3
2
1

(c)

3 2 1

(d)

3
2
1

(e)

Figure 10.10 Packet Switching: Virtual-Circuit Approach


About the course Introduction Packet Switching Technologies

Packet Switching

3 2
1

(a)

3
2
1

(b)

2
1

(c)

2 1

(d)

3
2
1

(e)

Figure 10.9 Packet Switching: Datagram Approach


About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies

Packets on VC
About the course Introduction Packet Switching Technologies

(Cont.)
About the course Introduction Packet Switching Technologies
About the course Introduction Packet Switching Technologies

Large vs Short Packet Sizes


(a) 1-packet message (b) 2-packet message (c) 5-packet message (d) 10-packet message

1
Header 1

Data 2 1
1
Data 2 1 3 2 1

4 3 2
3 2 1
5 4 3
Data Data
2 1 4 3 2 6 5 4

7 6 5
5 4 3
8 7 6
Data Data
Data
2 1 5 4 9 8 7

10 9 8
5
10 9
Data
X a b Y 10
2

X a b Y
X a b Y

Data

X a b Y

Figure 10.11 Effect of Packet Size on Transmission Time


About the course Introduction Packet Switching Technologies

Exercise Problem 5
Consider the store and forward packet switched network given below. Assume
that the bandwidth of each link is 106 bytes / sec. A user on host A sends a file
of size 103 bytes to host B through routers R1 and R2 in three different ways.
• first case: a single packet containing the complete file is transmitted
• second case: the file is split into 10 equal parts, and these packets are
transmitted
• third case: the file is split into 20 equal parts and these packets are
transmitted
Each packet contains 100 bytes of header information along with the user data.
Consider only transmission time and ignore processing, queuing and
propagation delays. Also assume that there are no errors during transmission.
Let T1, T2 and T3 be the times taken to transmit the file in the first, second
and third case respectively. Which one of the following is CORRECT?
1 T1 < T2 < T3

2 T1 > T2 > T3

3 T 2 = T 3, T 3 < T 1

4 T 1 = T 3, T 3 > T 2

You might also like