Collaborative Research: Visualization: Overlay Network Support for Remote Visualization of Time-Varying Data
Ohio State University Research Foundation -Do Not Use, Columbus OH
Investigators
Abstract
In this project, we address issues related to providing system support for remote visualization of time-varying data. A majority of the existing remote visualization systems have adopted the client-server model. The server may become a bottleneck due to the centralized data access and visualization computation. In addition, the network can be easily overloaded because of the large volume of visualization data to be transmitted. To overcome these problems, researchers have proposed various methods to decentralize the remote visualization computation by shifting workload to the clients. The effect of such a workload migration however, is limited since the client 92s computation power is often constrained. Another alternative to reduce the server bottleneck is to deploy multiple servers in the network. However, deployment and management of multiple servers is very expensive, and may raise some policy issues. Our objective is to develop a scalable, lightweight, and easily deployable architecture, which is capable of providing a certain degree of quality of services (QoS) to remote visualization of time-varying data. To achieve this objective, we propose a Peer-to-peer (P2P) system-based architecture. Generally speaking, each node in a P2P system is considered equal, and hence this model is technically different from the client-server one. The highlights of our architecture are (1) Server data and workload are distributed to the groups of volunteer nodes in the Internet which are willing to share their resources. These nodes compose multiple virtual servers. (2) The client is allowed access to the server group via anycast service. Anycast automatically finds the best server in the group, and returns the data to the requesting client. The best server is supposed to provide the best quality of services (i.e. in terms of the minimum delay in data access). (3) A spatio temporal multi-resolution data structure, called Time-Space Partitioning (TSP) tree, where multiple resolution blocks are stored and the data on the sub-trees are independent of each other, is employed. By storing multiple resolution blocks in the tree, a client is permitted more choices in making the selection of best server, which may vary with the system dynamics. In this project, we plan to fully design, analyze, implement, and evaluate the P2P-based architecture for remote visualization of time-varying data. We will carry out the following research tasks (1) design, analysis, and implementation of QoS-aware anycast services in the overlay networks; (2) enhancement of the TSP tree structure, especially its data encoding schemes; (3) design, evaluation, and realization of an efficient algorithm for distribution of time-varying data among the volunteer nodes; (4) construction and evaluation of a prototype system based on the proposed architecture.
View original record on NSF Award Search →