Packet Marking: Different Class of Traffic

 

Packet marking: mechanism needed to provide packets belonging to different class of traffic also
allows a router to distinguish among packets Belonging to different classes of traffic.
For example before you get to your airplane the Employee who work with the who work with the
airlines will need to scan you boarding pass but the people will be classified depend on their groups or
if the are VIP or not so the priority people will pass the line before anyone and so on.
Analogy:
Traffic Policing : Traffic policing enables you to control the maximum rate of IP traffic sent
or received on an interface and also to partition network traffic into multiple priority levels, also
known as classes of service.
Or we could say its one of the several network mechanisms that can be uses to provide
differentiated service among several class of traffic.
Analogy:
packet-discarding policy :
its a method that can determines whether the packet will be dropped (lost) or whether other packets
will be removed from the queue to make space for the arriving packet.
Analogy:
priority queuing
Under priority queuing , packets arriving at the output link are classified into priority
classes at the output queue.
Analogy:
round robin queuing discipline
Under the round robin queuing discipline , packets are sorted into classes as
with priority queuing. However, rather than there being a strict priority of service
among classes, a round robin scheduler alternates service among the classes.
In the simplest form of round robin scheduling, a class 1 packet is transmitted, followed by a class 2
packet, followed by a class 1 packet, followed by a class 2 packet
Analogy:
Weighted fair queuing:
In WFQ Arriving packets are classified and queued in the appropriate per-class waiting area.
WFQ differs from round robin in that each class may receive a differential
Amount of service in any interval of time .
In WFQ, the priority given to network traffic is inversely proportional to the signal bandwidth.
The purpose of WFQ is to let several sessions share the same link.
WFQ is the data packet queuing algorithm used by network schedulers.
Analogy:

 

Networking 

 

Place Order For A Top Grade Assignment Now

We have some amazing discount offers running for the students

Place Your Order

Packet marking:  mechanism needed to provide packets belonging to different class of traffic also allows a router to distinguish among packets Belonging to different classes of traffic.
For example before you get to your airplane the Employee who work with the who work with the airlines will need to scan you boarding pass but the people will be classified depend on their groups or if the are VIP or not so the priority people will pass the line before anyone and so on.
Analogy: in packet marking, we divide the data in the network. The data coming to the router is divided into classes. This division may be based on the priority of the packets. In other words, if a packet has higher priority, it will be put to a different class. The devices in the network use this technique. With this technique they handle the network traffic. For example, we want to send a file to someone. We upload the file and the sending fails. So we have to again upload entire file.
Rather we can break into packets. Now the sender starts sending packet by packet. And they are marked serially. So if a packet is lost, we have to send only the lost packet not all of them.
Traffic Policing: Traffic policing enables you to control the maximum rate of IP traffic sent or received on an interface and also to partition network traffic into multiple priority levels, also known as classes of service.
Or we could say its one of the several network mechanisms that can be uses to provide differentiated service among several class of traffic.
Analogy: as the name says, traffic policing is the process where policies are created to control the traffic. Contracts or parameters are created to shape the traffic. These are created to avoid congestion in the network. When there is heavy traffic, excess data packets are discarded. For example, when there is heavy load on server, to save the server from crashing, we can create such policies so as to accept only limited amount of data. This will help the server to work smoothly.

 


Packet-discarding policy:

 


It is a method that can determines whether the packet will be dropped (lost) or whether other packets will be removed from the queue to make space for the arriving packet.
Analogy: this technique is also used for discarding the packets. As we know that the data when sent over the network, is broken into packets. Since there is limited bandwidth to accommodate data packets. So this policy is applied. In this, old, unnecessary or low priority packets are discarded so that new packets can be added and accepted in the network. This policy also helps in network shaping that is, the network congestion and load can be avoided by this technique by removing some packets of the data.

 


Priority queuing

 


Under priority queuing, packets arriving at the output link are classified into priority classes at the output queue.
Analogy: as the name says, the data packets are arranged in different queues based on different priorities. In other words, the data packets received will have different priorities marked on it. So the data will be sent to the priority queues and arranged there. The device will transmit the packet with highest priority first. In this way we can say that, handle the network traffic efficiently. In simpler words we can say that the important data will be handled first, then one with lower priority and then the lowest one.
Round robin queuing discipline
Under the round robin queuing discipline, packets are sorted into classes as with priority queuing. However, rather than there being a strict priority of service among classes, a round robin scheduler alternates service among the classes.
In the simplest form of round robin scheduling, a class 1 packet is transmitted, followed by a class 2 packet, followed by a class 1 packet, followed by a class 2 packet
Analogy: as the name says, round robin, each class of data will be services. For example all the data packets are divided into priority classes. Now a data packet from each class will be serviced turn by turn and then again the cycle will continue. In simpler words, let us assume that there are 3 classes namely 1, 2, 3. So now, first packet from priority class 1 will be serviced, then from priority 2 then 3. Then again same cycle will be followed.

 


Weighted fair queuing:

 


In WFQ Arriving packets are classified and queued in the appropriate per-class waiting area.
WFQ differs from round robin in that each class may receive a differential Amount of service in any interval of time. In WFQ, the priority given to network traffic is inversely proportional to the signal bandwidth. The purpose of WFQ is to let several sessions share the same link.
WFQ is the data packet queuing algorithm used by network schedulers.
Analogy: in WFQ, the data is divided upon the bandwidth they need to be processed. Since bandwidth is an important factor when we have to process the data, so here we use it. The queues are created on this basis. The packets that require lower bandwidth are processed first and those require higher bandwidth are processed afterwards. Each packet gets fair allocation of time, bandwidth and resources for processing as per their requirement. So this is why it is called WFQ. Sometimes it may increase the delay for broadband requiring packets, but not much of latency is seen.


 

 

Get Quality Assignment Without Paying Upfront

Hire World's #1 Assignment Help Company

Place Your Order