Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-09-13
2005-09-13
Pham, Chi (Department: 2667)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S350000, C370S399000, C710S112000
Reexamination Certificate
active
06944172
ABSTRACT:
Provided are a system and method for time-based scheduling in a communications environment. In one example, the method includes assigning at least one token to each of multiple active queues during a predefined period of time. Each token authorizes an amount of data to be dequeued from the queue. The method also includes waiting until the end of the predefined period of time before starting a new round of assigning. At least one of the queues is nominated based on the token assigned to the queue, where the nomination authorizes the dequeuing of the amount of data from the queue. The nomination is sent to a memory system to dequeue the data and send the data to a network uplink.
REFERENCES:
patent: 5596576 (1997-01-01), Milito
patent: 5604742 (1997-02-01), Colmant et al.
patent: 5633867 (1997-05-01), Ben-Nun et al.
patent: 6182177 (2001-01-01), Harriman
patent: 6560230 (2003-05-01), Li et al.
patent: 6829649 (2004-12-01), Shorey et al.
patent: 6839321 (2005-01-01), Chiruvolu
Elias Paul Anthony
Jamieson Ross Alexander
Mezeul Michael Joseph
Roa-Diaz Marlon B.
Sankey Wayne Robert
Covaro Networks, Inc.
Haynes and Boone LLP
Jones Prenell
Pham Chi
LandOfFree
System and method for time-based scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for time-based scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for time-based scheduling will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3408641