Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2002-04-26
2008-03-11
Orgad, Edan (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S412000
Reexamination Certificate
active
07342929
ABSTRACT:
An improved network device that controls throughput of packets received thereby, e.g., to downstream devices or to downstream logic contained within the same network device. The network device comprises a scheduler that schedules one or more packets of a selected class for throughput as a function of a weight of that class and weights of one or more other classes. The weight of at least the selected class is dynamic and is a function of a history of volume of packets received by the network device in the selected class. An apparatus for protecting against overload conditions on a network, e.g., of the type caused by DDoS attacks, has a scheduler and a token bucket mechanism, e.g., as described above. Such apparatus can also include a plurality of queues into which packets of the respective classes are placed on receipt by the apparatus. Those packets are dequeued by the scheduler, e.g., in the manner described above, for transmittal to downstream devices (e.g., potential victim nodes) on the network.
REFERENCES:
patent: 5689508 (1997-11-01), Lyles
patent: 5905730 (1999-05-01), Yang et al.
patent: 5917822 (1999-06-01), Lyles et al.
patent: 5956340 (1999-09-01), Afek et al.
patent: 6041059 (2000-03-01), Joffe et al.
patent: 6072800 (2000-06-01), Lee
patent: 6134217 (2000-10-01), Stiliadis et al.
patent: 6182142 (2001-01-01), Win et al.
patent: 6208652 (2001-03-01), Stephens et al.
patent: 6215769 (2001-04-01), Ghani et al.
patent: 6862265 (2005-03-01), Appala et al.
patent: 6862291 (2005-03-01), Talpade et al.
patent: 6975638 (2005-12-01), Chen et al.
patent: 7058974 (2006-06-01), Maher et al.
patent: 2001/0012272 (2001-08-01), Aubert et al.
patent: 2002/0097726 (2002-07-01), Garcia-Luna-Aceves et al.
patent: 2002/0114334 (2002-08-01), Yang
patent: 2005/0175014 (2005-08-01), Patrick
patent: WO 02/33870 (2002-04-01), None
Bennett, J.C.R. et al. “Hierarchical Packet Fair Queueing Algorithms.”, IEEE (Oct. 1997).
Bennett, J.C.R. et al. “High Speed, Scalable, and Accurage Implementation of Fair Queueing Algorithms in ATM Networks.”, ICNP (1997).
Bennett, J.C.R. et al. “WF2Q: Worst-case Fair Weighted Fair Queueing.”, Infocom'96.
Chiussi, F.M. et al. “Implementing Fair Queueing in ATM Switches: The Discrete-Rate Approach.”, IEEE'1997.
Chiussi, F.M. et al. “Minimum-Delay Self-Clocked Fair Queueing Algorithm for Packet-Switched Networks.”,IEEE 1998.
Demers, A. et al. “Analysis and Simulation of a Fair Queueing Algorithm,” © 1989 Association for Computing Machinery.
Eckhardt, D.A. et al. “Effort-limited Fair (ELF) Scheduling for Wireless Networks,” IEEE Infocom 2000.
Golestani, S.J. “Network Delay Analysis of a Class of Fair Queueing Algorithms,” IEEE Journal on Selected Areas in Communications, vol. 13 No. 6 (Aug. 1995) pp. 1057-1070.
Golestani, S.J. “A Self-Clocked Fair Queueing Scheme for Broadband Applications,” IEEE © 1994 pp. 5c.1.1-5c1.11.
Greenberg, Albert G. et al. “How Fair is Fair Queuing?” Journal of the Association for Computing Machinery vol. 39 No. 3 (Jul. 1992) pp. 568-598.
Parekh, A.K.J. “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks,” Ph.D. Dissertation Massachusetts Institute of Technology (Feb. 1992).
Parekh, A.K. et al. “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case,” IEEE/ACM Transactions on Networking vol. 2 No. 2 (Apr. 1994) pp. 137-150.
Parekh, A.K. et al. “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Transactions on Networking vol. 1, No. 3 (Jun. 1993) pp. 344-357.
“Quality of Service Networking,” downloaded from the web (address: http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito—doc/qos.htm) © Cisco Systems, Inc., 1999.
Rexford, J.L. et al. “Hardware-Efficient Fair Queueing Architectures for High-Speed Networks,” IEEE © 1996 pp. 5d.2.1-5d.2.9.
Shreedhar M. et al. “Efficient Fair Queuing Using Deficit Round-Robin,” IEEE/ACM Transactions on Networking vol. 4 No. 3 (Jun. 1996) pp. 375-385.
Stiliadis, D. et al. “Frame-based Fair Queueing: A New Traffic Scheduling Algorithm for Packet-Switched Networks,” (Jul. 18, 1995) pp. 1-43.
U.S. Appl. No. 09/929,877, filed Aug. 14, 2001, entitled: “Method and apparatus for protecting against overloaded conditions on nodes of a distributed network”.
U.S. Appl. No. 60/286,943, filed Apr. 27, 2001, entitled: “Weighted-fair queuing based apparatus for defending against distributed denial of service attacks”.
Afek Yehuda
Bremler-Barr Anat
Horvitz Keren
Touitou Dan
Tzadikario Rephael
Cisco Technology Inc.
Kligler Daniel J.
Orgad Edan
Park Jung
Powsner David J.
LandOfFree
Weighted fair queuing-based methods and apparatus for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Weighted fair queuing-based methods and apparatus for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted fair queuing-based methods and apparatus for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3971840