Self-adaptive scheduling method and network element

Details Self-adaptive scheduling method and network element Self-adaptive scheduling method and network element

2011-03-29

2011-03-29

Patel, Haresh N (Department: 2454)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

C370S402000, C370S235000, C370S352000

Reexamination Certificate

active

07917648

ABSTRACT:
The present invention relates to a method and network element for scheduling data transmission in a packet data network, e.g. a differentiated services network. Data traffic of a predetermined traffic class is classified based on a predetermined traffic profile, e.g. responsive or non-responsive traffic, and an in-profile rate of the data traffic is estimated. Then, a weight determining a transmit order of queued data packets of said predetermined traffic class is adjusted according to the estimated in-profile rate. Thus, the data traffic is marked into different classes based on the traffic profile and a queue scheduler improves fairness between the classified flows in the packet data network. Thereby, enhanced fairness between traffic profiles can be achieved easily and effectively.

REFERENCES:
patent: 6748435 (2004-06-01), Wang et al.
patent: 6914883 (2005-07-01), Dharanikota
patent: 6939321 (2005-09-01), Wang et al.
patent: 6975638 (2005-12-01), Chen et al.
patent: 7082102 (2006-07-01), Wright
patent: 7085236 (2006-08-01), Oldak et al.
patent: 7139281 (2006-11-01), Bodin
patent: 2002/0087715 (2002-07-01), De Cnodder et al.
patent: 2002/0089985 (2002-07-01), Wahl et al.
patent: 2003/0086140 (2003-05-01), Thomas et al.
patent: 2003/0214954 (2003-11-01), Oldak et al.
patent: 2006/0039364 (2006-02-01), Wright
patent: 2007/0087715 (2007-04-01), Mimura et al.
patent: 2007/0109968 (2007-05-01), Hussain et al.
patent: 2007/0127382 (2007-06-01), Hussain et al.
patent: 1 187 404 (2002-03-01), None
patent: 2 338 372 (1999-12-01), None
patent: WO 01/28169 (2001-04-01), None
patent: WO 01/74027 (2001-10-01), None
RFC 2697, A Single Rate Three Color Marker, p. 1 through 9, Sep. 1999.
David D. Clark and Wenjia Fang, “Explicit Allocation of Best-Effort Packet Delivery Service,” IEEE/ACM Transactions on Networking, vol. 6, No. 4, Aug. 1998, pp. 362-373, IEEE, USA.
S. Blake, et al., Network Working Group, Request for Comments: 2475, “An Architecture for Differentiated Services,” Date of Memo: Dec. 1998, pp. 1-36, Retrieved from Internet: <ietf.org/rfc/rfc2475.txt> on May 13, 2009.
Sally Floyd and Kevin Fall, “Promoting the Use of End-to-End Congestion Control in the Internet,” IEEE/ACM Transactions on Networking, May 3, 1999, pp. 1-16.
J. Heinanen, et al., Network Working Group, Request for Comments: 2597, “Assured Forwarding PHB Group,” Date of Memo: Jun. 1999, pp. 1-11, Retrieved from Internet: <ietf.org/rfc/rfc2597.txt> on May 13, 2009.
V. Jacobson, et al., Network Working Group, Request for Comments: 2598, “An Expedited Forwarding PHB,” Date of Memo: Jun. 1999, pp. 1-11, Retrieved from Internet: <ietf.org/rfc/rfc2598.txt> on May 13, 2009.
J. Heinanen, et al., Network Working Group, Request for Comments: 2698, “A Two Rate Three Color Marker,” Date of Memo: Sep. 1999, pp. 1-5, Retrieved from Internet: <ietf.org/rfc/rfc2698.txt> on May 13, 2009.
Sally Floyd, et al., “Equation-Based Congestion Control for Unicast Applications,” SIGCOMM 2000, May 2000, pp. 1-14.

Affiliated with

Also associated with

Rating

Self-adaptive scheduling method and network element does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Self-adaptive scheduling method and network element, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-adaptive scheduling method and network element will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2692475