Scheduling the dispatch of cells in non-empty virtual output...

Details Scheduling the dispatch of cells in non-empty virtual output... Scheduling the dispatch of cells in non-empty virtual output...

2011-08-09

2011-08-09

Jain, Raj K (Department: 2472)

Multiplex communications

Pathfinding or routing

Through a circuit switch

C370S351000, C370S231000, C370S360000, C370S361000, C379S271000, C379S272000

Reissue Patent

active

RE042600

ABSTRACT:
A pipeline-based matching scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with matching schemes, such as CRRD and CMSD. In the new approach, arbitration may operate in a pipelined manner. Each sub-scheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides a matching result(s). The sub-scheduler can use a matching scheme such as CRRD and CMSD.

REFERENCES:
patent: 5367520 (1994-11-01), Cordell
patent: 5495474 (1996-02-01), Olnowich et al.
patent: 5495476 (1996-02-01), Kumar
patent: 5689506 (1997-11-01), Chiussi et al.
patent: 5889775 (1999-03-01), Sawicz et al.
patent: 6061330 (2000-05-01), Johansson
patent: 6072772 (2000-06-01), Charny et al.
patent: 6078585 (2000-06-01), Kakuma et al.
patent: 6125112 (2000-09-01), Koning et al.
patent: 6141323 (2000-10-01), Rusu et al.
patent: 6154459 (2000-11-01), Wicklund
patent: 6157643 (2000-12-01), Ma
patent: 6285679 (2001-09-01), Dally et al.
patent: 6295295 (2001-09-01), Wicklund
patent: 6324165 (2001-11-01), Fan et al.
patent: 6473428 (2002-10-01), Nichols et al.
patent: 6477169 (2002-11-01), Angle et al.
patent: 6563837 (2003-05-01), Krishna et al.
patent: 6625121 (2003-09-01), Lau et al.
patent: 6657959 (2003-12-01), Chong et al.
patent: 6661773 (2003-12-01), Pelissier et al.
patent: 6687225 (2004-02-01), Kawarai et al.
patent: 6725267 (2004-04-01), Hoang
patent: 6747971 (2004-06-01), Hughes et al.
patent: 6795442 (2004-09-01), Clayton et al.
patent: 6810031 (2004-10-01), Hegde et al.
patent: 6816487 (2004-11-01), Roberts et al.
patent: 6940851 (2005-09-01), Oki et al.
patent: 6959002 (2005-10-01), Wynne et al.
patent: 6977935 (2005-12-01), Kamiya et al.
patent: 6987732 (2006-01-01), Gracon et al.
patent: 6999413 (2006-02-01), Moriwaki et al.
patent: 7006514 (2006-02-01), Oki et al.
patent: 7023840 (2006-04-01), Golla et al.
patent: 7042883 (2006-05-01), Fan et al.
patent: 7046661 (2006-05-01), Oki et al.
patent: 7065046 (2006-06-01), Andrews et al.
patent: 7103056 (2006-09-01), Chao et al.
patent: 7154885 (2006-12-01), Nong
patent: 7158528 (2007-01-01), Dell et al.
patent: 7173931 (2007-02-01), Chao
patent: 7277428 (2007-10-01), Libeskind
patent: 7292576 (2007-11-01), Yasukawa et al.
patent: 7339935 (2008-03-01), Yasukawa et al.
patent: 7492782 (2009-02-01), Jun et al.
patent: 7519065 (2009-04-01), Angle et al.
patent: 2001/0023469 (2001-09-01), Jeong et al.
patent: 2002/0061020 (2002-05-01), Chao et al.
patent: 2002/0110134 (2002-08-01), Gracon et al.
patent: 2002/0131412 (2002-09-01), Shah et al.
patent: 2002/0141427 (2002-10-01), McAlpine
patent: 2002/0176431 (2002-11-01), Golla et al.
patent: 2002/0181483 (2002-12-01), Oki et al.
patent: 2003/0007498 (2003-01-01), Angle et al.
patent: 2003/0021266 (2003-01-01), Oki et al.
patent: 2004/0081184 (2004-04-01), Magill et al.
patent: 2004/0120321 (2004-06-01), Han et al.
patent: 2005/0053096 (2005-03-01), Yasukawa et al.
patent: 2005/0083939 (2005-04-01), Yasukawa et al.
McKeown, N. W., “Scheduling Algorithms for Input-Queued Cell Switches,” PhD Thesis, University of California at Berkeley, 1995.
United States Patent and Trademark Office: Non-Final Office Action dated Jul. 13, 2005, U.S. Appl. No. 09/851,461.
United States Patent and Trademark Office: Non-Final Office Action dated Nov. 19, 2004, U.S. Appl. No. 09/851,461.
United States Patent and Trademark Office: Final Office Action dated Apr. 4, 2006, U.S. Appl. No. 09/851,461.
United States Patent and Trademark Office: Notice of Allowance dated Sep. 27, 2006, U.S. Appl. No. 09/851,461.
United States Patent and Trademark Office: Non-Final Office Action dated Mar. 8, 2005, U.S. Appl. No. 09/872,892.
United States Patent and Trademark Office: Final Office Action dated Oct. 7, 2005, U.S. Appl. No. 09/872,892.
United States Patent and Trademark Office: Notice of Allowance dated May 10, 2006, U.S. Appl. No. 09/872,892.
United States Patent and Trademark Office: Non-Final Office Action dated Oct. 28, 2004, U.S. Appl. No. 09/873,110.
United States Patent and Trademark Office: Notice of Allowance dated Jun. 21, 2005, U.S. Appl. No. 09/873,110.
United States Patent and Trademark Office: Non-Final Office Action dated Aug. 10, 2005, U.S. Appl. No. 09/911,038.
United States Patent and Trademark Office: Notice of Allowance dated Jan. 25, 2006, U.S. Appl. No. 09/911,038.
United States Patent and Trademark Office: Notice of Allowance dated Apr. 12, 2005, U.S. Appl. No. 09/911,044.
C. Y. Lee and A. Y. Oruç, “A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks,”IEEE Trans. on Parallel and Distributed Sys.,vol. 6, No. 3, pp. 329-334 (Mar. 1995).
T. T. Lee and S-Y Liew, “Parallel Routing Algorithms in Benes-Clos Networks,”Proc. IEEE INFOCOM '96,pp. 279-286 (1996).
N. McKeown, M. Izzard, A. Mekkittikul, W. Ellersick and M. Horowitz, “Tiny-Tera: A Packet Switch Core,”IEEE Micro.,pp. 26-33 (Jan.-Feb. 1997).
T. Chaney, J. A. Fingerhut, M. Flucke, J. S. Turner, “Design of a Gigabit ATM Switch,”Proc. IEEE INFOCOM'97,pp. 2-11 (Apr. 1997).
F. M. Chiussi, J. G. Kneuer, and V. P. Kumar, “Low-Cost Scalable Switching Solutions for Broadband Networking: The ATLANTA Architecture and Chipset,”IEEE Commun. Mag.,pp. 44-53 (Dec. 1997).
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).
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).
A, Smiljanić, R. Fan and G. Ramamurthy, “RRGS-Round-Robin Greedy Scheduling for Electronic/Optical Terabit Switches,”Global Telecommunications Conference-Globe-com '99,pp. 1244-1250 (May 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×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).
E. Oki, Z. Jing, R. Rojas-Cessa, J. Chao, “Concurrent Round-Robin Dispatching Scheme in a Clos-Network Switch,”IEEE ICC 2001,pp. 106-112 (Jun. 2001).
E. Oki, R. Rojas-Cessa and H. J. Chao, “PCRRD: A Pipeline-Based Concurrent Round-Robin Dispatching Scheme for Clos-Network Switches,” pp. 1-18.
A. Smiljanić, “Flexible Bandwidth Allocation in Terabit Packet Switches,” pp. 233-239.

Affiliated with

Also associated with

Rating

Scheduling the dispatch of cells in non-empty virtual output... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scheduling the dispatch of cells in non-empty virtual output..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling the dispatch of cells in non-empty virtual output... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2729820