Name
Abstract | ||
|---|---|---|
In this paper we present a path-based multicast routing algorithm for wormhole routed 2D mesh network. Next we present some properties and the time complexity of the new algorithm. Analysis of the algorithm shows that it significantly reduces the multicast time (by about 50% in 2D mesh) and slightly decreases (by 15% in 2D mesh) the multicast traffic over LIN's Hamiltonian path-based algorithm. |
Year | Venue | Keywords |
|---|---|---|
2007 | Parallel and Distributed Computing and Networks | multicasting,algorithm,simulation |
Field | DocType | Citations |
Protocol Independent Multicast,Source-specific multicast,Hamiltonian path,Computer science,Xcast,Order One Network Protocol,Computer network,Multicast,Time complexity,Wormhole | Conference | 0 |
PageRank | References | Authors |
0.34 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hovhannes A. Harutyunyan | 1 | 206 | 28.18 |
| Shengjian Wang | 2 | 0 | 0.34 |