|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Electrical Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/551
|
| Title: | Source-based delay-bounded multicasting in multimedia |
| Authors: | Ravikumar, C P
Bajpai, Rajneesh |
| Keywords: | Multicasting
Multimedia communication
Delay-bounded communication
Genetic algorithms |
| Issue Date: | 1998 |
| Citation: | Computer Communications, 21(2), 126- I32 |
| Abstract: | In multimedia communication networks, the problem of multicasting assumes a new dimension. Apart from minimizing the cost of
multicast communication, it is also necessary to ensure that each of the destination nodes receives the message within a bounded delay. Such delay-bounded multicast applications typically arise in multimedia conferencing. In this paper, we present agenetic algorithm for solving the
delay-bounded multicast problem. We assume source-based routing, i.e. each source node completely determines the Steiner tree along
which multicasting is performed. The genetic algorithm is a powerful optimization tool, and our experimental results reveal that a genetic algorithm provides fast and superior quality solutions to the delay-bounded multicast problem. |
| URI: | http://eprint.iitd.ac.in/dspace/handle/2074/551 |
| Appears in Collections: | Electrical Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| ravikumarsou1998.pdf | | 227Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
