ALTTC/DX/SKG/Packet & Message Switching Concepts 1

ALTTC/DX/SKG/Packet & Message Switching Concepts
Contents
Circuit Switching v/s Packet switching

Logical Channel v/s Physical channel
Statistical Time Division Multiplexing
Connectionless and Connection Oriented
Data Communications
Switching Methods
Switching
Message Switching
Circuit Switching
Packet Switching
Datagram Approach
Virtual Circuit Approach
SVC
PVC
Circuit Switching
A
B
C
D
A S D C
B A S
Direction of transmission
Physical Channels (Time Slots)

Circuit Switching
A
B
C
D
A S -
A S
Inefficient Utilization of media

All Communications are bursty
D
A
T
A
Request for some

website home page
Data transfer
from the web site
Time
Message Switching
Store and Forward technique

Send the message to next node
Next node stores it in memory
It takes a decision about the next hop closer to
destination
Forwards it to next hop when link to the next hop
is available and next node is ready to receive it
Next hop repeats the same process
Message finally reaches its destination node
Message Switching
Store & Forward
Store & Forward
M1
M1
M2
Store & Forward
Store & Forward
M1
M2
M1
Message Switching
Messages are bigger in size
Storage and processing requires more resources
Sometimes nodes may not have sufficient
resources
Messages remain stored in memory of a node for
longer period
Entire process becomes slow
Error will require full message to be retransmitted
Suitable for services like Telegraphs etc
Not suitable for fast modern networks
Evolution of Packet switching

Break the message into smaller packets
Transmit the packets hop by hop to destination
Destination reassembles packets into original
message
Requires less resources at nodes
Process becomes faster compared to message
switching
Error requires only retransmission of errored
packet not the full message
10
Packet Switching: Statistical

Multiplexing
A
B
C
D
Virtual Channels
No Physical channel like a Time Slot
11
Packet Switching
Allot Bandwidth on Demand
Buffer Data and allow bandwidth to only
those hosts which have data to transmit.
To the data, add some delimiters to indicate
end of data transmitted by a particular host.
Add some tags (addresses or channel
identifiers) to indicate the sender.
12
Packet Switching
A
B
C
D
FFFFFF
CF
BF
AF
FFFFFF101010CF001010101110BF101111011AF
F: A flag to delimit the data transmitted by one host
A, B, C: Identifier for the transmitting host
(Address or Virtual channel no.)
13
Packet Switching
A
B
C
D
A
FFFFFF101010CF00101010111010101111011AF
C is denied the opportunity to transmit

14
Packet Switching
A
B
C
D
A
FFFFFF101010CF00101010111010101111011AF
11
11
1
The whole data for A is retransmitted
15
Packet Switching
A
B
C
D
A
FFFFFF101010CF00101010111010101111011AF
Solution is break data into small blocks
PACKETS
16
Packet Switching Techniques

Connection Oriented
End to end path is setup before any data communication
happens
Every packet need not carry the destination address
Destination address is send to the network only once
during the call setup process
Connectionless
Path setup is not required. Drop the packet in network
and network takes it to destination
Every packet should must carry the source and
destination address
Every packet is examined independently by the nodes
for its routing
17
Connection Oriented Data

Communications
A path is established before actual data transfer.

All packets take the same path.
Routing decision is taken before actual data transfer.
Actual data packets contains the routing labels.
All packets follow the same path
Packets reach its destination in sequence
Disruption in communication if link fails during data
transfer.
Quality of service can be guaranteed.
Example X.25, Frame Relay, Asynchronous Transfer
Mode(ATM).
18
Connection Oriented Data

Communications
I/C
P
1
CHL
49
O/G
P CHL
3
2
3
1
4
I/C
P
1
CHL
5
2
1
O/G
I/C
P CHL
3
CHL
O/G
P CHL
5
20
I/C
P
1
CHL
20
O/G
P CHL
2
49
19
35
Virtual Channel
B
A
C
Connect B
Chl No.1
Connect C
Chl No.2
1001010110F010101001F
10F
01F
C
Routing Table
I/c
O/g
P Chl P Chl
A
A
1
2
B
C
x
y
20
Permanent Virtual Circuit-PVC
4
2
21
Switched Virtual Circuit-SVC
4
2
22
Connectionless Data Communications

A path is not established before actual data transfer.
All packets do not take the same path
Routing decision is taken on the arrival of every packet at
every node.
Every packet contains the full destination address.
No disruption in communication if link fails during data
transfer and an alternate path exists.
Quality of service is not guaranteed.
Packet can follow different path
Packet can arrive out of sequence at destination
Example Internet
23
Connectionless Data Communications

Packet 1
Packet 2
Routing Table
Dest. Next Hop
24
Datagram Approach
3
1
1
2
4
1
2
3
4
2
2
25
26

ALTTC/DX/SKG/Packet & Message Switching Concepts 1

Cargado por

Información del documento

Descripción original:

Título original

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

ALTTC/DX/SKG/Packet & Message Switching Concepts 1

Cargado por

Copyright:

Formatos disponibles

ALTTC/DX/SKG/Packet & Message Switching Concepts

Circuit Switching v/s Packet switching