System and method for compressing URL request parameters

• US 20070168560A1
• Filed: 10/25/2005
• Published: 07/19/2007
• Est. Priority Date: 06/06/2003
• Status: Active Grant

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Inventors: Alkire, Robert
• Granted Patent: US 8,819,287 B2
• Time in Patent Office: Days
• US Class Current: 709/247
• CPC Class Codes: H03M 7/40 Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/30 Managing network names, e.g. use of aliases or nicknames name-to-address mapping H04L61/45
• CPC Class Codes: H04L 61/301 Name conversion
• CPC Class Codes: H04L 69/04 Protocols for data compression, e.g. ROHC

Abstract

Method and system for compressing URL request parameters is provided. At least a portion of a URL is converted from a first form into at least a second form and communicated.

Claims

1. A method for compressing URL request parameters, comprising:

converting at least a portion of a URL from a first form into at least a second form; and

communicating the converted URL.

2. The method of claim 1, wherein the converted URL is communicated to a server.

3. The method of claim 1, wherein at least a portion of the URL is the data portion comprising data.

4. The method of claim 1, wherein the first form is a decimal form and the second form is a hexadecimal form.

5. The method of claim 1, wherein the converting step further comprises creating an array, selecting a predetermined length, and determining whether data is in a single byte or multiple byte format based on the predetermined length.

7. The method of claim 5, wherein the converting step further comprises alerting the server to expect multiple byte data and pushing the converted data onto the array, if it is determined that the data is in a multiple byte format.

8. The method of claim 7, wherein the alerting step further comprises setting a flag and using starting and ending delimiters to denote each byte of data.

9. The method of claim 5, wherein the converting step further comprises pushing the converted data onto the array if it is determined that the data is in a single byte format.

10. The method of claim 1, further comprising compressing the second form into a third form if the length of the second form is greater than a predetermined length.

11. The method of claim 10, wherein the second form is a hexadecimal form and the third form is a Huffman encoded form.

12. The method of claim 11, wherein the Huffman encoded form comprises a Huffman tree and a Huffman encoded string.

13. The method of claim 12, wherein the Huffman tree is used by a server to decode the Huffman encoded string.

14. The method of claim 12, wherein the Huffman tree is created by creating a frequency array;

calculating a number of times a character appears in a hexadecimal string;

filling the frequency array with the characters from the hexadecimal string based on the number of times a character appears in the hexadecimal string;

joining the two minimal characters together, where one character becomes a left child and the other character becomes a right child; and

inserting combined characters into the frequency array.

15. The method of claim 14, wherein the joining and inserting steps are repeated until there are no characters left in the hexadecimal string.

16. The method of claim 12, wherein the Huffman encoded string is obtained from the Huffman tree by creating a first array;

determining if a node of a frequency array is a leaf node;

pushing a value ‘

1’

onto the first array and creating a hash table if it is determined that the node of the frequency array is a leaf node;

pushing a value ‘

0’

onto the first array if it is determined that the node of the frequency array is not a leaf node;

creating a second array;

searching the frequency array for a character and pushing a value ‘

0’

onto the second array for every left node encountered and a value ‘

1’

onto the second array for every right node encountered, until the character is located; and

pushing the value of the leaf node onto the first array.

17. The method of claim 16, wherein all the steps are repeated until the left and right nodes of the frequency array are null.

18. The method of claim 16, wherein the Huffman encoded string is obtained by looking up each character in the hash table.

19. The method of claim 12, wherein the Huffman encoded string is turned into a hexadecimal string.

6. The method of claim 6, wherein the predetermined length comprises the maximum number of bytes of data for the URL.

20. A system for compressing URL request parameters, comprising:

means for converting at least a portion of a URL from a first form into at least a second form; and

means for communicating the converted URL.

21. The system of claim 20, wherein the converted URL is communicated to a server.

22. The system of claim 20, wherein at least a portion of the URL is the data portion comprising data.

23. The system of claim 20, wherein the first form is a decimal form and the second form is a hexadecimal form.

24. The system of claim 20, wherein the means for converting further comprises means for creating an array, means for selecting a predetermined length, and means for determining whether data is in a single byte or multiple byte format based on the predetermined length.

25. The system of claim 24, wherein the predetermined length comprises the maximum number of bytes of data for the URL.

26. The system of claim 24, wherein the means for converting further comprises means for alerting the server to expect multiple byte data and means for pushing the converted data onto the array, if it is determined that the data is in a multiple byte format.

27. The system of claim 26, wherein the means for alerting further comprises means for setting a flag and using starting and ending delimiters to denote each byte of data.

28. The system of claim 24, wherein the means for converting further comprises means for pushing the converted data onto the array if it is determined that the data is in a single byte format.

