Anzeige
Erschienen in:
2018 | OriginalPaper | Buchkapitel
Mutation in Path for the Packets in the Network During Journey from Source to Destination
verfasst von : Tarak Nath Paul, Abhoy Chand Mondal
Erschienen in: Advanced Computational and Communication Paradigms
Verlag: Springer Singapore
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
This paper formulates a genetic algorithm to judge the mutation of path for packets in the network. The predefine routes for network lines to transfer packets, transportation links in liquids and bearer links are static phenomenon. The algorithm discovers mutation in prescribed path due to some breakage in the communication link. The breakage occurs due to natural calamity or for any technical issues. At this juncture in the mid-way dumping or returning, the packet/package is not wise. Here, a new path has to be redefined from the current node and the packet has to be delivered to the destination. It is good to have delay in delivery instead of been dumping. Because resending the packet is far more time consuming, this makes the phenomenon more dynamic and less time-consuming. The concept is also useful in robotics for path selection. Simulation for path is performed using MATLAB. Results are similar to Dijkstra’s algorithm. Dijkstra’s algorithm is a static algorithm, whereas the proposed algorithm is dynamic one.