1. Lect1- Introduction, OSI, Performance
1. Lect1- Introduction, OSI, Performance
F303)
BITS Pilani Dr. Raja Muthalagu, Dr. Pranav M Pawar & Dr. Mithun Mukherjee
Dubai Campus Department of Computer Science
Basic information
OB/ Weighta
Sl# Component Duration Date &Time
CB ge
Mid Semester 90 02.04.2025
1. OB* 30%
Exam Minutes AN
Mid Semester Lab 60
2. CB 10% TBA
Exam Minutes
End Semester Lab 90
3. CB 20% TBA
Exam Minutes
Comprehensive 180 26.05.2025
4. CB 40%
Exam Minutes AN
DATA COMMUNICATIONS
Categories of topology
bus topology
• Expensive
• Single point of failure
• Requires more cable and network
equipment at the start
• Not used as widely as bus topology
– Fewer equipment options
– Fewer options for expansion to high-
speed communication
• No security
A fully connected mesh topology (five
devices)
• Advantages
– No Traffic
– Easy fault identification
– Robust
• Disadvantages
- Expensive- large number of cables, I/O
port and connections required.
A hybrid topology: a star backbone with three
bus networks
Categories of Networks
company
network
Hi TCP connection
req.
Hi
TCP connection
Got the reply.
time? Get http://gaia.cs.umass.edu/index.htm
2:00
<file>
time
35
BITS Pilani, Dubai Campus
Protocols and Standards
Protocols are rules and regulations.
• It defines what is communicated, how it is communicated, and
when it is communicated.
• Key elements of protocol are,
• Syntax: Format of data
• Semantics: Meaning of each section of bits
• Timing: When data should sent and how fast?
Standards are agreed rules.
• Essential for creating and maintaining an open and competitive
market for equipment manufacturers
• For national and international interoperability.
• De facto standards: Not been approved by an organized body
but have been adopted as standards through widespread use.
• De jure
36
BITS Pilani, Dubai Campus
Protocols and Standards
Standard Organizations
• Standard Creation Committees
• ISO (International Standard Organization)
• International Telecommunication Union-Telecommunication Standards
Sector (ITU-T)
• American National Standards Institute (ANSI)
• Institute of Electrical and Electronics Engineers (IEEE)
• Electronic Industries Association (EIA)
• Forums
• Regulatory Agencies: FCC (Federal Communications
Commissions)
Internet Standards
• Internet draft: Lifetime of only 6 month
• RFC (Request for Comment): After recommendation from
internet authorities, draft will be converted to RFC.
38
BITS Pilani, Dubai Campus
The network edge:
• end systems (hosts):
– run application programs
– e.g., WWW, email
– at “edge of network”
• client/server model
– client host requests, receives service
– from server
– e.g., WWW client (browser)/ server;
– email client/server
• peer-peer model:
– host interaction symmetric
– e.g.: teleconferencing
39
BITS Pilani, Dubai Campus
Network edge: connection-oriented
service
Goal: data transfer TCP service [RFC 793]
between end sys. reliable, in-order byte-
stream data transfer
handshaking: setup – dealing with loss:
(prepare for) data transfer acknowledgements and
retransmissions
ahead of time
flow control:
– set up “state” in two
– sender won’t overcome
communicating hosts receiver
TCP - Transmission Control congestion control:
Protocol – senders “slow down
sending rate” when
– Internet’s de-facto network congestion
connection-oriented detected
service
40
BITS Pilani, Dubai Campus
Network edge: connectionless service
41
BITS Pilani, Dubai Campus
The Network Core
• mesh of interconnected
routers
• the fundamental question:
how is data transferred
through net?
– circuit switching: dedicated circuit
per call: telephone net
– packet-switching: data sent thru
net in discrete “chunks”
42
BITS Pilani, Dubai Campus
Network Core: Circuit Switching
• End-end resources
reserved for “call”
• link bandwidth, switch
capacity
• dedicated resources: no
sharing
• circuit-like (guaranteed)
performance
• call setup required
43
BITS Pilani, Dubai Campus
Network Core: Circuit Switching
• network resources
(e.g., bandwidth)
divided into “pieces”
• pieces allocated to calls
• resource piece idle if not
used by owning call (no
sharing)
• dividing link bandwidth
into “pieces”
– frequency division
– time division
– code division
44
BITS Pilani, Dubai Campus
Network Core: Packet Switching
resource contention:
• each end-end data aggregate resource
stream divided into demand can exceed
packets amount available
• user A, B packets share congestion: packets
network resources queue, wait for link use
• each packet uses full link store and forward:
bandwidth packets move one hop
• resources used as at a time
needed,division into “pieces”
Bandwidth
transmit over link
45
BITS Pilani, Dubai Campus
Network Core: Packet Switching
10 Mbs
A Ethernet statistical multiplexing C
1.5 Mbs
B
queue of packets 45 Mbs
waiting for output
link
D E
46
BITS Pilani, Dubai Campus
BITS Pilani, Dubai Campus
Packet-switched networks: routing
Goal: move packets among routers from source to
destination
– we’ll study several path selection algorithms
datagram network:
– destination address determines next hop
– routes may change during session
48
BITS Pilani, Dubai Campus
Access networks and physical media
50
BITS Pilani, Dubai Campus
Institutional access: local area networks
51
BITS Pilani, Dubai Campus
Wireless access networks
52
BITS Pilani, Dubai Campus
Open Systems Interconnection
(OSI) Model
7 Application
•Session layer provides mechanism for
controlling the dialogue between the
6 Presentation two end systems. It defines how to
start, control and end conversations
(called sessions) between applications.
5 Session •This layer requests for a logical
connection to be established on an end-
4 Transport user’s request.
•Any necessary log-on or password
validation is also handled by this layer.
3 Network •Session layer is also responsible for
terminating the connection.
•This layer provides services like dialogue
2 Data Link
discipline which can be full duplex or half
duplex.
1 Physical Session layer is responsible for,
•Dialog control
BITS Pilani, Dubai Campus
SESSION Layer
81
BITS Pilani, Dubai Campus
TCP/IP Protocol Suite
82
BITS Pilani, Dubai Campus
Types of address
11111111.11111111.00000000.0000000
0
255.255.0.0
Example 2:
11111111.11111111.10000000.0000000
0
BITS Pilani, Dubai Campus
Logical Address (IP addresses)
753
Solution
We can calculate the throughput as
Solution
We can calculate the propagation time as
Solution
We can calculate the propagation and transmission time
as shown on the next slide:
Solution
We can calculate the propagation and transmission
times as shown on the next slide.
How long does it take to send a file of 640,000 bits from host A to host
B over a circuit-switched network?
Solution:
For a TDM link, time is divided into frames of fixed duration and each frame is
divided into a fixed number of time slots. When the network establish a
connection across a link, the network dedicates one time slot in every frame to
the connection. These slots are edicated for the sole use of that connection,
with a time slot available for use (in every frame) to transmit the connection's
data.
Solution:
(a) The bandwidth is 10 Mbps, and data packets can be sent
continuously.
total time = initial handshaking + network delay
initial handshaking = 2*RTT = 2*80 ms = 160 ms.
Delay = propagation delay + transmission delay (assuming
processing & queuing
delays are not
significant).
= 40 ms + (1.5-MB / 10 Mbps)
= 40 ms + (1.5*1,048,576 B / 10*1,000,000 bps)
= 40 ms + (1.5*1,048,576*8 b / 10*1,000,000 bps)
= 40 ms + (12,582,912 bits / 10,000,000 bps)
= 40 ms + 1.26 s
= 40 ms + 1260 ms
= 1300 ms
» total time = initial handshaking + network delay
= 160 ms + 1300 ms
= 1460 ms BITS Pilani, Dubai Campus
(b) The bandwidth is 100 Mbps, but after we finish sending each data
packet, we must wait one RTT before sending the next.
First, count number of packets needed to send the file:
1.5-MB / 1 KB = 12,582,912 bits / 1024(8) bits
= 12,582,912 bits / 8192 bits
= 1536
Thus, we need (1536-1) RTTs to be added to the total delay time. ( After transmitting a
packet, we wait for one RTT. Therefore, since RTT>transmission time+propagation delay, by the
time we transmit the next packet, the first packet has already reached the other side. So, we need the
transmission time of a packet + one RTT for each of the first 999 packet. For the last packet, we
must wait for the propagation delay for the last bit to reach the other side. Therefore, the total time is
as before plus 1535 RTTs.)
Second, we need to calculate the network delay in this case:
Delay = propagation delay + transmission delay
= 40 ms + (1.5-MB / 100 Mbps)
= 40 ms + (1.5*1,048,576 B / 100*1,000,000 bps)
= 40 ms + (1.5*1,048,576*8 b / 100*1,000,000 bps)
= 40 ms + (12,582,912 bits / 100,000,000 bps)
= 40 ms + 0.126 s = 40 ms + 126 ms = 166 ms
» total time = initial handshaking + network delay + 1535
(80 ms)
= 160 ms + 166 ms + 122800 ms
= 123,126 ms
BITS Pilani, Dubai Campus
Example
= 200 ms + 5500 ms
= 5700 ms
= 5.7 s
(b) The bandwidth is 1.5 Mbps, but after we finish sending each
data packet we must wait one RTT before sending the next.
» total time = handshake + network delay + (number
of packets-1) * RTT
= 200 ms + 5700 ms + (1000 - 1)*100 ms
= 105,800 ms
= 105.8 s