Spatial Vector Data Indexing Network Clustered Mode Based on P2P

Article Preview

Abstract:

With the expansion of a variety of power networks, communication networks and computer network and in order to meet the needs of network users, network services must be promoted by the use of dynamic network environment. But, the workload of the server is very large. According to P2P space vector theory and space vector quaternion theory, this paper studies the network communication networks clustered mode and establishes quaternion model of P2P space vector. At last, this paper treats the index of communications network cluster as the experimental model and establishes quaternion-node network of communication network. It also stimulates quaternion model of P2P space vector and gets the server function achievement result of two-node in P2P spatial pattern which provide a theoretical reference for the innovation of communication and computer network servers.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2339-2344

Citation:

Online since:

February 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Jingshu Li, Jianwu Tao. Signal DOA and Dimensionality reduction quaternion polarization MUSIC of Polari metric joint estimation [J]. Electronic and Information Engineering, 2011, 33 (1): 106-111.

Google Scholar

[2] Nan Li, Jin Fang Cheng, Yi Liu. Vector array tensor decomposition MUSIC algorithm [J]. Signal Processing, 2012, 28 (11): 1575-1580.

Google Scholar

[3] Xiaofei Zhang, Fei Wang, Dazhuan Xu. Theory and application of array signal processing [M]. National Defense Industry Press, 2010: 112-130.

Google Scholar

[4] Lin Huang. Research on vector geographic data organization and indexing techniques based P2P network [D]. ​​Nanjing: Nanjing University of Posts and Telecommunications, 2011: 1-11.

Google Scholar

[5] Ming Yang, Yiting Zhang, Junzhou Luo. Anonymous communication node selection algorithm based on the weighted random bandwidth [J]. Southeast University, 2010 (6): 1169-1173.

Google Scholar

[6] Ruichun Tang, Bin Liu, Shiru Xu. The selection strategy of the node based on cluster cache in hierarchical P2P system [J]. The journal of Ocean University of China, 2010, 40 (1): 104-108.

Google Scholar

[7] Jiagao Wu, Shiwei Shao, Zheng Hua. Research and implementation of hybrid structure P2P spatial indexing mechanism for network optimization [J]. Computer Applications, 2011 (9): 2301-2304.

Google Scholar

[8] Yu Jin, Yan Liu, Hongwu Zhao et al. Trust-Based Supernode Selection in Peer-to-PeerSystems [C]. 2010 2nd International Conference on Future Computer and Communication, 2010: 317-321.

DOI: 10.1109/icfcc.2010.5497787

Google Scholar

[9] Xinyue Zhang. Pastry: Research on large-scale peer routing system [M]. Wide telecommunications research center of Beijing University of Posts and Telecommunications, 2011: 156-170.

Google Scholar