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: | Ng, Peoy Khee. |
---|---|
Other Authors: | Ng, Jim Mee |
Format: | Thesis |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/19827 |
Similar Items
-
Self-healing algorithm for real-time multicast tree
by: Au, Ivan.
Published: (2008) -
Efficient routing algorithms for group multicast communication
by: Wang, Ning.
Published: (2008) -
Recovery algorithm for time-constrained multicast tree
by: Jin, Yan Hong
Published: (2008) -
Recovery algorithm for multicast tree
by: Sadagopan Sridharan
Published: (2008) -
Efficient control and management for multicast services in the internet
by: Xie, Feng
Published: (2008)