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. Key words: algorithm; PCDN; search and routing;
Citation:
Ke Li, WanLei Zhou, Shui Yu, Yunsheng Zhang, "A Resource-Search and Routing Algorithm within PCDN Autonomy Area," pdcat, pp.509-514, Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 2007