Pipelined maximal-sized matching cell dispatch scheduling

Details Pipelined maximal-sized matching cell dispatch scheduling Pipelined maximal-sized matching cell dispatch scheduling

2006-02-28

2006-02-28

Phunkulh, Bob (Department: 2661)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

C370S429000, C370S395400

Reexamination Certificate

active

07006514

ABSTRACT:
A Pipelined-based Maximal-sized Matching (PMM) scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration may operate in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic.

REFERENCES:
patent: 6061330 (2000-05-01), Johansson
patent: 6072772 (2000-06-01), Charny et al.
patent: 6141323 (2000-10-01), Rusu et al.
patent: 6295295 (2001-09-01), Wicklund
patent: 6324165 (2001-11-01), Fan et al.
patent: 6657959 (2003-12-01), Chong et al.
patent: 6687225 (2004-02-01), Kawarai et al.
patent: 6725267 (2004-04-01), Hoang
patent: 6795442 (2004-09-01), Clayton et al.
patent: 2001/0023469 (2001-09-01), Jeong et al.
patent: 2002/0110134 (2002-08-01), Gracon et al.
patent: 2002/0122428 (2002-09-01), Fan et al.
patent: 2002/0136230 (2002-09-01), Dell et al.
patent: 2002/0176431 (2002-11-01), Golla et al.
patent: 2003/0007498 (2003-01-01), Angle et al.
patent: 2003/0031193 (2003-02-01), Andrews et al.
patent: 2004/0120321 (2004-06-01), Han et al.
J. Turner and N. Yamanaka, “Architectural Choices in Large Scale ATM Switches”,IEICE Trans. Commun., vol. E81-B, No. 2, pp. 120-137 (Feb. 1998).
H. J. Chao and J-S Park, “Centralized Contention Resolution Schemes for a Large-Capacity Optical ATM Switch”,Proc. IEEE ATM Workshop '97, pp. 11-16 (Fairfax, VA, May 1998).
A. Smiljanić, R. Fan and G. Ramamurthy, “RRGS-Round-Robin Greedy Scheduling for Electronic/Optical Terabit Switches”,Global Telecommunications Conference—Globecom '99, pp. 1244-1250 (May 1999).
G. Nong, J. K. Muppala and M. Hamdi, “Analysis of Nonblocking ATM Switches with Multiple Input Queues”,IEEE/ACM Transactions on Networking, vol. 7, No. 1, pp. 60-74 (Feb. 1999).
N. McKeown, “The iSLIP Scheduling Algorithm for Input-Queued Switches”,IEEE/ACM Transactions on Networking, vol. 7, No. 2, pp. 188-201 (Apr. 1999).
N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100% Throughput in an Input-Queued Switch”,IEEE Trans. on Communications, vol. 47, No. 8, pp. 1260-1267 (Aug. 1999).
E. Oki, N. Yamanaka, Y. Ohtomo, K. Okazaki and R. Kawano, “A 10-Gb/s (1.25 Gb/s x 8) 4×2 0.25-μm CMOS/SIMOX ATM Switch Based on Scalable Distributed Arbitration”,IEEE J. of Solid-State Circuits, vol. 34, No. 12, pp. 1921-1934 (Dec. 1999).
N. Yamanaka, E. Oki, S. Yasukawa, R. Kawano and K. Okazaki, “OPTIMA: Scalable, Multi-Stage, 640-Gbit/s ATM Switching System Based on Advanced Electronic and Optical WDM Technologies”,IEICE Trans. Commun., vol. E83-B, No. 7, pp. 1488-1496 (Jul. 2000).
J. Chao, “Saturn: A Terabit Packet Switch Using Dual Round-Robin”,IEEE Communications Magazine, pp. 78-84 (Dec. 2000).
G. Nong and M. Hamdi, “On the Provision of Quality-of-Service Guarantees for Input Queued Switches”,IEEE Commun. Mag., pp. 62-69 (Dec. 2000).
A. Smiljanic, “Flexible Bandwidth Allocation in Terabit Packet Switches”, pp. 233-239.

Affiliated with

Also associated with

Rating

Pipelined maximal-sized matching cell dispatch scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Pipelined maximal-sized matching cell dispatch scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pipelined maximal-sized matching cell dispatch scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3690530