A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit <a rel="external noopener" href="http://www.cs.nmt.edu:80/~song/Publications/AC-fgcs07.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/idqeix2ukbd5fbgjjdkjmaj3ka" style="color: black;">Future generations computer systems</a>
Dynamics is an inherent characteristic of computational grids. The volatile nodal availablity requires grid applications and services be adaptive to changes of the underlying grid topology. Mobile execution allows mobile users or tasks to relocate across different nodes in the grid. This poses new challenges to resource access control. Resource sharing in the grid coalition environment creates certain temporal and spatial requirements for accesses by mobile entities. However, there is a lack of<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.future.2006.12.002">doi:10.1016/j.future.2006.12.002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lig5pld2vjeq3jgftpcajzjpmu">fatcat:lig5pld2vjeq3jgftpcajzjpmu</a> </span>
more »... formal treatment of the impact of mobility on the shared resource access control. In this paper, we formalize the mobile execution of grid entities by using the mobile code model. We introduce a shared resource access language, SRAL, to model the behaviors of mobile codes. SRAL is structured and composed so that the program of a mobile code can be constructed recursively from primitive accesses. We define the operational semantics of SRAL and prove that it is expressive enough for most resource access patterns. In particular, it is complete in the sense that it can specify any program of regular trace model. A constraint language, SRAC, is defined to specify spatial constraints for shared resource accesses. Checking if the behavior of a mobile code satisfies a given spatial constraint can be solved by a polynomial-time algorithm. We apply the Duration Calculus to express temporal constraints, and show the constraint satisfaction problem is decidable as well. We extend the role-based access control model to specify and enforce our spatio-temporal constraints. To prove the concept and technical feasibility of our coordinated access control model, we implemented it in a mobile agent system, which emulates mobile execution in grids by software agents.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090530021848/http://www.cs.nmt.edu:80/~song/Publications/AC-fgcs07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/c1/cfc1295a374ca189ed5215b304b2dc57ae3d5815.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.future.2006.12.002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>