Network Sharing System Of Large Scale Spatial Information

Information sharing is the developing trends of the information technology. Spatial information is used to describe various entities and their attributes on the Earth. As an important part of the scientific data, the sharing of spatial information is crucial to the economic development of the country. It provides the users with spatial data input, storage, search, retrieval, processing, analysis, display, update, and ultimately provide a system to process various entities and their relationships in the space.Concurrently, the interactive visualization of the spatial information is now attracting more and more attention. The professional users can utilize such system to do project planning, solution evaluating and decision making. The private users (tourist or netizen) can also benefit a lot from the various applications of such system.This paper introduces an extendible network sharing system which can support massive spatial information and describes its framework and implementation. There are two focuses: one is the organization and storage of massive spatial information and the other is the communication architecture which supports large number of users. This paper also provides the design of an extension (spatial information sharing oriented P2P system) which further improves the communication architecture.The first chapter is devoted to the technology background of spatial information sharing, and the framework of the overall system. The second chapter describes the storage and organization of the spatial information. It first describes the scene graph and the spatial index, and then describes the out-of-core storage. Finally it describes the serialization and reconstruction of the spatial information. The third chapter is focusing on the transmission of the spatial information. It first describes the infrastructure, and then describes the priority, security, and bandwidth limitation of the transmission. Chapter IV describes the p2p architecture, neighbor finding, the pastry algorithm, and the communication protocol. Chapter V concludes this thesis, and introduces the future work.