Enviar búsqueda
Cargar
A comparative study on multicast routing using dijkstra’s
•
1 recomendación
•
578 vistas
I
iaemedu
Seguir
Denunciar
Compartir
Denunciar
Compartir
1 de 10
Descargar ahora
Descargar para leer sin conexión
Recomendados
A Novel Algorithm to Estimate Closely Spaced Source DOA
A Novel Algorithm to Estimate Closely Spaced Source DOA
IJECEIAES
ADAPTIVE BLIND MULTIUSER DETECTION UNDER IMPULSIVE NOISE USING PRINCIPAL COMP...
ADAPTIVE BLIND MULTIUSER DETECTION UNDER IMPULSIVE NOISE USING PRINCIPAL COMP...
csandit
Adaptive blind multiuser detection under impulsive noise using principal comp...
Adaptive blind multiuser detection under impulsive noise using principal comp...
csandit
5113jgraph02
5113jgraph02
graphhoc
Shortest route and mst
Shortest route and mst
Alona Salva
Paper id 71201925
Paper id 71201925
IJRAT
Introduction to Optial Flow
Introduction to Optial Flow
Sylvain_Lobry
20120140506008 2
20120140506008 2
IAEME Publication
Recomendados
A Novel Algorithm to Estimate Closely Spaced Source DOA
A Novel Algorithm to Estimate Closely Spaced Source DOA
IJECEIAES
ADAPTIVE BLIND MULTIUSER DETECTION UNDER IMPULSIVE NOISE USING PRINCIPAL COMP...
ADAPTIVE BLIND MULTIUSER DETECTION UNDER IMPULSIVE NOISE USING PRINCIPAL COMP...
csandit
Adaptive blind multiuser detection under impulsive noise using principal comp...
Adaptive blind multiuser detection under impulsive noise using principal comp...
csandit
5113jgraph02
5113jgraph02
graphhoc
Shortest route and mst
Shortest route and mst
Alona Salva
Paper id 71201925
Paper id 71201925
IJRAT
Introduction to Optial Flow
Introduction to Optial Flow
Sylvain_Lobry
20120140506008 2
20120140506008 2
IAEME Publication
Fuzzy c means clustering protocol for wireless sensor networks
Fuzzy c means clustering protocol for wireless sensor networks
mourya chandra
Information Content of Complex Networks
Information Content of Complex Networks
Hector Zenil
Hierarchical clustering techniques
Hierarchical clustering techniques
Md Syed Ahamad
H010223640
H010223640
IOSR Journals
RESOLVING CYCLIC AMBIGUITIES AND INCREASING ACCURACY AND RESOLUTION IN DOA ES...
RESOLVING CYCLIC AMBIGUITIES AND INCREASING ACCURACY AND RESOLUTION IN DOA ES...
csandit
An Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing Problem
CSCJournals
Mobile_Lec5
Mobile_Lec5
Charan Litchfield
Data miningpresentation
Data miningpresentation
Manoj Krishna Yadavalli
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
ijscmc
Graph Spectra through Network Complexity Measures: Information Content of Eig...
Graph Spectra through Network Complexity Measures: Information Content of Eig...
Hector Zenil
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
CSCJournals
NEURAL NETWORKS FOR HIGH PERFORMANCE TIME-DELAY ESTIMATION AND ACOUSTIC SOURC...
NEURAL NETWORKS FOR HIGH PERFORMANCE TIME-DELAY ESTIMATION AND ACOUSTIC SOURC...
csandit
Fuzzieee-98-final
Fuzzieee-98-final
Sumit Sen
Shortest path algorithm
Shortest path algorithm
Subrata Kumer Paul
Weighted graphs
Weighted graphs
Core Condor
Fuzzy c means manual work
Fuzzy c means manual work
Dr.E.N.Sathishkumar
post119s1-file2
post119s1-file2
Venkata Suhas Maringanti
Spanning trees
Spanning trees
Shareb Ismaeel
Visual cryptography scheme for color images
Visual cryptography scheme for color images
iaemedu
Shared bandwidth reservation of backup paths of multiple
Shared bandwidth reservation of backup paths of multiple
iaemedu
Dc dc converter for ultracapacitor boosted electric vehicle
Dc dc converter for ultracapacitor boosted electric vehicle
iaemedu
An analytical study on a factors affecting employee
An analytical study on a factors affecting employee
iaemedu
Más contenido relacionado
La actualidad más candente
Fuzzy c means clustering protocol for wireless sensor networks
Fuzzy c means clustering protocol for wireless sensor networks
mourya chandra
Information Content of Complex Networks
Information Content of Complex Networks
Hector Zenil
Hierarchical clustering techniques
Hierarchical clustering techniques
Md Syed Ahamad
H010223640
H010223640
IOSR Journals
RESOLVING CYCLIC AMBIGUITIES AND INCREASING ACCURACY AND RESOLUTION IN DOA ES...
RESOLVING CYCLIC AMBIGUITIES AND INCREASING ACCURACY AND RESOLUTION IN DOA ES...
csandit
An Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing Problem
CSCJournals
Mobile_Lec5
Mobile_Lec5
Charan Litchfield
Data miningpresentation
Data miningpresentation
Manoj Krishna Yadavalli
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
ijscmc
Graph Spectra through Network Complexity Measures: Information Content of Eig...
Graph Spectra through Network Complexity Measures: Information Content of Eig...
Hector Zenil
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
CSCJournals
NEURAL NETWORKS FOR HIGH PERFORMANCE TIME-DELAY ESTIMATION AND ACOUSTIC SOURC...
NEURAL NETWORKS FOR HIGH PERFORMANCE TIME-DELAY ESTIMATION AND ACOUSTIC SOURC...
csandit
Fuzzieee-98-final
Fuzzieee-98-final
Sumit Sen
Shortest path algorithm
Shortest path algorithm
Subrata Kumer Paul
Weighted graphs
Weighted graphs
Core Condor
Fuzzy c means manual work
Fuzzy c means manual work
Dr.E.N.Sathishkumar
post119s1-file2
post119s1-file2
Venkata Suhas Maringanti
Spanning trees
Spanning trees
Shareb Ismaeel
La actualidad más candente
(18)
Fuzzy c means clustering protocol for wireless sensor networks
Fuzzy c means clustering protocol for wireless sensor networks
Information Content of Complex Networks
Information Content of Complex Networks
Hierarchical clustering techniques
Hierarchical clustering techniques
H010223640
H010223640
RESOLVING CYCLIC AMBIGUITIES AND INCREASING ACCURACY AND RESOLUTION IN DOA ES...
RESOLVING CYCLIC AMBIGUITIES AND INCREASING ACCURACY AND RESOLUTION IN DOA ES...
An Ant Algorithm for Solving QoS Multicast Routing Problem
An Ant Algorithm for Solving QoS Multicast Routing Problem
Mobile_Lec5
Mobile_Lec5
Data miningpresentation
Data miningpresentation
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE
Graph Spectra through Network Complexity Measures: Information Content of Eig...
Graph Spectra through Network Complexity Measures: Information Content of Eig...
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
NEURAL NETWORKS FOR HIGH PERFORMANCE TIME-DELAY ESTIMATION AND ACOUSTIC SOURC...
NEURAL NETWORKS FOR HIGH PERFORMANCE TIME-DELAY ESTIMATION AND ACOUSTIC SOURC...
Fuzzieee-98-final
Fuzzieee-98-final
Shortest path algorithm
Shortest path algorithm
Weighted graphs
Weighted graphs
Fuzzy c means manual work
Fuzzy c means manual work
post119s1-file2
post119s1-file2
Spanning trees
Spanning trees
Destacado
Visual cryptography scheme for color images
Visual cryptography scheme for color images
iaemedu
Shared bandwidth reservation of backup paths of multiple
Shared bandwidth reservation of backup paths of multiple
iaemedu
Dc dc converter for ultracapacitor boosted electric vehicle
Dc dc converter for ultracapacitor boosted electric vehicle
iaemedu
An analytical study on a factors affecting employee
An analytical study on a factors affecting employee
iaemedu
Parallel communicating flip pushdown automata systems
Parallel communicating flip pushdown automata systems
iaemedu
Recent research in web page classification – a review
Recent research in web page classification – a review
iaemedu
A study on the presence of fecal pollution indicator
A study on the presence of fecal pollution indicator
iaemedu
Innovative hr practices in software organization
Innovative hr practices in software organization
iaemedu
Tech transfer making it as a risk free approach in pharmaceutical and biotech in
Tech transfer making it as a risk free approach in pharmaceutical and biotech in
iaemedu
Destacado
(9)
Visual cryptography scheme for color images
Visual cryptography scheme for color images
Shared bandwidth reservation of backup paths of multiple
Shared bandwidth reservation of backup paths of multiple
Dc dc converter for ultracapacitor boosted electric vehicle
Dc dc converter for ultracapacitor boosted electric vehicle
An analytical study on a factors affecting employee
An analytical study on a factors affecting employee
Parallel communicating flip pushdown automata systems
Parallel communicating flip pushdown automata systems
Recent research in web page classification – a review
Recent research in web page classification – a review
A study on the presence of fecal pollution indicator
A study on the presence of fecal pollution indicator
Innovative hr practices in software organization
Innovative hr practices in software organization
Tech transfer making it as a risk free approach in pharmaceutical and biotech in
Tech transfer making it as a risk free approach in pharmaceutical and biotech in
Similar a A comparative study on multicast routing using dijkstra’s
IRJET- Survey on Adaptive Routing Algorithms
IRJET- Survey on Adaptive Routing Algorithms
IRJET Journal
2512ijcsea02
2512ijcsea02
IJCSEA Journal
Parallel algorithm for computing edt with new architecture
Parallel algorithm for computing edt with new architecture
IAEME Publication
40120140501016
40120140501016
IAEME Publication
Implementation performance analysis of cordic
Implementation performance analysis of cordic
iaemedu
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...
IJCNCJournal
Automatic cluster formation and assigning address for wireless sensor net
Automatic cluster formation and assigning address for wireless sensor net
IAEME Publication
Steiner Tree: approach applying for shortest path in selected network
Steiner Tree: approach applying for shortest path in selected network
IOSR Journals
04 15029 active node ijeecs 1570310145(edit)
04 15029 active node ijeecs 1570310145(edit)
nooriasukmaningtyas
Accurate indoor positioning system based on modify nearest point technique
Accurate indoor positioning system based on modify nearest point technique
IJECEIAES
An efficient ant optimized multipath routing in wireless sensor network
An efficient ant optimized multipath routing in wireless sensor network
Editor Jacotech
Square grid points coveraged by
Square grid points coveraged by
ijcsit
Analysis on the performance of pointing error effects for RIS-aided FSO link ...
Analysis on the performance of pointing error effects for RIS-aided FSO link ...
TELKOMNIKA JOURNAL
Lecture set 5
Lecture set 5
Gopi Saiteja
Description Of A Graph
Description Of A Graph
Winstina Kennedy
Efficient Broadcast Authentication with Highest Life Span in Wireless Sensor ...
Efficient Broadcast Authentication with Highest Life Span in Wireless Sensor ...
IRJET Journal
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
ijceronline
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKS
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKS
ijwmn
Outage analysis of simo system over nakagami n fading channel
Outage analysis of simo system over nakagami n fading channel
eSAT Publishing House
Three Element Beam forming Algorithm with Reduced Interference Effect in Sign...
Three Element Beam forming Algorithm with Reduced Interference Effect in Sign...
IJMER
Similar a A comparative study on multicast routing using dijkstra’s
(20)
IRJET- Survey on Adaptive Routing Algorithms
IRJET- Survey on Adaptive Routing Algorithms
2512ijcsea02
2512ijcsea02
Parallel algorithm for computing edt with new architecture
Parallel algorithm for computing edt with new architecture
40120140501016
40120140501016
Implementation performance analysis of cordic
Implementation performance analysis of cordic
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...
Automatic cluster formation and assigning address for wireless sensor net
Automatic cluster formation and assigning address for wireless sensor net
Steiner Tree: approach applying for shortest path in selected network
Steiner Tree: approach applying for shortest path in selected network
04 15029 active node ijeecs 1570310145(edit)
04 15029 active node ijeecs 1570310145(edit)
Accurate indoor positioning system based on modify nearest point technique
Accurate indoor positioning system based on modify nearest point technique
An efficient ant optimized multipath routing in wireless sensor network
An efficient ant optimized multipath routing in wireless sensor network
Square grid points coveraged by
Square grid points coveraged by
Analysis on the performance of pointing error effects for RIS-aided FSO link ...
Analysis on the performance of pointing error effects for RIS-aided FSO link ...
Lecture set 5
Lecture set 5
Description Of A Graph
Description Of A Graph
Efficient Broadcast Authentication with Highest Life Span in Wireless Sensor ...
Efficient Broadcast Authentication with Highest Life Span in Wireless Sensor ...
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKS
ON FINDING MINIMUM AND MAXIMUM PATH LENGTH IN GRID-BASED WIRELESS NETWORKS
Outage analysis of simo system over nakagami n fading channel
Outage analysis of simo system over nakagami n fading channel
Three Element Beam forming Algorithm with Reduced Interference Effect in Sign...
Three Element Beam forming Algorithm with Reduced Interference Effect in Sign...
Más de iaemedu
Integration of feature sets with machine learning techniques
Integration of feature sets with machine learning techniques
iaemedu
Effective broadcasting in mobile ad hoc networks using grid
Effective broadcasting in mobile ad hoc networks using grid
iaemedu
Effect of scenario environment on the performance of mane ts routing
Effect of scenario environment on the performance of mane ts routing
iaemedu
Adaptive job scheduling with load balancing for workflow application
Adaptive job scheduling with load balancing for workflow application
iaemedu
Survey on transaction reordering
Survey on transaction reordering
iaemedu
Semantic web services and its challenges
Semantic web services and its challenges
iaemedu
Website based patent information searching mechanism
Website based patent information searching mechanism
iaemedu
Revisiting the experiment on detecting of replay and message modification
Revisiting the experiment on detecting of replay and message modification
iaemedu
Prediction of customer behavior using cma
Prediction of customer behavior using cma
iaemedu
Performance analysis of manet routing protocol in presence
Performance analysis of manet routing protocol in presence
iaemedu
Performance measurement of different requirements engineering
Performance measurement of different requirements engineering
iaemedu
Mobile safety systems for automobiles
Mobile safety systems for automobiles
iaemedu
Efficient text compression using special character replacement
Efficient text compression using special character replacement
iaemedu
Agile programming a new approach
Agile programming a new approach
iaemedu
Adaptive load balancing techniques in global scale grid environment
Adaptive load balancing techniques in global scale grid environment
iaemedu
A survey on the performance of job scheduling in workflow application
A survey on the performance of job scheduling in workflow application
iaemedu
A survey of mitigating routing misbehavior in mobile ad hoc networks
A survey of mitigating routing misbehavior in mobile ad hoc networks
iaemedu
A novel approach for satellite imagery storage by classify
A novel approach for satellite imagery storage by classify
iaemedu
A self recovery approach using halftone images for medical imagery
A self recovery approach using halftone images for medical imagery
iaemedu
A comprehensive study of non blocking joining technique
A comprehensive study of non blocking joining technique
iaemedu
Más de iaemedu
(20)
Integration of feature sets with machine learning techniques
Integration of feature sets with machine learning techniques
Effective broadcasting in mobile ad hoc networks using grid
Effective broadcasting in mobile ad hoc networks using grid
Effect of scenario environment on the performance of mane ts routing
Effect of scenario environment on the performance of mane ts routing
Adaptive job scheduling with load balancing for workflow application
Adaptive job scheduling with load balancing for workflow application
Survey on transaction reordering
Survey on transaction reordering
Semantic web services and its challenges
Semantic web services and its challenges
Website based patent information searching mechanism
Website based patent information searching mechanism
Revisiting the experiment on detecting of replay and message modification
Revisiting the experiment on detecting of replay and message modification
Prediction of customer behavior using cma
Prediction of customer behavior using cma
Performance analysis of manet routing protocol in presence
Performance analysis of manet routing protocol in presence
Performance measurement of different requirements engineering
Performance measurement of different requirements engineering
Mobile safety systems for automobiles
Mobile safety systems for automobiles
Efficient text compression using special character replacement
Efficient text compression using special character replacement
Agile programming a new approach
Agile programming a new approach
Adaptive load balancing techniques in global scale grid environment
Adaptive load balancing techniques in global scale grid environment
A survey on the performance of job scheduling in workflow application
A survey on the performance of job scheduling in workflow application
A survey of mitigating routing misbehavior in mobile ad hoc networks
A survey of mitigating routing misbehavior in mobile ad hoc networks
A novel approach for satellite imagery storage by classify
A novel approach for satellite imagery storage by classify
A self recovery approach using halftone images for medical imagery
A self recovery approach using halftone images for medical imagery
A comprehensive study of non blocking joining technique
A comprehensive study of non blocking joining technique
A comparative study on multicast routing using dijkstra’s
1.
International Journal of
Computer and Technology (IJCET), ISSN 0976 – 6367(Print), International Journal of Computer Engineering Engineering ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME and Technology (IJCET), ISSN 0976 – 6367(Print) ISSN 0976 – 6375(Online) Volume 1 IJCET Number 2, Sep - Oct (2010), pp. 16-25 ©IAEME © IAEME, http://www.iaeme.com/ijcet.html A COMPARATIVE STUDY ON MULTICAST ROUTING USING DIJKSTRA’S, PRIMS AND ANT COLONY SYSTEMS Sudip Kumar Sahana Dept. Of Computer Science& Engg Birla Institute of Technology Mesra, Ranchi, E-Mail: sudipsahana@gmail.com Dr.(Mrs). Aruna Jain Dept. of Information Technology Birla Institute of Technology Mesra, Ranchi, E-Mail: jaruna16@rediffmail.com Abijit Mustafi Dept. Of Computer Science& Engg Birla Institute of Technology Mesra, Ranchi, E-Mail: abhijit@bitmesra.ac.in ABSTRACT Dijkstra’s and Prim’s algorithms are well established methods for implementing multicast routing. We have emphasized a different approach ’Ant Colony System (ACS)’ for multicast routing. This paper introduces a comparative study of implementing simple Ant Colony System, Dijkstra’s Algorithm and Prim’s Algorithm in a multicast routing communication scenario. For the sake of simplicity we have only considered the distance as the key parameter to choose the best path. We have analyzed directed as well as undirected graphs. ACS, an optimization approach is considered here as undirected system for generalization. The complexity study shows that ACS has faster convergence to reach the optimal solution. Keywords: Dijkstra’s Algorithms, Prim’s Algorithm, Ant Colony System, Pheromone, Convergence. 16
2.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME 1. INTRODUCTION 1.1DIJKSTRA’S ALGORITHM Let the starting node is called as initial node and the distance of node Y be the distance from the initial node to Y. Dijkstra's algorithm[1] will assign some initial distance values and will try to improve them step by step. It is an algorithm to find shortest path[2] of routing in a network. Distance Matrix D = dij =0 ,if i=j. dij=∞ ,if there is no path between i and j. dij = distance of the path from i to j. 1. Assign to every node a distance value. Set it to zero for our initial node and to infinity for all other nodes. 2. Mark all nodes as unvisited. Set initial node as current. 3. For current node, consider all its unvisited neighbors and calculate their tentative distance dij (from the initial node). For example, if current node (A) has distance of 6, and an edge connecting it with another node (B) is 2, the distance to B through A will be 6+2=8. If this distance is less than the previously recorded distance (infinity in the beginning, zero for the initial node), overwrite the distance. 4. When we are done considering all neighbors of the current node, mark it as visited. A visited node will not be checked ever again; its distance recorded now is final and minimal. 5. If all nodes have been visited, finish. Otherwise, set the unvisited node with the smallest distance (from the initial node) as the next "current node" and continue from step 3. 1.2 PRIM’S ALGORITHM It determines a minimum spanning tree [2] for a connected weighted undirected graph. Here, objective is to find a subset of the edges that forms a tree, which includes every vertex, where the total weight of all the edges in the tree is minimized. 17
3.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME Algorithm: Input: A connected weighted graph with vertices V and edges E. Initialize: (i) Vnew = { X } , where X is an arbitary node from V,Enew = { } Repeat until Vnew = V; (ii)Choose edge (u,v) with minimal weight such that u is in Vnew and V is not in Vnew. (iii) Add v to Vnew, add (u,v) to Enew. Output: Vnew and Enew describe a minimal spanning tree 1.3 ANT COLONY SYSTEM (ACS) Ant colony algorithm [3] determines optimal solution through simulating the process of ants searching for food. The ants collective behavior reflects an information positive feedback phenomenon. This optimization technique does not rely on mathematical description of the specific issues, but has strong global optimization feature [4], high performance [5] and flexibility. Three main aspects to determine ACS are: 1) State Transition Rule: Ants prefer to move from one place to another (i.e one node to other node) which are connected by short edges with a high amount of pheromone[3]. It can be done by using following rule: PI k (r,s) = (r,s).[η(r,s)]β , if s єJk (r) ∑ (r,u)[η(r,u)] β uεJk (r) 0 otherwise 2) Local pheromone updating rule: While building a solution, ants visit edges and change their pheromone level by applying this rule: (r,s) (1-ρ). (r,s)+ρ. (r,s). Where 0<ρ<1 is a pheromone evaporation [3] parameter, and (r,s)= 0 where is pheromone. We here assume a well accepted value of ρ =0.5. 3) Global pheromone updating rule: Once all ants have built their tours, pheromone is updated on all edges by using the following rule: 18
4.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME (r,s) (1-α)* (r,s)+α* (r,s). where 0<α<1 is pheromone decay [4][6]parameter and we assume α=0.2 to get a better effect of probability on the globally shortest path. Where (r,s)= 1/Lgb if (r,s) є global best tour 0 otherwise and Lgb is length of globally best tour. 2. IMPLEMENTATION Part I: Description of the example network. Part II: Results of Dijkstra’s Algorithm considered for directed graph of example network for an instance. Part III: Results of Prims Algorithm considered for undirected graph of example network for an instance. Part IV: Results of ACS Algorithm considered for undirected graph of example network for an instance. Part V: Overall Results Analysis and Complexity Analysis. 2.1 PART I: Description of the network: In multicast network [7] one source can transmit packets to more than one destination at a time. In practical communication scenario, there may be different constraints [5] like bandwidth, delay, hop count, packet loss, etc. We are considering only distance as a main constrain for the sake of simplicity. We have experimented on a set of networks having different vertices ranging from 5 to 25 and edges from 5 to 10. We have implemented the program on C language and Windows environment in a stand-alone machine. For a better understanding we are taking an instance of the example network where five nodes (vertices) and ten paths(edges) are considered as shown below in figure1. Here ‘r’, ’v’ and‘ s’ are the source node respectively. And ‘u’ and ‘t’ are the destination nodes. 19
5.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME Figure 1 2.2 PART II: Using Dijkstra’s approach for the said network the final solution can be tabulated as follows where Best(t) represents the best path distance from source node to the specified node and Tree(i) represents the intermediate nodes to reach the destination. Taking ‘r’ as the source node, distance vector for rest of the nodes are as follows: ‘r’(source node) s t u v Best(i) 2 6 6 2 Tree(i) r v v r Taking ‘v’ as the source node, distance vector for rest of the nodes are as follows: ‘v’(source node) r s t u Best(i) 11 4 5 4 Tree(i) t v v v Taking ‘s’ s the source node, distance vector for rest of the nodes are as follows: ‘s’(source node) t u v r Best(i) 4 5 9 10 Tree(i) s s t t 2.3 PART III: Figure 2 20
6.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME For the above network in figure 2 (considered as undirected system) using Prims approach, the final solution can be tabulated as follows where Best d(i) represents the best path distance from source node to the specified node. Taking ‘r’ as the source node r v s u t Best d(i) 2 2 6 6 Taking ‘v’as the source node v s u t r Best d(i) 4 4 5 2 Taking ‘s’ as the source node s t u v r Best d(i) 4 5 4 2 2.4 PART IV: The cost and pheromone intensity of the paths are: Cost of (r,v)=(r,u) = 2 , Pheromone intensity = 4. Cost of (r,u)=(r,t) = 6 , Pheromone intensity = 1.4. Cost of (v,u)=(v,s)=(u,t)=(s,t) =4 , Pheromone intensity= 2. Cost: (v,t)=(s,u) = 5 , Pheromone intensity= 1.6. Taking ‘r’ as source node, final optimal solution is obtained after 3 iteration which is the average case of complexity. The final shortest path is path (rvu) with path length 6. Taking ‘v’ as the source node, final solution is obtained after 4 iterations which is the worst case of complexity. The final shortest path is path (vu) with path length 4. Taking ‘s’ as the source node, final solution is obtained after 3 iterations which is the average case of complexity. The final shortest path is path (su) with path length 5. Similarly for t as destination node the same can be obtained. 2.5 PART V: 2.5.1 OVERALL RESULTS ANALYSIS: The Table1 shown below depicts the summary of the run time results in milliseconds for varying number of vertices and varying number of edges but a constant 21
7.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME number of destination nodes( two) for multicast routing. In case of varying number of destination nodes, the algorithms exhibit same hierarchy of performance. Table1 Edge=5 Edge=6 Edge=7 Edge=8 Edge=9 Edge=10 Prim's Dijktra's ACS Prim's Dijktra's ACS Prim'sDijktra's ACSPrim's Dijktra's ACS Prim'sDijktra's ACS Prim's Dijktra's ACS Vertex=5 25 60 11.6096 25 62 13.9316 25 64 16.2535 25 66 18.5754 25 68 20.8974 25 70 23.2193 Vertex=10 100 210 16.6096 100 212 19.9316 100 214 23.2535 100 216 26.5754 100 218 29.8974 100 220 33.2193 Vertex=15 225 460 19.5345 225 462 23.4413 225 464 27.3482 225 466 31.2551 225 468 35.162 225 470 39.0689 Vertex=20 400 810 21.6096 400 812 25.9316 400 814 30.2535 400 816 34.5754 400 818 38.8974 400 820 43.2193 Vertex=25 625 1260 23.2193 625 1262 27.8631 625 1264 32.507 625 1266 37.1508 625 1268 41.7947 625 1270 46.4386 The Table2 shown below depicts the summary of the run time results in milliseconds for varying number of vertices and varying number of edges but a constant number of destination nodes( two) for multicast routing for advance performance analysis of the said algorithms implemented using heap data structure. In case of varying number of destination nodes, the algorithms exhibit same hierarchy of performance. Table 2 Edge=5 Edge=6 Edge=7 Edge=8 Edge=9 Edge=10 Ext-Prim's Ext-Dijktra's ACSExt-Prim's Ext-Dijktra's ACSExt-Prim's Ext-Dijktra's ACSExt-Prim's Ext-Dijktra's ACSExt-Prim'sExt-Dijktra's ACSExt-Prim'sExt-Dijktra's ACS Vertex=5 16.6096 23.2193 11.6096 17.6096 27.8631 13.9316 18.6096 32.507 16.2535 19.6096 37.1508 18.5754 20.6096 41.7947 20.8974 21.6096 46.4386 23.2193 Vertex=10 38.2193 33.2193 16.6096 39.2193 39.8631 19.9316 40.2193 46.507 23.2535 41.2193 53.1508 26.5754 42.2193 59.7947 29.8974 43.2193 66.4386 33.2193 Vertex=15 63.6034 39.0689 19.5345 64.6034 46.8827 23.4413 65.6034 54.6965 27.3482 66.6034 62.5102 31.2551 67.6034 70.324 35.162 68.6034 78.1378 39.0689 Vertex=20 91.4386 43.2193 21.6096 92.4386 51.8631 25.9316 93.4386 60.507 30.2535 94.4386 69.1508 34.5754 95.4386 77.7947 38.8974 96.4386 86.4386 43.2193 Vertex=25 121.0964 46.4386 23.2193 122.0964 55.7263 27.8631 123.0964 65.014 32.507 124.0964 74.3017 37.1508 125.0964 83.5894 41.7947 126.0964 92.8771 46.4386 22
8.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME A visual representation of dataset of Table1 and Table 2 are as shown below: 2.5.2 COMPLEXITY ANALYSIS: Our first simple implementation of the Dijkstra's algorithm stores vertices of set Q in an ordinary array, and extract minimum from Q is simply a linear search through all vertices in Q. In this case, the running time is O( | V | 2 + | E | ) = O( | V | 2). We have further implemented it using heap data structure and the complexity reduced to O(|E|log|V|). A simple implementation using an adjacency matrix graph representation and searching an array of weights to find the minimum weight edge to add requires O (V2) running time. The time required by Prim's algorithm is O(|V|2). Using a binary heap data structure and an adjacency list representation, Prim's algorithm requires run in time O ((V 23
9.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME + E) log(V)) where E is the number of edges and V is the number of vertices. Using a more sophisticated Fibonacci heap, this can be brought down to O (E + V log V). Where as an easy ACS implementation produces O (E log V) complexity. According to various parameters the comparative study of these algorithms are tabulated as follow: Parameters Prim’s Dijkstra’s ACS Complexity (a)Using Array: O(V2) (a)Using Array: (a) Using Array/ (b)Using Heap: O(m*(V2+E)) Adjacency List: O(V+E) log V (b)Using Heap: O(E log V) (c)Using Fibonacci O(m* |E|log|V|). Heap: O(E +V logV) Where m=no of destination nodes Nature of the Undirected Directed Undirected graph used Convergence Medium Medium Faster speed Alternate Path No No Yes Flexibility Do not allow Do not allow Allow constraints Dynamic No No Yes Approach Incur any Extra No No No cost 3. CONCLUSION: Though Dijkstra’s and Prim’s approaches are reliable and are in use, ant colony system can compete for the multicast implementation as we have already discussed the different advantages of ACS over other two. Complexity is relatively better in the case of ACS. The main advantages of ACS are it’s flexibility, dynamicity and the capability to find alternate paths. If there is congestion in the shortest path, ACS can dynamically route the packets on the alternative path. Ant colony system can be applied to different routing problems like vehicle routing problems [8][9],MANET[10], Network Flow,etc. REFERENCES: [1].M.Barbehenn, A Note on the Complexity of Dijkstra’s Algorithm for Graphs with Weighted Vertices, IEEE Transactions on Computers, Vol. 47, No.2,1998. [2] S.Pettie and V. Ramachandran, Minimizing Randomness in Minimum Spanning Tree, Parallel Connectivity, and Set Maxima Algorithms, UTCS Technical Report TR-01- 25,2001. 24
10.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 2, Sep - Oct (2010), © IAEME [3].Ant Colony Optimization, Marco Dorigo, Mauro Biratarri, and Thomas Stutzle, 2006. [4]. M. Dorigo and L.M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transaction on Evolutionary Computation 1(1997), 53--66. [5]. A Modified Ant Colony Algorithm for Multi-Constraint Multicast Routing, Hua Wang, ZhaoShi, Jun May, 2006. [6]. L. Bianchi, L.M. Gambardella, M.Dorigo. An ant colony optimization approach to the probabilistic traveling salesman problem. In Proceedings of PPSN-VII, Seventh International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany, 2002. [7]. C. Chao-Hsien, G. JunHua, H. Xiang Dan, G. Qijun, A heuristic ant algorithm for solving QoS multicast routing problem, in Proceedings of the 2002 congress on Evolutionary Computation, Honolulu, USA. [8]. N. Kohl, J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis, K-Path Cuts for the Vehicle Routing Problem with Time Windows, Technical Report IMM-REP-1997. [9]. L.M. Gambardella, E. Taillard, and G. Agazzi, Ant colonies for vehicle routing problems, vol. New Ideas in Optimization, McGraw-Hill, London, 1999. [10]. X. Wu and D. K. Y. Yau. Mitigating Denial-of-Service Attacks in MANET by Distributed Packet Filtering: A Game-theoretic Approach. ASIACCS, March 2007. 25
Descargar ahora