Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-10-26
2009-02-10
Pham, Chi H. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S256000
Reexamination Certificate
active
07489689
ABSTRACT:
A system and method for scheduling resources utilizes a data structure that supports quick sorting to find a highest priority eligibility key. The data structure provides for guaranteed storage efficiency, supports insertion and deletion, and assures that the worst-case operation to maintain its properties after assertion is O(log N) where N is the number of active keys.
REFERENCES:
patent: 5781531 (1998-07-01), Charny
patent: 7293024 (2007-11-01), Bayliss et al.
patent: 2004/0008634 (2004-01-01), Rangarajan et al.
patent: 2004/0249803 (2004-12-01), Vankatachary et al.
patent: 2004/0267958 (2004-12-01), Reed et al.
patent: 2005/0243740 (2005-11-01), Chen et al.
patent: 2006/0095444 (2006-05-01), Nadj et al.
Valente, P., Extract GPS Simulation with Logarithmic Complexity, and its Application to an Optimally Fair Scheduler. SIGCOMM'04, Aug.-Sep. 2004, Portland OR, copyright 2004 [Valente continued] ACM 1-58113-862-8/04/0008.
Neubauer, P., B-Trees: Balanced Tree Data Structures, copyright 1999 Peter Neubauer, downloaded from the Internet: <http:www.bluewhite.org/btree/>.
Lynch William
Ma Sha
Cisco Technology Inc.
Hoang Thai D.
Krueger Charles E.
Pham Chi H.
LandOfFree
Method, system and apparatus for scheduling a large pool of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method, system and apparatus for scheduling a large pool of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method, system and apparatus for scheduling a large pool of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4078207