-
J. Network and Computer Applications. 01/2012; 35:60-71.
-
[show abstract]
[hide abstract]
ABSTRACT: Data replication is an important technique to reduce access latency and bandwidth consumption in Grid environment. As one of the major functions of data replication, replica selection determines the best replica according to some specific criteria in Data Grid environment, where the data resources are limited and Grid users compete for these resources. In this paper, we focus mainly on a novel QoS preference-aware replica selection strategy which will meet individual QoS sensitivity (IQS) constraints for different users/applications. We first present a framework that characterize QoS properties of replica services and establish its mathematical model by introducing quantification methods. In order to deal with the IQS constraints and to perceive Grid users' QoS preferences accurately, we propose a QoS preference acquisition algorithm based on Analytic Hierarchy Process (AHP). We then design and implement a novel effective and efficient parallel genetic algorithm (PGA) based on Map Reduce paradigm for optimizing the objective function which corresponds to the optimal replica. Simulation results show that our strategy has a better performance in validity as well as scalability, and the optimal replica can always be obtained for Grid users with different IQS constraints under Data Grid environments that vary in system loads, scheduling strategies and user types.
Parallel Processing (ICPP), 2011 International Conference on; 10/2011
-
Proceedings of the 2011 15th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2011, June 8-10, 2011, Lausanne, Switzerland; 01/2011
-
J. UCS. 01/2011; 17:2064-2083.
-
11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2011, Newport Beach, CA, USA, May 23-26, 2011; 01/2011
-
Proceedings of the 12th IFIP/IEEE International Symposium on Integrated Network Management, IM 2011, Dublin, Ireland, 23-27 May 2011; 01/2011
-
Proceedings of the 2011 15th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2011, June 8-10, 2011, Lausanne, Switzerland; 01/2011
-
Proceedings of IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 5-9 June, 2011; 01/2011
-
[show abstract]
[hide abstract]
ABSTRACT: Cloud computing brings opportunities for network forensics tracing Internet criminals in the distributed environment. We may use the new “pay-as-you-go” model of the cloud computing to deploy the on-demand cyber surveillance sentinels and conduct distributed trace back in complicated cyber crime scene investigations. To trace criminals abusing anonymous communication networks such as Tor, law enforcement can deploy high-bandwidth Amazon EC2 sentinels into the Tor network. Some sentinels are configured as Tor entry guards and others work as Tor exits nodes. With the high bandwidth and appropriate number of such sentinels, we can achieve a required probability that a Tor circuit passes through an entry sentinel and an exit sentinel in order to capture the suspects. The proposed “pay-as-you-go” traceback model is cost-effective since the investigation may last for just hours with effective traceback techniques. Our experiments demonstrate the feasibility of this new traceback strategy through the cloud.
Distributed Computing Systems Workshops (ICDCSW), 2010 IEEE 30th International Conference on; 07/2010
-
[show abstract]
[hide abstract]
ABSTRACT: Data Grid is a kind of wide-area, distributed storage system, which can provide huge storage capacity. There are millions of files in data grid, distributed in hundreds of geographically dispersed storage resources. Given a unique logical identifier for desired content, replica location service can be used to determine the physical locations of one or more copies of this content. This paper analyzes the existing replica location methods, points out their insufficiency and then proposes an effective replica location algorithm based on Routing-Forward mechanism. Meanwhile, we analyze the time cost and space cost of all these algorithms, the result shows that the Routing-Forward algorithm costs lest time and tolerable space. As a conclusion, Routing-Forward algorithm is an effective replica location algorithm in Data Grid.
2010 Fifth Annual ChinaGrid Conference. 07/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Service composition is an active ongoing area of research in the field of Service-Oriented Computing. One of the research
challenges is to provide a mechanism for the autonomous search and selection of suitable service provid-ers for each service
type within service composition while guaranteeing the end-to-end QoS. A multi-agent based QoS-aware Service Composition solution
(MQSC) is presented in this chapter. MQSC not only can provide a mechanism for the dynamic service composition but also can
ensure the end-to-end QoS of the composite service.
01/2010: pages 47-80;
-
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Istanbul, Turkey, 10-13 October 2010; 01/2010
-
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Istanbul, Turkey, 10-13 October 2010; 01/2010
-
GCC 2010, The Ninth International Conference on Grid and Cloud Computing, Nanjing, Jiangsu, China, 1-5 November 2010; 01/2010
-
GCC 2010, The Ninth International Conference on Grid and Cloud Computing, Nanjing, Jiangsu, China, 1-5 November 2010; 01/2010
-
Proceedings of the 2010 14th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2010, April 14-16, 2010, Fudan University, Shanghai, China; 01/2010
-
Proceedings of the 2010 14th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2010, April 14-16, 2010, Fudan University, Shanghai, China; 01/2010
-
12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010, 1-3 September 2010, Melbourne, Australia; 01/2010
-
IJPEDS. 01/2010; 25:93-104.
-
Comput. J. 01/2010; 53:131-141.
