In broadband distributed computing environments, the importance of data resource (DR) migration is increasing because of its potential to improve performance of the system, especially for transaction processing. In such environments, mobile data resources relocate themselves from one computer site to the other. Hence, it is important to have mechanisms that manage the locations of each data resource. In this paper, a location management algorithm is presented in which sites are logically organized as multiple rooted tree structures. The rooted tree structures are used to move the requests for locating the data resources. The algorithm makes use of a distributed queue strategy to define the path a data resource takes while migrating from one site to the other. The proposed algorithm enhances its effectiveness by continuously updating its information regarding the site to which the request is to be forwarded so as to reduce the number of messages needed by the requests to locate and access the data resources. The performance of the proposed algorithm is evaluated and is also compared with one of the existing location management algorithms by simulation studies under several system parameters such as frequency of requests generation, frequency of data resource migrations and network topology. The experimental results show the effectiveness of the proposed algorithm in all cases.