Pipelined packet switching and queuing architecture

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S412000

Reexamination Certificate

active

06977930

ABSTRACT:
A pipelined linecard architecture for receiving, modifying, switching, buffering, queuing and dequeuing packets for transmission in a communications network. The linecard has two paths: the receive path, which carries packets into the switch device from the network, and the transmit path, which carries packets from the switch to the network. In the receive path, received packets are processed and switched in an asynchronous, multi-stage pipeline utilizing programmable data structures for fast table lookup and linked list traversal. The pipelined switch operates on several packets in parallel while determining each packet's routing destination. Once that determination is made, each packet is modified to contain new routing information as well as additional header data to help speed it through the switch. Each packet is then buffered and enqueued for transmission over the switching fabric to the linecard attached to the proper destination port. The destination linecard may be the same physical linecard as that receiving the inbound packet or a different physical linecard. The transmit path consists of a buffer/queuing circuit similar to that used in the receive path. Both enqueuing and dequeuing of packets is accomplished using CoS-based decision making apparatus and congestion avoidance and dequeue management hardware. The architecture of the present invention has the advantages of high throughput and the ability to rapidly implement new features and capabilities.

REFERENCES:
patent: 5426640 (1995-06-01), Hluchyj et al.
patent: 5553061 (1996-09-01), Waggener et al.
patent: 5757771 (1998-05-01), Li et al.
patent: 5790545 (1998-08-01), Holt et al.
patent: 5909686 (1999-06-01), Muller et al.
patent: 5938736 (1999-08-01), Muller et al.
patent: 6038230 (2000-03-01), Ofek
patent: 6038607 (2000-03-01), Hamilton et al.
patent: 6147996 (2000-11-01), Laor et al.
patent: 6167445 (2000-12-01), Gai et al.
patent: 6226267 (2001-05-01), Spinney et al.
patent: 6259695 (2001-07-01), Ofek
patent: 6259699 (2001-07-01), Opalka et al.
patent: 6343072 (2002-01-01), Bechtolsheim et al.
patent: 6389506 (2002-05-01), Ross et al.
patent: 6396809 (2002-05-01), Holden et al.
patent: 6404752 (2002-06-01), Allen, Jr. et al.
patent: 6424649 (2002-07-01), Laor et al.
patent: 6424659 (2002-07-01), Viswanadham et al.
patent: 6463059 (2002-10-01), Movshovich et al.
patent: 6650642 (2003-11-01), Sugai et al.
patent: 6658015 (2003-12-01), Merchant et al.
M. Shreedhar and G. Varghese, “Efficient Fair Queuing Using Deficit Round Robin,” Proceedings of ACM SIG COMM '95, Computer Communications Review, vol. 25, No. 4, Oct. 1995.
S. Floyd and V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transactions on Networking, ACM Press, Aug. 1993.
Sally Floyd and van Jacobson,Random Early Detection Gateways for Congestion Avoidance, IEEE/ACM Transactions on Networking, Vo. 1, No. 4, Aug. 1993, pp. 397-413.
M. Shreedhar and George Varghese,Efficient Fair Queuing Using Deficit Round Robin, Computer Communication Review, vol. 25, No. 4, Oct. 1995, pp. 231-242.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Pipelined packet switching and queuing architecture 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 packet switching and queuing architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pipelined packet switching and queuing architecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3478282

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.