Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2004-06-28
2008-11-25
Kizou, Hassan (Department: 2619)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S232000, C370S235000, C709S233000, C709S234000, C709S235000
Reexamination Certificate
active
07457247
ABSTRACT:
A system schedules traffic flows on an output port using a circular memory structure. The circular memory structure may be a rate wheel that includes a group of sequentially arranged slots. The rate wheel schedules the traffic flows in select ones of the slots based on traffic shaping parameters assigned to the flows. The rate wheel compensates for collisions between multiple flows that occur in the slots by subsequently skipping empty slots.
REFERENCES:
patent: 5579312 (1996-11-01), Regache
patent: 5751709 (1998-05-01), Rathnavelu
patent: 5926459 (1999-07-01), Lyles et al.
patent: 6256317 (2001-07-01), Holloway et al.
patent: 2002/0150047 (2002-10-01), Knight et al.
patent: 2003/0161291 (2003-08-01), Kramer et al.
patent: 2004/0062261 (2004-04-01), Zecharia et al.
patent: 2004/0187120 (2004-09-01), Moore et al.
U.S. Appl. No. 10/876,624, filed Jun. 28, 2004; entitled: “Priority Scheduling Using Per-Priority Memory Structures”; 46 pages.
U.S. Appl. No. 10/912,041; filed Aug. 6, 2004; entitled: “Hierarchical Shaping of Network Traffic”; 40 pages.
Harrity & Harrity LLP
Juniper Networks, Inc.
Kavleski Ryan C
Kizou Hassan
LandOfFree
Collision compensation in a scheduling system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Collision compensation in a scheduling system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Collision compensation in a scheduling system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4026750