CCN L01Introduction
CCN L01Introduction
Networks
EC106203EC
Dr. Ajay Singh Raghuvanshi
Electronics & Communication Engineering,
NIT, Raipur
Syllabus for EC106203EC
NATIONAL INSTITUTE OF TECHNOLOGY RAIPUR
DEPARTMENT OF ELECTRONICS AND COMMUNICATION
Semester: 6
Codes: EC106203EC
Subject: Computer Communication Networks
Credits: 3 Departmental Elective
Pre-requisites: EC104105EC- Analog Communication,
EC105101EC-Digital Communication,
CS10I010CS-Computer Programming
Unit- IV
Transport Layer: Introduction: Transport Layer Services, Connectionless and Connection oriented
Protocols, Transport Layer Protocols: Simple protocol, Stop and wait protocol, Go-Back-N
Protocol, Selective repeat protocol, User Datagram Protocol: User Datagram, UDP Services,
UDP Applications, Transmission Control Protocol: TCP Services, TCP Features, Segment,
Connection, State Transition diagram, Windows in TCP, Flow control, Error control, TCP
congestion control.
Interfacing Routing
Signal generation Recovery
Flow control
1/17/2024 Dr.Ajay Singh Raghuvanshi 14
Data Communications Model
1. Sender
2. Message
3. Protocol
4. Medium
5. Receiver
33
1/17/2024 Dr.Ajay Singh Raghuvanshi
Public Circuit Switched Network
35
1/17/2024 Dr.Ajay Singh Raghuvanshi
Basic Operation of Packet Switching
■ Data are transmitted in short packets
◻ Typically at the order of 1000 bytes
◻ Longer messages are split into series of packets
◻ Each packet contains a portion of user data plus some control info
■ Control info contains at least
◻ Routing (addressing) info, so as to be routed to the intended
destination Recall the content of an IP header!
■ store and forward
◻ On each switching node, packets are received, stored briefly
(buffered) and passed on to the next node.
36
1/17/2024 Dr.Ajay Singh Raghuvanshi
Use of Packets
37
1/17/2024 Dr.Ajay Singh Raghuvanshi
Advantages of Packet Switching
■ Line efficiency
◻ Single node-to-node link can be dynamically shared by many packets over
time
◻ Packets are queued up and transmitted as fast as possible
■ Data rate conversion
◻ Each station connects to the local node at its own speed
■ In circuit-switching, a connection could be blocked if there lacks free
resources. On a packet-switching network, even with heavy traffic,
packets are still accepted, by delivery delay increases.
■ Priorities can be used
◻ On each node, packets with higher priority can be forwarded first. They will
experience less delay than lower-priority packets.
38
1/17/2024 Dr.Ajay Singh Raghuvanshi
Packet Switching Technique
■ A station breaks long message into packets
■ Packets are sent out to the network sequentially, one at a
time
■ How will the network handle this stream of packets as it
attempts to route them through the network and deliver them
to the intended destination?
◻ Two approaches
■ Datagram approach
■ Virtual circuit approach
39
1/17/2024 Dr.Ajay Singh Raghuvanshi
Datagram Approach
■ Each Packet or Datagram is treated independently, with no
reference to packets that have gone before.
◻ Each node chooses the next node on a packet’s path.
■ Packets can take any possible route.
■ Packets may arrive at the receiver out of order.
■ Packets may go missing.
■ It is up to the receiver to re-order packets and recover from
missing packets.
■ Example: Internet
40
1/17/2024 Dr.Ajay Singh Raghuvanshi
Datagram
41
1/17/2024 Dr.Ajay Singh Raghuvanshi
Virtual Circuit
■ In virtual circuit, a preplanned route is established before any
packets are sent, then all packets follow the same route.
■ Each packet contains a virtual circuit identifier instead of
destination address, and each node on the pre-established
route knows where to forward such packets.
◻ The node need not make a routing decision for each packet.
■ Example: X.25, Frame Relay, ATM
42
1/17/2024 Dr.Ajay Singh Raghuvanshi
Virtual Circuit
A route between stations is set
up prior to data transfer.
All the data packets then follow
the same route.
But there is no dedicated
resources reserved for the
virtual circuit!
Packets need to be
stored-and-forwarded.
43
1/17/2024 Dr.Ajay Singh Raghuvanshi
Virtual Circuits v Datagram
■ Virtual circuits
◻ Network can provide sequencing (packets arrive at the same order) and error
control (retransmission between two nodes).
◻ Packets are forwarded more quickly
■ Based on the virtual circuit identifier
■ No routing decisions to make
◻ Less reliable
■ If a node fails, all virtual circuits that pass through that node fail.
■ Datagram
◻ No call setup phase
■ Good for bursty data, such as Web applications
◻ More flexible
■ If a node fails, packets may find an alternate route
■ Routing can be used to avoid congested parts of the network
44
1/17/2024 Dr.Ajay Singh Raghuvanshi
Comparison of
communication
switching
techniques
pathname
protocol
http://nitrr.ac.in/downloads/syllabus/sem%204.pdf
filename
Domain name