Method and system for preventing deadlock in fibre channel fabrics using frame priorities

• US 7,480,293 B2
• Filed: 03/11/2004
• Issued: 01/20/2009
• Est. Priority Date: 02/05/2004
• Status: Active Grant

• Current Assignee: Marvell Asia Pte Limited (Marvell Technology Group Limited)
• Original Assignee: QLogic Corporation (Marvell Technology Group Limited)
• Inventors: Betker, Steven M.
• Primary Examiner(s): Harper; Kevin C
• Application Number:
  US10/798,527
• Publication Number:
  US 20050174936A1
• Time in Patent Office: 1,776 Days
• Field of Search: 370412-418, 370/389
• US Class Current: 370/389
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 47/2458 Modification of priorities while in transit
• CPC Class Codes: H04L 47/39 Credit based
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 47/522 Dynamic queue service slot or variable bandwidth allocation
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority
• CPC Class Codes: H04L 47/6265 past bandwidth allocation
• CPC Class Codes: H04L 49/357 Fibre channel switches
• CPC Class Codes: H04L 49/552 by ensuring the integrity of packets received through redundant connections

Abstract

A method and system for transmitting frames using a fibre channel switch is provided. The method includes, determining a frame'"'"'s priority based on a hop count for the frame; placing a frame in a priority queue, where the priority queue is dedicated to frames having similar priorities; selecting a frame for transmission based on the frame'"'"'s priority, if credit is available, where a frame with a higher priority is sent before a frame with a lower priority; and selecting a frame with a lower priority if enough higher priority frames have been sent. The system includes a switch with at least two priority queues for placing frames with different priorities; a counter that keeps track of frames that are transmitted from the two priority queues; and a credit control module that determines if credit is available before sending a particular frame.

Claims

1. A method for transmitting frames between switches in a fibre chaimel network, comprising:

determining priority for a plurality of frames based on a hop count for each frame, where a frame with a lesser hop count has a higher priority than a frame with a greater hop count;

placing the frames in a plurality of priority queues, where each priority queue is dedicated to frames having similar priorities; and

selecting frames for transmission based on each frame'"'"'s priority;

wherein higher priority frames are selected before lower priority frames until a threshold number of higher priority frames have been selected, after which at least one lower priority frame is selected if lower priority frames are pending.

2. The method of Claim 1, where a counter in each priority queue maintains a count of frames selected from that queue, and lower priority frames may be selected after the counter reaches the threshold number.

7. The method of claim 1. further comprising the step of sending the selected frame if sufficient credit is available.

8. The method of claim 1 further comprising the step of sending the selected lower priority frame if a sum of empty receive buffers at a destination port and receive buffers at the destination port that are filled with higher priority frames is greater than or equal to the hop count for the selected lower priority frame.

3. A system for transmitting fibre channel frames, comprising:

a fibre channel switch with a transmit port the transmit port having at least two priority queues for placing frames with different priorities, where a frame'"'"'s priority is based on a hop count that is in turn based upon the frame'"'"'s destination;

a counter associated with each queue, each counter being configured to count frames transmitted from its associated priority queue; and

a credit control module configured to determine whether sufficient credit is available before sending a particular frame.

4. The system of Claim 3, wherein frames with higher hop counts have lower priority than frames with lower hop counts.

9. The system of claim 3, wherein for lower priority frames the credit control module is configured to determine that sufficient credit is available when a sum of empty receive buffers at a destination port and receive buffers at the destination port that are filled with higher priority frames is greater than or equal to the hop count for the selected lower priority frame.

5. A fibre channel switch having a transmit port for transmitting frames, comprising:

at least two priority queues for placing frames with different priorities, where a frame'"'"'s priority is based on a hop count that is in turn based upon the frame'"'"'s destination;

a counter associated with each queue, each counter being configured to count frames transmitted from its associated priority queue; and

a credit control module configured to determine if sufficient credit is available before sending a particular frame.

6. The fibre channel switch of claim 5, wherein frames with higher hop counts have lower priority than frames with lower hop counts.

10. The fibre channel switch of Claim 6, wherein for lower priority frames the credit control module is configured to determine that sufficient credit is available when a sum of empty receive buffers at destination port and receive buffers at the destination port that are filled with higher priority frames is greater than or equal to the hop count for the selected lower priority frame.

11. A system for transmitting fibre channel frames, comprising:

means for placing frames in a plurality of priority queues, where each priority queue is dedicated to frames having similar priorities;

means for selecting frames for transmission based on each frame'"'"'s priority;

means for determining whether a sum of empty receive buffers at a destination port and received buffers at the destination port that are filled with higher priority frames is greater than or equal to the hop count for the selected lower priority frame;

wherein higher priority frames are selected before lower priority frames until a threshold number of higher priority frames have been selected, after which at least one lower priority frames is selected if lower priority frames are pending.