Browse Prior Art Database

Method for Secure Socket Layer acceleration

IP.com Disclosure Number: IPCOM000127271D
Original Publication Date: 2005-Aug-19
Included in the Prior Art Database: 2005-Aug-19
Document File: 2 page(s) / 26K

Publishing Venue

IBM

Abstract

Described is a scheme to accelerate Secure Socket Layer (SSL) performance. Acceleration is accomplished by predicting and encrypting pages prior to the actual request. Traditional SSL encryption scheme is on a demand basis. When a page is requested the server retrieves the page from a storage media and runs the encryption algorithm. The encryption algorithm is compute intensive and consumes a lot of CPU cycles. But, Web-server traffic is inherently bursty in nature and there are periods of time when the CPU is idle or not fully utilized. The invention senses idle or low CPU and intelligently schedules a page for encryption in advance of its actual request. It selects the page based on a predictive algorithm. This scheme helps improve SSL performance by efficiently utilizing CPU resources.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 66% of the total text.

Page 1 of 2

Method for Secure Socket Layer acceleration

    The SSL Prediction and Encryption (SPE) implementation is targeted towards accelerating the performance of Web-servers servicing static pages (static html pages, image files). The mechanism is composed of a prediction table, page access history table and the SPE algorithm.

Prediction Table

    The prediction table is a page history cache that maintains the most recent history of web page accesses. The SPE prediction mechanism is implemented as single-level history-based prediction table. The prediction table predicts an event based on the last request. Each entry in the table is uniquely identifiable and indexed using a hashing mechanism. Each entry consists of a page number and the predicted next page. When a page is accessed by a client, the prediction table is checked. If the entry does not exist a new entry is created. The predicted next page is left blank. When the user accesses the next page, it is added into Predicted Next Page field. The prediction table is maintained and updated by the SPE algorithm. To accommodate the dynamic nature of web page access, the Predicted Next Page field is updated to the actual requested page whenever prediction is wrong.

Page Access History Table

    The page access history table (PAHT) stores the last page accessed by a user. It maintains an entry for every user and the last page accessed. It also maintains a field to indicate whether the page has been encrypted. This table is maintained...