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.
EventInternational Conference on Parallel and Distributed Computing, Applications and Technologies (8th : 2007 : Adelaide, Australia)
Pagination509 - 514
PublisherIEEE Computer Society
Place of publicationLos Alamitos, Calif.
NotesThis 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.
Publication classificationE1 Full written paper - refereed
Copyright notice2007, IEEE
Editor/Contributor(s)D Munro, H Shen, Q Sheng, H Detmold, K Falkner, C Izu, P Coddington, B Alexander, S Zheng
Title of proceedingsPDCAT 2007 : Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies : 3-6 December, 2007, Adelaide, Australia