SOAR
 
Wichita State University WSU Libraries

SOAR at Wichita State University Libraries >
Graduate School >
GRASP: Graduate Research and Scholarly Projects >
Proceedings: 3rd Annual Symposium: Graduate Research and Scholarly Projects >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10057/848

Title: Combinatorial input recognition algorithm Internet applications to HTTP web servers
Authors: Myers, Joseph K.
Issue Date: 27-Apr-2007
Publisher: Wichita State University. Graduate School.
Citation: Myers, Joseph K.(2007) . Combinatorial input recognition algorithm Internet applications to HTTP web servers. In Proceedings : 3rd Annual Symposium : Graduate Research and Scholarly Projects. Wichita, KS : Wichita State University, p.173-174
Series/Report no.: GRASP
v.3
Abstract: We introduce an algorithm for the classical recognition problem of identifying elements s within a class of strings S = {s1, s2, ..., sn}. Here it is assumed that struct s = { char *a; int z; }; and that for two strings s1, s2 if s1.z == s2.z then there is J = {j1, j2, ..., jl} with l(z) < z so that s1[J] == s2[J] ⇒ s1 == s2. The goal is to minimize Σ = n k i l si z 1 ( . ) and thus distinguish elements with the smallest number of comparisons. In general, this simply means that in a language system we face a nonoptimal set of keywords (n < sizeof(*s.a)z) and so we seek to reconstruct the language with a smaller set of k recognition vertices so that k ≈ logsizeof(*s.a) n. The algorithm is applied to increasing HTTP transmission and request processing speed. The result is an increase in web server performance from 20,000 to 35,000 or more hits per second. The input recognition algorithm produces the greatest improvement when interpreting HTTP request headers which are large in proportion to the response. This is the case when collecting data for statistical analysis of Internet traffic.
Description: Paper presented to the 3rd Annual Symposium on Graduate Research and Scholarly Projects (GRASP) held at the Hughes Metropolitan Complex, Wichita State University, April 27, 2007.
Research completed at Department of Mathematics and Statistics, College of Liberal Arts and Sciences.
URI: http://hdl.handle.net/10057/848
Appears in Collections:MAT Graduate Student Conference Papers
Proceedings: 3rd Annual Symposium: Graduate Research and Scholarly Projects

Files in This Item:

File Description SizeFormat
grasp174.pdfConference paper189KbAdobe PDFView/Open
Recommend this item

All items in SOAR are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback