Weighted longest queue first adaptive scheduling discipline for

Details Weighted longest queue first adaptive scheduling discipline for Weighted longest queue first adaptive scheduling discipline for

1997-08-18

2000-06-06

Kizou, Hassan

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

370465, 370230, 370235, H04L 1228

Patent

active

060728000

ABSTRACT:
Disclosed is a weighted longest queue first (WLQF) service discipline for ATM networks. The sources are classified so that sources in one class have the same cell loss probability requirement. For N classes of traffic the WLQF system has N buffers to store the traffic, wherein buffer i is assigned a positive number w.sub.i for the weight of buffer i. The scheduler transmits a cell from that buffer whose index maximizes w.sub.i Q.sub.i for i=1, 2, . . . ,N, where Q.sub.i is the queue length of buffer i at the moment when the scheduler makes a decision about which buffer to serve. Accordingly, the inventive system always serves the most congested buffer relative to the weighted queue lengths, and can adapt to temporary overload quickly. This feature ensures that in temporary overloads of one of the buffers, the overloaded buffer, receives almost all the service and therefore, losses due to buffer overflows and cell delay variation (CDV) are much small. Additionally, when a call is received, the system determines whether it can provide the requested QoS, and rejects the call if not.

REFERENCES:
patent: 5268900 (1993-12-01), Hluchyj et al.
patent: 5291481 (1994-03-01), Doshi et al.
patent: 5864538 (1999-01-01), Chong et al.
patent: 5864540 (1999-01-01), Bonomi et al.
patent: 5870629 (1999-02-01), Borden et al.
R.M. Loynes, "The Stability of a Queue with Non-Independent Inter-Arrival and Service Items," Nov. 1960, revised Jul. 1961, pp. 497-520.
J.W. Cohen, "A Two-Queue, One-Server Model with Priority for the Longer Queue," Queuing Systems 2(1987), pp. 261-283.
W. Szpankowski, "Stability Conditions for Multidimensional Queuing Systems with Computer Applications," Operations Research, vol. 36, No. 6 (Nov.-Dec. 1988), pp. 944-957.
S. Panwar, et al. "Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service," Journal of the Association for Computing Machinery, vol. 35, No. 4, Oct. 1988, pp. 832-844.
A. Demers, et al., "Analysis and Simulation of a Fair Queueing Algorithm" (1989), pp. 1-12.
L. Zhang, "VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks," ACM Transactions on Computer Systems, vol. 9, No. 2, May 1991, pp. 102-124.
R. Cruz, "A Calculus for Network Delay, Part I: Network Elements in Isolation," IEEE Transactions on Information Theory, vol. 37, No. 1, Jan. 1991, pp. 114-131.
R. Cruz, "A Calculus for Network Delay, Part II: Network Analysis," IEEE Transactions on Information Theory, vol. 37, No. 1, Jan. 1991, pp. 132-141.
S. Golestani, "Congestion-Free Communications in High-Speed Packet Networks," IEEE Transactions on Communications, vol. 39, No. 12, Dec. 1991, pp. 1802-1812.
H. Gail, et al., "Buffer Size Requirements Under Longest Queue First," Performance of Distributed Systems and Integrated Communication Networks, 1992, pp. 413-424.
A. Parekh, "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.
A. Parekh, "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.
O. Yaron, et al., "Generalized Processor Sharing Networks with Exponentially Bounded Burstiness Arrivals," 1994 IEEE, pp. 628-634.
T. Takine, et al., "An Analysis of a Discrete-Time Queue for Broadband ISDN with Priorities among Traffic Classes," IEEE Transactions on Communications, vol. 42, No. 2/3/4, Feb/Mar/Apr 1994, pp. 1837-1845.
S. Golestani, "A Self-Clocked Fair Queueing Scheme for Broadband Applications," 1994 IEEE, pp. 636-646.
Z. Zhang, et al., "Statistical Analysis of the Generalized Processor Sharing Scheduling Discipline," IEEE Journal on Selected Areas in Communications, vol. 13, No. 6, Aug. 1995, pp. 1071-1080.

Affiliated with

Also associated with

Rating

Weighted longest queue first adaptive scheduling discipline 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 longest queue first adaptive scheduling discipline for , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted longest queue first adaptive scheduling discipline for will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2220291