Name
Abstract | ||
|---|---|---|
Multicast service is becoming a key requirement of computer networks supporting multimedia applications. For multimedia applications, the routing algorithms should consider many Quality of Service (QoS) parameters such as delay, cost and so on to find a new route. However, to find routes with two or more QoS parameters is an NP-hard problem. Therefore, recently many researchers are trying to use heuristic methods such as Genetic Algorithm (GA) to find good routes satisfying application request. In a previous work, a QoS multicast routing based on GA was proposed. The routing algorithm uses as QoS parameters for multicasting the delay and cost. However, in this algorithm, the multicast routing falls in the local minimum and can not satisfy the application requirement. In this paper, we propose a new QoS multicast routing protocol which has better genetic operations than the conventional algorithm, resulting in a better search success ratio and computation time compared with the conventional algorithm. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICPADS.2005.36 | Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference |
Keywords | Field | DocType |
communication complexity,genetic algorithms,multicast communication,multimedia communication,quality of service,routing protocols,NP-hard problem,QoS,genetic algorithm,multicast routing protocol,multimedia routing,quality of service | Protocol Independent Multicast,Source-specific multicast,Dynamic Source Routing,Static routing,Computer science,Xcast,Computer network,Wireless Routing Protocol,Multicast,Distance Vector Multicast Routing Protocol,Distributed computing | Conference |
Volume | ISSN | ISBN |
1 | 1521-9097 | 0-7695-2281-5 |
Citations | PageRank | References |
4 | 0.42 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| akio koyama | 1 | 464 | 68.76 |
| Toshiki Nishie | 2 | 4 | 0.42 |
| Junpei Arai | 3 | 67 | 9.13 |
| Leonard Barolli | 4 | 1179 | 144.22 |