Multiplex communications – Channel assignment techniques – Using time slots
Reexamination Certificate
2007-07-03
2007-07-03
Phunkulh, Bob A. (Department: 2616)
Multiplex communications
Channel assignment techniques
Using time slots
C370S412000, C370S235000
Reexamination Certificate
active
10206997
ABSTRACT:
A hierarchical round robin arbiter includes a first set of arbitration vectors, each associated with a plurality of requesters. A second arbitration vector includes one bit for each arbitration vector in the first set. The single bit informs the round robin arbiter if any of the requesters associated with the corresponding arbitration vector in the first set are requesting service. The round robin arbiter can determine whether one of a number of requesters is requesting service by examining the single bit in the arbitration vector.
REFERENCES:
patent: 5835491 (1998-11-01), Davis et al.
patent: 5883895 (1999-03-01), Davis et al.
patent: 5912889 (1999-06-01), Preas et al.
patent: 5949789 (1999-09-01), Davis et al.
patent: 6032218 (2000-02-01), Lewin et al.
patent: 6044061 (2000-03-01), Aybay et al.
patent: 6160812 (2000-12-01), Bauman et al.
Basu Debashis
Sindhu Pradeep
Su Edwin
Harrity & Snyder LLP
Juniper Networks, Inc.
Phunkulh Bob A.
LandOfFree
Hierarchical round robin arbiter 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 round robin arbiter, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical round robin arbiter will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3747212