| 1. |
- Huang, Xin, 1982-, et al.
(författare)
-
Privacy of Value-Added Context-Aware Service Cloud
- 2009
-
Ingår i: Lecture notes in computer science Volume 5931. - Berlin, Heidelberg : Springer. - 9783642106644 ; , s. 547-552
-
Konferensbidrag (refereegranskat)abstract
- In the cloud computing era, service provider cloud and context service cloud store all your personal context data. This is a positive aspect for value-added context-aware service cloud as it makes that context information collection are easier than was the case previously. However, this computing environment does add a series of threats in relation to privacy protection. Whoever receives the context information is able to deduce the status of the owners and, generally owners are not happy to share this information. In this paper, we propose a privacy preserved framework which can be utilized by value-added context-aware service cloud. Context data and related services access privileges are determined by context-aware role-based access control (CRAC) extended from role-based access control (RAC). Privacy preserved context service protocol (PPCS) is designed to protect user privacy from exposed context information. Additionally, user network and information diffusion is combined to evaluate the privacy protection effect.
|
|
| 2. |
- Yin, D., et al.
(författare)
-
Utility based query dissemination in spatial data grid
- 2007
-
Ingår i: Proceedings of the 6th International Conference on Grid and Cooperative Computing, GCC 2007. - : IEEE Computer Society. - 0769528716 - 9780769528717 ; , s. 574-581
-
Konferensbidrag (refereegranskat)abstract
- Spatial Information Grid is an ideal infrastructure to handle the data-intensive and computing-intensive geo-spatial processing. In order that each agency could ad hoc connect to this computing environment and make autonomous decision, we build a Geospatial Data Grid in peer-to-peer way. The query processor module in each peer can decompose the user's query into sub-queries that executed in different nodes. One problem in the parallel spatial join query optimization is how to determine an appropriate node group to disseminate the sub-queries. Especially, if there is more than one node sharing the same area of interest, there is a dilemma: on the one hand, the task scheduler tends to decompose this query into sub-queries and disseminate them to as many as possible nodes so that they could process the user's query in parallel; on the other hand, recruiting too many nodes will also bring in overhead in repetitive computing, redundant data transmission, and the result merging. Based on the study of trade-off between increasing parallelism and reducing redundancy using the Utility Theory in economics, we put forward a fast node selection algorithm for the parallel spatial join query dissemination. The test in our system shows this strategy could balance the above two conflict demands and is appropriate for use in Data Grid.
|
|
