You are on page 1of 4

Inferring The Packet Forwarding Priority Of Router

ABSTRACT:
The Packet Forwarding Priority Inference is used for measuring the loss rates of different packet types. It determines the packet loss for each packet type by sending a large amount of traffic to saturate a particular router to its maximum link capacity and hence determining the loss incurred. An end-to-end approach is used to transfer the packets from sender to the receiver which enables the end users to discover the various network policies adapted by the I P. In the pro!ect it is proposed that the loss rate of the different packet types can be measured by using a hop-by-hop instead of an end-to-end approach. This is achieved by using multiple routers implemented with a "ueuing system# each router being implemented with a "ueue which is dynamically created. $nce the "ueue of a particular router is full# the data packets are sent through another router with least link congestion to complete the transmission of the packet and thus is said to have hopped from one router to another# the packet loss incurred is thus measured by using multiple routers to transmit the data packets. %oss ranks are then assigned to each packet type based on their loss rates. The Average &ormali'ed (ank for each packet type is then calculated# which is then used to cluster the packets into groups for measuring the performance of each packet type in the given network. The packets are then prioriti'ed based on their performance. The performance of the packet types in the given network is then plotted using ns-) simulation graphs.

Existing A

roach:

Packet Forwarding Priority can have a significant impact on the performance of applications. *e analytical model to study the interplay between medium access control +,A-. and packet forwarding disciplines in multi hop wireless networks.

The model allows the computation of per-node performance metrics for any given network topology and the combination of specific ,A- protocols and packet forwarding methods.

all the existing works on Packet Forwarding Priority mechanism !ust identified a shared congestion their paths. These efforts focused on flows which experience congestion +ignoring uncongested ones.# so that the probe traffic rate is low and not bursty. /ence they failed to flag many multi-priority paths that were discovered by the loss based method# and the paths flagged by them were mainly caused by the mechanisms which induce different delays among packets types. The packet forwarding priority of a router is inferred using a parametric loss based method. It uses an end-to-end approach for forwarding the packets through a router. o The following are the disadvantages of the existing solutions0 and determined whether the flow of two congested paths are correlated and share a common congested "ueue along

Packet loss incurred is high as there are no hops between the routers. Packet loss inferred is not accurate as a parametric method based on loss is used.

Pro osed A

roach:
roach a#gorith$ is used for

1. /ere it is proposed that an ho !"y!ho a

packet forwarding priority inference by measuring the loss rate difference of different packet types. This allows users to assign arbitrarily defined packet classes to "ueues with different priorities. ). This can be used by the enterprises or end-users to discover whether their traffic are treated differently by the I Ps# and whether the I Ps has fulfilled the contracts between them and the users. 2.A hop-by-hop approach is used to forward the packets through a router as shown. ,ultiple routers are used to transfer the packet from the sender to the receiver rather than a single router. 3.4ach router being implemented with a "ueuing system. A loss of packets is observed during the transmission of packets from the sender to receiver. Packet loss ranks are assigned to each packet type based on the packet loss rate. Average &ormali'ed ranks# which is non parametric are computed using the ranks derived. 5. (ange of the group of packet types in a single burst is calculated using A&(. All the packets are initially considered to be a single group which is then hierarchically divided into different groups using the c#ustering a#gorith$.

6.All the packet types within the same group have similar loss rates. 7ased on the loss rates of the group# the packets are prioriti'ed. (outer Packet forwarding capacity is monitored by ns-) simulations.

%AR&'ARE RE()IRE*E+TS

Processor (A, /ard 9isk ,other7oard I<$ Printer

0 0 0 0 0 0

Intel Pentium III or higher 1 87 or higher 3: 87 or higher Intel ;35 g chipset or higher $ptical mouse and keyboard %aser

SOFT'ARE RE()IRE*E+TS
$perating ystem Programming %anguage =sed 0 =buntu 1:.1: 0 &etwork imulator ).23 0 T-% and ->>

&etwork ,odelling Tool 0 9ia