Patents by Inventor Satyanarayana Arvapalli

Satyanarayana Arvapalli has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Longest Prefix Match Using Binary Search Tree
    Publication number: 20150074079
    Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.
    Type: Application
    Filed: October 23, 2014
    Publication date: March 12, 2015
    Inventors: Sridhar S. Kotha, Satyanarayana Arvapalli, Vikram Bichal, Anil Kumar Gajkela, Srinivas Reddy Bhima reddy, Balaji Tadepalli, Venkatesh Nagapudi, Satsheel Altekar
  • Longest prefix match using binary search tree
    Patent number: 8880507
    Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.
    Type: Grant
    Filed: October 27, 2010
    Date of Patent: November 4, 2014
    Assignee: Brocade Communications Systems, Inc.
    Inventors: Sridhar Kotha, Satyanarayana Arvapalli, Vikram Bichal, Anil Kumar Gajkela, Srinivas Reddy Bhima reddy, Balajl Tadepalli, Venkatesh Nagapudl, Satsheel Altekar
  • Longest Prefix Match Using Binary Search Tree
    Publication number: 20120023082
    Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.
    Type: Application
    Filed: October 27, 2010
    Publication date: January 26, 2012
    Applicant: Brocade Communications Systems, Inc.
    Inventors: Sridhar Kotha, Satyanarayana Arvapalli, Vikram Bichal, Anil Kumar Gajkela, Srinivas Reddy Bhima reddy, Balaji Tadepalli, Venkatesh Nagapudi, Satsheel Altekar