0% found this document useful (0 votes)
12 views

Computer Presentation

Uploaded by

Id Server
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Computer Presentation

Uploaded by

Id Server
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 36

Obviously , no 🙅 brain cells were

harmed during making this


presentation .
Presentation
Communication And
Internet Technologies
Circuit Switching⇒ Alok
Packet Switching ⇒Sarthak
Message Switching ⇒Aarogya
How router works, Packet Switching VS Message Switching ⇒Gobinda
Table Of Contents
● Circuit Switching
○ Advantages
○ Disadvantages
○ Application
● Message Switching
○ Advantages
○ Disadvantages
○ Application
● Packet Switching
○ Advantages
○ Disadvantages
○ Application
● Function of Router in Packet Switching and how it is used to send messages through the internet

● Circuit Switching VS Message Switching VS Packet Switching


● Swarm – A group of peers connected together . One of the most important facts when considering whether or not a swarm
can continue to allow peers to complete a torrent is its availability; availability refers to the number of complete copies of
torrent contents that are distributed amongst a swarm. Note: a torrent is simply the name given to a file being shared on the
peer-to-peer network.
● Seed – A peer that has downloaded a file (or pieces of a file) and has then made it available to other peers in the swarm.
● Tracker – The central server that stores details about other computers that make up the swarm; it will store details about all
the peers downloading or uploading the file, allowing the peers to locate each other using the stored IP addresses.
● Leech – a peer that has a negative impact on the swarm by having a poor share ratio, that is, they are downloading much
more data than they are uploading to the others
● Ratio =(amount of data the peer has uploaded) / (amount of data the peer has downloaded)
If the ratio > 1 then the peer has a positive impact on the swarm; if the ratio < 1 then the peer has a negative effect on the
swarm.
● Lurker – a peer that downloads many files but does not make available any new content for the community as a whole.
Circuit Switching
Definition Of Circuit Switching

Circuit Switching is a method of implementing a telecommunications network in


which two network nodes establish a dedicated communication channels (circuit)
through the network before the nodes may communicate. It was in use for
communication through PSTN (Public Switched Telephone Network). It uses a
dedicated private line to transmit data and messages to users. First the connection
between the users is created and the data is transferred. After that, the connection
is terminated. This is the basic working principle of Circuit switching.
Advantages Of Circuit Switching

● The Circuit is dedicated to single transmission only.

● The whole bandwidth is available.

● The data transfer rate in incredibly fast.

● The order of arrival of packets don’t change at arrival.

● No data loss occurs.

● It works better than packet switching in real-time applications.


Disadvantages of Circuit Switching

● It has to send empty frames and has to use a dedicated line making it not so
flexible.

● The line can only be accessed by one user even when it is idle.

● The line is never closed even when no one is using it.

● When an error occurs in the line, no other routes are available.

● These dedicated channels use high amount of bandwidth.

● The time required to link the line with the user before using it is long.
Where Circuit switching is used

Circuit switching is used for connections that must be maintained for long periods,
such as long-distance communication. Circuit switching technology is used in
traditional telephone systems.

When a computer connects to the internet through a dial-up service, it uses the public
switched network. Dial-up transmits Internet Protocol (IP) data packets via a circuit-
switched telephone network.

Data centre networks also make use of circuit switching. Optical circuit switching is
used to expand traditional data centres and fulfill increasing bandwidth demands.
Not using circuit
switching because it is
old

Using circuit
switching as it is
fastest and most secure
Packet Switching
Definition of Packet Switching
Packet switching is a way of sending data where a message is split
into many packets. Each packet is sent on its own from the start to
the end point. At the destination, the packets are put back together in
the right order. Here's an example of how packet switching works.
How data is transmitted using packet switching (in short)

● each packet follows its own path


● routing selection depends on the number of datagram packets waiting to be
processed at each node (router)
● the shortest path available is selected
● packets can reach the destination in a different order to that in which they are
sent.
In Detail

Each Packet Follows Its Unique Path:


● In a network, each packet is like a traveler with its own journey. It navigates through the
network independently of other packets.

Routing Selection Based on Packet Congestion:


