Programmable multi-service queue scheduler

Details Programmable multi-service queue scheduler Programmable multi-service queue scheduler

2006-08-29

2006-08-29

Phan, Man U. (Department: 2616)

Multiplex communications

Data flow congestion prevention or control

Control of data admission to the network

C370S252000, C370S412000

Reexamination Certificate

active

07099275

ABSTRACT:
A system and method for scheduling data utilizes a number of queues for receiving data. A programmable criteria table comprises a number of entries each associated with one of the queues. The entries of the criteria table comprise programmable traffic parameters selected to associate the queues with particular traffic characteristics governing a flow of data through the queues. A programmable mapping table maps each of the queues to one of the criteria table entries. The criteria table is programmable independently from the mapping table. A scheduling period timer produces epoch time signals that define scheduling time periods. The scheduling of queues changes between scheduling time periods in accordance with the traffic parameters associated with the queues. The scheduling time period is dynamically programmable. The traffic parameters are dynamically programmable to alter a scheduling prioritization of the queues.

REFERENCES:
patent: 5231633 (1993-07-01), Hluchyj et al.
patent: 5260935 (1993-11-01), Turner
patent: 5268900 (1993-12-01), Hluchyj et al.
patent: 5455825 (1995-10-01), Lauer et al.
patent: 5570360 (1996-10-01), Klausmeier et al.
patent: 5579312 (1996-11-01), Ragache
patent: 5629936 (1997-05-01), Lee et al.
patent: 5781531 (1998-07-01), Charny
patent: 5864540 (1999-01-01), Bonomi et al.
patent: 5870396 (1999-02-01), Abu-Amara et al.
patent: 5870629 (1999-02-01), Borden et al.
patent: 5923656 (1999-07-01), Duan et al.
patent: 6018527 (2000-01-01), Yin et al.
patent: 6021116 (2000-02-01), Chiussi et al.
patent: 6052375 (2000-04-01), Bass et al.
patent: 6067298 (2000-05-01), Shinohara
patent: 6072800 (2000-06-01), Lee
patent: 6104700 (2000-08-01), Haddock et al.
patent: 6108305 (2000-08-01), Charny et al.
patent: 6118761 (2000-09-01), Kalkunte et al.
patent: 6130878 (2000-10-01), Charny
patent: 6141355 (2000-10-01), Palmer et al.
patent: 6192406 (2001-02-01), Ma et al.
patent: 6430154 (2002-08-01), Hunt et al.
patent: 6728253 (2004-04-01), Jeffries et al.
patent: 6934294 (2005-08-01), Bertagna
patent: 6947996 (2005-09-01), Assa et al.
patent: 2001/0004362 (2001-06-01), Kamiya
patent: 2002/0075803 (2002-06-01), Zaharychuk et al.
patent: 2002/0141427 (2002-10-01), McAlpine
“Asynchronous Transfer Mode (ATM),” http://iwander.vlsi.uiuc.edu/abr/atmintro.html, printed Apr. 26, 2001, pp. 1-5.
“Introduction to ABR,” http://iwander.vlsi.uiuc.edu/abr/abrintro.html, printed Apr. 26, 2001, pp. 1-4.
“The Virtual Output Queue,” http://iwander.vlsi.uiuc.edu/abr/virtqueue.html, printed Apr. 26, 2001, pp. 1-7.
“Simulation Results,” http://iwander.vlsi.uiuc.edu/abr/simulation—results.html, printed Apr. 26, 2001, pp. 1-4.
“ABR Architecture And Simulation For an Input-Buffered And Per-VC Queued ATM Switch, ” Bossardt et al., Dept. of Electrical and Computer Engineering, Univ. of IL, Feb. 1998.
“Reinventing The Switch Fabric Architecture,” Communication System Design, http://www.csdmag.com/story/OEG20010521S0113, Jun. 1, 2001.
William Wong, “Network Processors Take The High Road . . . And The Low Road,” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6798, Retrieved Jun. 15, 2001, pp. 1-3.
“Network Processors Take The High Road . . . And The Low Road,” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6799 , Retrieved Jun. 15, 2001, pp. 1-2.
“Network Processors Take The High Road . . . And The Low Road,” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6800, Retrieved Mar. 7, 2002, 3 pgs.
“Network Processors Take The High Road . . . And The Low Road, ” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6802 , Retrieved Jun. 15, 2001, 1 pg.
“Network Processors Take The High Road . . . And The Low Road, ” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6804, Retrieved Jun. 15, 2001, 1 pg.
“Network Processors Take The High Road . . . And The Low Road,” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6806, Retrieved Jun. 15, 2001, 1 pg.
“Network Processors Take The High Road . . . And The Low Road,” Electronic Design, Jul. 10, 2000, http://www.planetee.com/planetee/servlet/DisplayDocument?ArticleID=6808, Retrieved Jun. 15, 2000, 1 pg.
“Products,” Applications, C-PORT, A Motorola Company, http://www.cportcorp.com/products/applications.htm, Retrieved Jan. 23, 2001, pp. 1-3.
“C-5™ Digital Communications Processor,” C-PORT, A Motorola Company, Product Brief, Date Unknown, 8 pgs.
David Husak, “Network Processors: A Definition and Comparison,” C-PORT, A Motorola Company, Date Unknown, pp. 1-8.
Husak et al., “Network Processor Programming Models: The Key to Achieving Faster Time-to-Market and Extending Product Life,” C-PORT, A Motorola Company, Date Unknown, 8 pgs.
“Products,” Applications, C-PORT, A Motorola Company, http://www.cportcorp.com/products/applications.htm, Retrieved Jan. 23, 2001, pp. 1-3.

Affiliated with

Also associated with

Rating

Programmable multi-service queue scheduler does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Programmable multi-service queue scheduler, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Programmable multi-service queue scheduler will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3709634