Packet forwarding

Multiplex communications – Data flow congestion prevention or control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S232000, C370S230000

Reexamination Certificate

active

07907519

ABSTRACT:
Packet forwarding apparatus has an input for receiving packets; a packet classifier arranged in operation to read a class indication in received packets and in dependence thereon to pass packets to a class-based policer associated with the class indicated; a plurality of class-based policers, each operable to assign a provisional indication to packets of the associated class in response to a measure of the load presented by packets of the class exceeding a predetermined class-based threshold; a multi-class policer operable to receive provisionally-indicated packets processed by the class-based policers, and to assign a congestion indication to packets having the provisional indication in response to congestion arising at the packet forwarding apparatus; and an output for presenting packets processed by the multi-class policer for onward transmission from the apparatus.

REFERENCES:
patent: 5751969 (1998-05-01), Kapoor
patent: 6144636 (2000-11-01), Aimoto et al.
patent: 6657962 (2003-12-01), Barri et al.
patent: 7284047 (2007-10-01), Barham
patent: 2004/0136379 (2004-07-01), Liao et al.
patent: 2005/0041587 (2005-02-01), Lee
patent: 1317151 (2003-06-01), None
patent: 2281005 (1995-02-01), None
patent: WO 03/010909 (2003-02-01), None
patent: WO 03010909 (2003-02-01), None
Wang et al, “A Random Early Demotion and Promotion Marker for Assured Services” Michigan State university, {wangfugu, prasant}@cse.msu.edu, Apr. 13, 2000.
International Search Report for PCT/GB2006/000163 mailed Mar. 27, 2006.
Heinanen et al., “A Two Rate Three Color Marker; rfc2698.txt,” IETF Standard, Internet Engineering Task Force, Switzerland, Sep. 1999, XP015008481.
Wang et al., “A Random Early Demotion and Promotion Marker for Assured Services,” IEEE Journal of Selected Areas in Communications, vol. 18, No. 12, Dec. 2005, pp. 2640-2650, XP009063635.
Blake et al., “An Architecture for Differentiated Services; rfc2475.txt,” IETF Standard, Internet Engineering Task Force, Switzerland, Dec. 1998, XP015008259.
Floyd et al., “Random Early Detection Gateways for Congestion Avoidance,” IEEE/ACM Transactions on Networking, vol. 1, No. 4, Aug. 1, 1993, pp. 397-413, XP000415363.
Karsten et al., “Admission Control based on Packet Marking and Feedback Signalling—Mechanisms, Implementation and Experiments,” Multimedia Communications, May 2002, XP002247632.
Nahm et al., “Enhanced Service Differentiation for Layered Video Multicast in Differentiated Service Networks,” Visual Communications and Image Processing, vol. 4671, 2002, pp. 46-57, XP009063153.
International Search Report mailed Mar. 27, 2006 in International Application No. PCT/GB2006/000163.
UK Search Report dated Jun. 8, 2005 in Application No. GB 0501841.1.
Henderson et al., “Congestion Pricing. Paying Your Way in Communication Networks,” IEEE Internet Computing, Sep./Oct. 2001, pp. 85-89.
Gibbens et al., “A Decision-Theoretic Approach to Call Admission Control in ATM Networks,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 6, Aug. 1995, pp. 1101-1114.
Bianchi et al., “Endpoint Admission Control with Delay Variation Measurements for QoS in IP Networks,” ACM SIGCOMM Computer Communications Review, vol. 32, No. 2, Apr. 2002, pp. 61-69.
Heinanen et al. “A Two Rate Three Color Marker,” Network Working Group, RFC 2698, Sep. 1999, pp. 1-5.
Floyd et al., “Random Early Detection Gateways for Congestion Avoidance,” IEEE/ACM Transactions on Networking, vol. 1, No. 4, Aug. 1993, pp. 397-413.
Karsten et al., “Admission Control Based on Packet Marking and Feedback Signalling—Mechanisms, Implementation and Experiments,” Darmstadt University of Technology, KOM Technical Report TUD-KOM 2002-03, May 2002, pp. 1-17.
Nahm et al., “Enhanced Service Differentiation for Layered Video Multicast in Differentiated Service Networks,” Visual Communications and Image Processing, vol. 4671, 11 pages.
Gibbens et al., “Distributed Connection Acceptance Control for a Connectionless Network,” 16 International Teletraffic Congress in Edinburgh, Jun. 1999, 12 pages.
Wang et al., “A Random Early Demotion and Promotion Marker for Assured Services,” IEEE Journal of Selected Areas in Communications, vol. 18, No. 12, Dec. 2005, pp. 1-23.
M3I, EU Vth Framework Project IST-1999-11429, 5 pages.
Ramakrishnan et al., “The Addition of Explicit Congestion Notification (ECN) to IP,” Standards Track, RFC 3168, Sep. 2001, pp. 1-63.
Kunniyur et al., “Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management,” SIGCOMM'01, San Diego, California, Aug. 27-31, 2001, pp. 123-134.
Floyd, “Comments on Measurement-based Admissions Control for Controlled-Load Services,” CCR, Technical Report, Jul. 1996, pp. 1-16.
Gibbens et al., “Resource Pricing and the Evolution of Congestion Control,” Automatica 35, 1999, pp. 1-35.
Cetinkaya et al., “Egress Admission Control,” In Proceedings of IEEE INFOCOM 2000, vol. 3, Mar. 2000, 10 pages.
Jamin et al., “A Measurement-based Admission Control Algorithm for Integrated Services Packet Networks (Extended Version),” Dec. 13, 1995, pp. 1-38.
Blake et al., “An Architecture for Differentiated Services,” Network Working Group, RFC 2475, Dec. 1998, pp. 1-36.
A.S. Tanenbaum, “Computer Networks”, Third Edition, pp. 379-384. Prentice-Hall (1996).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Packet forwarding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Packet forwarding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet forwarding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2649830

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.