Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2001-07-05
2008-08-19
Jung, David Y (Department: 2134)
Data processing: database and file management or data structures
Database design
Data structure types
C709S230000, C709S223000
Reexamination Certificate
active
07415477
ABSTRACT:
A method and apparatus for selecting a queue for service across a shared link. The method includes determining a priority for each queue (202) within a plurality of ingresses (102), wherein the priority is instantaneous for a given timeslot for data transfer, selecting a queue having a first priority for each group of queues within each ingress (104) having packets destined for a particular egress (104), selecting a queue having a second priority for each subset of queues having first priorities and having packets destined for the particular egress (104), and selecting the queue having the second priority for service across the shared link in the given timeslot.
REFERENCES:
patent: 5963557 (1999-10-01), Eng
patent: 6064651 (2000-05-01), Rogers et al.
patent: 6064677 (2000-05-01), Kappler et al.
patent: 2003/0086424 (2003-05-01), Tsubota
patent: 2003/0135449 (2003-07-01), Xu et al.
patent: 2004/0081184 (2004-04-01), Magill et al.
patent: 2005/0025141 (2005-02-01), Chao et al.
Priority queues and sorting methods for parallel simulation Grammatikakis, M.D.; Liesche, S.; Software Engineering, IEEE Transactions on vol. 26, Issue 5, May 2000 pp. 401-422.
On packet marking at priority queues Gibbens, R.J.; Kelly, F.P.; Automatic Control, IEEE Transactions on vol. 47, Issue 6, Jun. 2002 pp. 1016-1020.
Load balancing of multipath source routing in ad hoc networks Linifang Zhang; Zenghua Zhao; Yantai Shu; Lei Wang; Yang, O.W.W.; Communications, 2002. ICC 2002. IEEE International Conference on vol. 5, Apr. 28-May 2, 2002 pp. 3197-3201 vol. 5.
A policy based networking architecture for enterprise networks Nomura, Y.; Chugo, A.; Adachi, M.; Toriumi, M.; Communications, 1999. ICC '99. 1999 IEEE International Conference on vol. 1, Jun. 6-10, 1999 pp. 636-640 vol. 1.
Load-balanced routing and scheduling for real-time traffic in packet-switch networks Sangman Bak; Cheng, A.M.K.; Cobb, J.A.; Leiss, E.L.; Local Computer Networks, 2000. LCN 2000. Proceedings. 25th Annual IEEE Conference on Nov. 8-10, 2000 pp. 634-643.
Queueing in high-performance packet switching Hluchyj, M.G.; Karol, M.J.; Selected Areas in Communications, IEEE Journal on vol. 6, Issue 9, Dec. 1988 pp. 1587-1597.
Priority queues and sorting methods for parallel simulation Grammatikakis, M.D.; Liesche, S.; Software Engineering, IEEE Transactions on vol. 26, Issue 5, May 2000 pp. 401-422.
Dynamic queue length thresholds for shared-memory packet switches Choudhury, A.K.; Hahne, E.L.; Networking, IEEE/ACM Transactions on vol. 6, Issue 2, Apr. 1998 pp. 130-140.
Balakrishnan Hari
Devadas Srinivas
Rosenband Daniel
Broadcom Corporation
Jung David Y
Sterne Kessler Goldstein & Fox p.l.l.c.
LandOfFree
Method and apparatus for allocating link bandwidth 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 and apparatus for allocating link bandwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for allocating link bandwidth will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4011065