Multiplex communications – Pathfinding or routing – Store and forward
Reexamination Certificate
2003-12-24
2008-10-07
Vu, Huy D. (Department: 2616)
Multiplex communications
Pathfinding or routing
Store and forward
C370S235000, C370S412000, C370S428000
Reexamination Certificate
active
07433364
ABSTRACT:
Techniques for optimizing queuing performance include passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager, and determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.
REFERENCES:
patent: 5319778 (1994-06-01), Catino
patent: 5488724 (1996-01-01), Firoozmand
patent: 5519701 (1996-05-01), Colmant et al.
patent: 5617537 (1997-04-01), Yamada et al.
patent: 5687316 (1997-11-01), Graziano et al.
patent: 5708779 (1998-01-01), Graziano et al.
patent: 5751951 (1998-05-01), Osborne et al.
patent: 5781799 (1998-07-01), Leger et al.
patent: 6005866 (1999-12-01), Lincoln
patent: 6049390 (2000-04-01), Notredame et al.
patent: 6131113 (2000-10-01), Ellsworth et al.
patent: 6201807 (2001-03-01), Prasanna
patent: 6356951 (2002-03-01), Gentry, Jr.
patent: 6389468 (2002-05-01), Muller et al.
patent: 6434170 (2002-08-01), Movshovich et al.
patent: 6453360 (2002-09-01), Muller et al.
patent: 6480489 (2002-11-01), Muller et al.
patent: 6483804 (2002-11-01), Muller et al.
patent: 6650640 (2003-11-01), Muller et al.
patent: 6687256 (2004-02-01), Modali et al.
patent: 6717576 (2004-04-01), Duluk et al.
patent: 6717910 (2004-04-01), Kasper et al.
patent: 6757756 (2004-06-01), Lanteigne et al.
patent: 6779084 (2004-08-01), Wolrich et al.
patent: 7051175 (2006-05-01), Vo
patent: 7149212 (2006-12-01), Calvignac et al.
patent: 7269179 (2007-09-01), Wolrich et al.
patent: 2004/0100954 (2004-05-01), Dai et al.
patent: 2004/0128401 (2004-07-01), Fallon et al.
patent: 2004/0205166 (2004-10-01), DeMoney
patent: 2004/0252687 (2004-12-01), Lakshmanamurthy et al.
patent: 2005/0038793 (2005-02-01), Romano et al.
patent: 2005/0050306 (2005-03-01), Lakshmanamurthy et al.
patent: 2005/0108718 (2005-05-01), Kumar et al.
patent: 2005/0120195 (2005-06-01), Kumar
patent: 2005/0129046 (2005-06-01), Kumar et al.
patent: 2005/0160139 (2005-07-01), Boucher et al.
patent: 2006/0039374 (2006-02-01), Belz et al.
patent: 2006/0064508 (2006-03-01), Panwar et al.
patent: 2006/0143415 (2006-06-01), Naik
patent: 2006/0221978 (2006-10-01), Venkatachalam
patent: 2007/0201497 (2007-08-01), Krishnamurthy
Maged M. Michael and Michael L. Scott, “Simple, Fast and Practical Non-Blocking Concurrent Queue Algorithms”, Proceedings of the 19thannual international symposium on Computer architecture, p. 224-235, May 23-26, 1996, Philadelphia, Pennsylvania, United States.
Adiletta, M., et al., “Packet over SONET: Achieving 10 Gigabit/sec Packet Processing with an IXP2800”,Intel Technology Journal, 6(3):29-39, Aug. 15, 2002.
Adiletta, M., et al., “The Next Generation of Intel IXP Network Processors”,Intel Technology Journal, 6(3):6-18, Aug. 15, 2002.
Brink, P., et al., “Network Processing Performance Metrics for the IA- and IXP-Based Systems”,Intel Technology Journal, 7(4):77-91, Nov. 14, 2003.
Lakshmanamurthy, S., et al., “Network Processor Performance Analysis Methodology”,Intel Technology Journal, 6(3):19-28, Aug. 15, 2002.
Vipat, H., et al., “Network Processor Building Blocks for All-IP Wireless Network”,Intel Technology Journal, 6(3):61-69, Aug. 15, 2002.
Chandra Prashant R.
Kumar Alok
Naik Uday
Romano David A.
Varde Ameya S.
Fish & Richardson P.C.
Intel Corporation
Phung Luat
Vu Huy D.
LandOfFree
Method for optimizing queuing performance 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 for optimizing queuing performance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for optimizing queuing performance will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4012835