Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2011-04-26
2011-04-26
Pham, Brenda (Department: 2464)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S235000
Reexamination Certificate
active
07933204
ABSTRACT:
The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.
REFERENCES:
patent: 5748614 (1998-05-01), Wallmeier
patent: 6438134 (2002-08-01), Chow et al.
patent: 6975638 (2005-12-01), Chen et al.
patent: 7342929 (2008-03-01), Bremler-Barr et al.
patent: 2003/0088690 (2003-05-01), Zuckerman et al.
patent: 2003/0095551 (2003-05-01), Gotoh et al.
patent: 1478140 (2004-11-01), None
Kortebi, et al. “Cross-Protect: Implicit Service Differentiation and Admission Control”, IEEE HPSR 2004, p. 1-5, Apr. 2004, XP002354320.
Kortebi, et al., “On the Scalability of Fair Queueing”, ACM Hotnets-Ill, Nov. 2004, XP002354321.
Bennet, et al., “High Speed, Scalable, and Accurate Implementation of Packet Fair Queueing Algorithms in ATM Networks”, IEEE, p. 7-14, 1997.
Shreedhar, et al., “Efficient Fair Queuing Using Deficit Round Robin”, ACM, SIGCOMM Cambridge, MA, p. 231-242, 1995.
Goyal, et al., “Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks”, IEEE/ACM Transaction Networking, vol. 5, No. 5, p. 690-704, Oct. 1997.
Estan, et al., “New Directions in Traffic Measurement and Accounting”, ACM, SIGCOMM, Pittsburgh, PA Aug. 19-23, 2002.
Bloom, B. H., “Space/Time Trade-offs in Hash Coding with Allowable Errors”, Communication of the ACM, Computer Usage Company, Newton Upper Falls, MA, vol. 13, No. 7, 422-426, Jul. 1990.
Kortebi Abdesselem
Muscariello Luca
Roberts James
France Telecom
McKenna Long & Aldridge LLP
Pham Brenda
LandOfFree
Method for organizing packets belonging to streams, and... 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 organizing packets belonging to streams, and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for organizing packets belonging to streams, and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2729062