29. The system of claim 20, further comprising means for compressing the second form into a third form if the length of the second form is greater than a predetermined length.

30. The system of claim 29, wherein the second form is a hexadecimal form and the third form is a Huffman encoded form.

31. The system of claim 30, wherein the Huffman encoded form comprises a Huffman tree and a Huffman encoded string.

32. The system of claim 31, wherein the Huffman tree is used by a server to decode the Huffman encoded string.

33. The system of claim 31, wherein the Huffman tree is created through means for creating a frequency array;

means for calculating a number of times a character appears in a hexadecimal string;

means for filling the frequency array with the characters from the hexadecimal string based on the number of times a character appears in the hexadecimal string;

means for joining the two minimal characters together, where one character becomes a left child and the other character becomes a right child; and

means for inserting combined characters into the frequency array.

34. The system of claim 31, wherein the Huffman encoded string is obtained from the Huffman tree through means for creating a first array;

means for determining if a node of a frequency array is a leaf node;

means for pushing a value ‘

1’

onto the first array and means for creating a hash table if it is determined that the node of the frequency array is a leaf node;

means for pushing a value ‘

0’

onto the first array if it is determined that the node of the frequency array is not a leaf node;

means for creating a second array;

means for searching the frequency array for a character and means for pushing a value ‘

0’

onto the second array for every left node encountered and a value ‘

1’

onto the second array for every right node encountered, until the character is located; and

means for pushing the value of the leaf node onto the first array.

35. The system of claim 34, wherein the Huffman encoded string is obtained by looking up each character in the hash table.

36. The system of claim 31, wherein the Huffman encoded string is turned into a hexadecimal string.

37. A computer readable storage medium including computer executable code for compressing URL request parameters, comprising:

code for converting at least a portion of a URL from a first form into at least a second form; and

code for communicating the converted URL.

38. The computer readable storage medium of claim 37, wherein the converted URL is communicated to a server.

39. The computer readable storage medium of claim 37, wherein at least a portion of the URL is the data portion comprising data.

40. The computer readable storage medium of claim 37, wherein the first form is a decimal form and the second form is a hexadecimal form.

41. The computer readable storage medium of claim 37, wherein the code for converting further comprises code for creating an array, code for selecting a predetermined length, and code for determining whether data is in a single byte or multiple byte format based on the predetermined length.

42. The computer readable storage medium of claim 41, wherein the predetermined length comprises the maximum number of bytes of data for the URL.

43. The computer readable storage medium of claim 41, wherein the code for converting further comprises code for alerting the server to expect multiple byte data and code for pushing the converted data onto the array, if it is determined that the data is in a multiple byte format.

44. The computer readable storage medium of claim 43, wherein the code for alerting further comprises code for setting a flag and using starting and ending delimiters to denote each byte of data.

45. The computer readable storage medium of claim 41, wherein the code for converting further comprises code for pushing the converted data onto the array if it is determined that the data is in a single byte format.

46. The computer readable storage medium of claim 37, further comprising code for compressing the second form into a third form if the length of the second form is greater than a predetermined length.

47. The computer readable storage medium of claim 46, wherein the second form is a hexadecimal form and the third form is a Huffman encoded form.

48. The computer readable storage medium of claim 47, wherein the Huffman encoded form comprises a Huffman tree and a Huffman encoded string.

49. The computer readable storage medium of claim 48, wherein the Huffman tree is used by a server to decode the Huffman encoded string.

50. The computer readable storage medium of claim 48, wherein the Huffman tree is created by code for creating a frequency array;

code for calculating a number of times a character appears in a hexadecimal string;

code for filling the frequency array with the characters from the hexadecimal string based on the number of times a character appears in the hexadecimal string;

code for joining the two minimal characters together, where one character becomes a left child and the other character becomes a right child; and

code for inserting combined characters into the frequency array.

51. The computer readable storage medium of claim 48, wherein the Huffman encoded string is obtained from the Huffman tree by code for creating a first array;

code for determining if a node of a frequency array is a leaf node;

code for pushing a value ‘

1’

onto the first array and code for creating a hash table if it is determined that the node of the frequency array is a leaf node;

code for pushing a value ‘

0’

onto the first array if it is determined that the node of the frequency array is not a leaf node;

code for creating a second array;

code for searching the frequency array for a character and code for pushing a value ‘

0’

onto the second array for every left node encountered and a value ‘

1’

onto the second array for every right node encountered, until the character is located; and

code for pushing the value of the leaf node onto the first array.

52. The computer readable storage medium of claim 51, wherein the Huffman encoded string is obtained by looking up each character in the hash table.

53. The computer readable storage medium of claim 48, wherein the Huffman encoded string is turned into a hexadecimal string.