Optimal 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 the EREW PRAM model. We present an application of trunk on mobile ad hoc networks for efficient multicasting.

[1]  Timothy J. Lowe,et al.  On the location of a tree-shaped facility , 1996, Networks.

[2]  P. Slater.  Locating Central Paths in a Graph , 1982 .

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

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

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

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

[7]  Pitu B. Mirchandani,et al.  Location on networks : theory and algorithms , 1979 .

[8]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

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

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

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

[12]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[13]  Justo Puerto,et al.  Location Theory - A Unified Approach , 2005 .

[14]  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..

[15]  Edward Minieka.  The optimal location of a path or tree in a tree network , 1985, Networks.

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