Patent Application
20240031446
The present disclosure relates generally to information handling system. More particularly, the present disclosure relates to systems and methods for dynamic placement of services in a network closer to endpoints of the network.
As the value and use of information continues to increase, individuals and businesses seek additional ways to process and store information. One option available to users is information handling systems. An information handling system generally processes, compiles, stores, and/or communicates information or data for business, personal, or other purposes thereby allowing users to take advantage of the value of the information. Because technology and information handling needs and requirements vary between different users or applications, information handling systems may also vary regarding what information is handled, how the information is handled, how much information is processed, stored, or communicated, and how quickly and efficiently the information may be processed, stored, or communicated. The variations in information handling systems allow for information handling systems to be general or configured for a specific user or specific use, such as financial transaction processing, airline reservations, enterprise data storage, or global communications. In addition, information handling systems may include a variety of hardware and software components that may be configured to process, store, and communicate information and may include one or more computer systems, data storage systems, and networking systems.
In a network fabric, such as a network fabric with a CLOS topology, non-volatile memory express (NVMe) over Fabrics (NVMe-oF™) endpoints are connected to centralized discovery controller or service (CDC) server, which may be placed on one of multiple leaf switches in the network fabric, and may have resource constraints. When a CDC service is placed on a leaf switch to serve an NVMe® endpoint far way, the service to the NVMe® endpoint may suffer excessive latency, delay, jitter, or even timeout, and the performance of the whole network fabric may be impacted negatively.
Accordingly, it is highly desirable to find new, more efficient ways to place the leaf switches closest to NVMe® endpoints to which the CDC services connect for a predictable behavior with respect to connection scale, latency, and jitter.
References will be made to embodiments of the disclosure, examples of which may be illustrated in the accompanying figures. These figures are intended to be illustrative, not limiting. Although the accompanying disclosure is generally described in the context of these embodiments, it should be understood that it is not intended to limit the scope of the disclosure to these particular embodiments. Items in the figures may not be to scale.
In the following description, for purposes of explanation, specific details are set forth in order to provide an understanding of the disclosure. It will be apparent, however, to one skilled in the art that the disclosure can be practiced without these details. Furthermore, one skilled in the art will recognize that embodiments of the present disclosure, described below, may be implemented in a variety of ways, such as a process, an apparatus, a system/device, or a method on a tangible computer-readable medium.
Components, or modules, shown in diagrams are illustrative of exemplary embodiments of the disclosure and are meant to avoid obscuring the disclosure. It shall be understood that throughout this discussion that components may be described as separate functional units, which may comprise sub-units, but those skilled in the art will recognize that various components, or portions thereof, may be divided into separate components or may be integrated together, including, for example, being in a single system or component. It should be noted that functions or operations discussed herein may be implemented as components. Components may be implemented in software, hardware, or a combination thereof.
Furthermore, connections between components or systems within the figures are not intended to be limited to direct connections. Rather, data between these components may be modified, re-formatted, or otherwise changed by intermediary components. Also, additional or fewer connections may be used. It shall also be noted that the terms “coupled,” “connected,” “communicatively coupled,” “interfacing,” “interface,” or any of their derivatives shall be understood to include direct connections, indirect connections through one or more intermediary devices, and wireless connections. It shall also be noted that any communication, such as a signal, response, reply, acknowledgement, message, query, etc., may comprise one or more exchanges of information.
Reference in the specification to “one or more embodiments,” “preferred embodiment,” “an embodiment,” “embodiments,” or the like means that a particular feature, structure, characteristic, or function described in connection with the embodiment is included in at least one embodiment of the disclosure and may be in more than one embodiment. Also, the appearances of the above-noted phrases in various places in the specification are not necessarily all referring to the same embodiment or embodiments.
The use of certain terms in various places in the specification is for illustration and should not be construed as limiting. The terms “include,” “including,” “comprise,” “comprising,” and any of their variants shall be understood to be open terms, and any examples or lists of items are provided by way of illustration and shall not be used to limit the scope of this disclosure.
A service, function, or resource is not limited to a single service, function, or resource; usage of these terms may refer to a grouping of related services, functions, or resources, which may be distributed or aggregated. The use of memory, database, information base, data store, tables, hardware, cache, and the like may be used herein to refer to system component or components into which information may be entered or otherwise recorded. The terms “data,” “information,” along with similar terms, may be replaced by other terminologies referring to a group of one or more bits, and may be used interchangeably. The terms “packet” or “frame” shall be understood to mean a group of one or more bits. The term “frame” shall not be interpreted as limiting embodiments of the present invention to Layer 2 networks; and, the term “packet” shall not be interpreted as limiting embodiments of the present invention to Layer 3 networks. The terms “packet,” “frame,” “data,” or “data traffic” may be replaced by other terminologies referring to a group of bits, such as “datagram” or “cell.” The words “optimal,” “optimize,” “optimization,” and the like refer to an improvement of an outcome or a process and do not require that the specified outcome or process has achieved an “optimal” or peak state.
It shall be noted that: (1) certain steps may optionally be performed; (2) steps may not be limited to the specific order set forth herein; (3) certain steps may be performed in different orders; and (4) certain steps may be done concurrently.
Any headings used herein are for organizational purposes only and shall not be used to limit the scope of the description or the claims. Each reference/document mentioned in this patent document is incorporated by reference herein in its entirety.
In one or more embodiments, a stop condition may include: (1) a set number of iterations have been performed; (2) an amount of processing time has been reached; (3) convergence (e.g., the difference between consecutive iterations is less than a first threshold value); (4) divergence (e.g., the performance deteriorates); and (5) an acceptable outcome has been reached.
It shall be noted that any experiments and results provided herein are provided by way of illustration and were performed under specific conditions using a specific embodiment or embodiments; accordingly, neither these experiments nor their results shall be used to limit the scope of the disclosure of the current patent document.
In one or more embodiments, CDC may provide various connectivity broker services to host and subsystems. It connects to host and subsystems, fetches the information from each of these devices, and keeps them in a name server database, etc. The CDC may provide various functions or services, such as endpoint registration, endpoint query, name/zone services, notifications, database synchronization, etc.
In one or more embodiments, NVMe® hosts and subsystems register their information with CDC. A CDC Nameserver database may be updated with this information. The Nameserver database is maintained per CDC instance. A CDC instance may manage a set of hosts and subsystems that register with it. A CDC deployment may have one or more CDC instances running. Each CDC instance may be associated with a single NVMe® storage area network (SAN). A single NVMe® SAN may have one or more Internet Protocol (IP) networks. Devices on these IP networks may discover each other based on the zoning policies configured in using fabric orchestration or management services, such as SmartFabric Storage Software (SFSS) provided by Dell, Inc. of Round Rock, Texas.
In one or more embodiments, CDC may provide zoning services to enforce connectivity between the host & subsystem, and/or vice-versa, based on the zoning policies. In addition, discovery of new host/subsystem(s) may trigger notifications, e.g., asynchronous event notifications (AENs), about NVMe® endpoints about the change in connectivity. CDC may provide multicast Domain Name System (mDNS) services for service advertisement, such that an end host may automate the connectivity to the CDC. Furthermore, the CDC may provide user interfaces (UIs) for an administrator for CDC service management.
In one or more embodiments, CDC functionality may be divided into two categories, centralized service(s) 112 and distributed service(s) 114. Centralized services are CPU/memory intensive and need to be placed on switches which have high CPU/Memory capacity and have connectivity to the distributed services. Examples of centralized services may comprise, but not limited to, policy framework (e.g., zoning), monitoring and reporting, and/or user access to CDC, etc. Distributed services have lower CPU/memory requirements and may be horizontally scaled on lower powered switches. Distributed services are preferably placed closer to the endpoints. Examples of distributed services may comprise, but not limited to, NVMe® protocol termination, and transmission of discovery information (e.g., mDNS). Both exemplary distributed services may be directly associated with number of connections to handle.
Embodiments of centralized service(s) and distributed services deployment on network switches are described in co-pending and commonly-owned U.S. patent application Ser. No. 17/869,727 (Docket No. DC-128672.01 (20110-2576)), filed on 20 Jul. 2022, entitled “PLACEMENT OF CONTAINERIZED APPLICATIONS IN A NETWORK FOR EMBEDDED CENTRALIZED DISCOVERY CONTROLLER (CDC) DEPLOYMENT,” which is incorporated by reference herein in its entirety.
In one or more embodiments, the centralized and/or distributed services deployed on network switches may comprise third-party applications. Embodiments of third-party applications on network switches are described in co-pending and commonly-owned U.S. patent application Ser. No. 17/863,798, (Docket No. DC-128671.01 (20110-2575)), filed on 13 Jul. 2022, entitled “SYSTEMS AND METHODS FOR DEPLOYING THIRD-PARTY APPLICATIONS ON A CLUSTER OF NETWORK SWITCHES,” which is incorporated by reference herein in its entirety.
One of the services provided by the CDC is endpoint registration. In one or more embodiments, endpoints, such as NVMe® hosts and subsystems, may register their information with CDC. A CDC Nameserver database may be updated with this information. The Nameserver database may be maintained per CDC instances. Endpoint registration may be done via push registration and/or pull registration. In one or more embodiments, when the endpoint initiates the registration request with the CDC, it may be defined as a push registration. When the CDC initiates the registration request, it may be defined as a pull registration.
In one or more embodiments, the plurality of leaf switches may be grouped into multiple leaf switch pairs with a fabric link—such as an inter-switch link (ISL), inter-chassis link (ICL), or inter-node link (INL), which terms may be used interchangeably—connecting the leaf switches in each pair. For example, the leaf switches 220-11 and 220-12 form one leaf switch pair with an ICL connecting the two leaf switches.
The plurality of spine switches and leaf switches provide configurable and dedicated communication paths for connections between endpoints 230, which may comprise multiple NVMe® hosts, e.g., 230-1a, 230-1b, 230-1d, etc., and multiple NVMe® subsystems, e.g., e.g., 230-1e, 230-nd, etc. The endpoints 230 may be grouped into multiple virtual local area networks (VLANs) and each leaf switch may be configured to have a local IP address for each VLAN. As shown in the exemplary embodiment in
In one or more embodiments, the leaf switches may also communicatively couple to a plurality of direct discovery controllers (DDCs), e.g., 230-1c, 230-1f, etc., which may be NVMe® discovery controller residing on subsystems to provide controller functionality and at least some host functionality for pull registration. Details of the pull registration are described in the following Section C.
In one or more embodiments, an endpoint may receive mDNS messages from multiple leaf switches to form multihoming paths. For example, the host 230-la receives an mDNS message (yellow11) from the leaf switch-11 and an mDNS message (yellow12) from the leaf switch-12. As a result, the host 230-la may send connection requests to both leaf switches (switch-11 and switch-12) and have multihoming paths to the CDC centralized service(s) deployed on the spine switch 210-1.
In step 310, the CDC may start listener services on the leaf switch (and also on other leaf switches deployed with distributed services) to serve any incoming NVMe® connection requests for the local IP addresses on the leaf switch. In step 315, the one or more endpoints send connection requests for registration based on the mDNS message received. In step 320, the leaf switch receives the connection requests from the one or more endpoints to complete push registration for the one or more endpoints.
In one or more embodiments, such a push registration process guarantees a connection request from an endpoint is served by a local switch. Therefore, a predictable behavior with respect to connection scale, delay, and jitter may be achieved.
A pull registration is a registration process with registration request initiated by the CDC. In one or more embodiments, a pull registration process may comprise configuring a Direct Discovery Controller (DDC) for each subsystem endpoint that the CDC manages. Each DDC may couple to one or more subsystems for registration, while one subsystem may only have one DDC for registration. During the pull registration, the CDC may query the DDC for a subsystem and register the subsystem.
In step 515, the CDC centralized service updates a DDC database and sends an inquiry to the NOS regarding which switch to learn the DDC IP address (e.g., IP=ddc1 or ddcn). In step 520, the NOS checks Address Resolution Protocol (ARP) entries on all leaf switches to determine a leaf switch (e.g., leaf-11 or leaf-n1) to learn the local address of the corresponding DDC. In the exemplary embodiment in
In step 525, upon receiving the determined leaf switch (leaf-11 or leaf-n1) from the NOS, the CDC centralized service instantiates an NVMe® service handler (NVMeServiceHandler, as shown in
In step 530, upon microservice deployment, the determined leaf switch (leaf-11) sends an NVMe® connection request to the corresponding DDC to complete a pull registration for the corresponding DDC. In step 535, the CDC distributed services on the determined leaf switch (leaf-11) send the pull registration completion information of the corresponding DDC to the CDC centralized service for system information update.
In one or more embodiments, if a DDC IP address (e.g., ddc2) is not found, possibly due to the corresponding DDC (DDC-2) being offline, an ARP request may be originated from each of multiple leaf switches for the given IP address (e.g., ddc2). If an NVMe® endpoint for the given IP address is connected to one leaf switch, the NVMe® endpoint replies to the ARP request, and the SFSS/SFSS-like service learns the IP address on the one switch. In case the DDC IP address is not learned from any leaf switches, periodic ARP requests may be sent for the given IP address until a predetermined number, a predetermined time interval, or the given IP address is resolved.
In one or more embodiments, when a DDC reports multiple kickstart records or KDReqs, the CDC may implement pull registration to find a subsystem corresponding to each KDReq. Embodiments of kickstart and pull registration are described in co-pending and commonly-owned U.S. patent application Ser. No. 17/239,462, (Docket No. DC-123595.01 (20110-2456)), filed on 23 Apr. 2021, and in co-pending and commonly-owned U.S. patent application Ser. No. 17/200,896, (Docket No. DC-123596.01 (20110-2457)), filed on 14 Mar. 2021. Each of the aforementioned patent documents is incorporated by reference herein in its entirety.
In one or more embodiments, a DDC may be manually added via a CDC user interface (UI) for a subsystem that does not yet have automated registration. The CDC UI may be a graphical user interface (GUI) or a web UI. The CDC may use the manual mechanism to find where the subsystem endpoint is connected.
In step 705, the CDC centralized service updates a DDC database based on one or more DDCs manually added by a user 605 via a CDC UI (e.g., a GUI). Each DDC has a DDC IP address.
In step 710, the CDC centralized service sends an inquiry to the NOS regarding which switch to learn a DDC IP address (e.g., IP=ddc1) for one added DDC (e.g., DDC-1). In step 715, the NOS checks one or more ARP entries on leaf switches to determine a leaf switch (e.g., leaf-11) to learn the local address of the one added DDC. Since the DDC IP address (e.g., ddc1) never communicated with CDC, the ARP entry may not be present, and the DDC IP address may not be resolved on any of the switches at least initially. In one or more embodiments, the NOS may send a ping request to each of the leaf switches for IP=ddc1. After sending the ping request to each leaf switch, the leaf switch (e.g., leaf-11) that is connected to the one added DDC (DDC-1) sends a response for the ping and therefore an ARP entry may be added to the leaf switch. Accordingly, the SFS/SFS-like services solve the ARP on the leaf switch (leaf-11). In other words, the DDC IP address (ddc1) is learned on the determined leaf switch.
In step 720, upon receiving the determined leaf switch (leaf-11) from the NOS, the CDC centralized service instantiates an NVMe® service handler (NVMeServiceHandler, as shown in
In step 725, upon microservice deployment, the determined leaf switch (leaf-11) sends an NVMe® connection request to the one added DDC to complete a pull registration for the added DDC. In step 730, the CDC distributed services on the determined leaf switch (leaf-11) send pull registration completion information to the CDC centralized service for system information update.
In one or more embodiments, if a DDC IP address (e.g., ddc2) is not found, possibly due to the corresponding DDC (DDC-2) being offline, the ARP for ddc2 will not be resolved on any of the switches initially. SFS may send a ping request from each of the switches for DDC IP address (e.g., ddc2) and waits for a response for a predetermined timeout. If no response is received after the predetermined timeout, the SFS sends a message to the CDC centralized service indicating no IP found. The CDC centralized service may re-send the inquiry for the DDC IP address (ddc2) periodically.
In one or more embodiments, when the CDC centralized service sends an inquiry to the NOS regarding which switch to learn a DDC IP address (e.g., IP=ddc3), the DDC IP address (ddc3) may be learned on the NOS based on proactive measures.
In one or more embodiments, when the CDC centralized service sends an inquiry to the NOS regarding which switch to learn a DDC IP address (e.g., IP=ddc4), the NOS may not learn the DDC IP address (ddc4). However, the NOS may monitor services, e.g., DCD centralized services, when the DDC IP address (ddc4) is learned.
The embodiments of placement of services close to endpoints ensure a predictable behavior with respect to connection scale, delay, and jitter, especially for switches having resource-constrained compute resources.
In one or more embodiments, aspects of the present patent document may be directed to, may include, or may be implemented on one or more information handling systems (or computing systems). An information handling system/computing system may include any instrumentality or aggregate of instrumentalities operable to compute, calculate, determine, classify, process, transmit, receive, retrieve, originate, route, switch, store, display, communicate, manifest, detect, record, reproduce, handle, or utilize any form of information, intelligence, or data. For example, a computing system may be or may include a personal computer (e.g., laptop), tablet computer, mobile device (e.g., personal digital assistant (PDA), smartphone, phablet, tablet, etc.), smartwatch, server (e.g., blade server or rack server), a network storage device, camera, or any other suitable device and may vary in size, shape, performance, functionality, and price. The computing system may include random access memory (RAM), one or more processing resources such as a central processing unit (CPU) or hardware or software control logic, read-only memory (ROM), and/or other types of memory. Additional components of the computing system may include one or more drives (e.g., hard disk drives, solid-state drive, or both), one or more network ports for communicating with external devices as well as various input and output (I/O) devices. The computing system may also include one or more buses operable to transmit communications between the various hardware components.
As illustrated in
A number of controllers and peripheral devices may also be provided, as shown in
In the illustrated system, all major system components may connect to a bus 916, which may represent more than one physical bus. However, various system components may or may not be in physical proximity to one another. For example, input data and/or output data may be remotely transmitted from one physical location to another. In addition, programs that implement various aspects of the disclosure may be accessed from a remote location (e.g., a server) over a network. Such data and/or programs may be conveyed through any of a variety of machine-readable medium including, for example: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as compact discs (CDs) and holographic devices; magneto-optical media; and hardware devices that are specially configured to store or to store and execute program code, such as application specific integrated circuits (ASICs), programmable logic devices (PLDs), flash memory devices, other non-volatile memory (NVM) devices (such as 3D XPoint-based devices), and ROM and RAM devices.
The information handling system 1000 may include a plurality of I/O ports 1005, a network processing unit (NPU) 1015, one or more tables 1020, and a CPU 1025. The system includes a power supply (not shown) and may also include other components, which are not shown for sake of simplicity.
In one or more embodiments, the I/O ports 1005 may be connected via one or more cables to one or more other network devices or clients. The network processing unit 1015 may use information included in the network data received at the node 1000, as well as information stored in the tables 1020, to identify a next device for the network data, among other possible activities. In one or more embodiments, a switching fabric may then schedule the network data for propagation through the node to an egress port for transmission to the next destination.
Aspects of the present disclosure may be encoded upon one or more non-transitory computer-readable media with instructions for one or more processors or processing units to cause steps to be performed. It shall be noted that the one or more non-transitory computer-readable media shall include volatile and/or non-volatile memory. It shall be noted that alternative implementations are possible, including a hardware implementation or a software/hardware implementation. Hardware-implemented functions may be realized using ASIC(s), programmable arrays, digital signal processing circuitry, or the like. Accordingly, the “means” terms in any claims are intended to cover both software and hardware implementations. Similarly, the term “computer-readable medium or media” as used herein includes software and/or hardware having a program of instructions embodied thereon, or a combination thereof. With these implementation alternatives in mind, it is to be understood that the figures and accompanying description provide the functional information one skilled in the art would require to write program code (i.e., software) and/or to fabricate circuits (i.e., hardware) to perform the processing required.
It shall be noted that embodiments of the present disclosure may further relate to computer products with a non-transitory, tangible computer-readable medium that have computer code thereon for performing various computer-implemented operations. The media and computer code may be those specially designed and constructed for the purposes of the present disclosure, or they may be of the kind known or available to those having skill in the relevant arts. Examples of tangible computer-readable media include, for example: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as compact discs (CDs) and holographic devices; magneto-optical media; and hardware devices that are specially configured to store or to store and execute program code, such as ASICs, PLDs, flash memory devices, other non-volatile memory devices (such as 3D XPoint-based devices), ROM, and RAM devices. Examples of computer code include machine code, such as produced by a compiler, and files containing higher level code that are executed by a computer using an interpreter. Embodiments of the present disclosure may be implemented in whole or in part as machine-executable instructions that may be in program modules that are executed by a processing device. Examples of program modules include libraries, programs, routines, objects, components, and data structures. In distributed computing environments, program modules may be physically located in settings that are local, remote, or both.
One skilled in the art will recognize no computing system or programming language is critical to the practice of the present disclosure. One skilled in the art will also recognize that a number of the elements described above may be physically and/or functionally separated into modules and/or sub-modules or combined together.
It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present disclosure. It is intended that all permutations, enhancements, equivalents, combinations, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present disclosure. It shall also be noted that elements of any claims may be arranged differently, including having multiple dependencies, configurations, and combinations.
