Multiplex communications – Communication techniques for information carried in plural... – Adaptive
Reexamination Certificate
2004-12-15
2008-11-25
Patel, Ajit G (Department: 2616)
Multiplex communications
Communication techniques for information carried in plural...
Adaptive
C370S412000
Reexamination Certificate
active
07457313
ABSTRACT:
The HPRR method uses “token bucket” rate classifiers to mark each individual packet as conforming or not conforming to a traffic specification for the flow. Flows are considered to be in a single service class. One such class is distinguished as a default “best effort” service class. Each service class is assigned a weight corresponding to its fraction of bandwidth granted to the class when all classes are active. The HPRR method allows a packet from a flow to be forwarded in one of two ways, either as part of its class's allocated bandwidth or as part of the “best effort” bandwidth. By always providing two paths for a flow to send its packets, a flow is always given its “fair share” of two different classes: its primary or configured class and the best effort class. An overbooked class will have each of its flows compete for the inadequate bandwidth allocated to the class, but because each flow can use the best effort bandwidth it also gets a fair share of that bandwidth to allow the classes bandwidth guarantees to be when other classes are inactive.
REFERENCES:
patent: 5050161 (1991-09-01), Golestani
patent: 5463620 (1995-10-01), Sriram
patent: 5748629 (1998-05-01), Caldara et al.
patent: 5781624 (1998-07-01), Mitra et al.
patent: 6094435 (2000-07-01), Hoffman et al.
patent: 6477144 (2002-11-01), Morris et al.
patent: 6560195 (2003-05-01), Basak et al.
patent: 6608816 (2003-08-01), Nichols
patent: 6647424 (2003-11-01), Pearson et al.
patent: 6654374 (2003-11-01), Fawaz et al.
patent: 6721325 (2004-04-01), Duckering et al.
patent: 6891835 (2005-05-01), Kalkunte et al.
patent: 2006/0007859 (2006-01-01), Kadambi et al.
patent: 0 790 726 (1997-08-01), None
Shreedhar M. et al., “Efficient Fair Queuing Using Deficit Round Robin”, Computer Communication Review, ACM, New York, NY, US, vol. 25, No. 4, Oct. 1, 1995, pp. 231-242, XP000541659, ISSN: 0146-4833.
MacGregor M.H. et al., “Deficits for bursty latency-critical flows: DRR++” Networks, 2000 (ICON 2000) Proceedings, IEEE International Conference On Sep. 5-8, 2000, Piscataway, NJ, USA, IEEE, Sep. 5, 2000, pp. 287-293, XP010514114, ISBN: 0-7695-0777-8.
General Instrument Corporation
Patel Ajit G
Wiener Stewart M.
LandOfFree
Hierarchical prioritized round robin (HPRR) 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 Hierarchical prioritized round robin (HPRR) scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical prioritized round robin (HPRR) scheduling will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4048879