● The selection of the route for each packet depends on the congestion level at each router
along the way.
● Routers analyze the number of datagram packets awaiting processing and choose the least
congested path for efficient data transmission.
Selection of the Shortest Path:
● Routers prioritize selecting the shortest available path for packet transmission.
● This ensures that packets travel the most direct route, minimizing delays and optimizing
network efficiency.

Non-Sequential Packet Delivery:


● Despite being sent in a specific order, packets may arrive at their destination in a different
sequence.
● This phenomenon is akin to receiving packages out of order due to varying travel speeds
or routes taken.
Detailed Picture
Pros and cons of packet switching
Message switching

Message switching is a method of data transmission where


messages are sent from the sender to the receiver through a series
of intermediate nodes or switching centers. Each node stores the
complete message before forwarding it to the next node. This store-
and-forward technique is distinct from circuit switching and packet
switching.
Principles
● Storage and forward mechanism:
storage, forwarding and routing is
done
● non-real -time transmission
FEATURES
● Flexibility
● Efficient use of network
resources
● Error handling
Advantages
● There is better utilisation of resources
● The routing process is more flexible
● There is no requirement for setup time
● It is more scalable
● Messages can be appointed priority levels
● There is no need for the continuous allocation of resources as required in circuit
switching, leading to lower operational costs, especially in large networks with varying
traffic loads.
● Messages can be encrypted during storage at intermediate nodes, adding an additional
layer of security to the transmission process
Disadvantages

● There is high latency


● Critical storage requirements as each node in the network must have sufficient memory
to store entire messages
● The delays are variable and unpredictable
● There may be potential message loss
Applications
● Email Systems: Reliable store-and-forward transmission of email messages.
● Financial Transactions: Securely transmit banking data between branches.
● Military Communications: Ensures reliable delivery in unstable environments.
● Satellite Communications: Handles delays and intermittent connectivity efficiently.
● Telegraph Networks: Early method for manual message forwarding.
● Emergency Dispatch Systems: Prioritizes critical messages for timely response.
● Batch Processing Systems: Handles large volumes of non-real-time data efficiently.
● Healthcare Information Systems: Secure and reliable transmission of medical records.
● Command and Control Networks: Ensures message delivery in mission-critical operations.
● File Transfer Protocols: Store-and-forward mechanism for non-real-time file transfers.
Hopping, Error-Checking, and Priority
Handling

Sometimes, packets get lost and keep bouncing around from router to router, never reaching where they need to go. This
can slow down the network as these lost packets pile up and jam the system. To fix this, we use something called
"hopping". A hop number is added to each packet's header, which limits how many times it can hop between routers.
Each time a packet goes through a router, its hop number decreases by 1. If it doesn't reach its destination before the hop
number hits 0, it's deleted at the next router.

Packets also have an error-checking method like a checksum. The checksum is calculated for each packet and added to
the header. At the destination, the checksum is recalculated to make sure no errors happened. If the checksums don't
match, a request is made to resend the packet. Sometimes, a priority value is added to the header to show which packet
queue should be used.
Packet Header for TCP/IP Protocol

When sending packets with TCP/IP, the packet header includes:


● IP address of source computer
● IP address of destination computer
● Current hop number of data packet
● Length of packet in bytes
● Number of packets in the message
● Sequence number for reassembly
● Checksum value
General Packet Header Info
Packet headers usually have:

● 4 bits for protocol version (like IPv4, IPv6)


● 4 bits for header length (e.g., value of 6 means 24 bytes)
● 8 bits for packet priority
● 16 bits for packet length in bytes
● 3 bits for fragmentation (DF = do not fragment, MF = more fragments)
● 13 bits for fragmentation offset to show fragment position
● 8 bits for current hop number
● 16 bits for number of packets in the message
● 16 bits for sequence number
● 8 bits for transmission protocol (TCP, UDP)
● 16 bits for header checksum value
● 32 bits for source IP address
● 32 bits for destination IP address
Routing Tables

Routing tables help send packets along the best route. When a packet reaches a router, its header is
checked against the routing table, which gives instructions for the next hop.

Routing tables have:

● Number of hops
● MAC address of the next router
● Metrics (cost for each route to find the most efficient path)
● Network destination (network ID)
● Gateway (shows the gateway to the target network)
● Netmask (to generate network ID)
● Interface (local interface for reaching the gateway)
Pros and cons of circuit switching
Pros and cons of packet switching
Insignificant Details :)

You might also like