Abstract

In advance network we may use service Based Routing (SBR), so data is transmitted from a source node to destination nodes are not depended on destination addresses. So, it may be comfortable with new advanced technology as cloud computing and also flexible and reliable. Multicast routing is advanced technique to deliver data simultaneously from one source node to multiple destination nodes with QOS (quality of service). In this paper, we introduce a technique that is extended from multicast technique with multiple multicast trees that are conformed quality of service routing and multiple path routing. It also guarantees QOS of routes such as bandwidth. This technique is based on Greedy, Ant Colony Optimization, artificial neural network and fuzzy logic to get optimal routes to transmit data from one source to multiple destination node very effectively. The usage of the ANT Colony optimization, Greedy, fuzzy logic algorithms to find cyclic or multiple paths routes on each trunk by multiple criterions to transmit data effectively.

Highlights

  • In order to model a general network in common by a graph in discrete mathematics

  • The routing process consists of several minor detail processes: In the reactive or on-demand routing protocol: i) Broadcast packets over network to find routes; ii) Collecting reply packets to build optimal routes; in proactive protocol it usually collects network information through flooding HELLO messages

  • IOT is short for Internet of Nguyen Thanh Long et al.: Innovating Multicast Tree and Artificial Algorithms for Service Based Routing thing that is a trend to connect all the things of the Planet

Read more

Summary

Basical Concepts

In order to model a general network in common by a graph in discrete mathematics. In which denote V is the set of vertics that are nodes in the network, E is the set of the edges that are links to connect each pair of nodes in the graph. The inputs of the routing table are collected by routing process. The routing process consists of several minor detail processes: In the reactive or on-demand routing protocol: i) Broadcast packets over network to find routes; ii) Collecting reply packets to build optimal routes; in proactive protocol it usually collects network information through flooding HELLO messages. On receiving HELLO packets, network node updates the routing table to use to find routes as introducing . HELLO messages are effective to collect network information

Fuzzy Logic
Greedy Algorithm
Ant Colony Optimization
Use Greedy Algorithm
Use Kruskal Algorithm
Make QOS Routes from Multiple Multicast Tree
Build Hierachical Multiple Multicast Routing
Algorithms Simulations
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.