000000280 001__ 280
000000280 005__ 20130522141939.0
000000280 037__ $$aLERSSE-RefJnlPaper-2012-003
000000280 100__ $$aPranab Kini 
000000280 245__ $$aSpeculative Authorization
000000280 260__ $$c2012-08-10
000000280 300__ $$a11
000000280 520__ $$aWe 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 zero authorization latency for almost 60% 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.
000000280 6531_ $$aaccess control
000000280 6531_ $$amachine learning
000000280 6531_ $$aprediction
000000280 700__ $$aKonstantin Beznosov
000000280 8560_ $$fsantsais@ece.ubc.ca
000000280 8564_ $$uhttp://lersse-dl.ece.ubc.ca/record/280/files/280.pdf$$yTransfer from CDS 0.99.7
000000280 909C4 $$pPranab Kini, Konstantin Beznosov, "Speculative Authorization," IEEE Transactions on Parallel and Distributed Systems, 10 Aug. 2012.
000000280 980__ $$aRefJnlPaper