T.-E. Kim and V. Bharghavan, \A multicast routing algorithm for mobile computing environments," in Proceedings of IEEE Wireless Communications and Networking Conference, Sept. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Investigation into The Application of Active Networks to Mobile .. - Chin (2000) (4 citations) (Correct)
....due to the query delay to the HA, computation of closest MHA and rejoining delay to the multicast session if the MHA is not subscribed. Another issue that remains to be addressed is the problem of updating the multicast tree in a source rooted approach. A di erent approach was taken by Kim et al. [74]. Kim et al. s scheme entails construction of precomputed base tree(s) 3 infrastructure that supports low latency joins, leaves and hando s. The multicast tree is constructed as a subset of a chosen base tree. A link augmentation algorithm is used to optimise the sub optimal tree in stable ....
T.-E. Kim and V. Bharghavan, \A multicast routing algorithm for mobile computing environments," in Proceedings of IEEE Wireless Communications and Networking Conference, Sept. 1999.
Multicast Routing in Heterogeneous Wireline/Wireless.. - Tae-Eun Kim Vaduvur (1999) (1 citation) Self-citation (Kim Bharghavan) (Correct)
.... (2) Requirement (5) is naturally satisfied because of the clustered nature of many practical networks, including the MBone [6] 2] 22] The distributed implementation for the minimum height spanning tree is based on Bellman Ford algorithm [4] 10] The specific algorithm is available at [14]. C. Routing using Base Trees As outlined previously, the key approach in BTLA is to use the base tree backbone infrastructure in order to reduce the latency and complexity of joins, leaves, and handoffs in regions of high mobility. In this section, we describe the mechanisms for discovery, ....
....contain any terminal node. In our example, the resulting tree contains nodes b; f; a; d only. In this specific example, the resulting tree is optimal. In general, the tree that we generate is very close to optimal, though it is not guaranteed. An instance of priority BFS algorithm is available at [14]. At all times, the base tree provides a backup option, and carries the multicast data transmissions while the link augmented tree is being computed. IV. PERFORMANCE EVALUATION In this section, we describe the performance evaluation of the BTLA algorithm via simulation. We evaluate all the ....
[Article contains additional citation context not shown here]
T. Kim, V. Bharghavan, "A Multicast Routing Algorithm for Mobile Computing Environments", Master thesis, 1999.
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