Patents by Inventor Gordon A. Taylor
Gordon A. Taylor 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).
-
Patent number: 6529897Abstract: A method and system for testing a plurality of filter rules in a computer system is disclosed. The plurality of filter rules are used with a key that is capable of matching at least one of the plurality of filter rules. The at least one filter rule corresponds to at least one action. The computer system has a cache including a plurality of bins and a decision tree. The method and system include searching a plurality of stored keys in the cache for the key. Preferably, this search of the cache for the key includes determining whether a stored key exactly matches the key. A plurality of stored filter rules corresponds to the plurality of stored keys. A plurality of stored actions corresponds to the plurality of stored filter rules. The cache stores each of the plurality of stored keys and at least one stored action in each bin of a portion of the bins.Type: GrantFiled: March 31, 2000Date of Patent: March 4, 2003Assignee: International Business Machines CorporationInventors: Everett Arthur Corl, Jr., Gordon Taylor Davis, Clark Debs Jeffries, Malcolm Scott Ware
-
Publication number: 20030041146Abstract: The decision at network interface with an edge resource such as server to allow or not allow an new connection request is made by a connection control mechanism.Type: ApplicationFiled: August 16, 2001Publication date: February 27, 2003Applicant: International Business Machines CorporationInventors: Gordon Taylor Davis, Clark Debs Jeffries, Mark Anthony Rinaldi
-
Publication number: 20030039249Abstract: According to the present invention there is provided to a method and system for efficiently routing IP fragments (i.e., datagrams) at layer 3 through layer 7 of the OSI model without reassembling the fragments. Time-consuming reassembly of fragments of a datagram at higher layers that would be required via conventional methods is avoided, thereby improving processing speed of fragments and utilizing fewer resources for processing fragments of a datagram than would be required during reassembly of the fragments via conventional methods.Type: ApplicationFiled: August 16, 2001Publication date: February 27, 2003Applicant: International Business Machines CorporationInventors: Claude Basso, Jean Louis Calvignac, Philippe Damon, Gordon Taylor Davis
-
Publication number: 20030033307Abstract: A system and method for retrieving information in a distributed table by partitioning a search key. A packet processor may generate a search key for a received packet of data. The packet processor may partition the search key into a plurality of segments where the length of each segment corresponds to a size of a particular layer of a table. The packet processor may read a particular entry in a particular layer, e.g., the first layer, of the table using a value of the segment, e.g., the first segment, associated with that layer. A determination may be made to determine if the particular entry read stores a pointer that points to the next level of the table. If so, then the packet processor may read a particular entry in the next level of the table using the value of the next segment of the plurality of segments.Type: ApplicationFiled: August 10, 2001Publication date: February 13, 2003Applicant: International Business Machines CorporationInventors: Gordon Taylor Davis, Clark Debs Jeffries
-
Publication number: 20030023581Abstract: A method and system for finding a longest prefix match for a key in a computer network is disclosed. The method and system include providing a main engine and providing an auxiliary engine. The main engine is for storing a first plurality of addresses and for searching the first plurality of addresses for the longest prefix match for the key. None of the first plurality of addresses is a prefix for another address of the first plurality of addresses. The auxiliary engine is for storing and searching a second plurality of addresses. A first address of the second plurality of addresses is capable of including the prefix for a second address of the first plurality of addresses or for a third address for the second plurality of addresses. None of the first plurality of addresses is the prefix for any of the second plurality of addresses. Each of the second plurality of addresses is distinct from each of the first plurality of addresses.Type: ApplicationFiled: July 27, 2001Publication date: January 30, 2003Applicant: International Business Machines CorporationInventors: Gordon Taylor Davis, Clark Debs Jeffries, Grayson Warren Randall, Sonia Kiang Rovner
-
Publication number: 20030016653Abstract: A method and system for identifying sessions in a computer network is disclosed. The session is between a first computer system and a second computer system. The session consists of an exchange of a plurality of packets between the computer systems. Each of the packets includes source information and destination information relating to the first computer system and the second computer system. The method and system include providing a symmetric key and identifying the session using the symmetric key. The symmetric key is provided utilizing a manipulation of the source information and the destination information. The symmetric key is associated with the plurality of packets traveling between the first computer system and the second computer system.Type: ApplicationFiled: July 19, 2001Publication date: January 23, 2003Applicant: International Business Machines CorporationInventor: Gordon Taylor Davis
-
Publication number: 20030012209Abstract: Packetized voice, video, and data traffic (data frames) are received in a communication traffic sorter. The data frames have a dispatch priority corresponding to their transmission characteristics (flow) and a quality of service parameters. The communication traffic sorter analyzes information in data packets within each data frame and determines an optimum flow for the data frames. A data frame is assigned to a selected queue based on an analysis of the information in its data packets. A data frame may also be assigned to a queue based on a prior analysis of a data frame with like transmission characteristics. Results of analysis are stored and indexed to facilitate processing of subsequent data frames. The network access sorter has circuits to un-pack and re-pack the data frame, when called for, to allow user transmitted data to be processed to create a modified data frame.Type: ApplicationFiled: July 16, 2001Publication date: January 16, 2003Applicant: International Business Machines CorporationInventors: Youssef Abdelilah, Gordon Taylor Davis, Jeffrey Haskell Derby, Dongming Hwang, Clark Debs Jeffries, Malcolm Scott Ware, Hau Ye
-
Publication number: 20030014691Abstract: A remote controller is coupled to a target system via a computer network A real time probe is installed in software executing on a target system, typically a Digital Signal Processor (DSP). The remote controller includes a “debugger user interface” which accepts and interprets scoping commands issued by a developer. A controller network driver constructs appropriate network packets to be sent over the network to the target system. The target system has a control processor which runs a target network driver for receiving the network packets containing the scoping commands. The scoping commands are sent to an “embedded debugger” which performs the requested probing/scoping. When the DSP code runs across an address where the probe is installed, the embedded debugger will collect the signal values. The collected scope data will be interleaved and sent to the target network driver which, will encapsulate the information into suitable packets to send back to the controller via the network.Type: ApplicationFiled: July 16, 2001Publication date: January 16, 2003Applicant: Internationl Business Machines CorporationInventors: Youssef Abdelilah, Gordon Taylor Davis, Jeffrey Haskell Derby, Dongming Hwang, Clark Debs Jeffries, Malcolm Scott Ware, Hua Ye
-
Publication number: 20030012137Abstract: A packet network congestion control system using a biased packet discard policy includes a plurality of end points having codecs operating in a framework, e.g. ITU-T H.323 protocol to establish a communication session. The protocol enables the codecs to negotiate codec type and associated parameters. Once a connection and session are established, compressed voice and data packets start flowing between the two end points. A control entity supplies congestion control packets periodically. The control packets provide a “heartbeat” signal to the codec at the other end of the session. Each codec receiver uses the “heartbeat” signal as an indication of network congestion. As network congestion increases, routers within the network discard excess packets to prevent network failure. The network discards all packets classified as congestion control packets whenever a flow control mechanism detects congestion or a trend toward congestion.Type: ApplicationFiled: July 16, 2001Publication date: January 16, 2003Applicant: International Business Machines CorporationInventors: Youssef Abdelilah, Gordon Taylor Davis, Jeffrey Haskell Derby, Dongming Hwang, Clark Debs Jeffries, Malcolm Scott Ware, Hua Ye
-
Publication number: 20030012138Abstract: A codec detects congestion in a packet network and responds via a session control protocol to re-negotiate codec-type and/or parameters with the receiving codec to reduce bit rate for supporting a session. Once the connection and session are established, encoded packets start flowing between the two codecs. A control entity sends and receives network congestion control packets periodically in the session. The congestion control packets provide a “heartbeat” signal to the receiving codec. When the network is not congested, all “heartbeat” packets will be passed through the network As network congestion increases, routers within the network discard excess packets to prevent network failure. The codecs respond to the missing packets by slowing down the bit rate or proceeding to renegotiate a lower bit rate via the session control protocol. If there are no missing packets, the codecs detect if the session is operating at the highest bit rate, and if not, re-negotiate a higher bit rate.Type: ApplicationFiled: July 16, 2001Publication date: January 16, 2003Applicant: International Business Machines CorporationInventors: Youssef Abdelilah, Gordon Taylor Davis, Jeffrey Haskell Derby, Dongming Hwang, Clark Debs Jeffries, Malcolm Scott Ware, Hua Ye
-
Publication number: 20030009453Abstract: A method and system for performing a pattern match search for a data string having a plurality of characters separated by delimiters. In accordance with the method of the present invention a search key is constructed by generating a full match search increment comprising the binary representation of a data string element, wherein the data string element comprises all characters between a pair of delimiters. The search key is completed by concatenating a pattern search prefix to the full match search increment, wherein the pattern search prefix is a cumulative pattern search result of each previous full match search increment. A full match search is then performed within a lookup table utilizing the search key. In response to finding a matching pattern within the lookup table, the process returns to constructing a next search key. In response to not finding a matching pattern, the previous full match search result is utilized to process the data string.Type: ApplicationFiled: July 3, 2001Publication date: January 9, 2003Applicant: International Business Machines CorporationInventors: Claude Basso, Jean Louis Calvignac, Philippe Damon, Gordon Taylor Davis, Marco C. Heddes, Clark Debs Jeffries
-
Patent number: 6505222Abstract: Bias control systems, methods, and computer program products generate an error signal that corresponds to a difference between a reference signal and an equalizer output signal. The error signal is then filtered using a first filter circuit to generate an error signal average. If the absolute value of the error signal does not exceed a suitable threshold that is proportional to the error signal average, then the error signal is coupled to the equalizer for use in updating the filter coefficients. Furthermore, a second filter circuit may be used to generate an average of selected equalizer output signal samples. If the absolute value of the error signal is greater than the threshold that is proportional to the error signal average, then the reference signal is updated to correspond to the average of selected equalizer output signal samples. Large errors are interpreted as resulting from inaccurate reference signals or reference levels.Type: GrantFiled: October 29, 1999Date of Patent: January 7, 2003Assignee: International Business Machines CorporationInventors: Gordon Taylor Davis, Malcolm Scott Ware
-
Publication number: 20030005195Abstract: A generic method and apparatus for managing semaphores in a multi-threaded processing system has a storage area for each of the threads in the processing system. Each storage area includes a first part for storing at least one indicia for identifying at least one unique semaphore from a plurality of semaphores utilized by the multi-threaded processing system and a second part for storing an indicia for indicating a locked status for the stored semaphore. A thread requiring a semaphore sends a semaphore lock request to the semaphore manager which examines the contents of all of the storage areas to determine the status of the requested semaphore. If the requested semaphore is not locked, it is locked for the requesting thread by inserting the requested semaphore and locked status in the memory location assigned to the requesting thread.Type: ApplicationFiled: June 25, 2002Publication date: January 2, 2003Applicant: International Business Machines CorporationInventors: Gordon Taylor Davis, Marco Heddes, Steven Kenneth Jenkins, Ross Boyd Leavens, Robert Brian Likovich
-
Publication number: 20030002440Abstract: An ordered semaphore management subsystem and method for use in an application system which includes a plurality of processors competing for shared resources each of which is controlled by a unique semaphore. The subsystem generates an ordered semaphore field (OSF) corresponding to each processor in a linked list of processors and assigns one of four statuses to the OSF depending on the position the processor occupies in the linked list of processors competing for the shared resources. The four states are (1) semaphore head (SH); (2) behind semaphore head (BSH); (3) semaphore head behind (SHB); and (4) skip (Skip). Only the SH processor is allocated the semaphore when requested. A processor not in the SH state will be denied the semaphore even if is available to assure sequential access.Type: ApplicationFiled: June 25, 2002Publication date: January 2, 2003Applicant: International Business Machines CorporationInventors: Jean Louis Calvignac, Gordon Taylor Davis, Marco Heddes, Steven Kenneth Jenkins, Ross Boyd Leavens, Robert Brian Likovich
-
Publication number: 20020198981Abstract: A method and system for determining whether to enforce a plurality of filter rules for a packet including a key in a computer network is disclosed. Each of the plurality of filter rules has a priority. The method and system include accumulating statistics for each of the plurality of filter rules. The statistics indicate a frequency of enforcement for each of the plurality of filter rules. The method and system also include placing the plurality of filter rules in an order for testing against the key. The order is based on the frequency of each filter rule of the portion of the plurality of filter rules. Consequently, more frequently enforced filter rules may be tested first.Type: ApplicationFiled: June 22, 2001Publication date: December 26, 2002Applicant: International Business Machines CorporationInventors: Everett Arthur Corl, Gordon Taylor Davis, Clark Debs Jeffries
-
Patent number: 6498806Abstract: Multi-drop Asymmetrical Digital Subscriber Loop (ADSL) modems have at least two sets of digital front end circuitry which allow for simultaneous connections to at least two local loops. A shared DSL modem is operably associated with each of the two sets of digital front end circuitry and transmits and receives data to and from the digital front end circuitry. A digital interface is operably associated with the shared DSL modem and is configured to communicate with an external network.Type: GrantFiled: August 17, 1998Date of Patent: December 24, 2002Assignee: International Business Machines CorporationInventor: Gordon Taylor Davis
-
Publication number: 20020147544Abstract: A vehicle navigation system employing echo or doppler analysis to provide autonomous or enhanced navigational capabilities by correlating stored scene information with echo analysis information derived from an Active Traveling-Wave Device (ATWD) output representing information concerning the vehicle's state and velocity vectors with respect to a mapped scene. The system employs a steppable frequency oscillator for providing a signal which is stepped in frequency to provide an increased range resolution of the ATWD.Type: ApplicationFiled: February 11, 2002Publication date: October 10, 2002Applicant: WINGED SYSTEMS CORPORATIONInventors: Joseph M. Nicosia, Keith R. Loss, Gordon A. Taylor
-
Publication number: 20020143724Abstract: The effectiveness of a Network Processor to process data at media speed is enhanced by partitioning a Rules Database, used to filter and/or forward frames, into at least one set of Almost-Exact Rules and Other Rules. The Almost-Exact Rules are processed by a Full Match (FM) Tree Search Algorithm and the Other Rules are processed by a Software Managed Tree (SMT) algorithm.Type: ApplicationFiled: January 16, 2001Publication date: October 3, 2002Applicant: International Business Machines CorporationInventors: Everett Arthur Corl, Gordon Taylor Davis, Clark Debs Jeffries, Victoria Sue Thio, Colin Beaton Verrilli, Avraham Zehavi
-
Publication number: 20020136283Abstract: A shared digital subscriber line modem achieves reduced total power consumption and data security by generating and transmitting a physical data frame which includes a control channel and a data field to only the connected client modem associated with the intended recipient. A second physical frame which does not include the data field is generated and transmitted to all of the other connected client modems. This method results in a reduction in the power required and provides improved data security by preventing data access to non-addressed client modems.Type: ApplicationFiled: March 21, 2001Publication date: September 26, 2002Applicant: International Business Machines CorporationInventors: Gordon Taylor Davis, Jeffrey Haskell Derby, Evangelos Stavros Eleftheriou, Sedat Oelcer, Malcolm Scott Ware
-
Publication number: 20020136284Abstract: A low power DSL modem transmitter, suitable for incorporation in integrated DSLAM server line cards, transmits full power physical frames which include a control channel and a data field when data is available for transmission and physical frames having only a control channel or a control channel and a low power synchronization field when data is not available for transmission. And a method for controlling the total power dissipated in the integrated DSLAM by selectively restricting the flow of data packets to the DSLs.Type: ApplicationFiled: March 21, 2001Publication date: September 26, 2002Applicant: International Business Machines CorporationInventors: Gordon Taylor Davis, Jeffrey Haskell Derby, Evangelos Stavros Eleftheriou, Sedat Oelcer, Malcolm Scott Ware