This disclosure relates in general to the field of communications and, more particularly, to diagnosis and throughput measurement of Fibre Channel (FC) ports in a storage area network (SAN) environment.
A SAN transfers data between computer systems and storage elements through a specialized high-speed Fibre Channel network. The SAN consists of a communication infrastructure, which provides physical connections. It also includes a management layer, which organizes the connections, storage elements, and computer systems so that data transfer is secure and robust. The SAN allows any-to-any connections across the network by using interconnect elements such as switches. The SAN introduces the flexibility of networking to enable one server or many heterogeneous servers to share a common storage utility. The SAN might include many storage devices, including disks, tapes, and optical storage. Additionally, the storage utility might be located far from the servers that use it.
To provide a more complete understanding of the present disclosure and features and advantages thereof, reference is made to the following description, taken in conjunction with the accompanying figures, wherein like reference numerals represent like parts, in which:
Overview
An example method for diagnosis and throughput measurement of FC ports in a SAN environment is provided and includes generating, by a control processor at a generator in the SAN, a control packet requesting a link test to be performed with a reflector in the SAN, sending the control packet to the reflector through a media access controller (MAC) of the generator, receiving, at the MAC of the generator, an acknowledgement from the reflector indicating ability to perform the requested link test, generating, at the MAC of the generator, a test data packet for the link test, performing the link test with the reflector, and analyzing, at the generator, network parameters based on results of the link test.
As used herein, the terms “generator” and “reflector” refer to hardware network elements including SAN switches, network appliances, routers, gateways, bridges, load balancers, or any other suitable device, component, element, or object operable to route and/or switch and exchange information in a SAN network environment. Moreover, the network elements may include any suitably configured hardware provisioned with suitable software, components, modules, interfaces, or objects that facilitate the operations thereof. This may be inclusive of appropriate algorithms and communication protocols that allow for the effective exchange of information.
Turning to
Generator 12 and reflector 14 are directly connected (e.g., attached, linked, joined, coupled, etc.) with each other over one or more back-to-back links, with no intervening network elements in between them. As used herein, a “link” is a communications channel (e.g., information transfer path within a network) that connects two or more network elements. The link may be physical (e.g., cable) or it may be logical, using one or more physical links. For example, generator 12 and reflector 14 may be connected directly by links 18. In a back-to-back link, output from one network element, for example, generator 12, is connected to input of the other network element, for example, reflector 14, and vice versa. According to various embodiments, generator 12 and reflector 14 may be configured to verify FC link performance, throughput performance and other link characteristics in a new back-to-back link 20.
For purposes of illustrating the techniques of communication system 10, it is important to understand the communications that may be traversing the system shown in
Fibre Channel (FC) is a high speed serial interface technology that supports several higher layer protocols including Small Computer System Interface (SCSI) and Internet Protocol (IP). FC is a gigabit speed networking technology primarily used in SANs. SANs include servers and storage (SAN devices being called nodes) interconnected via a network of SAN switches using FC protocol for transport of frames. The servers host applications that eventually initiate read and write operations (also called input/output (IO) operations) of data towards the storage. Before any IO operations can be executed, the nodes login to the SAN (e.g., through fabric login (FLOGI) operations) and then to each other (e.g., through port login (PLOGI) operations).
The data involved in IO operations originate as Information Units (IU) passed from an application to the transport protocol. The IUs are packaged into frames for transport in the underlying FC network. In a general sense, a frame is an indivisible IU that may contain data to record on disc or control information such as a SCSI command. Each frame comprises a string of transmission words containing data bytes. All frames include a 24 bytes-long frame header in addition to a payload (e.g., which may be optional, but normally present, with size and contents determined by the frame type). The header is used to control link operation and device protocol transfers, and to detect missing frames or frames that are out of order. Various fields and subfields in the frame header can carry meta-data (e.g., data in addition to payload data, for transmitting protocol specific information). One or more frames form a sequence and multiple such sequences comprise an exchange.
Turning to hardware components of FC switches, each front-panel port of the FC switch has an associated physical layer (PHY) device interface and a media access controller (MAC). In typical switches, the port is located in a separate line card module that can be plugged into the FC switch chassis and interconnected with FC switch hardware components, such as crossbar fabric and control processors. On ingress, the PHY converts optical signals received at the port into electrical signals, sending the electrical stream of bits into the MAC.
The primary function of the MAC is to decipher FC frames from the incoming bit stream by identifying start-of-frame and end-of-frame markers in the bit stream, and other FC signaling primitives. In conjunction with frames being received, the MAC communicates with forwarding and queuing modules of the line card of the corresponding port. Before forwarding any frame, the MAC prepends an internal switch header onto the frame, providing a forwarding module of the line card having the port with details such as ingress port, type of port, ingress virtual SAN (VSAN), frame quality of service (QoS) markings, and a timestamp of when the frame entered the FC switch. The MAC also checks that the received frame contains no errors by validating its cyclic redundancy check (CRC).
The egress PHY/MAC modules of the egress port process frames leaving the FC switch. Note that the same PHY/MAC modules can act as ingress for some frames and egress for other frames. Frames arriving into the egress PHY/MAC module from within the FC switch have their switch internal header removed. If the output port is a Trunked E_Port (TE_Port), an Enhanced ISL (EISL) header is prepended to the frame. The frame timestamp is checked, and if the frame has been queued within the FC switch for too long (e.g., according to FC standards), it is dropped. The frames are transmitted onto the cable of the egress port. The outbound MAC is responsible for formatting the frame into the correct encoding over the cable, and inserting appropriate frame delimiters and other FC primitives to the frame.
Typical FC switches include a cross bar (XBAR) that can provide low-latency, high-throughput, non-blocking, and non-over-subscribed switching capacity between line card modules. In some switch architectures, crossbar capacity is provided to each line card slot as a small number of high-bandwidth channels, for example to facilitate performance-optimized (e.g., non-blocking, non-over-subscribed) line cards and host-optimized (e.g., non-blocking, over-subscribed) line cards, multiprotocol (Small Computer System Interface over IP (iSCSI) and Fibre Channel over IP (FCIP)) and intelligent (e.g., storage services) line cards.
In typical FC switches, the XBAR is provisioned in a supervisor module separate from the line cards of the switches. The supervisor modules provide two essential switch functions: (1) they house the control-plane processors that manage the switch and keep the switch operational; and (2) they house the crossbar switch fabrics and central arbiters used to provide data-plane connectivity between all the line cards in the chassis. Besides providing crossbar switch fabric capacity, the supervisor modules do not generally handle any frame forwarding or frame processing. (Frame forwarding and processing are handled within the distributed forwarding application specific integrated chips (ASICs) on the line cards themselves.) In some switches, the crossbar switch fabrics are provisioned on separate fabric cards inserted into the rear of the switch chassis rather than on supervisor modules. Control-plane functionality on the supervisor modules is handled by appropriate processors and memory elements (e.g., internal flash memory, hard disks, etc.).
Turning to SANs in general, in the past, SANs were traditionally small networks with few switches and devices and the SAN administrators' troubleshooting role was restricted to device level analysis using tools provided by server and/or storage vendors (e.g., EMC Ionix Control Center™, HDS Tuning Manager™, etc.). In contrast, current data center SANs involve a large network of FC switches that interconnect servers to storage. With servers becoming increasingly virtualized (e.g., virtual machines (VMs)) and/or mobile (e.g., migrating between servers) and storage capacity requirement increasing exponentially, there is an explosion of devices that login into the data center SAN. The increase in number of devices in the SAN also increases the number of ports, switches, communication links and tiers in the network.
Larger SANs also involve additional complexity of management and troubleshooting. In addition to complex troubleshooting of heterogeneous set of devices from different vendors, the networking in large scale SANs include multi-tier switches that may have to be analyzed and debugged for SAN performance issues. One common problem faced by administrators is troubleshooting link performance in the SAN. The effort can involve identifying various traffic flows from the application in the SAN, segregating misbehaving flows and eventually identifying the misbehaving links in the SAN. With larger SANs, the troubleshooting can become a tedious manual process, prone to operator error.
Communication system 10 is configured to address these issues (among others) to offer a system and method for diagnosis and throughput measurement of FC ports in a SAN environment. According to various embodiments, generator 12 generates a control packet and transmits the control packet to reflector 14, the control packet indicating a test mode according to which reflector 14 configures itself. Generator 12 generates a test data packet, performs a link test according to the test mode using the test data packet, and calculates network parameters from the link test. The network parameters can include latency, frame throughput, cable length, jitter, link integrity, link speed, network load, etc.
In various embodiments, the test mode can be chosen according to the network parameter to be tested using the link test and vice versa. For example, to test for latency, the test mode can involve setting ingress and egress ports at reflector 14 in loopback mode, such that the switch fabric at reflector 14 is bypassed for incoming data packets over link 20. The loopback test can enable verifying connectivity of link 20. In another example, to test for throughput, the test mode can involve configuring the switch fabric at reflector 14 to forward incoming data packets to the egress port connected to link 20. Various other reflector configurations may be included according to the network parameters to be tested under the broad scope of the embodiments.
Embodiments of communication system 10 can enable a network administrator to diagnose FC connections across two switches and also across end-to-end switches in a multi-hop FC network. In some embodiments, the diagnosis is enabled by exchanging protocol messages between endpoints (e.g., servers and storage devices) to negotiate the diagnostics test type, duration and other such test information, including signaling start and end of suitable tests. Embodiments of communication system 10 can facilitate physical layer diagnosis, for example, by verifying frame throughput, cable length, and latency; preventive diagnosis, for example, by verifying link performance before adding the link to a port channel (or other such aggregated link topology); and predicting network load, for example, by measuring load on FC network 11 before adding a new host or storage device to FC network 11.
In example network 11 illustrated in
According to various embodiments, generator 12 signals far-end reflector 14, for example, via appropriate control packets, to loopback packets arriving in a connecting port over new link 20. Upon receiving acknowledgement of generator 12's request, generator 12 configures its hardware to start test data packet (e.g., simulated data packet) generation for a certain period of time and/or certain number of test packets. Upon test completion, collected test results are used by generator 12 to make decisions regarding provisioning of new link 20.
In one example embodiment, generator 12 uses Exchange Peer Parameters Protocol (EPP) to signal reflector 14 for initiating the new link test. EPP is typically used by FC switches, such as generator 12 and reflector 14 to negotiate trunk mode, active VSAN list and other network parameters. EPP is also used as framework for other protocols such Peer Trunking Protocol (PTP), Port Channel Protocol (PCP) and Port Quiesce Protocol (PQP). EPP can also be used, according to embodiments of communication system 10, for communicating inter-switch link (ISL) diagnostics between FC switches, including generator 12 and reflector 14. A new extension for EPP according to various embodiments is referred to herein as Port Diagnostic Protocol (PDP). In an example embodiment, PDP has a value of 4 for protocol type.
Payload type-length-values (TLVs) used in the control packet sent from generator 12 to reflector 14 to initiate the link test includes EPP Payload TLVs. The control packet, comprising an EPP-PDP message is generated at generator 12 and is used to communicate various link tests and test modes to far-end reflector 14. The link test and test modes include diagnostic test start and stop time periods, and appropriate parameters for test setup and/or test execution on reflector 14. The EPP-PDP payload may include the following TLVs depending on the type of test: TestType: Latency|Traffic; TestCommand: Start|Stop; Test Duration: Number (e.g., indicating milliseconds); source identifier (SID): Fibre Channel ID (FCID) of source switch (e.g., generator 12); destination ID (DID): FCID of destination FC switch (e.g., reflector 14).
According to an example embodiment, when a start test command is given on generator 12 (e.g., manually through command line interface (CLI) instructions, or automatically through triggering of test upon link connection, etc.) generator 12 generates and sends a control packet comprising an EPP protocol message to far-end reflector 14. According to various embodiments, the link test can be executed routinely, or automatically, for example, as part of link bring-up and/or link provisioning. In other embodiments, the link test may be initiated upon user command, or invoked by a user initiated configuration command.
In one embodiment, the link test can be initiated by a user (e.g. a network administrator) through an application accessed on an administrative workstation such as a computer system that is connected to generator 12. The application may include one or more user interfaces, such as CLIs or graphical user interfaces (GUIs) that enable the user to identify link 20 intended to be diagnosed and to turn on a diagnostic mode. Turning on the diagnostic mode may automatically trigger the operations described herein on generator 12 and reflector 14 that are connected by identified link 20. In one embodiment, the user is able to decide which diagnostic tests to run on identified link 20. After the diagnostic tests have been performed, the result may be presented to the user for further analysis.
Assume, merely for example purposes that the control packet indicates a latency test on new back-to-back link 20. Accordingly, far-end reflector 14 puts a MAC on the PHY interface on which the message is received in Serdes loopback for the latency test. In the loopback test, reflector 14 sends the received signals (e.g., test data packets) back to generator 12. In some embodiments, reflector 14 may rewrite frame headers to indicate a changed source and destination for the test data packets before sending them back to generator 12. Reflector 14 also starts a timer, and sends an acknowledgement back to generator 12. When the EPP-PDP protocol exchange is successful (e.g., generator 12 receives the acknowledgement), test data packet generation is started on generator 12.
Note that EPP-PDP protocol exchange may be unsuccessful for a variety of reasons, such as: lack of software support at reflector 14 to support EPP-PDP protocol; lack of hardware support at reflector 14's port for the requested test (e.g., loopback test); reflector 14 is already running another diagnostic test; etc. If the protocol exchange fails for any reason, the link test is not started. In some embodiments, reserved Fabric Channel Identifiers (FCIDs) of source FCID=0xffff13 and destination FCID=0xffff14 may be used for Serdes loopback tests, for example, to enable proper routing of generated and received frames within the FC switch hardware functional blocks. Simulated traffic tests can be initiated with various payload patterns up to 100% of link capacity. In some example embodiments, simulated traffic tests may use encapsulation of source FCID=0xffff15 and destination FCID=0xffff16 to distinguish them from other user FC traffic, for example, so that test packets can be routed appropriately.
Turning to the infrastructure of communication system 10, the network topology can include any number of initiators, targets, servers, hardware accelerators, virtual machines, switches (including distributed virtual switches), routers, and other nodes inter-connected to form a large and complex network. Network 11 represents a series of points or nodes of interconnected communication paths for receiving and transmitting packets and/or frames of information that are delivered to communication system 10. A node may be any electronic device, printer, hard disk drive, client, server, peer, service, application, or other object capable of sending, receiving, or forwarding information over communications channels in a network, for example, using FC and other such protocols. Elements of
Network 11 offers a communicative interface between targets (e.g., storage devices) and/or initiators (e.g., hosts, servers, etc.), and may include any local area network (LAN), wireless local area network (WLAN), metropolitan area network (MAN), Intranet, Extranet, WAN, virtual private network (VPN), or any other appropriate architecture or system that facilitates communications in a network environment and can provide lossless service, for example, similar to (or according to) Fibre Channel over Ethernet (FCoE) protocols. Network 11 may implement any suitable communication protocol for transmitting and receiving data packets within communication system 10. The architecture of the present disclosure may include a configuration capable of TCP/IP, FC, FCoE, and/or other communications for the electronic transmission or reception FC frames in a network. The architecture of the present disclosure may also operate in conjunction with any suitable protocol, where appropriate and based on particular needs. In addition, gateways, routers, switches, and any other suitable nodes (physical or virtual) may be used to facilitate electronic communication between various nodes in the network.
Note that the numerical and letter designations assigned to the elements of
In some embodiments, a communication link may represent any electronic link supporting a LAN and/or SAN environment such as, for example, cable, Ethernet, wireless technologies (e.g., IEEE 802.11x), ATM, fiber optics, etc. or any suitable combination thereof. In other embodiments, communication links may represent a remote connection through any appropriate medium (e.g., digital subscriber lines (DSL), telephone lines, T1 lines, T3 lines, wireless, satellite, fiber optics, cable, Ethernet, etc. or any combination thereof) and/or through any additional networks such as a wide area networks (e.g., the Internet).
Turning to
Example reflector 14 includes a control processor 42 and a memory element 44. Control processor 42 may be connected to a XBAR 46. In some embodiments, control processor 42, memory element 44 and XBAR 46 may be provisioned in a single supervisor module of reflector 14. In other embodiments, control processor 42 and memory element 44 may be provisioned in the supervisor module and XBAR 46 may be provisioned in a separate fabric card of reflector 14. XBAR 46 may communicate with a port 47. Port 27 includes a MAC 48, a PHY 50, a forwarding module 52 and a queuing module 54 Reflector 14 can also include a timer 56.
Note that although generator 12 and reflector 14 are shown as having separate and different modules, the modules are based on the respective functionalities. Each of generator 12 and reflector 14 may include modules of the other when performing the corresponding operations. For example, generator 12 may function as reflector 14 under certain situations, and vice versa. In such instances, the switch shown as reflector 14 may include modules of the switch shown as generator 12, and vice versa.
Note that each port 27 and 47 can comprise line cards that plug into or are otherwise connected to generator 12 and reflector 14, respectively. In various embodiments, MAC 28 and MAC 48 provide respective interfaces between incoming/outgoing data signals and internal switch signals (e.g., to the SAN fabric). MAC 28 and MAC 48 are integrated circuits connected to respective PHY 30 and 50. MAC 28 and MAC 48 include processing units capable of processing at 1, 2, 4 or 10 Gbps and support various FC ports, such as F_Port, Loop Port (FL_Port), Private Loop (TL_Port), ISL (E_Port), EISL (TE_Port), SPAN Port (SD_Port). PHY 30 and 50 include hardware components including (or connected to) optical to electrical transceivers (e.g., small form factor pluggable optics at 1, 2 or 4 Gbps line rate). In some embodiments, MAC and PHY (e.g., MAC 28 and PHY 30, or MAC 48 and PHY 50) may be integrated into a single hardware component (e.g., single-chip integrated circuit) connected to appropriate transceivers.
Merely as an example to describe certain functions of the various modules of ports 27 and 47, consider port 47 at reflector 14. At ingress, PHY 50 performs CRC error checking of the ingress frame, performs ingress rate limiting, prepends switch internal header (e.g., ingress port, ingress VSAN, QoS bits, etc.), and timestamps ingress frame arrival time. Forwarding module 52 looks up hard zoning rules (e.g., per-VSAN ingress access control lists (ACLs)), FC/multi-protocol label switching (MPLS) forwarding rules (e.g., per-VSAN), determines final egress interface according to load balancing algorithms (e.g., equal cost fabric shortest path first (FSPF), PortChannel hash, etc.) and performs FC network address translation (FC NAT). Queuing module 54 queues frames destined to egress ports according to various virtual queues and other buffering algorithms before forwarding the frame to XBAR 46.
At egress, forwarding module 52 receives frames from XBAR 46, looks up hard zoning rules (e.g., per VSAN egress ACLs), revalidates frame CRC, performs egress QoS, and FC NAT. PHY 50 and MAC 48 transmits, loopbacks or expires frames according to the appropriate forwarding instructions from forwarding module 52 and ingress timestamp, removes switch internal header from the outgoing frame, and prepends other appropriate headers (e.g., EISL header if egress port is a TE_Port) to the frame. Note that although the ingress and egress operations are described with respect to reflector 14, similar operations are performed by the corresponding modules and components of generator 12.
According to various embodiments, during operation, control packet generator 36 generates a control packet 60, for example, comprising an EPP-PDP message. Control processor 22 forwards control packet 60 to XBAR 26, which forwards it to MAC 28. MAC 28 adds appropriate headers, etc. Control packet 60 is sent out through MAC 28 and PHY 30 over the link under test (e.g., new link 20) to reflector 14. PHY 50 at reflector 14 receives control packet 60 and MAC 48 forwards it to XBAR 46. XBAR 46 identifies the incoming packet as a control packet and forwards control packet 60 to control processor 42. Control processor 42 analyzes control packet 60 and provides configuration instructions to XBAR 46 and MAC 48. For example, MAC 48 may be configured for Serdes loopback for a latency test, bypassing XBAR 46. In one embodiment, XBAR 46 may configure MAC 48 according to the test mode and other configuration options provided in control packet 60 from generator 12. In another embodiment, control processor 42 may directly configure MAC 48, without involving XBAR 46.
Reflector 14 sends an acknowledgement packet 62 (e.g., according to EPP) back to generator 12. Control processor 22 at generator 12 configures MAC 28 to generate test data packets when acknowledgement packet 62 is received indicating that reflector 14 can perform the requested link test. Test data packet generator 40 at MAC 28 generates a test data packet (e.g., simulated data packet) 64. PHY 30 forwards test data packet 64 to reflector 14, at which it is received by PHY 50. Assume, merely for example purposes, that the requested link test is a latency test, in which MAC 48 is configured in loopback mode. Thus, MAC 48 may rewrite frame headers appropriately and send out test packet 64 through PHY 50 back to generator 12, without forwarding test data packet 64 to XBAR 46. Timer 48 may time the time taken at reflector 14 and include the information in test data packet 64 returned to generator 12. For example, MAC 48 may timestamp test data packet 64 before sending it out.
Test data packet 64 is received at PHY 30 of generator 12. Various parameters are parsed and extracted from test data packet 64 by PHY 30 and MAC 28 and forwarded to analysis engine 38. Analysis engine 38 at generator 12 analyzes information in returned test data packet 64 and computes latency over the link under test, and other network parameters as appropriate.
Turning to
Reflector 14 sends acknowledgement packet 62 (e.g., according to EPP) back to generator 12. Control processor 22 at generator 12 configures MAC 28 to generate test data packets when acknowledgement packet 62 is received indicating that reflector 14 can perform the requested link test. Test data packet generator 40 generate test data packet 64 at MAC 28. PHY 30 forwards test data packet 64 to reflector 14, at which it is received by PHY 50. MAC 48 forwards test data packet 64 to forwarding module 52, which sends it to queuing module 54, and subsequently test data packet 64 is forwarded to XBAR 46. XBAR 46 loopbacks test data packet to MAC 48 according to its configured settings. MAC 48 rewrites frame headers appropriately and send out test packet 64 through PHY 50 back to generator 12. Timer 48 may time the time taken at reflector 14 and include the information in test data packet 64 returned to generator 12. For example, MAC 48 may timestamp test data packet 64 before sending it out.
Test data packet 64 is received at PHY 30 of generator 12. Various parameters are parsed and extracted from test data packet 64 by PHY 30 and MAC 28 and forwarded to analysis engine 38. Analysis engine 38 at generator 12 analyzes information in returned test data packet 64 and computes throughput over the link under test, and other network parameters as appropriate.
Turning to
According to embodiments of communication system 10, link diagnostics can be performed across another network 80 that can include additional network elements, including the Internet. Such diagnostics can be used to diagnose and/or predict network problems in end-to-end connections (e.g., connections other than back-to-back links). For example, an egress port 82 and an ingress port 84 at generator 12 may face an endpoint, such as a new server being introduced into SAN 11. Similarly, an egress port 86 and an ingress port 88 at reflector 14 may face another endpoint, such as a storage device. In one embodiment, egress port 82 and ingress port 84 comprise simulated endpoints, with simulated FCID 70; likewise, egress port 86 and ingress port 88 comprise simulated endpoints with corresponding simulated FCID 72.
Traffic on a typical SAN arises from FC endpoints such as servers and storage devices. For the FC switches to forward traffic, the traffic must originate and terminate at legitimate endpoints (e.g., endpoints that have logged into the FC switches appropriately). In a general sense, when a SAN endpoint (e.g., host such as server or storage device) plugs into a FC switch, the host end is called an N_Port (Node Port), and the FC switch's interface is called an F_Port (Fabric Port). The host has a port world-wide name (pWWN), which is a 64-bit globally unique label (e.g., analogous to a Media Access Control address). When the N_Port is attached to the switch port F_Port, an extended link initiation procedure known as fabric login (FLOGI) is used. Note that in switched FC environments, such as in SAN 11, FLOGI accomplishes various tasks, including assigning, by the switch, an FCID (e.g., analogous to an IP address) to the requesting N_Port. The FCID is a 24-bit number, which is used appropriately in the source and destination fields of the frame header. The simulated FCID indicates a simulated endpoint that is presumed to be connected to the FC switch.
According to embodiments of communication system 10, FC switches at the two test endpoints simulate device FLOGIs. The simulated device FLOGIs acquire FCIDs (e.g., 70 and 72) and the acquired FCIDs are communicated throughout network 80, including SAN 11, using suitable FC routing protocol, such as Fabric Shortest Path First (FSPF). Subsequently, traffic can flow between the simulated device FLOGIs 70 and 72 over network 80. In some embodiments, appropriate hardware components of the FC switches including generator 12 and reflector 14 are used for traffic generation and local loopback of the traffic on the MACs.
Simulated FCIDs 70 and 72 are programmed into forwarding tables and other appropriate routing/switching tables in the various components of the respective FC switches. For example, XBAR 26 and 46 can correlate FCIDs 70 and 72, respectively, with certain ports (e.g., simulated ports) in the respective FC switches. MACs 28 and 48 can be programmed to insert simulated FCID 70 and 72 into appropriate frame headers (e.g., to indicate source and/or destination), and so on.
Generator 12 and reflector 14 can be multiple hops away in the SAN. Simulated endpoints 70 and 72 are used with appropriate communication protocols to start and stop the link tests. EPP protocol used in back-to back-ISL links cannot be used for the multi-hop diagnosis, in part because EPP is used when a new link is activated, whereas testing between endpoints multiple hops away use established links between FC switches. On the other hand, a suitable end to end communication protocol such as Cisco Fabric Services (CFS) can be extended for the link tests in some embodiments.
In a general sense, one or more of a set of devices connected through some kind of network fabric have features that can benefit from exchanging information (e.g., configuration information) with peer devices providing the same features. CFS comprises a protocol that allows configuration for a feature provided on one device to be propagated to all other devices in the fabric. CFS is typically used for exchange of configuration information between various FC switches in the SAN, enabling automatic configuration synchronization in the SAN. CFS is FC2 based peer-to-peer protocol with no client-server relationship at the CFS layer. The CFS protocol can ensure reliable transport with facilities for unicast or broadcast capabilities. CFS has the ability to discover CFS capable switches in the SAN and discover application capabilities in all such discovered CFS capable switches. According to various embodiments, CFS provides both uncoordinated distributions where multiple parallel distributions are allowed in the fabric and coordinated distributions where only one distribution is allowed in the fabric at any given time.
CFS distribution functionality is independent of the lower transport layer; CFS facilitates a layering abstraction where applications can register with CFS and exchange information with discovered peers without any particular knowledge of the underlying mode of transport. Typically, the logical scope of messaging with CFS is within one or more specific VSAN across the entire physical topology of the SAN. Within a defined distribution scope, an FC switch can use CFS to distribute its configuration information to its peers running on other platforms.
In a general sense, a feature supported in any particular device (e.g., FC switch) may or may not be CFS capable. If the feature is CFS capable, the control of the CFS operations is instrumented through a CFS infrastructure provisioned on the device. Applications providing the features register with the CFS infrastructure as service access points (SAPs) and communicate end-to-end. Any service built over CFS communicates end-to-end via the CFS infrastructure. Typically, the CFS capable feature can be enabled for data distribution within the fabric by the user via SNMP. After the CFS capable feature is enabled for data distribution, CFS operations can be performed for that particular feature.
The CFS message generally contains a field indicating that it includes data that should be sent throughout the fabric and an application field indicating the use of such data. In one embodiment, CFS is extended with a “Fabric Diagnostic Application” that can be used for communication between generator 12 and reflector 14. According to the embodiment, at least three different kinds of CFS packets are exchanged between generator 12 and reflector 14 for performing diagnostics of end-to-end connections: (1) CFS_REQ; (2) CFS_ACC; and (3) CFS_RJT. CFS_REQ is sent by generator 12 to reflector 14 with CFS_CMD_CODE_DATA (0x01). In a general sense, the CFS_REQ packet is a unicast un-coordinated CFS message that can originate from any FC switch destined to any other FC switch within a specific VSAN.
Reflector 14 (e.g., the responding FC switch) typically responds with either an acknowledgement allowing (e.g., through a CFS_ACC message) or denying (e.g., through a CFS_RJT message) the CFS request based on whether reflector 14 can be programmed to loopback test data packets sent from given source pWWN destined to given destination pWWN. CFS_RJT may be sent due to any of the following reasons that do not permit the test mode specified in the CFS_REQ message, for example, reflector 14 does not support the loopback feature requested in hardware, or the requested feature cannot be enabled on the interface as it is in a shut state.
Embodiments of communication system 10 can facilitate verifying FC link performance in back-to-back connections and throughput analysis between end-to-end devices, among other network parameters. The protocol encapsulation exchanged between participating FC switches can provide a basis for the various messages exchanged between participating FC switches. In some embodiments, protocol encapsulation extends existing EPP protocol and CFS protocol to accomplish single-hop and multi-hop diagnosis, respectively.
Turning to
Reflector 14 sends acknowledgement packet 62 (e.g., CFS_ACC message) back to generator 12. Control processor 22 at generator 12 configures MAC 28 to generate test data packets when acknowledgement packet 62 is received indicating that reflector 14 can perform the requested link test. Test data packet generator 40 generates test data packet 64 at MAC 28. MAC 28 inserts simulated FCID 70 as the source and simulated FCID 72 as the destination for test data packet 64. PHY 30 forwards test data packet 64 to reflector 14, at which it is received by PHY 50. MAC 48 forwards test data packet 64 to forwarding module 52, which sends it to queuing module 54, and subsequently test data packet 64 is forwarded to XBAR 46. XBAR 46 loopbacks test data packet to MAC 48 according to its configured settings, sending test data packet 64 back to MAC 48 as if from simulated FCID 72. MAC 48 rewrites frame headers appropriately and send out test packet 64 through PHY 50 back to generator 12. Timer 48 may time the time taken at reflector 14 and include the information in test data packet 64 returned to generator 12. For example, MAC 48 may timestamp test data packet 64 before sending it out.
Test data packet 64 is received at PHY 30 of generator 12. Various parameters are parsed and extracted from test data packet 64 by PHY 30 and MAC 28 and forwarded to analysis engine 38. Analysis engine 38 at generator 12 analyzes information in returned test data packet 64 and computes throughput over the link under test, and other network parameters as appropriate.
Turning to
According to various embodiments, generator 12 and reflector 14 may be configured with respective fabric diagnostics application 124(1) and 124(2), which register with corresponding CFS infrastructure 120(1) and 120(2) to initiate link diagnostics over network 80. The registration enables fabric diagnostics application 124(1) and 124(2) to be assigned unique SAP identifiers, enabling selective routing and identification of source and destination points for CFS messages. In one embodiment, fabric diagnostic applications 124(1) and 124(2) simulate endpoints, performing FLOGIs and being assigned FCIDs. The unique SAP identifiers correspond to simulated FCIDs 70 and 72, respectively in some embodiments.
In one embodiment, the user (e.g., network administrator) instructs fabric diagnostics application 124(1) at generator 12 to initiate link diagnostics with fabric diagnostics application 124(2) at reflector 14. Fabric diagnostics application 124(2) at reflector 14 may be identified by its unique SAP identifier. Fabric diagnostics application 124(1) at generator 12 sends a control packet in CFS protocol to fabric diagnostics application 124(2) at reflector 14. Thereafter, reflector 14 configures itself according to the test mode and other parameters specified in the control packet and responds with an acknowledgement. If the acknowledgement indicates that reflector 14 can support the requested test, generator 12 generates test data packets and commences the multi-hop link diagnostics over network 80. Further analysis of the test results can indicate any potential problems with the links between endpoints connected by generator 12 and reflector 14.
Turning to
In general, endpoints 134 may be interconnected by one or more FC switches, including edge switches 130 and core switches 132 in SAN 11. Note that edge switches 130 and core switches 132 may differ merely in the devices to which their ports are connected. For example whereas at least some ports of edge switches 130 are connected to endpoints 134, the ports of core switches 132 are connected to other FC switches, including core or edge switches. Note that the network topology illustrated in the figure is merely as an example. Any number of FC switches and endpoints may be included in SAN 11 within the broad scope of the embodiments.
According to various embodiments, edge switches 130 and core switches 132 that are connected back-to-back may use EPP to perform link diagnostics of their new back-to-back links (e.g., NPV-SW1 may use EPP to perform link test of connection with NPIV-Core Switch 1; NPIV-Core Switch 1 may use EPP to perform link test of connection with NPIV-Core Switch 2; etc.). On the other hand, edge switches 130 may use CFS to perform link diagnostics of multi-hop connections between their respective endpoints 134 (e.g., NPV-SW1 may use CFS with NPV-SW3 to test multi-hop connections between server 1 and disk 3).
Turning to
Turning to
Turning to
Note that the example format of control packet 158 can also be used in response acknowledgement from reflector 14. For example, CFS message type REQ (e.g., value of 1) indicates a request message initiating the test from generator 12 to reflector 14; CFS message type ACC (e.g., value of 2) indicates that the test can be performed; CFS message type RJT (e.g., value of 3) indicates that the test cannot be performed (e.g., because reflector 14 does not have the requisite hardware for the test).
In one embodiment, some of the frame bytes (e.g., 64-67) may include a P Bit identifying a scope of distribution (e.g., 1 Physical, 0 Logical); a B Bit identifying a type of distribution (e.g., 1: Broadcast, 0: Unicast); and an L Bit with a value of 1 indicating last fragment or frame not fragmented. Note that other bits representing other indicators may be included within the broad scope of the embodiments. The application data TLVs can include the following information: TestCommand: Start Test: 1, Stop Test: 2; TestType: Multihop Throughput Test: 1; Source pWWN: 8 bytes; Destination pWWN: 8 bytes; and Destination Interface: 4 bytes. Note that the source and destination pWWN may comprise simulated ports representing corresponding endpoints and generated by the respective fabric diagnostics applications.
Turning to
Turning to
At 204, control packet generator 32 at generator 12 generates control packet 60. In some embodiments, for example, where a back-to-back link between two FC switches is being diagnosed, control packet 60 may include an EPP PDP message in EPP. In other embodiments, for example, where multi-hop connections are being diagnosed, control packet 60 may include a CFS request message in CFS protocol. Control packet 60 includes a request for a specific test (e.g., latency, throughput, etc.) and certain parameters or configuration settings (e.g., PHY/MAC in loopback mode, etc.) at reflector 14 for performing the requested test. At 206, generator 12 sends control packet 60 to reflector 14. At 208, generator 12 receives acknowledgement packet 62 from reflector 14. If acknowledgement packet 62 indicates that reflector 14 cannot perform the requested test, further operations are stopped.
If acknowledgement packet 62 indicates that reflector 14 can perform the requested test, at 210, test data packet generator 34 at generator 12 generates test data packet 64 for the link test. In one embodiment, test data packet 64 is generated by MAC 28 in hardware. Generator 12 may also configure its ports and analysis engines, etc. for performing the test and analyzing the test results. At 212, generator 12 sends test data packet 64 to reflector 14. At 214, generator 12 may receive test data packet 64 back from reflector 14. Received test data packet 64 may include metadata (e.g., timestamp) according to the requested test parameters of the control packet. At 216, generator 12 may calculate appropriate network parameters, including latency, throughput, etc. Note that steps 212 to 214 comprises the link test, and may be performed repeatedly until the desired test accuracy, repeatability, etc., are achieved.
Turning to
If reflector 14 can perform the requested test, as indicated in acknowledgement packet 62, reflector 14 receives test data packet 64 from generator 12 at 228. At 230, reflector 14 may start timer 48. At 232, reflector 14 may send test data packet 64 with appropriate metadata (e.g., timestamp) back to generator 12. Note that steps 228 to 232 comprises the link test, and may be performed repeatedly until the desired test accuracy, repeatability, etc., are achieved.
Note that in this Specification, references to various features (e.g., elements, structures, modules, components, steps, operations, characteristics, etc.) included in “one embodiment”, “example embodiment”, “an embodiment”, “another embodiment”, “some embodiments”, “various embodiments”, “other embodiments”, “alternative embodiment”, and the like are intended to mean that any such features are included in one or more embodiments of the present disclosure, but may or may not necessarily be combined in the same embodiments. Furthermore, the words “optimize,” “optimization,” and related terms are terms of art that refer to improvements in speed and/or efficiency of a specified outcome and do not purport to indicate that a process for achieving the specified outcome has achieved, or is capable of achieving, an “optimal” or perfectly speedy/perfectly efficient state.
In example implementations, at least some portions of the activities outlined herein may be implemented in software in, for example, generator 12 and reflector 14. In some embodiments, one or more of these features may be implemented in hardware, provided external to these elements, or consolidated in any appropriate manner to achieve the intended functionality. The various components may include software (or reciprocating software) that can coordinate in order to achieve the operations as outlined herein. In still other embodiments, these elements may include any suitable algorithms, hardware, software, components, modules, interfaces, or objects that facilitate the operations thereof.
Furthermore, generator 12 and reflector 14 described and shown herein (and/or their associated structures) may also include suitable interfaces for receiving, transmitting, and/or otherwise communicating data or information in a network environment. Additionally, some of the processors and memory elements associated with the various nodes may be removed, or otherwise consolidated such that a single processor and a single memory element are responsible for certain activities. In a general sense, the arrangements depicted in the FIGURES may be more logical in their representations, whereas a physical architecture may include various permutations, combinations, and/or hybrids of these elements. It is imperative to note that countless possible design configurations can be used to achieve the operational objectives outlined here. Accordingly, the associated infrastructure has a myriad of substitute arrangements, design choices, device possibilities, hardware configurations, software implementations, equipment options, etc.
In some of example embodiments, one or more memory elements (e.g., memory elements 24, 40) can store data used for the operations described herein. This includes the memory element being able to store instructions (e.g., software, logic, code, etc.) in non-transitory media, such that the instructions are executed to carry out the activities described in this Specification. A processor can execute any type of instructions associated with the data to achieve the operations detailed herein in this Specification. In one example, processors (e.g., control processors 22, 38; media access controllers 28, 48) could transform an element or an article (e.g., data) from one state or thing to another state or thing. In another example, the activities outlined herein may be implemented with fixed logic or programmable logic (e.g., software/computer instructions executed by a processor) and the elements identified herein could be some type of a programmable processor, programmable digital logic (e.g., a field programmable gate array (FPGA), an erasable programmable read only memory (EPROM), an electrically erasable programmable read only memory (EEPROM)), an ASIC that includes digital logic, software, code, electronic instructions, flash memory, optical disks, CD-ROMs, DVD ROMs, magnetic or optical cards, other types of machine-readable mediums suitable for storing electronic instructions, or any suitable combination thereof.
These devices may further keep information in any suitable type of non-transitory storage medium (e.g., random access memory (RAM), read only memory (ROM), field programmable gate array (FPGA), erasable programmable read only memory (EPROM), electrically erasable programmable ROM (EEPROM), etc.), software, hardware, or in any other suitable component, device, element, or object where appropriate and based on particular needs. The information being tracked, sent, received, or stored in communication system 10 could be provided in any database, register, table, cache, queue, control list, or storage structure, based on particular needs and implementations, all of which could be referenced in any suitable timeframe. Any of the memory items discussed herein should be construed as being encompassed within the broad term ‘memory element.’ Similarly, any of the potential processing elements, modules, and machines described in this Specification should be construed as being encompassed within the broad term ‘processor.’
It is also important to note that the operations and steps described with reference to the preceding FIGURES illustrate only some of the possible scenarios that may be executed by, or within, the system. Some of these operations may be deleted or removed where appropriate, or these steps may be modified or changed considerably without departing from the scope of the discussed concepts. In addition, the timing of these operations may be altered considerably and still achieve the results taught in this disclosure. The preceding operational flows have been offered for purposes of example and discussion. Substantial flexibility is provided by the system in that any suitable arrangements, chronologies, configurations, and timing mechanisms may be provided without departing from the teachings of the discussed concepts.
Although the present disclosure has been described in detail with reference to particular arrangements and configurations, these example configurations and arrangements may be changed significantly without departing from the scope of the present disclosure. For example, although the present disclosure has been described with reference to particular communication exchanges involving certain network access and protocols, communication system 10 may be applicable to other exchanges or routing protocols. Moreover, although communication system 10 has been illustrated with reference to particular elements and operations that facilitate the communication process, these elements, and operations may be replaced by any suitable architecture or process that achieves the intended functionality of communication system 10.
Numerous other changes, substitutions, variations, alterations, and modifications may be ascertained to one skilled in the art and it is intended that the present disclosure encompass all such changes, substitutions, variations, alterations, and modifications as falling within the scope of the appended claims. In order to assist the United States Patent and Trademark Office (USPTO) and, additionally, any readers of any patent issued on this application in interpreting the claims appended hereto, Applicant wishes to note that the Applicant: (a) does not intend any of the appended claims to invoke paragraph six (6) of 35 U.S.C. section 112 as it exists on the date of the filing hereof unless the words “means for” or “step for” are specifically used in the particular claims; and (b) does not intend, by any statement in the specification, to limit this disclosure in any way that is not otherwise reflected in the appended claims.
This application is a continuation of and claims priority to U.S. patent Ser. No. 14/594,108 entitled “Diagnosis and Throughput Measurement of Fibre Channel Ports in a Storage Area Network Environment,” filed on Jan. 10, 2015, the contents of which are expressly incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4688695 | Hirohata | Aug 1987 | A |
5263003 | Cowles et al. | Nov 1993 | A |
5339445 | Gasztonyi | Aug 1994 | A |
5430859 | Norman et al. | Jul 1995 | A |
5457746 | Dolphin | Oct 1995 | A |
5535336 | Smith et al. | Jul 1996 | A |
5588012 | Oizumi | Dec 1996 | A |
5617421 | Chin et al. | Apr 1997 | A |
5680579 | Young et al. | Oct 1997 | A |
5690194 | Parker et al. | Nov 1997 | A |
5740171 | Mazzola et al. | Apr 1998 | A |
5742604 | Edsall et al. | Apr 1998 | A |
5764636 | Edsall | Jun 1998 | A |
5809285 | Hilland | Sep 1998 | A |
5812814 | Sukegawa | Sep 1998 | A |
5812950 | Tom | Sep 1998 | A |
5838970 | Thomas | Nov 1998 | A |
5999930 | Wolff | Dec 1999 | A |
6035105 | McCloghrie et al. | Mar 2000 | A |
6101497 | Ofek | Aug 2000 | A |
6148414 | Brown et al. | Nov 2000 | A |
6185203 | Berman | Feb 2001 | B1 |
6188694 | Fine et al. | Feb 2001 | B1 |
6202135 | Kedem et al. | Mar 2001 | B1 |
6208649 | Kloth | Mar 2001 | B1 |
6209059 | Ofer et al. | Mar 2001 | B1 |
6219699 | McCloghrie et al. | Apr 2001 | B1 |
6219753 | Richardson | Apr 2001 | B1 |
6223250 | Yokono | Apr 2001 | B1 |
6226771 | Hilla et al. | May 2001 | B1 |
6260120 | Blumenau et al. | Jul 2001 | B1 |
6266705 | Ullum et al. | Jul 2001 | B1 |
6269381 | St. Pierre et al. | Jul 2001 | B1 |
6269431 | Dunham | Jul 2001 | B1 |
6295575 | Blumenau et al. | Sep 2001 | B1 |
6400730 | Latif et al. | Jun 2002 | B1 |
6408406 | Parris | Jun 2002 | B1 |
6542909 | Tamer et al. | Apr 2003 | B1 |
6542961 | Matsunami et al. | Apr 2003 | B1 |
6553390 | Gross et al. | Apr 2003 | B1 |
6564252 | Hickman et al. | May 2003 | B1 |
6647474 | Yanai et al. | Nov 2003 | B2 |
6675258 | Bramhall et al. | Jan 2004 | B1 |
6683883 | Czeiger et al. | Jan 2004 | B1 |
6694413 | Mimatsu et al. | Feb 2004 | B1 |
6708227 | Cabrera et al. | Mar 2004 | B1 |
6715007 | Williams et al. | Mar 2004 | B1 |
6728791 | Young | Apr 2004 | B1 |
6772231 | Reuter et al. | Aug 2004 | B2 |
6820099 | Huber et al. | Nov 2004 | B1 |
6847647 | Wrenn | Jan 2005 | B1 |
6848759 | Doornbos et al. | Feb 2005 | B2 |
6850955 | Sonoda et al. | Feb 2005 | B2 |
6876656 | Brewer et al. | Apr 2005 | B2 |
6880062 | Ibrahim et al. | Apr 2005 | B1 |
6898670 | Nahum | May 2005 | B2 |
6907419 | Pesola et al. | Jun 2005 | B1 |
6912668 | Brown et al. | Jun 2005 | B1 |
6952734 | Gunlock et al. | Oct 2005 | B1 |
6976090 | Ben-Shaul et al. | Dec 2005 | B2 |
6978300 | Beukema et al. | Dec 2005 | B1 |
6983303 | Pellegrino et al. | Jan 2006 | B2 |
6986015 | Testardi | Jan 2006 | B2 |
6986069 | Oehler et al. | Jan 2006 | B2 |
7051056 | Rodriguez-Rivera et al. | May 2006 | B2 |
7069465 | Chu et al. | Jun 2006 | B2 |
7073017 | Yamamoto | Jul 2006 | B2 |
7108339 | Berger | Sep 2006 | B2 |
7149858 | Kiselev | Dec 2006 | B1 |
7171514 | Coronado et al. | Jan 2007 | B2 |
7171668 | Molloy et al. | Jan 2007 | B2 |
7174354 | Andreasson | Feb 2007 | B2 |
7200144 | Terrell et al. | Apr 2007 | B2 |
7222255 | Claessens | May 2007 | B1 |
7237045 | Beckmann et al. | Jun 2007 | B2 |
7240188 | Takata et al. | Jul 2007 | B2 |
7246260 | Brown et al. | Jul 2007 | B2 |
7266718 | Idei et al. | Sep 2007 | B2 |
7269168 | Roy et al. | Sep 2007 | B2 |
7277431 | Walter et al. | Oct 2007 | B2 |
7277948 | Igarashi et al. | Oct 2007 | B2 |
7305658 | Hamilton et al. | Dec 2007 | B1 |
7328434 | Swanson et al. | Feb 2008 | B2 |
7340555 | Ashmore et al. | Mar 2008 | B2 |
7346751 | Prahlad et al. | Mar 2008 | B2 |
7352706 | Klotz et al. | Apr 2008 | B2 |
7353305 | Pangal et al. | Apr 2008 | B2 |
7359321 | Sindhu et al. | Apr 2008 | B1 |
7383381 | Faulkner et al. | Jun 2008 | B1 |
7433326 | Desai et al. | Oct 2008 | B2 |
7433948 | Edsall | Oct 2008 | B2 |
7434105 | Rodriguez-Rivera et al. | Oct 2008 | B1 |
7441154 | Klotz et al. | Oct 2008 | B2 |
7447839 | Uppala | Nov 2008 | B2 |
7487321 | Muthiah et al. | Feb 2009 | B2 |
7500053 | Kavuri et al. | Mar 2009 | B1 |
7542681 | Cornell et al. | Jun 2009 | B2 |
7558872 | Senevirathne | Jul 2009 | B1 |
7587570 | Sarkar et al. | Sep 2009 | B2 |
7643505 | Colloff | Jan 2010 | B1 |
7654625 | Amann et al. | Feb 2010 | B2 |
7657796 | Kaiser et al. | Feb 2010 | B1 |
7668981 | Nagineni et al. | Feb 2010 | B1 |
7669071 | Cochran et al. | Feb 2010 | B2 |
7689384 | Becker | Mar 2010 | B1 |
7694092 | Mizuno | Apr 2010 | B2 |
7697554 | Ofer et al. | Apr 2010 | B1 |
7706303 | Bose et al. | Apr 2010 | B2 |
7707481 | Kirschner et al. | Apr 2010 | B2 |
7716648 | Vaidyanathan et al. | May 2010 | B2 |
7752360 | Galles | Jul 2010 | B2 |
7757059 | Ofer et al. | Jul 2010 | B1 |
7774329 | Peddy et al. | Aug 2010 | B1 |
7774839 | Nazzal | Aug 2010 | B2 |
7793138 | Rastogi et al. | Sep 2010 | B2 |
7840730 | D'Amato et al. | Nov 2010 | B2 |
7843906 | Chidambaram et al. | Nov 2010 | B1 |
7895428 | Boland, IV et al. | Feb 2011 | B2 |
7930494 | Goheer et al. | Apr 2011 | B1 |
7975175 | Votta et al. | Jul 2011 | B2 |
7979670 | Saliba et al. | Jul 2011 | B2 |
7984259 | English | Jul 2011 | B1 |
8031703 | Gottumukkula et al. | Oct 2011 | B2 |
8032621 | Upalekar et al. | Oct 2011 | B1 |
8051197 | Mullendore et al. | Nov 2011 | B2 |
8086755 | Duffy, IV et al. | Dec 2011 | B2 |
8161134 | Mishra et al. | Apr 2012 | B2 |
8196018 | Forhan et al. | Jun 2012 | B2 |
8205951 | Boks | Jun 2012 | B2 |
8218538 | Chidambaram et al. | Jul 2012 | B1 |
8230066 | Heil | Jul 2012 | B2 |
8234377 | Cohn | Jul 2012 | B2 |
8266238 | Zimmer et al. | Sep 2012 | B2 |
8272104 | Chen et al. | Sep 2012 | B2 |
8274993 | Sharma et al. | Sep 2012 | B2 |
8290919 | Kelly et al. | Oct 2012 | B1 |
8297722 | Chambers et al. | Oct 2012 | B2 |
8301746 | Head et al. | Oct 2012 | B2 |
8335231 | Kloth et al. | Dec 2012 | B2 |
8341121 | Claudatos et al. | Dec 2012 | B1 |
8345692 | Smith | Jan 2013 | B2 |
8352941 | Protopopov et al. | Jan 2013 | B1 |
8392760 | Kandula et al. | Mar 2013 | B2 |
8442059 | de la Iglesia et al. | May 2013 | B1 |
8479211 | Marshall et al. | Jul 2013 | B1 |
8495356 | Ashok et al. | Jul 2013 | B2 |
8514868 | Hill | Aug 2013 | B2 |
8532108 | Li et al. | Sep 2013 | B2 |
8560663 | Baucke et al. | Oct 2013 | B2 |
8619599 | Even | Dec 2013 | B1 |
8626891 | Guru et al. | Jan 2014 | B2 |
8630983 | Sengupta et al. | Jan 2014 | B2 |
8660129 | Brendel et al. | Feb 2014 | B1 |
8661299 | Ip | Feb 2014 | B1 |
8677485 | Sharma et al. | Mar 2014 | B2 |
8683296 | Anderson et al. | Mar 2014 | B2 |
8706772 | Hartig et al. | Apr 2014 | B2 |
8719804 | Jain | May 2014 | B2 |
8725854 | Edsall | May 2014 | B2 |
8768981 | Milne et al. | Jul 2014 | B1 |
8775773 | Acharya et al. | Jul 2014 | B2 |
8793372 | Ashok et al. | Jul 2014 | B2 |
8805918 | Chandrasekaran et al. | Aug 2014 | B1 |
8805951 | Faibish et al. | Aug 2014 | B1 |
8832330 | Lancaster | Sep 2014 | B1 |
8855116 | Rosset et al. | Oct 2014 | B2 |
8856339 | Mestery et al. | Oct 2014 | B2 |
8868474 | Leung et al. | Oct 2014 | B2 |
8887286 | Dupont et al. | Nov 2014 | B2 |
8898385 | Jayaraman et al. | Nov 2014 | B2 |
8909928 | Ahmad et al. | Dec 2014 | B2 |
8918510 | Gmach et al. | Dec 2014 | B2 |
8924720 | Raghuram et al. | Dec 2014 | B2 |
8930747 | Levijarvi et al. | Jan 2015 | B2 |
8935500 | Gulati et al. | Jan 2015 | B1 |
8949677 | Brundage et al. | Feb 2015 | B1 |
8996837 | Bono et al. | Mar 2015 | B1 |
9003086 | Schuller et al. | Apr 2015 | B1 |
9007922 | Mittal et al. | Apr 2015 | B1 |
9009427 | Sharma et al. | Apr 2015 | B2 |
9009704 | McGrath et al. | Apr 2015 | B2 |
9075638 | Barnett et al. | Jul 2015 | B2 |
9141554 | Candelaria | Sep 2015 | B1 |
9141785 | Mukkara et al. | Sep 2015 | B2 |
9164795 | Vincent | Oct 2015 | B1 |
9176677 | Fradkin et al. | Nov 2015 | B1 |
9201704 | Chang et al. | Dec 2015 | B2 |
9203784 | Chang et al. | Dec 2015 | B2 |
9207882 | Rosset et al. | Dec 2015 | B2 |
9207929 | Katsura | Dec 2015 | B2 |
9213612 | Candelaria | Dec 2015 | B2 |
9223564 | Munireddy et al. | Dec 2015 | B2 |
9223634 | Chang et al. | Dec 2015 | B2 |
9244761 | Yekhanin et al. | Jan 2016 | B2 |
9250969 | Lagar-Cavilla et al. | Feb 2016 | B2 |
9264494 | Factor et al. | Feb 2016 | B2 |
9270754 | Iyengar et al. | Feb 2016 | B2 |
9280487 | Candelaria | Mar 2016 | B2 |
9304815 | Vasanth et al. | Apr 2016 | B1 |
9313048 | Chang et al. | Apr 2016 | B2 |
9374270 | Nakil et al. | Jun 2016 | B2 |
9378060 | Jansson et al. | Jun 2016 | B2 |
9396251 | Boudreau et al. | Jul 2016 | B1 |
9448877 | Candelaria | Sep 2016 | B2 |
9471348 | Zuo et al. | Oct 2016 | B2 |
9501473 | Kong et al. | Nov 2016 | B1 |
9503523 | Rosset et al. | Nov 2016 | B2 |
9565110 | Mullendore et al. | Feb 2017 | B2 |
9575828 | Agarwal et al. | Feb 2017 | B2 |
9614763 | Dong et al. | Apr 2017 | B2 |
9658868 | Hill | May 2017 | B2 |
9658876 | Chang et al. | May 2017 | B2 |
9733868 | Chandrasekaran et al. | Aug 2017 | B2 |
9763518 | Charest et al. | Sep 2017 | B2 |
9830240 | George et al. | Nov 2017 | B2 |
9853873 | Dasu et al. | Dec 2017 | B2 |
20020049980 | Hoang | Apr 2002 | A1 |
20020053009 | Selkirk et al. | May 2002 | A1 |
20020073276 | Howard et al. | Jun 2002 | A1 |
20020083120 | Soltis | Jun 2002 | A1 |
20020095547 | Watanabe et al. | Jul 2002 | A1 |
20020103889 | Markson et al. | Aug 2002 | A1 |
20020103943 | Lo et al. | Aug 2002 | A1 |
20020112113 | Karpoff et al. | Aug 2002 | A1 |
20020120741 | Webb et al. | Aug 2002 | A1 |
20020138675 | Mann | Sep 2002 | A1 |
20020156971 | Jones et al. | Oct 2002 | A1 |
20030023885 | Potter et al. | Jan 2003 | A1 |
20030026267 | Oberman et al. | Feb 2003 | A1 |
20030055933 | Ishizaki et al. | Mar 2003 | A1 |
20030056126 | O'Connor et al. | Mar 2003 | A1 |
20030065986 | Fraenkel et al. | Apr 2003 | A1 |
20030084359 | Bresniker et al. | May 2003 | A1 |
20030118053 | Edsall et al. | Jun 2003 | A1 |
20030131105 | Czeiger et al. | Jul 2003 | A1 |
20030131165 | Asano et al. | Jul 2003 | A1 |
20030131182 | Kumar et al. | Jul 2003 | A1 |
20030140134 | Swanson et al. | Jul 2003 | A1 |
20030140210 | Testardi | Jul 2003 | A1 |
20030149763 | Heitman et al. | Aug 2003 | A1 |
20030154271 | Baldwin et al. | Aug 2003 | A1 |
20030159058 | Eguchi et al. | Aug 2003 | A1 |
20030174725 | Shankar | Sep 2003 | A1 |
20030189395 | Doornbos et al. | Oct 2003 | A1 |
20030210686 | Terrell et al. | Nov 2003 | A1 |
20040024961 | Cochran et al. | Feb 2004 | A1 |
20040030857 | Krakirian et al. | Feb 2004 | A1 |
20040039939 | Cox et al. | Feb 2004 | A1 |
20040054776 | Klotz et al. | Mar 2004 | A1 |
20040057389 | Klotz et al. | Mar 2004 | A1 |
20040059807 | Klotz et al. | Mar 2004 | A1 |
20040088574 | Walter et al. | May 2004 | A1 |
20040117438 | Considine et al. | Jun 2004 | A1 |
20040123029 | Dalai et al. | Jun 2004 | A1 |
20040128470 | Hetzler et al. | Jul 2004 | A1 |
20040153863 | Klotz et al. | Aug 2004 | A1 |
20040215749 | Tsao | Oct 2004 | A1 |
20040230848 | Mayo et al. | Nov 2004 | A1 |
20040250034 | Yagawa et al. | Dec 2004 | A1 |
20050033936 | Nakano et al. | Feb 2005 | A1 |
20050036499 | Dutt et al. | Feb 2005 | A1 |
20050050211 | Kaul et al. | Mar 2005 | A1 |
20050050270 | Horn et al. | Mar 2005 | A1 |
20050053073 | Kloth et al. | Mar 2005 | A1 |
20050055428 | Terai et al. | Mar 2005 | A1 |
20050060574 | Klotz et al. | Mar 2005 | A1 |
20050060598 | Klotz et al. | Mar 2005 | A1 |
20050071851 | Opheim | Mar 2005 | A1 |
20050076113 | Klotz et al. | Apr 2005 | A1 |
20050091426 | Horn et al. | Apr 2005 | A1 |
20050114615 | Ogasawara et al. | May 2005 | A1 |
20050117522 | Basavaiah et al. | Jun 2005 | A1 |
20050117562 | Wrenn | Jun 2005 | A1 |
20050138287 | Ogasawara et al. | Jun 2005 | A1 |
20050185597 | Le et al. | Aug 2005 | A1 |
20050188170 | Yamamoto | Aug 2005 | A1 |
20050235072 | Smith et al. | Oct 2005 | A1 |
20050283658 | Clark et al. | Dec 2005 | A1 |
20060015861 | Takata et al. | Jan 2006 | A1 |
20060015928 | Setty et al. | Jan 2006 | A1 |
20060034302 | Peterson | Feb 2006 | A1 |
20060045021 | Deragon | Mar 2006 | A1 |
20060075191 | Lolayekar | Apr 2006 | A1 |
20060098672 | Schzukin et al. | May 2006 | A1 |
20060117099 | Mogul | Jun 2006 | A1 |
20060136684 | Le et al. | Jun 2006 | A1 |
20060184287 | Belady et al. | Aug 2006 | A1 |
20060198319 | Schondelmayer et al. | Sep 2006 | A1 |
20060215297 | Kikuchi | Sep 2006 | A1 |
20060230227 | Ogasawara et al. | Oct 2006 | A1 |
20060242332 | Johnsen et al. | Oct 2006 | A1 |
20060251111 | Kloth et al. | Nov 2006 | A1 |
20070005297 | Beresniewicz et al. | Jan 2007 | A1 |
20070067593 | Satoyama et al. | Mar 2007 | A1 |
20070079068 | Draggon | Apr 2007 | A1 |
20070094465 | Sharma et al. | Apr 2007 | A1 |
20070101202 | Garbow | May 2007 | A1 |
20070121519 | Cuni et al. | May 2007 | A1 |
20070136541 | Herz et al. | Jun 2007 | A1 |
20070162969 | Becker | Jul 2007 | A1 |
20070211640 | Palacharla | Sep 2007 | A1 |
20070214316 | Kim | Sep 2007 | A1 |
20070250838 | Belady et al. | Oct 2007 | A1 |
20070263545 | Foster et al. | Nov 2007 | A1 |
20070276884 | Hara et al. | Nov 2007 | A1 |
20070283059 | Ho et al. | Dec 2007 | A1 |
20080016412 | White et al. | Jan 2008 | A1 |
20080034149 | Sheen | Feb 2008 | A1 |
20080052459 | Chang et al. | Feb 2008 | A1 |
20080059698 | Kabir et al. | Mar 2008 | A1 |
20080114933 | Ogasawara et al. | May 2008 | A1 |
20080126509 | Subrannanian et al. | May 2008 | A1 |
20080126734 | Murase | May 2008 | A1 |
20080168304 | Flynn et al. | Jul 2008 | A1 |
20080201616 | Ashmore | Aug 2008 | A1 |
20080244184 | Lewis et al. | Oct 2008 | A1 |
20080256082 | Davies et al. | Oct 2008 | A1 |
20080267217 | Colville et al. | Oct 2008 | A1 |
20080288661 | Galles | Nov 2008 | A1 |
20080294888 | Ando et al. | Nov 2008 | A1 |
20090063766 | Matsumura et al. | Mar 2009 | A1 |
20090083484 | Basham et al. | Mar 2009 | A1 |
20090089567 | Boland, IV et al. | Apr 2009 | A1 |
20090094380 | Qiu et al. | Apr 2009 | A1 |
20090094664 | Butler et al. | Apr 2009 | A1 |
20090125694 | Innan et al. | May 2009 | A1 |
20090193223 | Saliba et al. | Jul 2009 | A1 |
20090201926 | Kagan et al. | Aug 2009 | A1 |
20090222733 | Basham et al. | Sep 2009 | A1 |
20090240873 | Yu et al. | Sep 2009 | A1 |
20090282471 | Green et al. | Nov 2009 | A1 |
20090323706 | Germain et al. | Dec 2009 | A1 |
20100011365 | Gerovac et al. | Jan 2010 | A1 |
20100030995 | Wang et al. | Feb 2010 | A1 |
20100046378 | Knapp et al. | Feb 2010 | A1 |
20100083055 | Ozonat | Apr 2010 | A1 |
20100174968 | Charles et al. | Jul 2010 | A1 |
20100318609 | Lahiri et al. | Dec 2010 | A1 |
20100318837 | Murphy et al. | Dec 2010 | A1 |
20110010394 | Carew et al. | Jan 2011 | A1 |
20110022691 | Banerjee et al. | Jan 2011 | A1 |
20110029824 | Schöler et al. | Feb 2011 | A1 |
20110035494 | Pandey et al. | Feb 2011 | A1 |
20110075667 | Li et al. | Mar 2011 | A1 |
20110087848 | Trent | Apr 2011 | A1 |
20110119556 | de Buen | May 2011 | A1 |
20110142053 | Van Der Merwe et al. | Jun 2011 | A1 |
20110173303 | Rider | Jul 2011 | A1 |
20110228679 | Varma | Sep 2011 | A1 |
20110231899 | Pulier et al. | Sep 2011 | A1 |
20110239039 | Dieffenbach et al. | Sep 2011 | A1 |
20110252274 | Kawaguchi et al. | Oct 2011 | A1 |
20110276584 | Cotner et al. | Nov 2011 | A1 |
20110276675 | Singh et al. | Nov 2011 | A1 |
20110276951 | Jain | Nov 2011 | A1 |
20110299539 | Rajagopal et al. | Dec 2011 | A1 |
20110307450 | Hahn et al. | Dec 2011 | A1 |
20110313973 | Srivas et al. | Dec 2011 | A1 |
20120023319 | Chin et al. | Jan 2012 | A1 |
20120030401 | Cowan et al. | Feb 2012 | A1 |
20120054367 | Ramakrishnan et al. | Mar 2012 | A1 |
20120072578 | Alam | Mar 2012 | A1 |
20120072985 | Davne et al. | Mar 2012 | A1 |
20120084445 | Brock et al. | Apr 2012 | A1 |
20120084782 | Chou et al. | Apr 2012 | A1 |
20120096134 | Suit | Apr 2012 | A1 |
20120130874 | Mane et al. | May 2012 | A1 |
20120131174 | Ferris et al. | May 2012 | A1 |
20120134672 | Banerjee | May 2012 | A1 |
20120144014 | Natham et al. | Jun 2012 | A1 |
20120167094 | Suit | Jun 2012 | A1 |
20120173581 | Hartig et al. | Jul 2012 | A1 |
20120173589 | Kwon et al. | Jul 2012 | A1 |
20120177039 | Berman | Jul 2012 | A1 |
20120177041 | Berman | Jul 2012 | A1 |
20120177042 | Berman | Jul 2012 | A1 |
20120177043 | Berman | Jul 2012 | A1 |
20120177044 | Berman | Jul 2012 | A1 |
20120177045 | Berman | Jul 2012 | A1 |
20120177370 | Berman | Jul 2012 | A1 |
20120179909 | Sagi et al. | Jul 2012 | A1 |
20120210041 | Flynn et al. | Aug 2012 | A1 |
20120254440 | Wang | Oct 2012 | A1 |
20120265976 | Spiers et al. | Oct 2012 | A1 |
20120281706 | Agarwal et al. | Nov 2012 | A1 |
20120297088 | Wang et al. | Nov 2012 | A1 |
20120303618 | Dutta et al. | Nov 2012 | A1 |
20120311106 | Morgan | Dec 2012 | A1 |
20120311568 | Jansen | Dec 2012 | A1 |
20120320788 | Venkataramanan et al. | Dec 2012 | A1 |
20120324114 | Dutta et al. | Dec 2012 | A1 |
20120331119 | Bose, Sr. et al. | Dec 2012 | A1 |
20130003737 | Sinicrope | Jan 2013 | A1 |
20130013664 | Baird et al. | Jan 2013 | A1 |
20130028135 | Berman | Jan 2013 | A1 |
20130036212 | Jibbe et al. | Feb 2013 | A1 |
20130036213 | Hasan et al. | Feb 2013 | A1 |
20130036449 | Mukkara et al. | Feb 2013 | A1 |
20130054888 | Bhat et al. | Feb 2013 | A1 |
20130061089 | Valiyaparambil et al. | Mar 2013 | A1 |
20130067162 | Jayaraman et al. | Mar 2013 | A1 |
20130080823 | Roth et al. | Mar 2013 | A1 |
20130086340 | Fleming et al. | Apr 2013 | A1 |
20130100858 | Kamath et al. | Apr 2013 | A1 |
20130111540 | Sabin | May 2013 | A1 |
20130138816 | Kuo et al. | May 2013 | A1 |
20130138836 | Cohen et al. | May 2013 | A1 |
20130139138 | Kakos | May 2013 | A1 |
20130144933 | Hinni et al. | Jun 2013 | A1 |
20130152076 | Patel | Jun 2013 | A1 |
20130152175 | Hromoko et al. | Jun 2013 | A1 |
20130163426 | Beliveau et al. | Jun 2013 | A1 |
20130163606 | Bagepalli et al. | Jun 2013 | A1 |
20130179941 | McGloin et al. | Jul 2013 | A1 |
20130182712 | Aguayo et al. | Jul 2013 | A1 |
20130185433 | Zhu et al. | Jul 2013 | A1 |
20130191106 | Kephart et al. | Jul 2013 | A1 |
20130198730 | Munireddy et al. | Aug 2013 | A1 |
20130208888 | Agrawal et al. | Aug 2013 | A1 |
20130212130 | Rahnama | Aug 2013 | A1 |
20130238641 | Mandelstein et al. | Sep 2013 | A1 |
20130266307 | Garg et al. | Oct 2013 | A1 |
20130268922 | Tiwari et al. | Oct 2013 | A1 |
20130275470 | Cao et al. | Oct 2013 | A1 |
20130297655 | Narasayya et al. | Nov 2013 | A1 |
20130297769 | Chang et al. | Nov 2013 | A1 |
20130318134 | Bolik et al. | Nov 2013 | A1 |
20130318288 | Khan et al. | Nov 2013 | A1 |
20140006708 | Huynh et al. | Jan 2014 | A1 |
20140016493 | Johnsson | Jan 2014 | A1 |
20140019684 | Wei et al. | Jan 2014 | A1 |
20140025770 | Warfield et al. | Jan 2014 | A1 |
20140029441 | Nydell | Jan 2014 | A1 |
20140029442 | Wallman | Jan 2014 | A1 |
20140039683 | Zimmermann et al. | Feb 2014 | A1 |
20140040473 | Ho et al. | Feb 2014 | A1 |
20140040883 | Tompkins | Feb 2014 | A1 |
20140047201 | Mehta | Feb 2014 | A1 |
20140053264 | Dubrovsky et al. | Feb 2014 | A1 |
20140059187 | Rosset et al. | Feb 2014 | A1 |
20140059266 | Ben-Michael et al. | Feb 2014 | A1 |
20140086253 | Yong | Mar 2014 | A1 |
20140089273 | Borshack et al. | Mar 2014 | A1 |
20140096249 | Dupont et al. | Apr 2014 | A1 |
20140105009 | Vos et al. | Apr 2014 | A1 |
20140108474 | David et al. | Apr 2014 | A1 |
20140109071 | Ding et al. | Apr 2014 | A1 |
20140112122 | Kapadia et al. | Apr 2014 | A1 |
20140123207 | Agarwal et al. | May 2014 | A1 |
20140156557 | Zeng et al. | Jun 2014 | A1 |
20140164666 | Yand | Jun 2014 | A1 |
20140164866 | Bolotov et al. | Jun 2014 | A1 |
20140172371 | Zhu et al. | Jun 2014 | A1 |
20140173060 | Jubran et al. | Jun 2014 | A1 |
20140173195 | Rosset et al. | Jun 2014 | A1 |
20140173579 | McDonald et al. | Jun 2014 | A1 |
20140189278 | Peng | Jul 2014 | A1 |
20140198794 | Mehta | Jul 2014 | A1 |
20140211661 | Gorkemli et al. | Jul 2014 | A1 |
20140215265 | Mohanta et al. | Jul 2014 | A1 |
20140215590 | Brand | Jul 2014 | A1 |
20140219086 | Cantu' et al. | Aug 2014 | A1 |
20140222953 | Karve et al. | Aug 2014 | A1 |
20140229790 | Goss et al. | Aug 2014 | A1 |
20140244585 | Sivasubramanian et al. | Aug 2014 | A1 |
20140244897 | Goss et al. | Aug 2014 | A1 |
20140245435 | Belenky | Aug 2014 | A1 |
20140269390 | Ciodaru | Sep 2014 | A1 |
20140281700 | Nagesharao et al. | Sep 2014 | A1 |
20140297941 | Rajani et al. | Oct 2014 | A1 |
20140307578 | DeSanti | Oct 2014 | A1 |
20140317206 | Lomelino et al. | Oct 2014 | A1 |
20140324862 | Bingham et al. | Oct 2014 | A1 |
20140325208 | Resch et al. | Oct 2014 | A1 |
20140331276 | Frascadore et al. | Nov 2014 | A1 |
20140348166 | Yang et al. | Nov 2014 | A1 |
20140355450 | Bhikkaji et al. | Dec 2014 | A1 |
20140366155 | Chang et al. | Dec 2014 | A1 |
20150003450 | Salam et al. | Jan 2015 | A1 |
20150003458 | Li et al. | Jan 2015 | A1 |
20150003463 | Li et al. | Jan 2015 | A1 |
20150010001 | Duda et al. | Jan 2015 | A1 |
20150016461 | Qiang | Jan 2015 | A1 |
20150030024 | Venkataswami et al. | Jan 2015 | A1 |
20150046123 | Kato | Feb 2015 | A1 |
20150063353 | Kapadia et al. | Mar 2015 | A1 |
20150067001 | Koltsidas | Mar 2015 | A1 |
20150082432 | Eaton et al. | Mar 2015 | A1 |
20150120907 | Niestemski et al. | Apr 2015 | A1 |
20150121131 | Kiselev et al. | Apr 2015 | A1 |
20150127979 | Doppalapudi | May 2015 | A1 |
20150142840 | Baldwin | May 2015 | A1 |
20150169313 | Katsura | Jun 2015 | A1 |
20150180672 | Kuwata | Jun 2015 | A1 |
20150207763 | Bertran Ortiz et al. | Jun 2015 | A1 |
20150205974 | Talley et al. | Jul 2015 | A1 |
20150222444 | Sarkar | Aug 2015 | A1 |
20150229546 | Somaiya et al. | Aug 2015 | A1 |
20150248366 | Bergsten et al. | Sep 2015 | A1 |
20150248418 | Bhardwaj et al. | Sep 2015 | A1 |
20150254003 | Lee et al. | Sep 2015 | A1 |
20150254088 | Chou et al. | Sep 2015 | A1 |
20150261446 | Lee | Sep 2015 | A1 |
20150263993 | Kuch | Sep 2015 | A1 |
20150269048 | Marr et al. | Sep 2015 | A1 |
20150277804 | Arnold | Oct 2015 | A1 |
20150281067 | Wu | Oct 2015 | A1 |
20150303949 | Jafarkhani et al. | Oct 2015 | A1 |
20150341237 | Cuni et al. | Nov 2015 | A1 |
20150341239 | Bertran Ortiz et al. | Nov 2015 | A1 |
20150358136 | Medard | Dec 2015 | A1 |
20150379150 | Duda | Dec 2015 | A1 |
20160011936 | Luby | Jan 2016 | A1 |
20160011942 | Golbourn et al. | Jan 2016 | A1 |
20160062820 | Jones et al. | Mar 2016 | A1 |
20160070652 | Sundararaman et al. | Mar 2016 | A1 |
20160087885 | Tripathi et al. | Mar 2016 | A1 |
20160088083 | Bharadwaj et al. | Mar 2016 | A1 |
20160119159 | Zhao et al. | Apr 2016 | A1 |
20160205189 | Mopur et al. | Jul 2016 | A1 |
20160210161 | Rosset et al. | Jul 2016 | A1 |
20160274926 | Narasimhamurthy et al. | Sep 2016 | A1 |
20160285760 | Dong | Sep 2016 | A1 |
20160292359 | Tellis et al. | Oct 2016 | A1 |
20160294983 | Kliteynik et al. | Oct 2016 | A1 |
20160334998 | George et al. | Nov 2016 | A1 |
20160366094 | Mason et al. | Dec 2016 | A1 |
20160378624 | Jenkins, Jr. et al. | Dec 2016 | A1 |
20160380694 | Guduru | Dec 2016 | A1 |
20170010874 | Rosset | Jan 2017 | A1 |
20170010930 | Dutta et al. | Jan 2017 | A1 |
20170019475 | Metz et al. | Jan 2017 | A1 |
20170068630 | Iskandar et al. | Mar 2017 | A1 |
20170168970 | Sajeepa et al. | Jun 2017 | A1 |
20170177860 | Suarez et al. | Jun 2017 | A1 |
20170212858 | Chu et al. | Jul 2017 | A1 |
20170277655 | Das et al. | Sep 2017 | A1 |
20170337097 | Sipos et al. | Nov 2017 | A1 |
20170340113 | Charest et al. | Nov 2017 | A1 |
20170371558 | George et al. | Dec 2017 | A1 |
Number | Date | Country |
---|---|---|
2228719 | Sep 2010 | EP |
2439637 | Apr 2012 | EP |
2680155 | Jan 2014 | EP |
2350028 | May 2001 | GB |
2000-242434 | Sep 2000 | JP |
1566104 | Jan 2017 | TW |
WO 2004077214 | Sep 2004 | WO |
WO 2016003408 | Jan 2016 | WO |
WO 2016003489 | Jan 2016 | WO |
Entry |
---|
Brocade Communication Systems, Inc., “San Fabric Administration Best Practices Guide Support Perspective,” May 2013, 21 pages; http://www.brocade.com/downloads/documents/best_practice_guides/san-admin-best-practicesbp.pdf. |
Brocade Communication Systems, Inc., “Metro Cloud Connectivity: Integrated Metro SAN Connectivity in 16 Gbps Switches,” Apr. 2011, 14 pages; http://www.hds.com/assets/pdf/data-center-integrated-metro-san-connectivity-in-16-gbpsswitches.pdf. |
Hedayat, et al., “A Two-Way Active Measurement Protocol (TWAMP),” Network Working Group, RFC 5357, Oct. 2008, 26 pages; https://tools.ietf.org/html/rfc5357. |
Aweya, James, et al., “Multi-level active queue management with dynamic thresholds,” Elsevier, Computer Communications 25 (2002) pp. 756-771. |
Petersen, Chris, “Introducing Lightning: A flexible NVMe JBOF,” Mar. 9, 2016, 6 pages. |
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., posted Jul. 10, 2012, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud. |
Author Unknown, “Configuration Interface for IBM System Storage DS5000, IBM DS4000, and IBM DS3000 Systems,” IBM SAN Volume Controller Version 7.1, IBM® System Storage® SAN Volume Controller Information Center, Jun. 16, 2013, 3 pages. |
Author Unknown, “Coraid EtherCloud, Software-Defined Storage with Scale-Out Infrastructure,” Solution Brief, 2013, 2 pages, Coraid, Redwood City, California, U.S.A. |
Author Unknown, “Coraid Virtual DAS (VDAS) Technology: Eliminate Tradeoffs between DAS and Networked Storage,” Coraid Technology Brief, © 2013 Cora id, Inc., Published on or about Mar. 20, 2013, 2 pages. |
Author Unknown, “Creating Performance-based SAN SLAs Using Finisar's NetWisdom” May 2006, 7 pages, Finisar Corporation, Sunnyvale, California, U.S.A. |
Author Unknown, “delphi—Save a CRC value in a file, without altering the actual CRC Checksum?” Stack Overflow, stackoverflow.com, Dec. 23, 2011, XP055130879, 3 pages http://stackoverflow.com/questions/8608219/save-a-crc-value-in-a-file-without-altering-the-actual-crc-checksum. |
Author Unknown, “EMC UNISPHERE: Innovative Approach to Managing Low-End and Midrange Storage; Redefining Simplicity in the Entry-Level and Midrange Storage Markets,” Data Sheet, EMC Corporation; published on or about Jan. 4, 2013 [Retrieved and printed Sep. 12, 2013] 6 pages http://www.emc.com/storage/vnx/unisphere.htm. |
Author Unknown, “HP XP Array Manager Software—Overview & Features,” Storage Device Management Software; Hewlett-Packard Development Company, 3 pages; © 2013 Hewlett-Packard Development Company, L.P. |
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages. |
Author Unknown, “Network Transformation with Software-Defined Networking and Ethernet Fabrics,” Positioning Paper, 2012, 6 pages, Brocade Communications Systems. |
Author Unknown, “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Juniper Networks, Dec. 2011, 3 pages. |
Author Unknown, “Shunra for HP Softwarer,” Enabiling Confidence in Application Performance Before Deployment, 2010, 2 pages. |
Author Unknown, “Software Defined Networking: The New Norm for Networks,” White Paper, Open Networking Foundation, Apr. 13, 2012, 12 pages. |
Author Unknown, “Software Defined Storage Networks An Introduction,” White Paper, Doc # 01-000030-001 Rev. A, Dec. 12, 2012, 8 pages; Jeda Networks, Newport Beach, California, U.S.A. |
Author Unknown, “Standard RAID Levels,” Wikipedia, the Free Encyclopedia, last updated Jul. 18, 2014, 7 pages; http://en.wikipedia.org/wiki/Standard_RAID_levels. |
Author Unknown, “Storage Infrastructure for the Cloud,” Solution Brief, © 2012, 3 pages; coraid, Redwood City, California, U.S.A. |
Author Unknown, “Storage Area Network—NPIV: Emulex Virtual HBA and Brocade, Proven Interoperability and Proven Solution,” Technical Brief, Apr. 2008, 4 pages, Emulex and Brocade Communications Systems. |
Author Unknown, “The Fundamentals of Software-Defined Storage, Simplicity at Scale for Cloud-Architectures” Solution Brief, 2013, 3 pages; Coraid, Redwood City, California, U.S.A. |
Author Unknown, “VirtualWisdom® SAN Performance Probe Family Models: Probe FC8, HD, and HD48,” Virtual Instruments Data Sheet, Apr. 2014 Virtual Instruments. All Rights Reserved; 4 pages. |
Author Unknown, “Xgig Analyzer: Quick Start Feature Guide 4.0,” Feb. 2008, 24 pages, Finisar Corporation, Sunnyvale, California, U.S.A. |
Author Unknown, “Sun Storage Common Array Manager Installation and Setup Guide,” Software Installation and Setup Guide Version 6.7.x 821-1362-10, Appendix D: Configuring In-Band Management, Sun Oracle; retrieved and printed Sep. 12, 2013, 15 pages. |
Author Unknown, “Vblock Solution for SAP: Simplified Provisioning for Operation Efficiency,” VCE White Paper, VCE—The Virtual Computing Environment Company, Aug. 2011, 11 pages. |
Berman, Stuart, et al., “Start-Up Jeda Networks in Software Defined Storate Network Technology,” Press Release, Feb. 25, 2013, 2 pages, http://www.storagenewsletter.com/news/startups/jeda-networks. |
Borovick, Lucinda, et al., “White Paper, Architecting the Network for the Cloud,” IDC Analyze the Future, Jan. 2011, pp. 1-8. |
Chakrabarti, Kaushik, et al., “Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases,” ACM Transactions on Database Systems, vol. 27, No. 2, Jun. 2009, pp. 188-228. |
Chandola, Varun, et al., “A Gaussian Process Based Online Change Detection Algorithm for Monitoring Periodic Time Series,” Proceedings of the Eleventh SIAM International Conference on Data Mining, SDM 2011, Apr. 28-30, 2011, 12 pages. |
Cisco Systems, Inc. “N-Port Virtualization in the Data Center,” Cisco White Paper, Cisco Systems, Inc., Mar. 2008, 7 pages. |
Cisco Systems, Inc., “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” White Paper, Cisco Systems, Inc., Apr. 2011, 36 pages. |
Cisco Systems, Inc., “Cisco Prime Data Center Network Manager 6.1,” At-A-Glance, © 2012, 3 pages. |
Cisco Systems, Inc., “Cisco Prime Data Center Network Manager,” Release 6.1 Data Sheet, © 2012, 10 pages. |
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” White Paper, Cisco Systems, Inc., Jan. 2011, 6 pages. |
Clarke, Alan, et al., “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, pp. 1-18. |
Cummings, Roger, et al., Fibre Channel—Fabric Generic Requirements (FC-FG), Dec. 4, 1996, 33 pages, American National Standards Institute, Inc., New York, New York, U.S.A. |
Farber, Franz, et al. “An In-Memory Database System for Multi-Tenant Applications,” Proceedings of 14th Business, Technology and Web (BTW) Conference on Database Systems for Business, Technology, and Web, Feb. 28 to Mar. 4, 2011, 17 pages, University of Kaiserslautern, Germany. |
Guo, Chang Jie, et al., “IBM Resarch Report: Data Integration and Composite Business Services, Part 3, Building a Multi-Tenant Data Tier with with [sic] Access Control and Security,” RC24426 (C0711-037), Nov. 19, 2007, 20 pages, IBM. |
Hatzieleftheriou, Andromachi, et al., “Host-side Filesystem Journaling for Durable Shared Storage,” 13th USENIX Conference on File and Storage Technologies (FAST '15), Feb. 16-19, 2015, 9 pages; https://www.usenix.org/system/files/conference/fast15/fast15-paper-hatzieleftheriou.pdf. |
Horn, C., et al., “Online anomaly detection with expert system feedback in social networks,” 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 22-27, 2011, 2 pages, Prague; [Abstract only]. |
Hosterman, Cody, et al., “Using EMC Symmetrix Storage inVMware vSph ere Environments,” Version 8.0, EMC2Techbooks, EMC Corporation; published on or about Jul. 8, 2008, 314 pages; [Retrieved and printed Sep. 12, 2013]. |
Hu, Yuchong, et al., “Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding,” University of Science & Technology of China, Feb. 2010, 9 pages. |
Keogh, Eamonn, et al., “Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases,” KAIS Long Paper submitted May 16, 2000; 19 pages. |
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, pp. 1-5. |
Kovar, Joseph F., “Startup Jeda Networks Takes SDN Approach to Storage Networks,” CRN Press Release, Feb. 22, 2013, 1 page, http://www.crn.com/240149244/printablearticle.htm. |
Lampson, Butler, W., et al., “Crash Recovery in a Distributed Data Storage System,” Jun. 1, 1979, 28 pages. |
Lewis, Michael E., et al., “Design of an Advanced Development Model Optical Disk-Based Redundant Array of Independent Disks (RAID) High Speed Mass Storage Subsystem,” Final Technical Report, Oct. 1997, pp. 1-211. |
Lin, Jessica, “Finding Motifs in Time Series,” SIGKDD'02 Jul. 23-26, 2002, 11 pages, Edmonton, Alberta, Canada. |
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages. |
Long, Abraham Jr., “Modeling the Reliability of RAID Sets,” Dell Power Solutions, May 2008, 4 pages. |
Ma, Ao, et al., “RAIDShield: Characterizing, Monitoring, and Proactively Protecting Against Disk Failures,” FAST '15, 13th USENIX Conference on File and Storage Technologies, Feb. 16-19, 2015, 17 pages, Santa Clara, California, U.S.A. |
Mahalingam, M., et al., “Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks,” Independent Submission, RFC 7348, Aug. 2014, 22 pages; http://www.hjp.at/doc/rfc/rfc7348.html. |
Mcquerry, Steve, “Cisco UCS M-Series Modular Servers for Cloud-Scale Workloads,” White Paper, Cisco Systems, Inc., Sep. 2014, 11 pages. |
Monia, Charles, et al., IFCP—A Protocol for Internet Fibre Channel Networking, draft-monia-ips-ifcp-00.txt, Dec. 12, 2000, 6 pages. |
Mueen, Abdullah, et al., “Online Discovery and Maintenance of Time Series Motifs,” KDD'10 The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Jul. 25-28, 2010, 10 pages, Washington, DC, U.S.A. |
Muglia, Bob, “Decoding SDN,” Jan. 14, 2013, Juniper Networks, pp. 1-7, http://forums.juniper.net/t5/The-New-Network/Decoding-SDN/ba-p/174651. |
Murray, Joseph F., et al., “Machine Learning Methods for Predicting Failures in Hard Drives: A Multiple-Instance Application,” Journal of Machine Learning Research 6 (2005), pp. 783-816; May 2005, 34 pages. |
Nelson, Mark, “File Verification Using CRC,” Dr. Dobb's Journal, May 1, 1992, pp. 1-18, XP055130883. |
Pace, Alberto, “Technologies for Large Data Management in Scientific Computing,” International Journal of Modern Physics C., vol. 25, No. 2, Feb. 2014, 72 pages. |
Pinheiro, Eduardo, et al., “Failure Trends in a Large Disk Drive Population,” FAST '07, 5th USENIX Conference on File and Storage Technologies, Feb. 13-16, 2007, 13 pages, San Jose, California, U.S.A. |
Raginsky, Maxim, et al., “Sequential Anomaly Detection in the Presence of Noise and Limited Feedback,” arXiv:0911.2904v4 [cs.LG] Mar. 13, 2012, 19 pages. |
Saidi, Ali G., et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages. |
Sajassi, A., et al., “BGP MPLS Based Ethernet VPN,” Network Working Group, Oct. 18, 2014, 52 pages. |
Sajassi, Ali, et al., “A Network Virtualization Overlay Solution using EVPN,” L2VPN Workgroup, Nov. 10, 2014, 24 pages; http://tools.ietf.org/pdf/draft-ietf-bess-evpn-overlay-00.pdf. |
Sajassi, Ali, et al., “Integrated Routing and Bridging in EVPN,” L2VPN Workgroup, Nov. 11, 2014, 26 pages; http://tools.ietf.org/pdf/draft-ietf-bess-evpn-inter-subnet-forwarding-00.pdf. |
Schroeder, Bianca, et al., “Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?” FAST '07: 5th USENIX Conference on File and Storage Technologies, Feb. 13-16, 2007, 16 pages, San Jose, California, U.S.A. |
Shue, David, et al., “Performance Isolation and Fairness for Multi-Tenant Cloud Storage,” USENIX Association, 10th USENIX Symposium on Operating Systems Design Implementation (OSDI '12), 2012, 14 pages; https://www.usenix.org/system/files/conference/osdi12/osdi12-final-215.pdf. |
Staimer, Marc, “Inside Cisco Systems' Unified Computing System,” Dragon Slayer Consulting, Jul. 2009, 5 pages. |
Swami, Vijay, “Simplifying SAN Management for VMWare Boot from SAN, Utilizing Cisco UCS and Palo,” posted May 31, 2011, 6 pages. |
Tate, Jon, et al., “Introduction to Storage Area Networks and System Networking,” Dec. 2017, 302 pages, ibm.com/redbooks. |
Vuppala, Vibhavasu, et al., “Layer-3 Switching Using Virtual Network Ports,” Computer Communications and Networks, 1999, Proceedings, Eight International Conference in Boston, MA, USA, Oct. 11-13, 1999, Piscataway, NJ, USA, IEEE, ISBN: 0-7803-5794-9, pp. 642-648. |
Wang, Feng, et al. “OBFS: A File System for Object-Based Storage Devices,” Storage System Research Center, MSST. vol. 4., Apr. 2004, 18 pages. |
Weil, Sage A., “CEPH: Reliable, Scalable, and High-Performance Distributed Storage,” Dec. 2007, 239 pages, University of California, Santa Cruz. |
Weil, Sage A., et al. “CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data.” Proceedings of the 2006 ACM/IEEE conference on Supercomputing. ACM, Nov. 11, 2006, 12 pages. |
Weil, Sage A., et al. “CEPH: A Scalable, High-performance Distributed File System,” Proceedings of the 7th symposium on Operating systems design and implementation. USENIX Association, Nov. 6, 2006, 14 pages. |
Wu, Joel, et al., “The Design, and Implementation of AQuA: An Adaptive Object-Based Storage Device,” Department of Computer Science, http://storageconference.us/2006/Presentations/30Wu.pdf. |
Xue, Chendi, et al. “A Standard framework for Ceph performance profiling with latency breakdown,” CEPH, Jun. 30, 2015, 3 pages. |
Zhou, Zihan, et al., “Stable Principal Component Pursuit,” arXiv:1001.2363v1 [cs.IT], Jan. 14, 2010, 5 pages. |
Zhu, Yunfeng, et al., “A Cost-based Heterogeneous Recovery Scheme for Distributed Storage Systems with RAID-6 Codes,” University of Science & Technology of China, 2012, 12 pages. |
Number | Date | Country | |
---|---|---|---|
20180097714 A1 | Apr 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14594108 | Jan 2015 | US |
Child | 15835033 | US |