viral
Advance Topic In Network RLDSC Scheduling Policy
Scheduling Policies
Whenever the message arrives in the queue, implement Scheduling Policy.
There are various type of Policies such as..
TSMF
RLDSC :
0• It is a scheduling policy.
0• This Strategy is Remaining Life time Descending and Ascending
0• In this we find the time to live (ttl) of a message in both descending and ascending.
0• All implementation shown here is only for remaining life time descending.
0• There are very minor changes for remaining life time ascending.
0• In this scheduling policy bundles are sorted taking into account their remaining time-to-live (TTL). Bundles with a longer remaining TTL are scheduled to be sent first because they have a higher probability to reach its final destination.
Both FIFO and Random scheduling policies do not take into account the time-to live(TTL) of bundles. TTL is a timeout value that expresses the amount of time that bundles should be stored before being discarded, since they are no longer. meaningful. Remaining Lifetime scheduling policy orders bundles based on their remaining TTL.
0• Two variations of this scheduling policy are considered ,either
1) bundles with smaller remaining TTLs are scheduled to be sent first
(RL Ascending Order)
or
2) bundles with longer remaining TTLs are scheduled to be sent first
(RLDescending
Order).
Anali shah (T13104931023) Shinny Purohit (T13104931001)
Advance Topic In Network RLDSC Scheduling Policy
Implementation :
Some steps we have to follow to implement .
Default_Settings.txt:
Group.movementModel = RandomWaypoint
Group.router = EpidemicRouter
Scenario.endTime = 10000
It is scheduling policy , so we can put our code in message router.java file.
0• In General, there is FIFO in any routing Scheme, But ,here we change it with RLASC
/RLDSC.
0• In message Router, there is a switch case. And by
Scheduling Policies
Whenever the message arrives in the queue, implement Scheduling Policy.
There are various type of Policies such as..
TSMF
RLDSC :
0• It is a scheduling policy.
0• This Strategy is Remaining Life time Descending and Ascending
0• In this we find the time to live (ttl) of a message in both descending and ascending.
0• All implementation shown here is only for remaining life time descending.
0• There are very minor changes for remaining life time ascending.
0• In this scheduling policy bundles are sorted taking into account their remaining time-to-live (TTL). Bundles with a longer remaining TTL are scheduled to be sent first because they have a higher probability to reach its final destination.
Both FIFO and Random scheduling policies do not take into account the time-to live(TTL) of bundles. TTL is a timeout value that expresses the amount of time that bundles should be stored before being discarded, since they are no longer. meaningful. Remaining Lifetime scheduling policy orders bundles based on their remaining TTL.
0• Two variations of this scheduling policy are considered ,either
1) bundles with smaller remaining TTLs are scheduled to be sent first
(RL Ascending Order)
or
2) bundles with longer remaining TTLs are scheduled to be sent first
(RLDescending
Order).
Anali shah (T13104931023) Shinny Purohit (T13104931001)
Advance Topic In Network RLDSC Scheduling Policy
Implementation :
Some steps we have to follow to implement .
Default_Settings.txt:
Group.movementModel = RandomWaypoint
Group.router = EpidemicRouter
Scenario.endTime = 10000
It is scheduling policy , so we can put our code in message router.java file.
0• In General, there is FIFO in any routing Scheme, But ,here we change it with RLASC
/RLDSC.
0• In message Router, there is a switch case. And by