US20080101256A1 - System and method for selecting fibre channel switched fabric frame paths - Google Patents
System and method for selecting fibre channel switched fabric frame paths Download PDFInfo
- Publication number
- US20080101256A1 US20080101256A1 US11/965,274 US96527407A US2008101256A1 US 20080101256 A1 US20080101256 A1 US 20080101256A1 US 96527407 A US96527407 A US 96527407A US 2008101256 A1 US2008101256 A1 US 2008101256A1
- Authority
- US
- United States
- Prior art keywords
- link
- port
- data
- network
- switch
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0882—Utilisation of link capacity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
- H04L25/40—Transmitting circuits; Receiving circuits
- H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
- H04L25/4906—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems using binary codes
- H04L25/4908—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems using binary codes using mBnB codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/35—Switches specially adapted for specific applications
- H04L49/356—Switches specially adapted for specific applications for storage area networks
- H04L49/357—Fibre channel switches
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/35—Switches specially adapted for specific applications
- H04L49/351—Switches specially adapted for specific applications for local area network [LAN], e.g. Ethernet switches
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Physics & Mathematics (AREA)
- Spectroscopy & Molecular Physics (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A system and method for measuring data transmission activity through a port of a switch device interconnecting nodes of a storage area network, the port transmitting data as words of predetermined length, one data word indicating idle port activity. The method includes steps of counting a number of transmitted words received from the port in a first counter device; and, for each word counted, comparing that word with a predetermined word indicating no (idle) port transmission activity. In response to the comparing, a number of matches are counted in a second counter device. In this manner, a ratio of a number of counted matches with a total amount of words counted indicates available bandwidth for transmitting additional data over that link. Preferably, this available bandwidth information is included in a link state record that the switch communicates to other switch devices interconnecting that link. Processing devices at the switches determine a link cost factor, based on the available bandwidth of that link and, in addition, the link speed, the cost factor being used to optimize path selection over links in the network according to a path routing algorithm.
Description
- This application is a continuation application of U.S. patent application Ser. No. 10/317,765 filed Dec. 12, 2002, which is a continuation-in-part application based upon and claiming the benefit of the filing of commonly-owned, co-pending U.S. patent application Ser. No. 10/238,751 filed Sep. 10, 2002 entitled “AVAILABLE BANDWIDTH DETECTOR FOR SAN SWITCH PORTS,” the contents and disclosure of which are fully incorporated herein by reference.
- 1. Field of the Invention
- The present invention relates to fibre channel switched networks and particularly to a system and method for selecting frame paths in a fibre channel switched network that takes into account available bandwidth considerations.
- 2. Description of the Prior Art
-
FIG. 1 depicts generally a Storage Area Network (SAN) 10 which is a dedicated high performance network capable of moving data betweenheterogeneous servers libraries 20. As shown inFIG. 1 , a Local Area Network (LAN) 12 is provided which enables the sharing of data files among groups of user clients, such asdesktop computers LAN 12 may comprise an Internet Protocol (IP) network such as Ethernet and provides client/server connectivity between thedesktop client 14 a, andSAN server devices network 25, that preferably comprises a switched topology or “fabric” including fiber channel interconnect devices such as switches, 30,routers 22 and high speedserial links 26 interconnecting theservers storage subsystems SAN architecture 10 advantageously minimizes any traffic conflicts and provides for increased scalability, availability, and file transfers over longer distances as compared to SANs of traditional messaging networks comprising bus architectures. The Fiber Channel based SAN, such as shown inFIG. 1 , combines the high performance of an I/O channel and the advantages of a network (connectivity and distance of a network) using similar network technology components likerouters 22,switches 30 and gateways (not shown). Thus, SAN products do not function like a server. Rather, the SAN product processes block I/O protocols, such as Fiber Channel Protocol (SCSI-FCP) or Fiber Connection (FICON), for some other system, e.g., a server. - As known, the fiber
channel switching fabric 25 is organized into logical entities including ports, nodes and platforms. For instance, fiber channel “nodes” are physical devices, e.g., disk drive or disk arrays, workstations, storage devices, etc., that may be a source or destination of information to/from other nodes. Each node comprises one or more “ports” which are the hardware interfaces that connect all fiber channel devices to the topology via links, i.e., electrical or optical transmit fibers, e.g. cables of copper or optical fiber. Ports are designated and have different attributes depending upon the switch topology in which they are implemented, e.g., point-to-point, arbitrated loop, fabric. - In Fibre Channel networks comprising a switching fabric, such as shown in
FIG. 1 , switches 30 communicate to each other over switch-to-switch links via Expansion or “E”-ports. A part of each switch's function in the network is to generate a Link State Record (“LSR”) 99 that completely describes the connectivity of a switch to all switches to which it is directly attached. The LSR 99 generated at a switch is communicated to all other switches connected to that switch to provide the switch fabric with information such as the status of each switch port. The ANSI Fibre Channel Switch Fabric-3 (FC-SW-3) rev 6.01 (NCITS) working draft proposed American National Standard for Information Technology (Jun. 1, 2002), incorporated herein by reference, describes in greater detail the composition of the LSR that is communicated. For instance, as described in the proposed ANSI Fibre Channel Switch Fabric-3 standard, basic information included in the LSR includes, but is not limited to: whether a particular port is up, the speed of a link connected to the port, e.g., 1 Gbit/sec, 2 Gbit/sec, etc., the LSR age, an options field, a length, checksum bytes, etc. - Typically, the LSR header is 24 bytes having a configuration as follows:
- byte 1 . . . Type
- byte 2 . . . Reserved
- bytes 3-4 . . . LSR Age
- bytes 5-8 . . . Options
- bytes 9-12 . . . Link State ID
- bytes 13-16 . . . Advertising Domain ID
- bytes 17-20 . . . Link State Incarnation
- bytes 21-22 . . . Checksum
- bytes 23-24 . . . LSR Length
- From this information, whenever a switch comes up in the Fibre Channel network, it may then look at the speed of the link and the number of hops to determine the cost of a particular path, the proposed cost being a combination of the speed of the links versus the number of switches it goes to. From this information, a shortest path may be calculated using a well known algorithm, e.g., a Fabric Shortest Path First (FSPF) path selection protocol. A more detailed description of the FSPF algorithm may be found at the T 11 standards website at section (8) of the D Switch Fabric-2 specification, revision 5.4, incorporated by reference herein.
- Within a Storage Area Network (SAN) a path selection process for routing frames only considers the link cost in the fibre channel switched fabric to determine the best path for routing frames through fibre switches. The link cost is a measurement that is calculated by the following formula:
Link Cost=S*(1.0625e12/Baud Rate) - By default, S is an administrative value, typically set to one. The number 1.0625e12 is exemplary and for purposes of discussion is equal to 1000 times 1.0625e9 (which represents a 1 Gb/s link speed). Thus, for example, when the Link Cost is calculated for a 1.0625 Gb/s Fibre Channel Link, this calculation yields (with S set to 1.0): 1.0 *(1.0625e12/1.0625e9)=1000. It should be understood that the 1.0625e12 number is configurable and may change in accordance with link speed. Currently, link cost only considers link speed (i.e., the Baud rate). However, while link speed is one important measurement to consider in best frame path selection, there are several other factors that may be considered as well. One of these additional factors would be the current congestion or amount of available bandwidth for each link along each available path through fabric.
- It would be highly desirable to provide a frame path selection system and method that takes into account available bandwidth of each port (link) and the link cost, in real time.
- It is an object of the present invention to provide a system and method for determining an amount of available bandwidth at each switch port, in real-time, and utilizing this available bandwidth information in a manner to provide for more accurate path selection and frame routing algorithms.
- It is a further object of the present invention to provide a system and method for determining an amount of available bandwidth at each switch port, in real-time, and inserting this available bandwidth information in the Link State Record for propagation to all other switches in the fabric, so that it each switch will know the available bandwidth for all ports within the network to optimize routing decisions.
- It is another object of the present invention to provide a system and method for determining an amount of available bandwidth at each switch port, in real-time, and inserting this available bandwidth information in the Link State Record and utilizing this added bandwidth information to influence frame routing decisions.
- The invention particularly comprises adding a definition of a value for placement in a defined byte field in the Link State Record (LSR) that would reflect the amount of bandwidth available for each link. Using this value, fibre channel network switches may take not only link speed into consideration but also consider current traffic and congestion on the associated link. Thus, the percentage of bandwidth available or current congestion found on the fibre link may be factored in along with the link speed.
- Thus, according to the principles of the invention, there is provided a system and method for measuring data transmission activity through a port of a switch device interconnecting nodes of a storage area network, the port transmitting data as words of predetermined lengths one data word indicating idle port activity. The method includes steps of: counting a number of transmitted words received from the port in a first counter device; and, for each word counted, comparing that word with a predetermined word indicating no (idle) port transmission activity. In response to the comparing, a number of matches are counted in a second counter device. In this manner, a ratio of a number of counted matches with a total amount of words counted indicates available bandwidth for transmitting additional data over that link. Preferably, this available bandwidth information is included in a Link State Record that the switch communicates to other switch devices interconnecting that link. Processing devices at the switches determine a link cost factor, based on the available bandwidth of that link and, in addition, the link speed, the cost factor being used to optimize path selection over links in the network according to a path routing algorithm.
- It is understood that the system and method of the present invention may be implemented at switch nodes in many types of SANs, including Gigabit Ethernet, Infiniband, and iSCSI. Furthermore, the present invention may be implemented for determining available bandwidth for other types of Fiber Channel node ports. That is, other ports interconnected by links in a switch fabric may benefit from the system and method.
- Further features, aspects and advantages of the apparatus and methods of the present invention will become better understood with regard to the following description, appended claims, and accompanying drawings where:
-
FIG. 1 depicts generally a Storage Area Network (SAN) 10 including a dedicated high performance network capable of moving data between heterogeneous servers and storage resources such as disk drives and arrays (RAIDS) or tape storage devices and/or libraries; and, -
FIG. 2 illustrates the state machine for measuring the activity through the various ports of switches in a switch fabric of a Fibre Channel Network. - The fibre bandwidth available at a port is measured according to a technique that includes counting the number of idles state words found at any one time on the fibre link. Details concerning this measurement technique is disclosed in commonly-owned, co-pending U.S. patent application Ser. No. 10/238,751 filed Sep. 10, 2002 entitled “AVAILABLE BANDWIDTH DETECTOR FOR SAN SWITCH PORTS,” the whole content and disclosure of which is fully incorporated herein by reference.
- Briefly, in view of
FIG. 2 , there is depicted a novel state machine for measuring the activity through the various ports of the switches in a switch fabric of a Storage Area Network according to the present invention. As shown inFIG. 2 , adata stream 110 communicated from a node is received at a switch port (not shown) alonglink 100. The data stream is received and processed by theSERDES module 102 which provides link control for a fiber channel port. The SERDES deserializer receives the serial stream and generates 10-bit wide data bytes (encoded characters), and aword clock 130, indicating a word is available. - The received 10-bit wide data byte is tapped off the output of the
SERDES module 102 and clocked into a 10-bit wide×4 deepshift FIFO register 112 with parallel access to accumulate a transmitted ordered set comprising 40 characters, i.e., four ten-bit words. The resulting 40-bit data word is compared with the “IDLE” ordered set, which is a special ordered set (40-bit word) specified by the Fiber Channel protocol to be transmitted when a port (of a node) has no valid data to send. Preferably, the special 40-bit IDLE word is hard-wired in aregister 114 or equivalent data storage structure. When theFIFO register 112 has received four characters in succession (i.e., the 40 bit word), acomparator device 116 is triggered compares the received ordered set to determine if the received ordered set corresponds to the IDLE ordered set (word). Each time an IDLE word is detected by comparator l16, a comparator output signal is generated to increment acounter device 120 for counting IDLE words. Simultaneously with the detection and counting of received IDLE words, aword counter device 122 is provided to count the total number of words received. Particularly, as shown inFIG. 2 , theword clock 130 that clocks the received 10-bit wide data words into theshift FIFO register 112, is additionally implemented to count the total number of received words in theword counter device 122.Reset logic circuit 124 is provided to generate areset signal 132 when thecounter device 122 has counted a pre-determined number of words. The reset logic word count is configurable depending upon the type of network implemented, and for purposes of explanation, may be set to reach avalue 25×106, for example. The value of 25×106 words, in the example system illustrated inFIG. 2 , would correspond to alink 100 data rate of 1.0 Gbit/sec as there are 4 characters/word and 10 bits/character (according to the 8b/10b encoding scheme) which is multiplied by 25×106 words total number received and counted. Thus, when the amount of words received (and counted) has reached the value specified by the reset logic circuit 124 (e.g., 25×106), thereset signal 132 is generated to latch the value of the IDLE counter register 120 by acounter latch device 122. Additionally, at that moment, the reset signal 132 resets theIDLE counter 120 andword counter 122, so that continuous bandwidth activity at a switch port may be ascertained. Preferably, the latched IDLE counter value is communicated to a processor device e.g., provided in the switch, via abus 140. In this manner, the switch processor may thus compute a percentage comprising a ratio of the number of IDLE ordered sets (words) received for a fixed number of transmission words (e.g., 25×106), which translates into available bandwidth. - Thus, in one embodiment, as the fibre link bandwidth available is measured by counting the number of idles found at any one time in the fibre link, this measurement value may be inserted in the Link State Record (LSR), for example, in the defined Link Options field within the LSR which field is large enough to count up to 4 Gbyte of idles on each link. Presently, this Link Options field has no options defined, and is set to 0×00 0×00 0×00 0×00.
- In an embodiment that avoids the use of the entire Link Options field, the unused bandwidth may be computed as a percentage of the total bandwidth of the associated link. In this manner, the switch processor device may compute a percentage comprising a ratio of the number of IDLE ordered sets (words) received for a fixed number of transmission words (e.g., 25×106), which translates into available bandwidth, referred to herein as a variable w′. Preferably, the available bandwidth w′ is computed for each link subsection and may comprise a one byte number having values 1-255, for example.
- Once the amount of available bandwidth w′ is determined, this value is inserted in the Link State Record (LSR), for example, in the defined Reserved field (one byte) within the LSR, or, may be provided in a new defined byte field provided in the LSR. For example, this new field may reside in byte 0×45 of the FSPF (Fabric Shortest Path First) Information Unit, i.e. word 3, byte 1 of the link descriptor. Accordingly, based on the available bandwidth information provided in the LSR, the bandwidth of any selected path is determined to be equal to the bandwidth of the link having the least available bandwidth within that path.
- Link Cost may then be computed using this additional factor, and thus to some degree, reflect actual link usage. Thus, with the available bandwidth information w′ (a number from 1 to 255, for example), the used bandwidth, w, of a link may be computed as follows:
w=1−w′/255 - Link Cost for each link can then be calculated using the current administratively defined factor S, the baud rate and the percentage of used bandwidth:
Link Cost=S*w*(1.0625e12/Baud rate) - In an exemplary embodiment, the switch that owns the LSR record will transmit an update of the LSR including the available bandwidth information for each LSR Refresh Time-Out Value (L_R_TOV), which is 30 minutes by default. In this way, each additional switch will have the current Link Cost as well as the amount of available bandwidth for each link that it is attached to select the optimum paths for subsequent frames. This method would result in better performance and control over the Storage Area Network (SAN) preventing bottlenecks due to over used links and paths from the switch.
- It is understood that the system and method of the present invention may be implemented at switch nodes in many types of SANs, including Gigabit Ethernet, Infiniband, and iSCSI. Furthermore, the present invention may be implemented for determining available bandwidth for other types of Fiber Channel node ports. That is, other ports interconnected by links in a switch fabric may benefit from the system and method.
- While the invention has been particularly shown and described with respect to illustrative and preferred embodiments thereof, it will be understood by those skilled in the art that the foregoing and other changes in form and details may be made therein without departing from the spirit and scope of the invention which should be limited only by the scope of the appended claims.
Claims (15)
1. A system for optimizing data transmission activity through ports of a switch device interconnecting nodes of a network, the port transmitting data as words of predetermined length, one data word indicating idle port activity, said system comprising:
first counter means for counting a fixed amounts of transmitted words received from said port;
means for comparing each received word of said fixed amount with a predetermined word indicating said idle port transmission activity; and,
means for counting a number of matches in a second counter means,
a processing device for computing a ratio of a number of counted matches with said fixed amount of words counted, said ratio indicating available bandwidth for transmitting additional data through said port,
said processing device communicating said available bandwidth information to other switch devices to thereby optimize transmission of data through ports interconnecting said switch devices.
2. The system as claimed in claim 1 , wherein said network is a fiber channel network comprising switch devices interconnecting nodes by communication links, said links carrying data in serial form between switch devices in a switch fabric of said fiber channel network, said processing device further computing a cost of transmission over a link interconnecting said port in the network as a basis for determining transmission of data over a path including said interconnected link,
wherein said link cost considers a speed of said link and said available bandwidth information.
3. The system as claimed in claim 2 , wherein said data words are communicated over said link in serial form and received as a serial stream, said system further comprising:
a means for synchronizing receipt of said data words from said serial stream and generating a clock signal indicating receipt of a transmitted word in said serial stream; and,
a means for de-serializing said data stream and converting each received word to a parallel format.
4. The system as claimed in claim 2 , wherein said link cost forming a basis for routing data in said network is calculated according to:
Link Cost=S*(n/Baud Rate)
with S and n being pre-defined values, and Baud Rate indicating said link speed.
5. The system as claimed in claim 4 , wherein said ratio indicating available bandwidth for transmitting additional data through said port is defined as a variable w′ of byte length, said processing device further computing a used bandwidth, w, of a link according to:
w=1−w′/255.
6. The system as claimed in claim 5 , wherein said link cost forming a basis for routing data in said network is calculated according to:
Link Cost=S*w*(n/baud rate)
with S and n being pre-defined values, and Baud Rate indicating said link speed.
7. The system as claimed in claim 5 , wherein said processing device generates a Link State Record (LSR) for communicating said available bandwidth information to other switch devices in said network, said available bandwidth information inserted in said LSR as said byte W′.
8. The system as claimed in claim 7 , wherein said network implements a Fabric Shortest Path First algorithm for determining frame routing through said network based on link speed and said available bandwidth information provided in said LSR.
9. A switch device for routing data over links interconnecting nodes of a network, each switch including a port interfaced to a link for communicating data along paths including one or more links in the network, each port transmitting data as words of predetermined length, one data word indicating idle port activity, the switch device comprising:
first counter means for counting a fixed amounts of transmitted words received from said port;
means for comparing each received word of said fixed amount with a predetermined word indicating said idle port transmission activity; and,
means for counting a number of matches in a second counter means,
a processing device for computing a ratio of a number of counted matches with said fixed amount of words counted, said ratio indicating available bandwidth for transmitting additional data through said port,
said processing device communicating said available bandwidth information to other switch devices to thereby optimize transmission of data through ports interconnecting said switch devices.
10. The switch device as claimed in claim 9 , wherein said network is a fiber channel network comprising switch devices interconnecting nodes by said links, said links carrying data in serial form between switch devices in a switch fabric of said fiber channel network, said processing device further computing a cost of transmission over a link interconnecting said port in the network as a basis for determining transmission of data over a path including said interconnected link,
wherein said link cost considers a speed of said link and said available bandwidth information.
11. The switch device as claimed in claim 10 , wherein said processing device calculates said link cost as:
Link Cost=S*(n/Baud Rate)
with S and n being pre-defined values, and Baud Rate indicating said link speed.
12. The switch device as claimed in claim 11 , wherein said ratio indicating available bandwidth for transmitting additional data through said port is defined as a variable w′ of byte length, said processing device farther computing a used bandwidth, w, of a link according to:
w=1−w′/255.
13. The switch device as claimed in claim 12 , wherein said link cost forming a basis for routing data in said network is calculated according to:
Link Cost=S*w*(n/baud rate)
with S and n being pre-defined values, and Baud Rate indicating said link speed.
14. The switch device as claimed in claim 12 , wherein said processing device generates a Link State Record (LSR) for communicating said available bandwidth information to other switch devices in said network, said available bandwidth information inserted in said LSR as said byte w′.
15. A storage area network comprising:
a plurality of network nodes each capable of receiving and transmitting data;
one or more switch devices for routing data over links interconnecting said nodes, each switch including a port interfaced to a link for communicating data along paths including one or more links in the network, each port transmitting data as words of predetermined length, one data word indicating idle port activity, wherein the switch device comprises:
first counter means for counting a fixed amounts of transmitted words received from said port;
means for comparing each received word of said fixed amount with a predetermined word indicating said idle port transmission activity; and,
means for counting a number of matches in a second counter means,
a processing device for computing a ratio of a number of counted matches with said fixed amount of words counted, said ratio indicating available bandwidth for transmitting additional data through said port, and said processing device communicating said available bandwidth information to other switch devices to thereby optimize path selection over links in the network according to a path routing algorithm.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/965,274 US20080101256A1 (en) | 2002-09-10 | 2007-12-27 | System and method for selecting fibre channel switched fabric frame paths |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/238,751 US7339896B2 (en) | 2002-09-10 | 2002-09-10 | Available bandwidth detector for SAN switch ports |
US10/317,765 US7327692B2 (en) | 2002-09-10 | 2002-12-12 | System and method for selecting fibre channel switched fabric frame paths |
US11/965,274 US20080101256A1 (en) | 2002-09-10 | 2007-12-27 | System and method for selecting fibre channel switched fabric frame paths |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/317,765 Continuation US7327692B2 (en) | 2002-09-10 | 2002-12-12 | System and method for selecting fibre channel switched fabric frame paths |
Publications (1)
Publication Number | Publication Date |
---|---|
US20080101256A1 true US20080101256A1 (en) | 2008-05-01 |
Family
ID=39329980
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/317,765 Expired - Fee Related US7327692B2 (en) | 2002-09-10 | 2002-12-12 | System and method for selecting fibre channel switched fabric frame paths |
US11/965,274 Abandoned US20080101256A1 (en) | 2002-09-10 | 2007-12-27 | System and method for selecting fibre channel switched fabric frame paths |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/317,765 Expired - Fee Related US7327692B2 (en) | 2002-09-10 | 2002-12-12 | System and method for selecting fibre channel switched fabric frame paths |
Country Status (1)
Country | Link |
---|---|
US (2) | US7327692B2 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7697555B1 (en) * | 2003-07-17 | 2010-04-13 | Marvell International Ltd. | Fibre channel SERDES with elastic transmitter FIFO |
Families Citing this family (51)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7339896B2 (en) * | 2002-09-10 | 2008-03-04 | International Business Machines Corporation | Available bandwidth detector for SAN switch ports |
US7327692B2 (en) * | 2002-09-10 | 2008-02-05 | International Business Machines Corporation | System and method for selecting fibre channel switched fabric frame paths |
US8151318B1 (en) * | 2003-02-25 | 2012-04-03 | Cisco Technology, Inc. | Method and apparatus for reliably and asymmetrically distributing security information within a fibre channel fabric |
JP4214919B2 (en) * | 2004-01-16 | 2009-01-28 | 株式会社日立製作所 | Storage switch with bandwidth control function |
US8843978B2 (en) | 2004-06-29 | 2014-09-23 | Time Warner Cable Enterprises Llc | Method and apparatus for network bandwidth allocation |
US7567565B2 (en) | 2005-02-01 | 2009-07-28 | Time Warner Cable Inc. | Method and apparatus for network bandwidth conservation |
NZ541666A (en) * | 2005-08-05 | 2008-09-26 | Elizabeth Cramer | Methods of modulating apoptosis and platelet production using an isolated oligonucleotide, its compliment, a vector with the expression sequence or an isolated polypeptide all relating to cytochrome C |
US8458753B2 (en) | 2006-02-27 | 2013-06-04 | Time Warner Cable Enterprises Llc | Methods and apparatus for device capabilities discovery and utilization within a content-based network |
US8170065B2 (en) | 2006-02-27 | 2012-05-01 | Time Warner Cable Inc. | Methods and apparatus for selecting digital access technology for programming and data delivery |
US9386327B2 (en) | 2006-05-24 | 2016-07-05 | Time Warner Cable Enterprises Llc | Secondary content insertion apparatus and methods |
US8280982B2 (en) | 2006-05-24 | 2012-10-02 | Time Warner Cable Inc. | Personal content server apparatus and methods |
US8024762B2 (en) | 2006-06-13 | 2011-09-20 | Time Warner Cable Inc. | Methods and apparatus for providing virtual content over a network |
US20080065749A1 (en) * | 2006-09-08 | 2008-03-13 | Simge Kucukyavuz | System and method for connectivity between hosts and devices |
US8181206B2 (en) | 2007-02-28 | 2012-05-15 | Time Warner Cable Inc. | Personal content server apparatus and methods |
US20080235746A1 (en) | 2007-03-20 | 2008-09-25 | Michael James Peters | Methods and apparatus for content delivery and replacement in a network |
US7761629B2 (en) * | 2007-06-04 | 2010-07-20 | International Business Machines Corporation | Method for using host and storage controller port information to configure paths between a host and storage controller |
US20080301333A1 (en) * | 2007-06-04 | 2008-12-04 | International Business Machines Corporation | System and article of manufacture for using host and storage controller port information to configure paths between a host and storage controller |
US9071859B2 (en) | 2007-09-26 | 2015-06-30 | Time Warner Cable Enterprises Llc | Methods and apparatus for user-based targeted content delivery |
US8561116B2 (en) | 2007-09-26 | 2013-10-15 | Charles A. Hasek | Methods and apparatus for content caching in a video network |
US8099757B2 (en) * | 2007-10-15 | 2012-01-17 | Time Warner Cable Inc. | Methods and apparatus for revenue-optimized delivery of content in a network |
US9503691B2 (en) | 2008-02-19 | 2016-11-22 | Time Warner Cable Enterprises Llc | Methods and apparatus for enhanced advertising and promotional delivery in a network |
US8813143B2 (en) | 2008-02-26 | 2014-08-19 | Time Warner Enterprises LLC | Methods and apparatus for business-based network resource allocation |
CN101286947B (en) * | 2008-05-30 | 2010-12-01 | 杭州华三通信技术有限公司 | Data output controlling method and device therefor |
US7995481B2 (en) * | 2008-07-31 | 2011-08-09 | Cisco Technology, Inc. | Hop cost as secondary metric for equal cost multi-paths |
US8190768B2 (en) * | 2008-10-31 | 2012-05-29 | Toshiba America Research, Inc. | Network selection mechanism |
US9866609B2 (en) | 2009-06-08 | 2018-01-09 | Time Warner Cable Enterprises Llc | Methods and apparatus for premises content distribution |
US9178634B2 (en) | 2009-07-15 | 2015-11-03 | Time Warner Cable Enterprises Llc | Methods and apparatus for evaluating an audience in a content-based network |
US8813124B2 (en) | 2009-07-15 | 2014-08-19 | Time Warner Cable Enterprises Llc | Methods and apparatus for targeted secondary content insertion |
US8701138B2 (en) | 2010-04-23 | 2014-04-15 | Time Warner Cable Enterprises Llc | Zone control methods and apparatus |
US8867106B1 (en) * | 2012-03-12 | 2014-10-21 | Peter Lancaster | Intelligent print recognition system and method |
US9078040B2 (en) | 2012-04-12 | 2015-07-07 | Time Warner Cable Enterprises Llc | Apparatus and methods for enabling media options in a content delivery network |
US9854280B2 (en) | 2012-07-10 | 2017-12-26 | Time Warner Cable Enterprises Llc | Apparatus and methods for selective enforcement of secondary content viewing |
US8862155B2 (en) | 2012-08-30 | 2014-10-14 | Time Warner Cable Enterprises Llc | Apparatus and methods for enabling location-based services within a premises |
US9131283B2 (en) | 2012-12-14 | 2015-09-08 | Time Warner Cable Enterprises Llc | Apparatus and methods for multimedia coordination |
US9450877B1 (en) | 2012-12-18 | 2016-09-20 | Juniper Networks, Inc. | Methods and apparatus for load balancing communication sessions |
US20140282786A1 (en) | 2013-03-12 | 2014-09-18 | Time Warner Cable Enterprises Llc | Methods and apparatus for providing and uploading content to personalized network storage |
US10028025B2 (en) | 2014-09-29 | 2018-07-17 | Time Warner Cable Enterprises Llc | Apparatus and methods for enabling presence-based and use-based services |
US10348645B2 (en) | 2016-01-27 | 2019-07-09 | Oracle International Corporation | System and method for supporting flexible framework for extendable SMA attributes in a high performance computing environment |
US11271870B2 (en) | 2016-01-27 | 2022-03-08 | Oracle International Corporation | System and method for supporting scalable bit map based P_Key table in a high performance computing environment |
US10586023B2 (en) | 2016-04-21 | 2020-03-10 | Time Warner Cable Enterprises Llc | Methods and apparatus for secondary content management and fraud prevention |
US10687115B2 (en) | 2016-06-01 | 2020-06-16 | Time Warner Cable Enterprises Llc | Cloud-based digital content recorder apparatus and methods |
US11212593B2 (en) | 2016-09-27 | 2021-12-28 | Time Warner Cable Enterprises Llc | Apparatus and methods for automated secondary content management in a digital network |
US10911794B2 (en) | 2016-11-09 | 2021-02-02 | Charter Communications Operating, Llc | Apparatus and methods for selective secondary content insertion in a digital network |
US10178038B1 (en) * | 2017-05-18 | 2019-01-08 | State Farm Mutual Automobile Insurance Company | System and computer-implemented method for dynamically changing network port speed of fiber channel initiator |
US11109290B2 (en) | 2017-08-04 | 2021-08-31 | Charter Communications Operating, Llc | Switching connections over frequency bands of a wireless network |
US10686734B2 (en) * | 2017-09-26 | 2020-06-16 | Hewlett Packard Enterprise Development Lp | Network switch with interconnected member nodes |
US10939142B2 (en) | 2018-02-27 | 2021-03-02 | Charter Communications Operating, Llc | Apparatus and methods for content storage, distribution and security within a content distribution network |
US11301906B2 (en) | 2020-03-03 | 2022-04-12 | BrandActif Ltd. | Method and system for digital marketing and the provision of digital content |
SG10202001898SA (en) | 2020-03-03 | 2021-01-28 | Gerard Lancaster Peter | Method and system for digital marketing and the provision of digital content |
US11593843B2 (en) | 2020-03-02 | 2023-02-28 | BrandActif Ltd. | Sponsor driven digital marketing for live television broadcast |
US11854047B2 (en) | 2020-03-03 | 2023-12-26 | BrandActif Ltd. | Method and system for digital marketing and the provision of digital content |
Citations (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5502719A (en) * | 1994-10-27 | 1996-03-26 | Hewlett-Packard Company | Path allocation system and method having double link list queues implemented with a digital signal processor (DSP) for a high performance fiber optic switch |
US5519695A (en) * | 1994-10-27 | 1996-05-21 | Hewlett-Packard Company | Switch element for fiber channel networks |
US5528584A (en) * | 1994-10-27 | 1996-06-18 | Hewlett-Packard Company | High performance path allocation system and method with fairness insurance mechanism for a fiber optic switch |
US5591472A (en) * | 1994-08-29 | 1997-01-07 | Cummins Eagle, Inc. | Dough cut-off method and apparatus |
US5784372A (en) * | 1995-04-18 | 1998-07-21 | Northern Telecom Limited | Scheduling connections across a switching matrix |
US5878029A (en) * | 1995-07-03 | 1999-03-02 | Nippon Telegraph And Telephone Corporation | Variable-bandwidth network |
US6016306A (en) * | 1993-12-24 | 2000-01-18 | International Business Machines Corporation | Routing bandwidth-reserved connections in information networks |
US6016307A (en) * | 1996-10-31 | 2000-01-18 | Connect One, Inc. | Multi-protocol telecommunications routing optimization |
US6019306A (en) * | 1997-11-25 | 2000-02-01 | Voith Sulzer Finishing Gmbh | Roll winding device |
US6130879A (en) * | 1997-09-22 | 2000-10-10 | Integrated Telecom Express | Access and setup process for end-to-end data and analog voice connections |
US6233236B1 (en) * | 1999-01-12 | 2001-05-15 | Mcdata Corporation | Method and apparatus for measuring traffic within a switch |
US20020012340A1 (en) * | 2000-06-19 | 2002-01-31 | Broadcom Corporation | Frame forwarding in a switch fabric |
US6370119B1 (en) * | 1998-02-27 | 2002-04-09 | Cisco Technology, Inc. | Computing the widest shortest path in high-speed networks |
US20030016630A1 (en) * | 2001-06-14 | 2003-01-23 | Microsoft Corporation | Method and system for providing adaptive bandwidth control for real-time communication |
US6687651B2 (en) * | 2002-01-10 | 2004-02-03 | Fujitsu Network Communications, Inc. | Real time estimation of equivalent bandwidth utilization |
US20040024908A1 (en) * | 2002-07-31 | 2004-02-05 | Brocade Communications Systems, Inc. | Topology database synchronization |
US20040047291A1 (en) * | 2002-09-10 | 2004-03-11 | International Business Machines Corporation | Available bandwidth detector for SAN switch ports |
US6888800B1 (en) * | 1998-11-14 | 2005-05-03 | Emulex Design & Manufacturing Corporation | High performance digital loop diagnostic technology |
US7180909B1 (en) * | 2001-12-17 | 2007-02-20 | Supergate Technology Usa, Inc. | Interface receive circuits for modularized data optimization engines and methods therefor |
US7327692B2 (en) * | 2002-09-10 | 2008-02-05 | International Business Machines Corporation | System and method for selecting fibre channel switched fabric frame paths |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5592472A (en) * | 1994-10-27 | 1997-01-07 | Hewlett-Packard Company | High performance path allocation system and method for a fiber optic switch for a fiber optic network |
US6141327A (en) * | 1997-06-27 | 2000-10-31 | Advanced Micro Devices, Inc. | Arrangement for regulating packet flow rate in half-duplex networks |
US6715034B1 (en) | 1999-12-13 | 2004-03-30 | Network Appliance, Inc. | Switching file system request in a mass storage system |
-
2002
- 2002-12-12 US US10/317,765 patent/US7327692B2/en not_active Expired - Fee Related
-
2007
- 2007-12-27 US US11/965,274 patent/US20080101256A1/en not_active Abandoned
Patent Citations (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6016306A (en) * | 1993-12-24 | 2000-01-18 | International Business Machines Corporation | Routing bandwidth-reserved connections in information networks |
US5591472A (en) * | 1994-08-29 | 1997-01-07 | Cummins Eagle, Inc. | Dough cut-off method and apparatus |
US5502719A (en) * | 1994-10-27 | 1996-03-26 | Hewlett-Packard Company | Path allocation system and method having double link list queues implemented with a digital signal processor (DSP) for a high performance fiber optic switch |
US5519695A (en) * | 1994-10-27 | 1996-05-21 | Hewlett-Packard Company | Switch element for fiber channel networks |
US5528584A (en) * | 1994-10-27 | 1996-06-18 | Hewlett-Packard Company | High performance path allocation system and method with fairness insurance mechanism for a fiber optic switch |
US5784372A (en) * | 1995-04-18 | 1998-07-21 | Northern Telecom Limited | Scheduling connections across a switching matrix |
US5878029A (en) * | 1995-07-03 | 1999-03-02 | Nippon Telegraph And Telephone Corporation | Variable-bandwidth network |
US6144641A (en) * | 1996-10-31 | 2000-11-07 | Kapcom Industries | Multi-protocol telecommunications routing optimization |
US6016307A (en) * | 1996-10-31 | 2000-01-18 | Connect One, Inc. | Multi-protocol telecommunications routing optimization |
US6130879A (en) * | 1997-09-22 | 2000-10-10 | Integrated Telecom Express | Access and setup process for end-to-end data and analog voice connections |
US6019306A (en) * | 1997-11-25 | 2000-02-01 | Voith Sulzer Finishing Gmbh | Roll winding device |
US6370119B1 (en) * | 1998-02-27 | 2002-04-09 | Cisco Technology, Inc. | Computing the widest shortest path in high-speed networks |
US6888800B1 (en) * | 1998-11-14 | 2005-05-03 | Emulex Design & Manufacturing Corporation | High performance digital loop diagnostic technology |
US6233236B1 (en) * | 1999-01-12 | 2001-05-15 | Mcdata Corporation | Method and apparatus for measuring traffic within a switch |
US20020012340A1 (en) * | 2000-06-19 | 2002-01-31 | Broadcom Corporation | Frame forwarding in a switch fabric |
US20030016630A1 (en) * | 2001-06-14 | 2003-01-23 | Microsoft Corporation | Method and system for providing adaptive bandwidth control for real-time communication |
US7180909B1 (en) * | 2001-12-17 | 2007-02-20 | Supergate Technology Usa, Inc. | Interface receive circuits for modularized data optimization engines and methods therefor |
US6687651B2 (en) * | 2002-01-10 | 2004-02-03 | Fujitsu Network Communications, Inc. | Real time estimation of equivalent bandwidth utilization |
US20040024908A1 (en) * | 2002-07-31 | 2004-02-05 | Brocade Communications Systems, Inc. | Topology database synchronization |
US20040047291A1 (en) * | 2002-09-10 | 2004-03-11 | International Business Machines Corporation | Available bandwidth detector for SAN switch ports |
US7327692B2 (en) * | 2002-09-10 | 2008-02-05 | International Business Machines Corporation | System and method for selecting fibre channel switched fabric frame paths |
US7339896B2 (en) * | 2002-09-10 | 2008-03-04 | International Business Machines Corporation | Available bandwidth detector for SAN switch ports |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7697555B1 (en) * | 2003-07-17 | 2010-04-13 | Marvell International Ltd. | Fibre channel SERDES with elastic transmitter FIFO |
Also Published As
Publication number | Publication date |
---|---|
US20040047294A1 (en) | 2004-03-11 |
US7327692B2 (en) | 2008-02-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7327692B2 (en) | System and method for selecting fibre channel switched fabric frame paths | |
JP5111591B2 (en) | Method and apparatus for multiple gigabit ethernet architecture | |
US9614776B1 (en) | Systems and methods for transmitting data according to an auto-negotiated data rate | |
EP1514388B1 (en) | Methods and apparatus for characterizing a route in a fibre channel fabric | |
US8179808B2 (en) | Network path tracing method | |
US8102777B2 (en) | Network diagnostic systems and methods for aggregated links | |
US7945164B2 (en) | Multiple fiber optic gigabit ethernet links channelized over single optical link | |
EP2003823B1 (en) | Autonegotiation over an interface for which no autonegotiation standard exists | |
US6272552B1 (en) | Dual channel 100Base-T link for computer networks | |
US6925078B1 (en) | Network adaptor driver with destination based ordering | |
US7339896B2 (en) | Available bandwidth detector for SAN switch ports | |
US6925058B2 (en) | Credit management for data flow between two networks | |
Ocheltree et al. | A comparison of fibre channel and 802 MAC services | |
Tolmie | High-Performance Parallel Interface (HIPPI) | |
Primmer | An introduction to fibre channel | |
Tolmie et al. | From HiPPI-800 to HiPPI-6400: A changing of the guard and gateway to the future | |
Ballingam et al. | Analysis of client/server transaction delay through a local area network switch | |
DeCusatis | Lossless Ethernet for the Data Center | |
Kiranmai et al. | The 10 Gigabit Ethernet | |
Christensen et al. | Emerging trends-Full-duplex and the switched LAN | |
Shaker | Modelling and simulation of Ethernet based networked mechanical systems | |
Ragnarsson | Design Guidelines for Switched Ethernet and Fast Ethernet Networks | |
DeCusatis | Handbook of Fiber Optic Data Communication: Chapter 9. Lossless Ethernet for the Data Center | |
Kipp et al. | Fibre Channel—The Storage Interconnect | |
US20060023692A1 (en) | Exemplary method and apparatus for creating an efficient storage area network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |