Abstract:SUMMARY
Grid applications with stringent security requirements introduce challenging concerns because the schedule devised by nonsecurity‐aware scheduling algorithms may suffer in scheduling security constraints tasks. To make security‐aware scheduling, estimation and quantification of security overhead is necessary. The proposed model quantifies security, in the form of security levels, on the basis of the negotiated cipher suite between task and the grid‐node and incorporates it into existing heuristics MinM… Show more
“…It is expected that all submitted tasks to the system must be scheduled and all nodes of the system can be used. Above parameters are also used in [4,12,14].…”
Section: Experimental Evaluations and Resultsmentioning
confidence: 99%
“…Both these paper considers load distribution and load variation among the nodes in CG. In [12], fault tolerance aware scheduling for independent tasks using GA is discussed. In this paper we modify the work of [12] by incorporating dependencies between tasks.…”
Section: Related Workmentioning
confidence: 99%
“…In [12], fault tolerance aware scheduling for independent tasks using GA is discussed. In this paper we modify the work of [12] by incorporating dependencies between tasks. The effectiveness of the model is studied by comparing with Min-Min, Max-Min.…”
“…It is expected that all submitted tasks to the system must be scheduled and all nodes of the system can be used. Above parameters are also used in [4,12,14].…”
Section: Experimental Evaluations and Resultsmentioning
confidence: 99%
“…Both these paper considers load distribution and load variation among the nodes in CG. In [12], fault tolerance aware scheduling for independent tasks using GA is discussed. In this paper we modify the work of [12] by incorporating dependencies between tasks.…”
Section: Related Workmentioning
confidence: 99%
“…In [12], fault tolerance aware scheduling for independent tasks using GA is discussed. In this paper we modify the work of [12] by incorporating dependencies between tasks. The effectiveness of the model is studied by comparing with Min-Min, Max-Min.…”
“…Also, the comparative study reveals that the proposed model has an edge over other contemporary models viz. Min-Min, Max-Min, HEFT and EAMM for energy optimization [17,23,24,25,33].…”
Section: Related Workmentioning
confidence: 99%
“…The future work will consider the resource scheduling problem with consideration on some other QoS parameters such as reliability, perform-ability and security [23] etc. Also, in all the proposed work, at a time only one parameter has been considered.…”
Computational Grid (CG) is a wide network of computational resources that provides a distributed platform for high end compute intensive applications. The resources in the computational grid are usually heterogeneous and being a highly heterogeneous system, Computational Grid poses a number of constraints. It is difficult to allocate and schedule the applications properly to achieve the benefit of the grid resources from the applications point of view, as the resources are heterogeneous and dynamic in nature. There are no common scheduling strategies that fulfill all the needs with respect to both, user and the system. The available scheduling implementations consider specific characteristics of the available resources and the application. The complexity of application, user requirements and system heterogeneity prevents any scheduling procedure in achieving its best performance. The aim of a grid scheduling algorithm is to find an appropriate set of resources and maintain its userdemanded Quality of Service (QoS) requirements. Scheduling in CG is an NP-hard problem which requires an efficient solution. The problem, considered in this work, is task scheduling in Computational Grid (CG). Task scheduling in CG is a complex problem as many QoS parameters and system constraints are involved. This paper deliberates over the problem and various tools used in order to solve this problem.
SUMMARYRadio frequency identification (RFID) has been regarded as one of the 10 important technologies in the 21st century. Because of its capability to rapidly and accurately collect and process data in real-time, RFID has been widely applied in many areas, such as Internet of Things and Smart Grid. However, the existing security threats become more severe toward RFID authentication scheme. The traditional security mechanisms cannot be used in RFID directly because of the limitations of processing capability, storage space, and power supply of RFID tags. In this paper, we propose a revocable secure efficient lightweight RFID authentication scheme (RSEL). To achieve authentication efficiency, the key of the tag is chosen to reduce the number of hash computing in the database. Furthermore, the key is stored in the database and updated constantly with the tag to prevent the tracking and synchronization attacks. The valid period of each tag is stored in the database so that RSEL can revoke the expired tag. The correctness of RSEL has been proved using GNY logic. The performance of RSEL in terms of security and efficiency is evaluated. Compared with other existing approaches, RSEL achieves stronger security and higher efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.