Papers
Topics
Authors
Recent
Search
2000 character limit reached

Delay and Delay Variation Constrained Algorithm based on VNS Algorithm for RP Management in Mobile IPv6

Published 19 Mar 2013 in cs.NI | (1303.4771v1)

Abstract: On account of the progress of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast communication. These applications are more important with the arrival of mobile IPv6 protocol through mobile receivers and sources. These applications require a multicast routing protocol which has packets arriving at multicast receptors within a specified QoS guaranteed and a quick recovery mechanism. When multicasting with mobile IPv6, the mobility of a receivers and senders may lead to serious problems. When the receiver or sender moves, the quality of full multicast tree may degrade so that multicast datagrams cannot be forwarded efficiently. D2V-RPM (delay and delay variation RP Manager) problem consist in choosing an optimal multicast router in the network as the root of the shared multicast tree (ST) within a specified delay and delay variation bound for all multicast session, and recovering this RP if it's not optimal or it has failed. This NP hard problem needs to be solved through a heuristic algorithm. In this paper, we propose a new RP Management algorithm based on Variable Neighborhood Search algorithm, based on a systematic neighborhood changing. D2VVNS-RPM algorithm selects and recovers the RP router by considering tree cost, delay and delay variation. Simulation results show that good performance is achieved.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.