000000250 001__ 250
000000250 005__ 20130522141946.0
000000250 037__ $$aLERSSE-REPORT-2010-002
000000250 100__ $$aPranab Kini
000000250 245__ $$aSpeculative Authorization
000000250 260__ $$c2010-12-20
000000250 300__ $$amult. p
000000250 520__ $$aAs enterprises aim towards achieving zero latency for their systems, latency introduced by authorization process can act as an obstacle towards achieving their goal. We present \emph{\underline{Sp}eculative \underline{A}uthorizatio\underline{n}} (SPAN), a prediction technique to address the problem of latency in enterprise authorization systems. SPAN predicts the possible future requests that could be made by a client, based on the present and past behavior of the client. Authorization decisions to the predicted requests are fetched even before the requests are made by the client, thus reducing the authorization latency virtually to zero. Our implementation indicates that systems deploying SPAN can obtain zero authorization latency for almost $60\%$ of the requests made by the client. We discuss the additional load incurred by the systems to compute responses to the predicted requests, and provide measures to reduce the unnecessary load. We also compare the benefits of deploying caching and SPAN in the same system, and find that SPAN can effectively improve the performance of systems with smaller sizes of cache.
000000250 6531_ $$aaccess control
000000250 6531_ $$amachine learning
000000250 6531_ $$aprediction
000000250 700__ $$aKonstantin Beznosov
000000250 8560_ $$fpranabk@ece.ubc.ca
000000250 8564_ $$uhttp://lersse-dl.ece.ubc.ca/record/250/files/250.pdf$$yTransfer from CDS 0.99.7
000000250 909C4 $$pPranab Kini and Konstantin Beznosov, "Speculative Authorizaion," Tech. Rep. LERSSE-TR-2010-002, Laboratory for Education and Research in Secure Systems Engineering, University of British Columbia, December 2010:
000000250 980__ $$aREPORT