论文信息 - Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications

Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications

Given an edge-weighted tree T, a trunk is a path P in T which minimizes the sum of the distances of all vertices in T from P plus the weight of path P. In this paper, we give efficient algorithms for finding a trunk of T. The first algorithm is a sequential algorithm which runs in O(n) time, where n is the number of vertices in T. The second algorithm is a parallel algorithm which runs in O(log n) time using O(n/log n) processors on EREW PRAM model. We also present an application of trunk for efficient multicast in wireless ad hoc networks.

Shietung Peng | Yamin Li | Wanming Chu

[1] David G. Kirkpatrick,et al. A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[2] Shietung Peng,et al. A Simple Optimal Parallel Algorithm for a Core of a Tree , 1994, J. Parallel Distributed Comput..

[3] Richard Cole,et al. Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[4] Shietung Peng,et al. Efficient Algorithms for Finding a Core of a Tree with a Specified Length , 1996, J. Algorithms.

[5] Prasant Mohapatra,et al. Efficient overlay multicast for mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[6] Peter J. Slater,et al. A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.

[7] Kirk L. Johnson,et al. Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[8] Shietung Peng,et al. Algorithms for a Core and k-Tree Core of a Tree , 1993, J. Algorithms.

[9] Dharma P. Agrawal,et al. Multicast over wireless mobile ad hoc networks: present and future directions , 2003, IEEE Netw..