Patents by Inventor Sartaj Sahni
Sartaj Sahni 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).
-
Publication number: 20130070753Abstract: A method for managing incremental classifier tables is disclosed. A sequence of classifier table updates is received. Each update in the sequence of updates is associated with a filter and is analyzed. If multiple updates are received at the same time, then all updates associated with the same filter are identified. The updates on the same filter can be reduced to a single update resulting in an identical final state of the same filter. The other updates associated with the filter are removed from the sequence of updates. A reduced sequence of classifier updates is generated based on other updates of filters with multiple updates being removed. The reduced sequence of classifier updates comprises a set of classifier table updates, where for each distinct filter in the reduced sequence only one update is associated therewith. A reordered sequence of update operations is generated from the reduced sequence of update operations.Type: ApplicationFiled: May 25, 2011Publication date: March 21, 2013Applicant: UNIVERSITY OF FLORIDA RESEARCH FOUNDATION, INC.Inventors: Sartaj Sahni, Tania Mishra
-
Patent number: 8144686Abstract: A connection-oriented network includes a control server. The control server receives requests to establish and utilize dedicated channels in the network. The control server utilizes various scheduling methods and algorithms to determine channels based on the request's requirements and resources of the network. For example, the control server may determine a channel based on: (i) a specified bandwidth in a specified time slot, (ii) highest available bandwidth in a specified time slot, (iii) earliest available time with a specified bandwidth and duration, and (iv) all available time slots with a specified bandwidth and duration.Type: GrantFiled: April 20, 2007Date of Patent: March 27, 2012Assignees: University of Florida Research Foundation, Inc., UT-Battelle, LLCInventors: Sartaj Sahni, Nageswara Sirikonda Venkata Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Narayana Kamath
-
Patent number: 8089961Abstract: Ternary content-addressable memories (TCAMs) may be used to obtain a simple and very fast implementation of a router's forwarding engine. The applicability of TCAMs is, however, limited by their size and high power requirement. The present invention provides an improved method and associated algorithms to reduce the power needed to search a forwarding table using a TCAM. Additionally, the present invention teaches how to couple TCAMs and high bandwidth SRAMs so as to overcome both the power and size limitations of a pure TCAM forwarding engine. By using one of the novel TCAM-SRAM coupling schemes (M-12Wb), TCAM memory is reduced by a factor of about 5 on IPv4 data sets and by a factor of about 2.5 on IPv6 data sets; TCAM power requirement is reduced by a factor of about 10 on IPv4 data sets and by a factor of about 6 on IPv6 data sets.Type: GrantFiled: December 7, 2007Date of Patent: January 3, 2012Assignee: University of Florida Research Foundation, Inc.Inventors: Sartaj Sahni, Wencheng Lu
-
Patent number: 7948980Abstract: A computer-implemented method of classifying packets of data transmitted over a data communications network includes providing a memory-storable packet classifier rule defined by a plurality of filters, each filter uniquely corresponding to a one of a plurality of actions to be taken in transmitting the data packets over the data communications network; and classifying a data packet according to the packet classifier rule by generating at least one supernode trie subject to a predetermined constraint for reducing accesses to a memory in which the packet classifier rule is stored. A system including a combination of hardware and software modules is provided for carrying out the method. A computer-readable storage medium is also provided for storing a computer program for carrying out the method.Type: GrantFiled: August 2, 2007Date of Patent: May 24, 2011Assignee: University of Florida Research Foundation, Inc.Inventors: Wencheng Lu, Sartaj Sahni
-
Publication number: 20100034202Abstract: A computer-implemented method of classifying packets of data transmitted over a data communications network includes providing a memory-storable packet classifier rule defined by a plurality of filters, each filter uniquely corresponding to a one of a plurality of actions to be taken in transmitting the data packets over the data communications network; and classifying a data packet according to the packet classifier rule by generating at least one supemode trie subject to a predetermined constraint for reducing accesses to a memory in which the packet classifier rule is stored. A system including a combination of hardware and software modules is provided for carrying out the method. A computer-readable storage medium is also provided for storing a computer program for carrying out the method.Type: ApplicationFiled: August 2, 2007Publication date: February 11, 2010Inventors: Wencheng Lu, Sartaj Sahni
-
Publication number: 20090150603Abstract: Ternary content-addressable memories (TCAMs) may be used to obtain a simple and very fast implementation of a router's forwarding engine. The applicability of TCAMs is, however, limited by their size and high power requirement. The present invention provides an improved method and associated algorithms to reduce the power needed to search a forwarding table using a TCAM. Additionally, the present invention teaches how to couple TCAMs and high bandwidth SRAMs so as to overcome both the power and size limitations of a pure TCAM forwarding engine. By using one of the novel TCAM-SRAM coupling schemes (M-12Wb), TCAM memory is reduced by a factor of about 5 on IPv4 data sets and by a factor of about 2.5 on IPv6 data sets; TCAM power requirement is reduced by a factor of about 10 on IPv4 data sets and by a factor of about 6 on IPv6 data sets.Type: ApplicationFiled: December 7, 2007Publication date: June 11, 2009Applicant: University of Florida Research Foundation, Inc.Inventors: SARTAJ SAHNI, Wencheng Lu
-
Publication number: 20080259954Abstract: A connection-oriented network includes a control server. The control server receives requests to establish and utilize dedicated channels in the network. The control server utilizes various scheduling methods and algorithms to determine channels based on the request's requirements and resources of the network. For example, the control server may determine a channel based on: (i) a specified bandwidth in a specified time slot, (ii) highest available bandwidth in a specified time slot, (iii) earliest available time with a specified bandwidth and duration, and (iv) all available time slots with a specified bandwidth and duration.Type: ApplicationFiled: April 20, 2007Publication date: October 23, 2008Inventors: Sartaj Sahni, Nageswara Sirikonda Venkata Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Narayana Kamath
-
Patent number: 7142635Abstract: A method of delivering intensity modulated radiation therapy (IMRT) is disclosed. An intensity profile for the treatment of a patient is provided which spans a prescribed field width and includes a discrete profile having intensity values at each of a plurality of sample points bounded by the prescribed width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity profile is split into a plurality of intensity profile portions, each having respective widths less than the maximum width if the prescribed width is greater than the maximum width. The prescribed field is also divided into a plurality of different profile portion split arrangements. A monitor unit (MU) efficiency is calculated for each of the arrangements. One of the arrangements is selected for delivery by the system using a leaf sequencing method.Type: GrantFiled: April 8, 2005Date of Patent: November 28, 2006Assignee: University of Florida Research Foundation, Inc.Inventors: Srijit Kamath, Sartaj Sahni, Jonathan Gang Li, Jatinder Palta, Sanjay Ranka
-
Patent number: 7085348Abstract: A method of delivering radiation treatment using multi-leaf collimation includes the step of providing a radiation fluence map which includes an intensity profile. The fluence map is converted into a preliminary leaf sequence, wherein the preliminary leaf sequence minimizes machine on-time and is generated without leaf movement constraints. The leaf movement constraint is imposed on the preliminary leaf sequence. At least one constraint elimination algorithm is then applied, the algorithm adjusting the preliminary leaf sequence to minimize violations of the constraint while providing the desired fluence map and minimized radiation on-time. The method can be applied to SMLC and DLMC systems, and can include adjustment for the tongue-and-groove effect.Type: GrantFiled: December 15, 2003Date of Patent: August 1, 2006Assignee: The University of Florida Research Foundation, Inc.Inventors: Srijit Kamath, Sartaj Sahni, Jantinder Palta, Sanjay Ranka, Jonathan G. Li
-
Publication number: 20050254623Abstract: A method of delivering intensity modulated radiation therapy (IMRT) is disclosed. An intensity profile for the treatment of a patient is provided which spans a prescribed field width and includes a discrete profile having intensity values at each of a plurality of sample points bounded by the prescribed width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity profile is split into a plurality of intensity profile portions, each having respective widths less than the maximum width if the prescribed width is greater than the maximum width. The prescribed field is also divided into a plurality of different profile portion split arrangements. A monitor unit (MU) efficiency is calculated for each of the arrangements. One of the arrangements is selected for delivery by the system using a leaf sequencing method.Type: ApplicationFiled: April 8, 2005Publication date: November 17, 2005Inventors: Srijit Kamath, Sartaj Sahni, Jonathan Li, Jatinder Palta, Sanjay Ranka
-
Publication number: 20050163122Abstract: A system for classifying data packets transmitted over a data communications network based upon a set of predetermined prefixes associated with destination addresses of the data packets is provided. The includes a data structure stored in an electronic memory. The data structure is a prefix-in-B-tree (PIBT) data structure and/or a range-in-B-tree (RIBT) data structure, the at least one data structure comprising a plurality of nodes based upon the set of predetermined prefixes. The system also includes a determination module for determining a match between one or more of the plurality of nodes and a destination address of a particular data packet.Type: ApplicationFiled: December 30, 2004Publication date: July 28, 2005Applicant: UNIVERSITY OF FLORIDA RESEARCH FOUNDATION, INC.Inventors: Sartaj Sahni, Haibin Lu
-
Publication number: 20050148841Abstract: A method of delivering radiation treatment using multi-leaf collimation includes the step of providing a radiation fluence map which includes an intensity profile. The fluence map is converted into a preliminary leaf sequence, wherein the preliminary leaf sequence minimizes machine on-time and is generated without leaf movement constraints. The leaf movement constraint is imposed on the preliminary leaf sequence. At least one constraint elimination algorithm is then applied, the algorithm adjusting the preliminary leaf sequence to minimize violations of the constraint while providing the desired fluence map and minimized radiation on-time. The method can be applied to SMLC and DLMC systems, and can include adjustment for the tongue-and-groove effect.Type: ApplicationFiled: December 15, 2003Publication date: July 7, 2005Inventors: Srijit Kamath, Sartaj Sahni, Jatinder Palta, Sanjay Ranka, Jonathan Li