A resource-search and routing algorithm within PCDN autonomy area
Li, Ke, Zhou, Wanlei, Yu, Shui and Zhang, Yunsheng 2007, A resource-search and routing algorithm within PCDN autonomy area, in PDCAT 2007 : Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies : 3-6 December, 2007, Adelaide, Australia, IEEE Computer Society, Los Alamitos, Calif., pp. 509-514.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
This paper studied a new type of network model; it is formed by the dynamic autonomy area, the structured source servers and the proxy servers. The new network model satisfies the dynamics within the autonomy area, where each node undertakes different tasks according to their different abilities, to ensure that each node has the load ability fit its own; it does not need to exchange information via the central servers, so it can carry out the efficient data transmission and routing search. According to the highly dynamics of the autonomy area, we established dynamic tree structure-proliferation system routing and resource-search algorithms and simulated these algorithms. Test results show the performance of the proposed network model and the algorithms are very stable.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact email@example.com.