US5894481A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fiber channel switch employing distributed queuing
Assignee: McData Corp
•
Filing: 1996-09-11
•
Granted: 1999-04-13
•
Expires: 2016-09-11
Abstract
Abstract The present invention is a fiber channel switch employing a distributed queuing algorithm for interconnecting a plurality of devices (workstations, supercomputer, peripherals) through their associated node ports (N -- ports) and employs a fabric having a shared memory coupled to a plurality of fabric ports (F -- ports) through a bi-directional bus over which memory addresses, frame data and communications commands are transmitted. Each F -- port includes a port controller employing a distributed queuing algorithm associated with a control network for communicating commands between the ports related to when and where frame transfers should be made, wherein the bi-directional bus provides an independent data network for access to the shared memory such that frames can be transferred to and from the shared memory in response to port controller commands.
Inventors
- 👤 David Book
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 01:12
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/60; H04L49/608; H04L49/35; H04L49/356; H04L49/357; H04Q; H04Q11/00; H04Q11/04; H04Q11/0421; H04L49/10; H04L49/103; H04L49/351
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
232 words
A fibre channel switch for interconnecting a plurality of devices, each device having a node port, such that frames of data originating from a source port having a source node port may be transferred through the fibre channel switch to a destination device having a destination node port in accordance with a distributed source and destination queuing algorithm, comprising: a plurality of fabric ports, each fabric port coupled to a different device through corresponding source or destination node port, a plurality of port controllers, each port controller located on a different fabric port, each port controller further comprising the distributed source and destination queuing algorithm for queuing frames sourced or destined from a device, or to, itself, and wherein, each port controller operates independently of the queuing of frames by any other port controller, a control network for communicating timing and destination commands between each port controller corresponding to when and where frame transfers are to be made, a bit-sliced shared memory having a common pool of memory buffers, a shared memory controller coupled to each port controller, for bit-slicing data and memory addresses being transmitted between the port controllers and the shared memory, wherein data and destination addresses are transferred to and from the shared memory, the bit-sliced shared memory being coupled to each fabric port through the shared memory controller, wherein each fabric port can access the shared memory directly.
Claim 2
Dependent Claim
232 words
A fibre channel switch for interconnecting a plurality of devices, each device having a node port, such that frames of data originating from a source port having a source node port may be transferred through the fibre channel switch to a destination device having a destination node port in accordance with a distributed source and destination queuing algorithm, comprising: a plurality of fabric ports, each fabric port coupled to a different device through corresponding source or destination node port, a plurality of port controllers, each port controller located on a different fabric port, each port controller further comprising the distributed source and destination queuing algorithm for queuing frames sourced or destined from a device, or to, itself, and wherein, each port controller operates independently of the queuing of frames by any other port controller, a control network for communicating timing and destination commands between each port controller corresponding to when and where frame transfers are to be made, a bit-sliced shared memory having a common pool of memory buffers, a shared memory controller coupled to each port controller, for bit-slicing data and memory addresses being transmitted between the port controllers and the shared memory, wherein data and destination addresses are transferred to and from the shared memory, the bit-sliced shared memory being coupled to each fabric port through the shared memory controller, wherein each fabric port can access the shared memory directly.
Claim 3
Dependent Claim
76 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 1, the bit-sliced shared memory being bit-sliced to degree n, and the common pool of memory buffers is constructed from n blocks, each with a memory bandwidth mb, given by: mb=(2×b×p)/n, where b is equal to the data bandwidth of a single fabric port, p is equal to the number of fabric ports and n represents the degree of bit-slicing.
Claim 4
Dependent Claim
56 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 2, wherein, each port delivers and receives 1 bit of data at a time to, and from, each memory bank, and over 2p clock cycles these bits are accumulated, and wherein, every fabric port has access to the shared memory.
Claim 5
Dependent Claim
89 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 1, each port controller further comprising a writer and a reader, each writer further containing a separate destination queue for each destination port, wherein each source port passes the buffer descriptor at the head of its destination queues to the destination port before the source port is actually ready to forward the frame such that each destination port knows about the next frame that each of the source ports wants to forward next.
Claim 6
Dependent Claim
117 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 4, wherein upon forwarding a frame from a particular source port to a device, the destination port requests the next buffer descriptor in the source port queue, and wherein, depending on the latency of the request and response between the two port controllers and the length of the frame being transmitted, the destination port will get the next buffer descriptor before or at approximately the same time transmission of the current frame completes, and wherein, by overlapping these two operations, a very high rate of sustained bandwidth can be maintained between two ports sending frames back and forth to each other.
Claim 7
Dependent Claim
50 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 2, wherein p=18 fabric ports and b=800 Mbits/sec, n=36 memory devices and mb=800 Mbits/sec, and wherein, the tx side of all ports retrieve data directly from the same memory which the rx side accesses.
Claim 8
Dependent Claim
106 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 1, each port controller further comprising: a link controller for controlling the link between the node port and the fabric port, a frame transfer controller for receiving and transmitting data between the link controller and the shared memory, an address validation/translation controller for obtaining frame header information and for generating destination port numbers, buffer numbers, and timeout values, a synchronizer for synchronizing port state transitions and the activities of the reader and writer, a statistics controller for counting statistics, and a port communications controller for enabling port controllers to communicate.
Claim 9
Dependent Claim
58 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 7, the address validation/translation controller further comprising: a timer for timing and timeout handling of frames in the queue, such that upon passing a buffer descriptor to the destination fabric port, the port controller from the source fabric port remembers the frame.
Claim 10
Dependent Claim
58 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 8, wherein the port controller, in response to the timer, sends a busy frame signal back to the source node port, or discards the frame, if the frame cannot be forwarded out to the destination fabric Port within a fixed time period.
Claim 11
Dependent Claim
31 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 9, wherein the fixed time period is determined in accordance with the Fibre channel standard.
Claim 12
Dependent Claim
72 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 10, wherein the source fabric port retains responsibility for timing the frame until the source fabric port buffer descriptor makes it to the head of the source queue and is passed to the destination queue, such that the destination port may now forward a request to the source fabric port to return a busy frame signal.
Claim 13
Dependent Claim
50 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 9, further comprising the step of link resetting the source fabric port and discarding the contents of the buffer, and wherein, the source fabric port stops the destination fabric port from forwarding the frame.
Claim 14
Dependent Claim
66 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 2, the plurality of port controllers further comprising a "non-core function port" port controller, wherein, the buffer descriptor of the frame to be busied or rejected is queued to the "non-core function port" port controller, wherein the source fabric port is not required to generate busy and reject frame commands.
Claim 15
Dependent Claim
145 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 13, the "non-core function port" port controller further comprising software for manipulation of the frame header, and further comprising the step of queuing the frame back out to the original source fabric port, and wherein, the source fabric port continues to time the frame while the original frame is queued to the "non-core function port", and wherein, if the frame is not forwarded within a predetermined period of time, the source fabric port makes a request to the "non-core function port" port controller not to forward the original frame to the processor, and wherein, if the frame does make it the processor, and the reject/busy frame is queued back to the source fabric port, the "non-core function port" port controller must time the frame and discard it if necessary.
Claim 16
Dependent Claim
48 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 14, further comprising a "non-core function port" timer that times the time between when the frame was first queued to the "non-core function" port and when it was actually delivered to it.
Claim 17
Dependent Claim
65 words
The fibre channel switch employing the distributed source and destination queuing algorithm as claimed in claim 5, further comprising a processor and the buffer information passed to the "non-core function port" further comprises a time stamp, wherein, the processor time stamps frames upon receipt, and wherein, a time out value is calculated that ensures that the frame is discarded within R -- A -- TOV.
Claim 18
Independent Claim
87 words
A method of switching data frames, each data frame having a frame beginning, in a network having a plurality of ports and a central memory including a plurality of memory modules, the method comprising: receiving a data frame at a first port; determining a destination port; striping the data frame across the plurality of memory modules in the central memory; generating a message indicating which memory module of the plurality of memory modules stores the beginning of the frame; and sending the message to the destination port.
Claim 19
Independent Claim
87 words
A method of switching data frames, each data frame having a frame beginning, in a network having a plurality of ports and a central memory including a plurality of memory modules, the method comprising: receiving a data frame at a first port; determining a destination port; striping the data frame across the plurality of memory modules in the central memory; generating a message indicating which memory module of the plurality of memory modules stores the beginning of the frame; and sending the message to the destination port.
Claim 20
Dependent Claim
37 words
The method of claim 17 wherein the step of striping the data frame across the plurality of memory modules in the central memory includes writing the beginning of the data frame to a next available memory module.
Claim 21
Dependent Claim
25 words
The method of claim 17 further comprising the step of sending the bit-sliced data frame from the plurality of memory modules to the destination port.
Claim 22
Independent Claim
106 words
A method of switching data frames, each data frame having a frame beginning, in a network having a plurality of ports and a central memory including a plurality of memory modules, the method comprising: receiving a data frame at a first port; determining a destination port; bit-slicing the data frame across the plurality of memory modules in the central memory; generating a buffer descriptor indicating which memory module of the plurality of memory modules stores the beginning of the bit-sliced data frame; sending the buffer descriptor to the destination port; and sending the bit-sliced data frame from the plurality of memory modules to the destination port.
Claim 23
Independent Claim
106 words
A method of switching data frames, each data frame having a frame beginning, in a network having a plurality of ports and a central memory including a plurality of memory modules, the method comprising: receiving a data frame at a first port; determining a destination port; bit-slicing the data frame across the plurality of memory modules in the central memory; generating a buffer descriptor indicating which memory module of the plurality of memory modules stores the beginning of the bit-sliced data frame; sending the buffer descriptor to the destination port; and sending the bit-sliced data frame from the plurality of memory modules to the destination port.
References Cited (Backward Citations)
US4635250A
Cited
US5109378A
Cited
US5126999A
Cited
US5197063A
Cited
US5265090A
Cited
US5420854A
Cited
US5444700A
Cited
US5224093A
Cited
US5390171A
Cited
US5307342A
Cited
US5351236A
Cited
US5329524A
Cited
US5390181A
Cited
US5390184A
Cited
US5452294A
Cited
US5655163A
Cited
US5598541A
Cited
US5502719A
Cited
US5528584A
Cited
US5603064A
Cited
US5490007A
Cited
US5619497A
Cited
US5519596A
Cited
US5592160A
Cited
US5610745A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-04-12 | 2002-10-12 | 2003-04-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-04-12 | 2006-10-12 | 2007-04-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-04-12 | 2010-10-12 | 2011-04-13 | $7700.00 | Window Closed / Lapsed |