Share Email Print
cover

Proceedings Paper

Research on the efficiency of the spatial information service in the P2P network
Author(s): Lian Duan; Baoqing Hu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Now most of the spatial information service applications still adopt the centralized pattern, which brings the network congestion or single point of failure to the side of center server. But the P2P technique takes away the bottleneck in data transmission exists in traditional C/S model by virtue of its multilink self-adaptive mechanism of the data transmission, which has a magnitude meaning for researches on the spatial information service delivering. As the spatial data has the characteristic of the massive volumes and client change the interesting spatial area so frequently that the spatial application efficiency is sharply decreased, the author brought forward a layered P2P architecture of the spatial data interoperation and flexible group mode in P2P network. A mechanism of the layered query queue of the oriented association and the self-adapted cache mode were introduced to adjust the peer loading and the link numbers for the reliable data capture. In this way, we can provide the each peer the rapid data transmission speed, the great data transmission reliability and the better user experience. A prototype was developed and it proved the efficiency of this P2P spatial information service framework. At last the futures of involved techniques and methods are concluded.

Paper Details

Date Published: 3 November 2008
PDF: 9 pages
Proc. SPIE 7143, Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Geo-Simulation and Virtual GIS Environments, 71432S (3 November 2008); doi: 10.1117/12.812632
Show Author Affiliations
Lian Duan, Guangxi Teachers Education Univ. (China)
Baoqing Hu, Guangxi Teachers Education Univ. (China)


Published in SPIE Proceedings Vol. 7143:
Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Geo-Simulation and Virtual GIS Environments
Lin Liu; Xia Li; Kai Liu; Xinchang Zhang; Aijun Chen, Editor(s)

© SPIE. Terms of Use
Back to Top