Y. Im and Y. Choi, "A Distributed Multicast Routing with End-to-End Delay Bound" in Proceeding of SEACOMM, Penang, August1998.  Home/Search   Document Not in Database   Summary   Related Articles

....to minimize the cost while satisfying the delay constraint. The rearrangement process involved only the nodes on the multicast tree and a selected set of off tree nodes whose inclusion in the tree lowered the cost of the tree. Another distributed heuristic algorithm is proposed by Im and Choi [22], they called the algorithm distributed delay constrained multicast tree (DDCMT) and it had a worst case message complexity O(N ) The most recent heuristic algorithm had been proposed by Jia [23] The basic idea of that algorithm was as follows. The construction of a routing tree started with ....

Y. Im and Y. Choi, "A Distributed Multicast Routing with End-to-End Delay Bound" in Proceeding of SEACOMM, Penang, August1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC