Keqing Li, Xinmeng Chen and Hui Tan.

Wuhan Daxue Xuebao (Journal of Wuhan University) (Natural Science Edition), Vol. 52, No. 1, 24 Feb. 2006, pp. 69-72.

According to the inherent hierarchy in computer networks, we propose a dynamic auto-adaptive load-balance algorithm, which based on hierarchy. It adopts centric manageable algorithm in the lower hierarchies while distributed high-effect algorithm in the higher one. The load status of system can be described more accurate because of a moderate status added between over loading and low loading, and makes grid computing becomes stable. Overhead and traffic loading maybe decrease due to the loads migrated to neighbor nodes.

Lu-Lai Yuan, Guo-Sun Zeng, Li-Li Jiang and Chang-Jun Jiang.

Jisuanji Xuebao (Chinese Journal of Computers), Vol. 29, No. , 2006, pp. 1217-1224.

The uncertainty of Grid users, resources and services may play a negative affect on the execution of Grid tasks, which makes it difficult to design a scheduling algorithm to minimize execution time and cheat probability of Grid tasks. Referring to the social trust relationship, the authors introduce a trust model that is based on the uncertainty reasoning theory (D-S theory). In addition, by combining the trust model and Dynamic Level Scheduling (DLS) algorithm, the authors propose a novel scheduling algorithm that is called Trustworthy and Dynamic Level Scheduling (TDLS). The algorithm takes the Grid nodes' trust degree into account when calculating the scheduling-level of task-node pairs. Simulations prove that the algorithm can efficiently satisfy the QoS requirement in trust, with costing a few more time.

Marty Humphrey, Jim Basney and Jim Jokl.

Software - Practice & Experience, Vol. 35, No. 9, 25 July 2005, pp. 817-826.

As Grid deployments increase, the challenge remains to create a scalable, multi-organizational authentication infrastructure. Public key infrastructures (PKIs) are widely used for authentication in Grids, due in large part to the success of the Globus toolkit, despite the challenges and difficulties both for PKI administrators and users. The Bridge Certificate Authority (CA) is a compromise between a strictly hierarchical PKI and a mesh PKI and achieves many of the benefits of the hierarchical PKI and mesh PKI but has been untested for use with Grid software. This paper reports on the use of a Bridge CA with two representative Grid software packages: the Globus Toolkit v2 and WSRF.NET. We find that both packages support Bridge CAs sufficiently today to be usable in Grid software architectures, although not without limitations. In this paper, and through these experiments, we build the case for using Bridge CAs for Grid computing.

Manfu Ma, Jian Wu, Zhengguo Hu, Dingjian Chen and Lei Deng.

Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, Vol. 23, No. , 2005, pp. 628-632.

In the full paper we analyze the two principal shortcomings of reputation model: (1) reputation value is dependent on Grid Services Consumers's (GSC's) subjective judgment; (2) such judgment is obviously far from changing continuously with new developments. We aim to overcome these two shortcomings with our stringent trust model. Trust is the base of accessing, utilizing, and managing a variety of heterogeneous resources in virtual organizations across multiple domains and institutions. GSC's broker relies on reputation model or our stringent trust model to perform the following complex and difficult task: selecting the capability, the trustable resource and the Grid Service Provider(GSP) within a distributed Grid environment to satisfy service requirements. In the full paper, we describe in much detail the stringent trust model we propose; here we give only a briefing. We present a stringent trust model which includes the credit and reputation of resource, GSP and GSC. In the model, we bring forward the algorithm of credit and then integrate credit and reputation for the sake of trust, and define the process of evaluating. Finally we performed simulations to compare the performances of reputation model and our stringent trust model. We selected two levels of resource scheduling: 2000 tasks and 4000 tasks. Here we give only results for 2000 tasks; they were : (1) average time required for performing one task was 753. 30 ms for our model and 877. 04 ms for reputation model respectively; (2) resource utilization was 88. 21 % for our model and 83. 36 % for reputation model respectively.

S. Goel and M. Sobolewski.

IASTED International Conference on Communication, Network, and Information Security; New York, NY; USA; 10-12 Dec. 2003; IASTED International Conference on Communication, Network, and Information Security

This paper presents a trust and security model for a Grid Computing System. The issues involved in development of this model are investigated in context of a service-based P2P architecture. The hierarchical intergrid architecture has been developed for B2B transactions across trusted intragrids. The paper discusses the issues posed by security implementation in these architectures. A centralized trust mechanism is proposed for the intragrids and a distributed trust mechanism for the intergrids.

M. Humphrey and M. R. Thompson.

Cluster Computing, Vol. 5, No. 3, July 2002, pp. 257-264.

Grid Computing consists of a collection of heterogeneous computers and resources spread across multiple administrative domains with the intent of providing users uniform access to these resources. There are many ways to access the resources of a Grid, each with unique security requirements and implications for both the resource user and the resource provider. A comprehensive set of Grid usage scenarios is presented and analyzed with regard to security requirements such as authentication, authorization, integrity, and confidentiality. The main value of these scenarios and the associated security discussions is to provide a library of situations against which an application designer can match, thereby facilitating security-aware application use and development from the initial stages of the application design and invocation. A broader goal of these scenarios is to increase the awareness of security issues in Grid Computing.