Efficient algorithms for real-time multicasting
The critical requirements for real-time multicast routing is to generate a multicast tree that has (i) minimal overall network cost and (ii) acceptable end-to-end network delay in every paths. These requirements are often conflicting in nature and the problem of minimising overall network cost in mu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/19827 |