Using burst tolerance values in time-based schedules

Details Using burst tolerance values in time-based schedules Using burst tolerance values in time-based schedules

2005-03-03

2011-12-13

Sefcheck, Gregory (Department: 2477)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C370S395400

Reexamination Certificate

active

08077618

ABSTRACT:
Schedules may use burst tolerance values to adjust the scheduling in a time-based schedule, such as, but not limited to, adjusting for accumulated but not used bandwidth, and/or adjusting eligibility of schedule entries. A best schedule item associated with an eligible schedule entry of a schedule is identified. Whether or not a particular schedule entry is eligible is typically determined based on the relationship of an associated timestamp with a current scheduling time, such as its timestamp being less than or equal to the current time. A burst tolerance time bound might also be used to allow certain priorities and/or types of items to be considered eligible if even its timestamp exceeds the current time by an amount, but less than or equal to the burst tolerance time bound. When a schedule entry which has been dormant becomes active, its one or more timestamps are typically initialized, which may include setting at least one of these timestamps behind current time by a wakeup burst tolerance value to guarantee its immediate eligibility for one or more consecutive scheduling iterations.

REFERENCES:
patent: 5751708 (1998-05-01), Eng et al.
patent: 5844890 (1998-12-01), Delp et al.
patent: 5850399 (1998-12-01), Ganmukhi et al.
patent: 5864540 (1999-01-01), Bonomi et al.
patent: 5864557 (1999-01-01), Lyons
patent: 5892766 (1999-04-01), Wicki et al.
patent: 6064650 (2000-05-01), Kappler et al.
patent: 6130878 (2000-10-01), Charny
patent: 6337851 (2002-01-01), Charny et al.
patent: 6389019 (2002-05-01), Fan et al.
patent: 6408005 (2002-06-01), Fan et al.
patent: 6412000 (2002-06-01), Riddle et al.
patent: 6438134 (2002-08-01), Chow et al.
patent: 6449650 (2002-09-01), Westfall et al.
patent: 6469982 (2002-10-01), Henrion et al.
patent: 6477168 (2002-11-01), Delp et al.
patent: 6483839 (2002-11-01), Gemar et al.
patent: 6532213 (2003-03-01), Chiussi et al.
patent: 6560230 (2003-05-01), Li et al.
patent: 6643293 (2003-11-01), Carr et al.
patent: 6691312 (2004-02-01), Sen et al.
patent: 6836475 (2004-12-01), Chaskar et al.
patent: 6876952 (2005-04-01), Kappler et al.
patent: 7190674 (2007-03-01), Kobayakawa et al.
patent: 2001/0001608 (2001-05-01), Parruck et al.
patent: 2003/0050954 (2003-03-01), Tayyar et al.
patent: 2003/0123449 (2003-07-01), Kuhl et al.
patent: 2003/0142692 (2003-07-01), Shimada
patent: 2003/0202517 (2003-10-01), Kobayakawa et al.
patent: 2004/0177087 (2004-09-01), Wu et al.
patent: 2004/0184460 (2004-09-01), Milway et al.
patent: 2005/0243853 (2005-11-01), Bitar et al.
patent: 2005/0249220 (2005-11-01), Olsen et al.
H. Jonathan Chao, Y. Jeng, X. Guo, C. Lam; “Design of Packet-Fair Queuing Schedulers Using a RAM-Based Searching Engine”; IEEE Journal of Selected Areas in Communications, vol. 17, No. 6, Jun. 1999, pp. 1105-1126.
J. Bennett, H. Zhang, “Hierarchical Packet Fair Queuing Algorithms”, IEEE/ACM Transactions on Networking, vol. 5, No. 5, Oct. 1997.
U.S. Appl. No. 10/758,547, filed Jan. 14, 2004, Charny et al.
U.S. Appl. No. 10/422,167, filed Apr. 24, 2003, Kappler et al.
U.S. Appl. No. 11/022,246, filed Dec. 23, 2004, Cohen et al.
U.S. Appl. No. 10/913,055, filed Aug. 5, 2004, Cohen et al.
U.S. Appl. No. 11/022,220, filed Dec. 23, 2004, Shoham et al.
Bennett et al., “Hierarchical Packet Fair Queueing Algorithms,” IEEE/ACM Transactions on Networking (TON), vol. 5, Issue 5, Oct. 1997, pp. 675-689.
Hou et al., “Service Disciplines for Guaranteed Performance Service,” Proceedings—Fourth International Workshop on Real-Time Computing Systems and Applications, Oct. 27-29, 1997, pp. 244-250, Taipei.
Hagai et al., “Multiple Priority, Per Flow, Dual GCRA Rate Controller for ATM Switches,” Electrical and Electronic Engineers in Israel, 2000. The 21st IEEE Convention, Apr. 11-12, 2000, pp. 479-482, Tel-Aviv, Israel.
Kim et al., “Three-level Traffic Shaper and its Application to Source Clock Frequency Recovery for VBR Services in ATM Networks,” IEEE/ACM Transaction on Networking (TON), vol. 3, Issue 4, Aug. 1995, pp. 450-458.
Dixit et al., “Traffic Descriptor Mapping and Traffic Control for Frame Relay Over ATM Network,” IEEE/ACM Transactions on Networking (TON), vol. 6, Issue 1, Feb. 1998, pp. 56-70.
Bennett et al., “WF2Q: Worst-case Fair Weighted Fair Queueing,” INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies Networking the Next Generation. Proceedings IEEE. Mar. 24-28, 1996, vol. 1, pp. 120-128.
Bennett et al., “High-Speed, Scalable, and Accurate Implementation of Fair Queueing Algorithms in ATM Networks,” ICNP '97, http://www-2.cs.cmu.edu/˜hzhang/papers/ICNP97.pdf, 1997.
“Modular QoS CLI (MQC) Three-Level Hierarchical Policer”, Cisco Systems, Inc., San Jose, CA, Oct. 1, 2004.
A. Ioannou & M. Katevenis, Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High-Speed Networks, 2001, IEEE, 0-7803-7097, pp. 2043-2047.

Affiliated with

Also associated with

Rating

Using burst tolerance values in time-based schedules does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Using burst tolerance values in time-based schedules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using burst tolerance values in time-based schedules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4268154