DocumentCode
2623426
Title
A Resource-Search and Routing Algorithm within PCDN Autonomy Area
Author
Li, Ke ; Zhou, Wanlei ; Yu, Shui ; Zhang, Yunsheng
Author_Institution
Deakin Univ., Melbourne
fYear
2007
fDate
3-6 Dec. 2007
Firstpage
509
Lastpage
514
Abstract
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.
Keywords
file servers; peer-to-peer computing; telecommunication network routing; tree data structures; PCDN autonomy area; central delivery network; data transmission; dynamic tree structure-proliferation system; network model; peer-to-peer network; proxy server; resource-search algorithm; routing algorithm; structured source server; Bandwidth; Costs; Distributed computing; Hardware; Joining processes; Network servers; Peer to peer computing; Routing; Scalability; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2007. PDCAT '07. Eighth International Conference on
Conference_Location
Adelaide, SA
Print_ISBN
0-7695-3049-4
Type
conf
DOI
10.1109/PDCAT.2007.50
Filename
4420210
Link To Document