The present invention is in the field of routing packets through alternative paths between nodes in a routing fabric, and pertains in particular to methods by which back-ups in a fabric may be avoided.
With the advent and continued development of the well-known Internet network, and of similar data-packet networks, much attention has been paid to computing machines for receiving, processing, and forwarding data packets. Such machines, known as routers in the art, typically have multiple interfaces for receiving and sending packets, and circuitry at each interface, including typically a processor, for handling and processing packets. The circuitry at the interfaces is implemented on modules known as line cards in the art. In some routers the line cards are interconnected through what is known as the internal fabric, which comprises interconnected fabric cards handling transmissions through the fabric. Fabric interconnection has not always been a part of routers in the art, and is a fairly recent innovation and addition for packet routers.
One purpose of
In conventional switching fabric at the time of the present patent application fabric nodes in such a structure are implemented on fabric cards or chips that do Flow Control. Such Flow Control is very well-known in the art, and comprises a process of monitoring ports for real or potential traffic overflow, and notifying an upstream port to stop or slow sending of further data. That is, if node G as shown in
A serious problem with Flow Control as conventionally practiced is that the upstream notifications, inherent in flow control, propagate further upstream and hinder or stop traffic that there is no need to stop, partly because the interconnections of nodes may be quite complicated and the alternative paths quite numerous. Further, a node that has been informed of a downstream overload condition cannot select to stop or divert traffic just for that particular link, but only to stop or divert all traffic. These effects, because of the complexity and interconnection of nodes in a fabric, can result in complete stultification of parts of a system, or of an entire network.
There have been in the art several attempts to improve upon flow control, but all such solutions have only been partly successful, and still use upstream propagation of control indicators, which always still have a good chance of causing unwanted difficulty.
What is clearly needed is a way to deal with temporary overloads at fabric nodes without resorting to problematic upstream messaging without impacting traffic that does not need to use the overloaded link.
In a preferred embodiment of the present invention a method for managing data traffic at switching element in a fabric network, each node having two or more internally coupled ports is provided, comprising the steps of (a) establishing a managed queuing system comprising one or more queues associated with each port, for managing incoming data traffic; and (b) accepting or discarding data directed to a queue according to the quantity of data in the queue relative to queue capacity.
In some embodiments all data is discarded for a full queue. In some other embodiments the queue manager monitors quantity of queued data in relation to a preset threshold, and begins to discard data at a predetermined rate when the quantity of queued data reaches the threshold. In still other embodiments the queue manager increases the rate of discarding as quantity of queued data increases above the preset threshold, discarding all data traffic when the queue is full.
In another aspect of the invention a switching element for a fabric network is provided, comprising two or more internally-coupled ports, and a managed queuing system comprising one or more queues associated with each port, for managing incoming data traffic. The switching element is characterized in that the queue manager accepts or discards data directed to a queue according to the quantity of data in the queue relative to queue capacity.
In some embodiments all data is discarded for a full queue. In some other embodiments the queue manager monitors quantity of queued data against a preset threshold, and begins to randomly discard data when the quantity of queued data exceeds the threshold. In still other embodiments the queue manager increases the rate of discarding as the quantity of queued data increases above the preset threshold.
In still another aspect of the invention a data router having external connections to other data routers is provided, comprising an internal fabric network, and a plurality of switching elements in the internal fabric network, each having internally-coupled ports, and a managed queuing system comprising one or more queues associated with each port, for managing incoming data traffic. The router is characterized in that the queue manager accepts or discards data directed to a queue according to the quantity of data in the queue relative to queue capacity.
In some embodiments all data is discarded for a full queue. In some other embodiments the queue manager monitors quantity of queued data against a preset threshold, and begins to randomly discard data when the quantity of queued data exceeds the threshold. In still other embodiments the queue manager increases the rate of discarding as the quantity of queued data increases above the preset threshold.
In various embodiments of the invention taught below in enabling detail, for the first time a system is provided for routers that accomplished the purposes of flow control without requiring upstream notification of problems, which can often result in extensive and unnecessary cessation or diversion of traffic.
In the fabric card of this embodiment, as shown in
Referring now back to
In this unique arrangement the size of each queue is set to provide adequate flow under ordinary, and to some extent extraordinary, load conditions without data loss, but under extreme conditions, when a queue is full, data is simply discarded until the situation corrects, which the inventors have found to be less conducive to data loss than the problems associated with conventional Flow Control, which uses the previously described upstream-propagated Flow Control indicators.
In an alternative embodiment of the present invention each queue manager on a card has an ability to begin to drop packets at a pre-determined rate at some threshold in queue capacity short of a full queue. In certain further embodiments the queue manager may accelerate the rate of packet dropping as a queue continues to fill above the first threshold. In these embodiments the incidence of dropping packets is minimized and managed, and spread over more traffic than would be the case if dropping of packets were to begin only at a full queue, wherein all packets would be dropped until the queue were to begin to empty.
A distinct advantage of the queue management scheme of the present invention is that the intelligence required is considerably lessened, and there is no addition to the traffic load by generating Flow Control indicators.
It will be apparent to the person with ordinary skill in the art that the embodiments of the invention described in this specification are exemplary, and may vary in a number of ways without departing form the spirit and scope of the present invention. For example, there may be more or fewer than nine ports and queue managers per fabric card, the system may be implemented on a chip or a set of chips, and the size of each queue may vary. There are many other alterations within the spirit and scope of the invention as well, and the scope of the invention is limited only by the claims which follow.
The present application is a continuation application of patent application Ser. No. 09/800,678 entitled “System for Fabric Packet Control,” filed Mar. 6, 2001, now U.S. Pat. No. 6,831,891 which is incorporated in its entirety by reference.
Number | Name | Date | Kind |
---|---|---|---|
3831891 | Jester | Aug 1974 | A |
5335222 | Kamoi et al. | Aug 1994 | A |
5495608 | Antoshenkov | Feb 1996 | A |
5914936 | Hatono et al. | Jun 1999 | A |
6219728 | Yin | Apr 2001 | B1 |
6247058 | Miller et al. | Jun 2001 | B1 |
6292834 | Ravi et al. | Sep 2001 | B1 |
RE37435 | Yoshimura et al. | Nov 2001 | E |
6452901 | Yang et al. | Sep 2002 | B1 |
6535484 | Hughes et al. | Mar 2003 | B1 |
6556578 | Silberschatz et al. | Apr 2003 | B1 |
6570848 | Loughran et al. | May 2003 | B1 |
6675220 | Bergamasco et al. | Jan 2004 | B1 |
6744767 | Chiu et al. | Jun 2004 | B1 |
6788697 | Aweya et al. | Sep 2004 | B1 |
6829245 | Medina et al. | Dec 2004 | B1 |
6839321 | Chiruvolu | Jan 2005 | B1 |
6856596 | Blumer et al. | Feb 2005 | B2 |
6859435 | Lee et al. | Feb 2005 | B1 |
6870854 | Aimoto et al. | Mar 2005 | B1 |
6912226 | De Cnodder et al. | Jun 2005 | B2 |
6940814 | Hoffman | Sep 2005 | B1 |
6961307 | Aweya et al. | Nov 2005 | B1 |
6973033 | Chiu et al. | Dec 2005 | B1 |
6990529 | Yang et al. | Jan 2006 | B2 |
7027395 | Elloumi et al. | Apr 2006 | B2 |
7058061 | Tanaka et al. | Jun 2006 | B2 |
7116680 | Kramer et al. | Oct 2006 | B1 |
7139281 | Bodin | Nov 2006 | B1 |
7149664 | Firoiu et al. | Dec 2006 | B1 |
7197244 | Thomas et al. | Mar 2007 | B2 |
7336672 | Aweya et al. | Feb 2008 | B1 |
7369498 | Ma et al. | May 2008 | B1 |
20030179712 | Kobayashi et al. | Sep 2003 | A1 |
20050163139 | Robotham et al. | Jul 2005 | A1 |
Number | Date | Country | |
---|---|---|---|
20040223456 A1 | Nov 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09800678 | Mar 2001 | US |
Child | 10863161 | US |