Issue No. 04 - April (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.172
P. Kini , Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
K. Beznosov , Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
We present Speculative Authorization (SPAN), a prediction technique that reduces authorization latency in enterprise systems. SPAN predicts requests that a system client might make in the near future, based on its past behavior. SPAN allows authorization decisions for the predicted requests to be made before the requests are issued, thus virtually reducing the authorization latency to zero. We developed SPAN algorithms, implemented a prototype, and evaluated it using two real-world data traces and one synthetic data trace. The results of our evaluation suggest that systems employing SPAN are able to achieve a reduced authorization latency for almost 60 percent of the requests. We analyze the tradeoffs between the hit rate and the precision of SPAN predictions, which directly affect the corresponding computational overhead. We also compare the benefits of deploying both caching and SPAN together, and find that SPAN can effectively improve the performance of those systems which have caches of a smaller size.
performance evaluation, authorisation, business data processing, performance improvement, speculative authorization, prediction technique, authorization latency reduction, enterprise systems, system client, authorization decisions, SPAN algorithms, data traces, SPAN predictions, computational overhead, Authorization, Training, Web pages, Markov processes, Prediction algorithms, Predictive models, Testing, prediction, Access control, machine learning
P. Kini, K. Beznosov, "Speculative Authorization", IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 814-824, April 2013, doi:10.1109/TPDS.2012.172