Scribd
Upload
14 views11 pages

Data Packets and Packet Switching

Uploaded by

musfirahanniyasminhyssain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODP, PDF, TXT or read online on Scribd
14 views11 pages

Data Packets and Packet Switching

Uploaded by

musfirahanniyasminhyssain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODP, PDF, TXT or read online on Scribd
You are on page 1/ 11

DATA

PACKETS
AND
PACKET
SWITCHING
BY MUSFIRA
•DATA PACKETS
•STRUCTURE OF DATA PACKE
CONTENT:
•PACKET SWITCHING
•HOW PACKET SWITCHING W
•HOPPING METHOD
DATA PACKETS
• Data sent over long distances is usually broken up into data
packets (sometimes called datagrams). The packets of data are
usually quite small, typically 64KiB, which are much easier to
control
than a long continuous stream of data.The idea
of splitting up data in this way means each packet
can be sent along a different route to its destination. This would
clearly be of great benefit if a particular transmission route was out
of action or very busy. The only obvious drawback of splitting data
into packets is the need to reassemble the data when it reaches its
THE STRUCTURE OF A
PACKET
A typical packet is split up into:
» a packet header
» the payload
» a trailer.
DETAILS OF PACKET
STRUCTURE
FOR EACH PACKET,
THE PACKET
FOR EACH PACKET,
THE PACKET
HEADER CONSISTS FOR EACH PACKET, THE TRAILER CONSISTS
OF: PAYLOAD CONSISTS OF OF:
» the IP address of the » some way of identifying the
of the actual data
sending device end of the packet; this is
being sent in the essential to allow each packet
» the IP address of the
packet (this is usually to be separated from each other
receiving device as they travel from sending to
about 64KiB). receiving station
» the sequence number of the
packet (this is to ensure that » an error checking method;
all the packets can be cyclic redundancy checks (CRCs)
reassembled into the correct are used to check data packet
order once they reach the
destination) » packet size
(this is to ensure the receiving
station can check if all of the
packets have arrived intact).
LET US NOW CONSIDER WHAT HAPPENS WHEN A
PHOTOGRAPH, FOR EXAMPLE, IS SENT FROM COMPUTER
‘A’ TO COMPUTER ‘B’. THE PHOTOGRAPH WILL BE SPLIT
UP INTO A NUMBER OF PACKETS BEFORE IT IS SENT.
THERE WILL BE SEVERAL POSSIBLE ROUTES FOR THE
PACKETS, BETWEEN COMPUTER ‘A’ (SENDER) AND
COMPUTER ‘B’ (RECEIVER). EACH STAGE IN THE ROUTE
CONTAINS A ROUTER. A ROUTER RECEIVES A DATA
PACKET AND, BASED ON THE INFORMATION IN THE
HEADER, DECIDES WHERE TO SEND IT NEXT. FOR
PACKET SWITCHING
Packet switching is a method of data transmission in which a message is broken
up into a number of packets. Each packet can then be sent independently from
start point to end point. At the destination, the packetswill need to be
reassembled into their Correct order (using the information sent in the header).At
each stage in then transmission, there are nodes that contain a router. Each
router will determine which route the packet needs to take, in order to reach its

METHOD
destination (the destination IP address is used in this part of the process).

• » each packet will follow its own path (route)


• » routers will determine the route of each packet
• » routing selection depends on the number of packets waiting to be processed
at each node
• » the shortest possible path available is always selected – this may not always
be the shortest path that could be taken, since certain parts of the route may
be too busy or not suitable
• » unfortunately, packets can reach the destination in a different order to that in
COMPUTER ‘B’ WILL NOW HAVE TO
REASSEMBLE THE PACKETS INTO THE
ORIGINAL SEQUENCE.
DRAWBACK
BENIFITS
• » there is no need to tie up a
S
• » packets can be lost and need
single communication line to be re-sent
• » it is possible to overcome • » the method is more prone to
failed, busy or faulty lines errors with real-time
by simply re-routing packets streaming (for example, a live
• » it is relatively easy to sporting event being
expand package usage » a transmitted over the internet)
high data transmission rate • » there is a delay at the
is possible.
possible destination whilst the packets
are being re-ordered.
HOPPING
• SOMETIMES IT IS POSSIBLE FOR PACKETS TO GET LOST BECAUSE THEY KEEP

METHOD
‘BOUNCING’ AROUND FROM ROUTER TO ROUTER AND NEVER ACTUALLY REACH
THEIR DESTINATION. EVENTUALLY THE NETWORK WOULD JUST GRIND TO A HALT
AS THE NUMBER OF LOST PACKETS MOUNT UP, CLOGGING UP THE SYSTEM. TO
OVERCOME THIS, A METHOD CALLED HOPPING IS USED. A HOP NUMBER IS
ADDED TO THE HEADER OF EACH PACKET, AND THIS NUMBER IS REDUCED BY 1
EVERY TIME IT LEAVES A ROUTER. EACH PACKET HAS A MAXIMUM HOP NUMBER
TO START WITH. ONCE A HOP NUMBER REACHES ZERO, AND THE PACKET HASN’T
REACHED ITS DESTINATION, THEN THE PACKET IS DELETED WHEN IT REACHES
THE NEXT ROUTER. THE MISSING PACKETS WILL THEN BE FLAGGED BY THE
RECEIVING COMPUTER AND A REQUEST TO RE-SEND THESE PACKETS WILL BE
MADE.
THANK U
THAT IS ALL

You might also like