Pluris, Inc.

Google Inc.

Russell R Tuck, Iii

Puneet Agarwal

Paul Thomas Buchheit

Bay-Wei W Chang

Sanjeev Singh

Jing Yee Lim

Ying Wang

Seth J Golub

I-Sing Roger Niu

Angshuman Saha

Lauren M Baptist

Deepak Mansharamani

Steven L Farnworth

Bora Akyol

Erol Basturk

Mike Mussoline

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.

Systems and methods for re-ranking displayed conversations

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.

Retrieving and snoozing categorized conversations in a conversation-based email system

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.

Labeling messages of conversations and snoozing labeled conversations in a conversation-based email system

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.

Method and apparatus for improving data transmission in router fabric cards through pseudo-synchronous data switching

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.

Method of link word synchronization

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.

Virtual egress packet classification at ingress

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.

Method and apparatus for intelligent sorting and process determination of data packets destined to a central processing unit of a router or server on a data packet network

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.

Growing community of inventors

San Jose, CA, United States of America

Russell R Tuck, Iii