Patents by Inventor Russell R. Tuck

Russell R. Tuck 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: 10706060
    Abstract: Systems and methods for storing a plurality of conversations are provided. Each such conversation has a corresponding conversation identifier and one or more messages sharing a common set of characteristics that meet predefined criteria. Information is sent to a remote computer identifying the conversations and providing sufficient information to rank them in accordance with a date/time value of a most recently received message of each conversation thereby causing a first conversation to be ordered before a second conversation. Subsequently, a first message that is deemed to belong to the second conversation is obtained and added to the second conversation. Information is resent to a remote computer identifying the plurality of conversations and providing sufficient information to rank the plurality of conversations in accordance with a date/time value of a most recently received message of each respective conversation thereby causing the first conversation to be ordered after the second conversation.
    Type: Grant
    Filed: August 15, 2017
    Date of Patent: July 7, 2020
    Assignee: Google LLC
    Inventors: Paul T. Buchheit, Lauren M. Baptist, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Publication number: 20180018376
    Abstract: Systems and methods for storing a plurality of conversations are provided. Each such conversation has a corresponding conversation identifier and one or more messages sharing a common set of characteristics that meet predefined criteria. Information is sent to a remote computer identifying the conversations and providing sufficient information to rank them in accordance with a date/time value of a most recently received message of each conversation thereby causing a first conversation to be ordered before a second conversation. Subsequently, a first message that is deemed to belong to the second conversation is obtained and added to the second conversation. Information is resent to a remote computer identifying the plurality of conversations and providing sufficient information to rank the plurality of conversations in accordance with a date/time value of a most recently received message of each respective conversation thereby causing the first conversation to be ordered after the second conversation.
    Type: Application
    Filed: August 15, 2017
    Publication date: January 18, 2018
    Inventors: Paul T. Buchheit, Lauren M. Baptist, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Patent number: 9063989
    Abstract: A method and system for processing messages includes receiving a plurality of messages directed to a user. Each of the plurality of messages is associated with a respective conversation and list of conversations is displayed in an order determined in accordance with second predefined criteria, as a set of rows, where each row corresponds to one of the listed conversations and includes at least a sender list, a conversation topic and a date/time value. A user is enabled to identify one or more conversations in the list of conversations, to mark the identified conversations as belonging to a particular category, and to display another list of conversations comprising conversations marked as belonging to the particular category. A user may cause a conversation to be removed from certain displays, but to become visible again after the passage of a certain amount of time or the occurrence of an event.
    Type: Grant
    Filed: May 22, 2013
    Date of Patent: June 23, 2015
    Assignee: Google Inc.
    Inventors: Paul T. Buchheit, Lauren M. Baptist, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Patent number: 8583747
    Abstract: A method system for labeling messages of conversations, where each conversation has a respective conversation identifier and comprises one or more messages sharing a common set of characteristics. A selected conversation has a plurality of messages associated with a first label. In response to an action specifying a second label to be associated with the selected conversation, the second label is associated with the messages of the selected conversation, such that the plurality of messages are each associated with both the first and second labels. An index entry for the second label is modified to account for the association of the second label with the messages. In some embodiments, a set of predetermined conditions is associated with the conversation; the first label is removed from the plurality of messages and is prevented from being automatically associated with newly received messages of the conversation until the predetermined conditions are satisfied.
    Type: Grant
    Filed: November 13, 2009
    Date of Patent: November 12, 2013
    Assignee: Google Inc.
    Inventors: Paul T. Buchheit, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Patent number: 8533274
    Abstract: A method and system for processing messages includes receiving a plurality of messages directed to a user. Each of the plurality of messages is associated with a respective conversation and list of conversations is displayed in an order determined in accordance with second predefined criteria, as a set of rows, where each row corresponds to one of the listed conversations and includes at least a sender list, a conversation topic and a date/time value. A user is enabled to identify one or more conversations in the list of conversations, to mark the identified conversations as belonging to a particular category, and to display another list of conversations comprising conversations marked as belonging to the particular category. A user may cause a conversation to be removed from certain displays, but to become visible again after the passage of a certain amount of time or the occurrence of an event.
    Type: Grant
    Filed: November 13, 2009
    Date of Patent: September 10, 2013
    Assignee: Google Inc.
    Inventors: Paul T. Buchheit, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Patent number: 8331232
    Abstract: In a data packet router, a router fabric card for routing data packets is provided. The router fabric card comprises a plurality of ingress/egress ports, the ports connected through a switching facility for switching connection states of the port paths between individual ingress paths and individual egress paths on the fabric card, and a scheduling component for scheduling communication between ports on the fabric card. Data coming into ingress on the card is organized into individual data-packet trains, each individual train comprising data packets and inserted data denoting a starting point and an ending point of a train. The switching facility recognizes the start data and the end data of a train and switches port paths to a next-assigned connection state accordingly.
    Type: Grant
    Filed: May 20, 2010
    Date of Patent: December 11, 2012
    Assignee: Pluris, Inc.
    Inventors: I-Sing Roger Niu, Ying Wang, Russell R. Tuck, III
  • Patent number: 7965804
    Abstract: A method for word synchronization can be applied to asynchronous devices including SERDES devices connected across serial lines. A state transition methodology characterizes the state of the device based on control characters received consistently across the serial lines and channels the system to a state of word synchronization. Loss of synchronization and transmission errors lead to a re-establishment of synchronization.
    Type: Grant
    Filed: July 7, 2009
    Date of Patent: June 21, 2011
    Assignee: Pluris, Inc.
    Inventors: Angshuman Saha, Steven Farnworth, Russell R. Tuck, III, Deepak Mansharamani
  • Publication number: 20100232425
    Abstract: In a data packet router, a router fabric card for routing data packets is provided. The router fabric card comprises a plurality of ingress/egress ports, the ports connected through a switching facility for switching connection states of the port paths between individual ingress paths and individual egress paths on the fabric card, and a scheduling component for scheduling communication between ports on the fabric card. Data coming into ingress on the card is organized into individual data-packet trains, each individual train comprising data packets and inserted data denoting a starting point and an ending point of a train. The switching facility recognizes the start data and the end data of a train and switches port paths to a next-assigned connection state accordingly.
    Type: Application
    Filed: May 20, 2010
    Publication date: September 16, 2010
    Inventors: I-Sing Roger Niu, Ying Wang, Russell R. Tuck, III
  • Patent number: 7733775
    Abstract: In a data packet router, a router fabric card for routing data packets is provided. The router fabric card comprises a plurality of ingress/egress ports, the ports connected through a switching facility for switching connection states of the port paths between individual ingress paths and individual egress paths on the fabric card, and a scheduling component for scheduling communication between ports on the fabric card. Data coming into ingress on the card is organized into individual data-packet trains, each individual train comprising data packets and inserted data denoting a starting point and an ending point of a train. The switching facility recognizes the start data and the end data of a train and switches port paths to a next-assigned connection state accordingly.
    Type: Grant
    Filed: June 10, 2008
    Date of Patent: June 8, 2010
    Assignee: Pluris, Inc.
    Inventors: I-Sing Roger Niu, Ying Wang, Russell R. Tuck, III
  • Publication number: 20100064017
    Abstract: A method system for labeling messages of conversations, where each conversation has a respective conversation identifier and comprises one or more messages sharing a common set of characteristics. A selected conversation has a plurality of messages associated with a first label. In response to an action specifying a second label to be associated with the selected conversation, the second label is associated with the messages of the selected conversation, such that the plurality of messages are each associated with both the first and second labels. An index entry for the second label is modified to account for the association of the second label with the messages. In some embodiments, a set of predetermined conditions is associated with the conversation; the first label is removed from the plurality of messages and is prevented from being automatically associated with newly received messages of the conversation until the predetermined conditions are satisfied.
    Type: Application
    Filed: November 13, 2009
    Publication date: March 11, 2010
    Inventors: Paul T. Buchheit, Lauren M. Baptist, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Publication number: 20100057879
    Abstract: A method and system for processing messages includes receiving a plurality of messages directed to a user. Each of the plurality of messages is associated with a respective conversation and list of conversations is displayed in an order determined in accordance with second predefined criteria, as a set of rows, where each row corresponds to one of the listed conversations and includes at least a sender list, a conversation topic and a date/time value. A user is enabled to identify one or more conversations in the list of conversations, to mark the identified conversations as belonging to a particular category, and to display another list of conversations comprising conversations marked as belonging to the particular category. A user may cause a conversation to be removed from certain displays, but to become visible again after the passage of a certain amount of time or the occurrence of an event.
    Type: Application
    Filed: November 13, 2009
    Publication date: March 4, 2010
    Inventors: Paul T. Buchheit, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck, III
  • Publication number: 20090276652
    Abstract: A method for word synchronization can be applied to asynchronous devices including SERDES devices connected across serial lines. A state transition methodology characterizes the state of the device based on control characters received consistently across the serial lines and channels the system to a state of word synchronization. Loss of synchronization and transmission errors lead to a re-establishment of synchronization.
    Type: Application
    Filed: July 7, 2009
    Publication date: November 5, 2009
    Inventors: Angshuman Saha, Steven Farnworth, Russell R. Tuck, III, Deepak Mansharamani
  • Patent number: 7570724
    Abstract: A method for word synchronization can be applied to asynchronous devices including SERDES devices connected across serial lines. A state transition methodology characterizes the state of the device based on control characters received consistently across the serial lines and channels the system to a state of word synchronization. Loss of synchronization and transmission errors lead to a re-establishment of synchronization.
    Type: Grant
    Filed: October 14, 1999
    Date of Patent: August 4, 2009
    Assignee: Pluris, Inc.
    Inventors: Angshuman Saha, Steven Farnworth, Russell R. Tuck, III, Deepak Mansharamani
  • Publication number: 20080240141
    Abstract: In a data packet router, a router fabric card for routing data packets is provided. The router fabric card comprises a plurality of ingress/egress ports, the ports connected through a switching facility for switching connection states of the port paths between individual ingress paths and individual egress paths on the fabric card, and a scheduling component for scheduling communication between ports on the fabric card. Data coming into ingress on the card is organized into individual data-packet trains, each individual train comprising data packets and inserted data denoting a starting point and an ending point of a train. The switching facility recognizes the start data and the end data of a train and switches port paths to a next-assigned connection state accordingly.
    Type: Application
    Filed: June 10, 2008
    Publication date: October 2, 2008
    Inventors: I-Sing Roger Niu, Ying Wang, Russell R. Tuck
  • Patent number: 7385922
    Abstract: In a data packet router, a router fabric card for routing data packets is provided. The router fabric card comprises a plurality of ingress/egress ports, the ports connected through a switching facility for switching connection states of the port paths between individual ingress paths and individual egress paths on the fabric card, and a scheduling component for scheduling communication between ports on the fabric card. Data coming into ingress on the card is organized into individual data-packet trains, each individual train comprising data packets and inserted data denoting a starting point and an ending point of a train. The switching facility recognizes the start data and the end data of a train and switches port paths to a next-assigned connection state accordingly.
    Type: Grant
    Filed: April 9, 2004
    Date of Patent: June 10, 2008
    Assignee: Pluris, Inc.
    Inventors: I-Sing Roger Niu, Ying Wang, Russell R. Tuck, III
  • Patent number: 7107352
    Abstract: In a network packet router having one or more ingress and egress ports, a method is implemented at an ingress port for egress pass/drop determination for packets, comprising the steps of (a) noting header combinations and values, and egress port destination for incoming packets; (b) comparing the header combinations and values with rule sets associated with the header combinations and values including egress port identities, and (c) returning a determination of pass or drop for the packet.
    Type: Grant
    Filed: July 12, 2004
    Date of Patent: September 12, 2006
    Assignee: Pluris, Inc.
    Inventors: Russell R. Tuck, III, Puneet Agarwal
  • Patent number: 7103046
    Abstract: In a network node having one or more packet processors and at least one CPU required to process specific types of packets, a system for managing the specific types of packets for CPU processing has one or more packet processors enabled to sort the specific types of packets into two or more categories of different priority for processing; and a queue set for queuing the sorted packets according to priority ahead of the CPU. The system is characterized in that the CPU processes the queued packets according to priority. In a special case the queues are a part of network access controller (NAC). Also in some cases a software component is provided for configuring the hardware.
    Type: Grant
    Filed: May 14, 2004
    Date of Patent: September 5, 2006
    Assignee: Pluris, INC
    Inventors: Russell R. Tuck, III, Puneet Agarwal
  • Publication number: 20050234910
    Abstract: A method and system for processing messages includes receiving a plurality of messages directed to a user. Each of the plurality of messages is associated with a respective conversation and list of conversations is displayed in an order determined in accordance with second predefined criteria, as a set of rows, where each row corresponds to one of the listed conversations and includes at least a sender list, a conversation topic and a date/time value. A user is enabled to identify one or more conversations in the list of conversations, to mark the identified conversations as belonging to a particular category, and to display another list of conversations comprising conversations marked as belonging to the particular category. A user may cause a conversation to be removed from certain displays, but to become visible again after the passage of a certain amount of time or the occurrence of an event.
    Type: Application
    Filed: August 6, 2004
    Publication date: October 20, 2005
    Inventors: Paul T. Buchheit, Lauren M. Baptist, Bay-Wei W. Chang, Seth J. Golub, Jing Yee Lim, Sanjeev Singh, Russell R. Tuck
  • Patent number: 6947963
    Abstract: A method of and apparatus for distributing data for a database between a plurality of processors in a distributed processor system involves running a database management system on a first plurality of processors in conjunction with a plurality of protocols that generate or amend data for the database. Data is distributed from servers to clients registered in a server-client relationship. Server-client relationships may also be registered between a second, and a third plurality of processors that do not run protocols generating or amending data for the database. Fault tolerant redundancy is provided by clients registering with two or more servers, one as a primary and another as a secondary, and activating the secondary if the primary fails. The method is particularly applicable to scalable data packet routers having a plurality of processors operating on different line and control cards.
    Type: Grant
    Filed: June 28, 2000
    Date of Patent: September 20, 2005
    Assignee: Pluris, Inc
    Inventors: Puneet Agarwal, Russell R. Tuck, III, Bora Aydin Akyol, Erol Basturk, Mike Mussoline
  • Publication number: 20040246899
    Abstract: In a network packet router having one or more ingress and egress ports, a method is implemented at an ingress port for egress pass/drop determination for packets, comprising the steps of (a) noting header combinations and values, and egress port destination for incoming packets; (b) comparing the header combinations and values with rule sets associated with the header combinations and values including egress port identities, and (c) returning a determination of pass or drop for the packet.
    Type: Application
    Filed: July 12, 2004
    Publication date: December 9, 2004
    Inventors: Russell R. Tuck, Puneet Agarwal