Stage upgrade of image versions on devices in a cluster

Description

TECHNICAL FIELD

The present technology pertains to image upgrades, and more specifically pertains to upgrading image versions on devices in a cluster.

BACKGROUND

Multi-tenant datacenters typically have numerous network devices, such as routers and switches, which are interconnected to provide service and connectivity to the various tenants in the datacenter. In particular, many of these network devices provide network connectivity to tenant infrastructure, while others are connected to servers and other devices in the tenant space to provide application and network services. Some application and network services can include, for example, DHCP, NTP, firewall and security services, policy services (e.g., Policy Gateway servers), and so forth. As such, these network devices provide important services in the datacenter, and any interruption in service can be extremely disruptive and inconvenient.

However, many times, the various devices in a datacenter must undergo upgrades, which can result in downtime for the upgraded devices and thus the services they provision. Not surprisingly, image upgrades of network devices in the datacenter can be very difficult to implement, as each image upgrade often results in service disruptions. This challenge can become even more profound as the number of network devices in the datacenter—and consequently the potential service disruption—increases. Unfortunately, many network devices in a datacenter do not fully support ISSU (in-service software upgrade), which would reduce the service disruption period from upgrading images, and must therefore undergo some period of downtime.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only exemplary embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:

FIG. 1 illustrates an example network device according to some aspects of the subject technology;

FIGS. 2A and 2B illustrate example system embodiments according to some aspects of the subject technology;

FIG. 3 illustrates a schematic block diagram of an example architecture for a network fabric;

FIG. 4 illustrates an example overlay network;

FIG. 5 illustrates an example multi-tenant network;

FIG. 6 illustrates an example graph showing vertices representing switches in a network;

FIG. 7 illustrates an example method embodiment for scheduling upgrades in a network;

FIG. 8 illustrates an example method for generating a graph for scheduling upgrades; and

FIG. 9 illustrates an example colored graph showing colored vertices representing switches in a network.

DESCRIPTION OF EXAMPLE EMBODIMENTS

Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the disclosure.

Overview

As previously mentioned, network devices in a datacenter can be very difficult to upgrade, as they typically result in service disruptions. Indeed, many network devices are low-end commodity switches which do not provide full-fledged ISSU (in-service software upgrade) and, as such, must undergo some period of downtime during an image upgrade. Moreover, various strategies for performing image upgrades may reduce the downtime, but nevertheless may result in long and unacceptable service disruptions.

For example, doing image upgrades in a random manner might render tenant services unavailable for unnecessary long periods of time. On the other hand, if each switch is upgraded sequentially, then the impact of such image upgrades to tenant service and traffic can be reduced. However, this can also result in a disruptive and prolonged process, as it requires a long window of time for upgrading.

On another extreme, shutting down all switches and upgrading them in one shot has the shortest upgrade time, but the maximal impact to all tenant traffic and service in that period, as it would result in all services and connectivity being completely down. This may not be acceptable in many cases.

The disclosed technology addresses the need in the art for minimizing downtime when performing image upgrades on network devices, such as switches. Disclosed are methods, systems and computer-readable media for stage upgrades of image versions on network devices in a cluster. First, the system can generate a graph including vertices interconnected in the graph, the vertices showing a distribution of associated switches in a network. The network can be a multi-tenant network, and the vertices can be interconnected to represent that the corresponding vertices provide service to the same tenant. The vertices can be graph-data structure based nodes in the graph.

However, note that while the graph is described here as having vertices, one of ordinary skill in the art will readily recognize that these concepts can be implemented using any type of representation or structure, including representations or data structures having one or more attributes or graphical formats. For example, in some cases, the graph can be generated with graph-data structure based representations. Here, the graph-data structure based representations can represent the switches in the network. Other types and structures for representations and graphs are contemplated herein, including any type of graphical representation instead of, or in addition to, vertices, or any type of view, display, or data structure instead of, or in addition to, a graph.

The system can then display the vertices and interconnections of the vertices in the graph according to a respective graphical attribute selected for the vertices and the interconnections, the respective graphical attribute selected to represent services provided by the associated switches to tenants in the network, wherein each of the vertices are displayed having a graphical attribute selected based on a type of service provided by each of the associated switches and/or an identity of a tenant serviced by each of the associated switches.

In some embodiments, the respective graphical attribute can be a color given to each of the vertices. Here, the vertices can be colored based on the services they provide in the network to a particular tenant. If two interconnected vertices provide service to a same tenant, those vertices can be given different colors to distinguish them in the graph. Since the attributes of the vertices (e.g., the colors) are used to determine what stage the devices represented by those vertices will be upgraded in, as will be explained further below, the different attributes provided to neighboring vertices can ensure that those vertices are assigned to different upgrade stages. As a result, if the two devices serve the same tenant, they will be upgraded in different stages to minimize the disruption to the tenant.

In some cases, the attributes can include a color, a line weight, a size, a shape, a symbol, a character, a label, and so forth. Moreover, the attributes can be selected based on services provided by the corresponding devices such that the upgrade of devices servicing specific tenants is distributed in order to minimize impact or disruption to those tenants. For example, devices that serve a same tenant can be given different attributes to place the devices in different upgrade categories or stages, and thus distribute the upgrades to a particular tenant.

Next, the system can schedule an upgrade of at least a portion of the associated switches, the upgrade being scheduled in stages, each of the stages including a portion of switches selected for upgrade in that stage based on respective graphical attributes associated with the vertices and interconnections, wherein switches associated with vertices and interconnections having a same graphical attribute are scheduled for a same stage to be upgraded in parallel during the same stage. Accordingly, the attributes of the vertices and interconnections in the graph can be assigned to specific stages in a multi-stage upgrade schedule, and the graph can thus quickly indicate the corresponding stage for each of the vertices based on the attributes given to the vertices. As previously mentioned, the attributes can be implemented to distribute the impact to every tenant in the network by partitioning the upgrades to devices that are pertinent to each tenant into multiple upgrade stages.

DESCRIPTION

A computer network is a geographically distributed collection of nodes interconnected by communication links and segments for transporting data between endpoints, such as personal computers and workstations. Many types of networks are available, with the types ranging from local area networks (LANs) and wide area networks (WANs) to overlay and software-defined networks, such as virtual extensible local area networks (VXLANs).

LANs typically connect nodes over dedicated private communications links located in the same general physical location, such as a building or campus. WANs, on the other hand, typically connect geographically dispersed nodes over long-distance communications links, such as common carrier telephone lines, optical lightpaths, synchronous optical networks (SONET), or synchronous digital hierarchy (SDH) links. LANs and WANs can include layer 2 (L2) and/or layer 3 (L3) networks and devices.

The Internet is an example of a WAN that connects disparate networks throughout the world, providing global communication between nodes on various networks. The nodes typically communicate over the network by exchanging discrete frames or packets of data according to predefined protocols, such as the Transmission Control Protocol/Internet Protocol (TCP/IP). In this context, a protocol can refer to a set of rules defining how the nodes interact with each other. Computer networks may be further interconnected by an intermediate network node, such as a router, to extend the effective “size” of each network.

Overlay networks generally allow virtual networks to be created and layered over a physical network infrastructure. Overlay network protocols, such as Virtual Extensible LAN (VXLAN), Network Virtualization using Generic Routing Encapsulation (NVGRE), Network Virtualization Overlays (NVO3), and Stateless Transport Tunneling (STT), provide a traffic encapsulation scheme which allows network traffic to be carried across L2 and L3 networks over a logical tunnel. Such logical tunnels can be originated and terminated through virtual tunnel end points (VTEPs).

Moreover, overlay networks can include virtual segments, such as VXLAN segments in a VXLAN overlay network, which can include virtual L2 and/or L3 overlay networks over which VMs communicate. The virtual segments can be identified through a virtual network identifier (VNI), such as a VXLAN network identifier, which can specifically identify an associated virtual segment or domain.

Network virtualization allows hardware and software resources to be combined in a virtual network. For example, network virtualization can allow multiple numbers of VMs to be attached to the physical network via respective virtual LANs (VLANs). The VMs can be grouped according to their respective VLAN, and can communicate with other VMs as well as other devices on the internal or external network.

Network segments, such as physical or virtual segments; networks; devices; ports; physical or logical links; and/or traffic in general can be grouped into a bridge or flood domain. A bridge domain or flood domain can represent a broadcast domain, such as an L2 broadcast domain. A bridge domain or flood domain can include a single subnet, but can also include multiple subnets. Moreover, a bridge domain can be associated with a bridge domain interface on a network device, such as a switch. A bridge domain interface can be a logical interface which supports traffic between an L2 bridged network and an L3 routed network. In addition, a bridge domain interface can support internet protocol (IP) termination, VPN termination, address resolution handling, MAC addressing, etc. Both bridge domains and bridge domain interfaces can be identified by a same index or identifier.

Furthermore, endpoint groups (EPGs) can be used in a network for mapping applications to the network. In particular, EPGs can use a grouping of application endpoints in a network to apply connectivity and policy to the group of applications. EPGs can act as a container for buckets or collections of applications, or application components, and tiers for implementing forwarding and policy logic. EPGs also allow separation of network policy, security, and forwarding from addressing by instead using logical application boundaries.

Cloud computing can also be provided in one or more networks to provide computing services using shared resources. Cloud computing can generally include Internet-based computing in which computing resources are dynamically provisioned and allocated to client or user computers or other devices on-demand, from a collection of resources available via the network (e.g., “the cloud”). Cloud computing resources, for example, can include any type of resource, such as computing, storage, and network devices, virtual machines (VMs), etc. For instance, resources may include service devices (firewalls, deep packet inspectors, traffic monitors, load balancers, etc.), compute/processing devices (servers, CPU's, memory, brute force processing capability), storage devices (e.g., network attached storages, storage area network devices), etc. In addition, such resources may be used to support virtual networks, virtual machines (VM), databases, applications (Apps), etc.

Cloud computing resources may include a “private cloud,” a “public cloud,” and/or a “hybrid cloud.” A “hybrid cloud” can be a cloud infrastructure composed of two or more clouds that inter-operate or federate through technology. In essence, a hybrid cloud is an interaction between private and public clouds where a private cloud joins a public cloud and utilizes public cloud resources in a secure and scalable manner. Cloud computing resources can also be provisioned via virtual networks in an overlay network, such as a VXLAN.

The disclosed technology addresses the need in the art for minimizing disruptions of network device upgrades in networks. Disclosed are systems, methods, and computer-readable storage media for stage upgrades of image versions on network devices in a cluster. A brief introductory description of exemplary systems and networks, as illustrated in FIGS. 1 through 5, is disclosed herein. A detailed description of generating graphs for upgrading devices in a network, implementing the graphs to upgrade devices in the network, related concepts, and exemplary variations, will then follow. These variations shall be described herein as the various embodiments are set forth. The disclosure now turns to FIG. 1.

FIG. 1 illustrates an example network device 110 suitable for implementing the present invention. Network device 110 includes a master central processing unit (CPU) 162, interfaces 168, and a bus 115 (e.g., a PCI bus). When acting under the control of appropriate software or firmware, the CPU 162 is responsible for executing packet management, error detection, and/or routing functions, such as miscabling detection functions, for example. The CPU 162 preferably accomplishes all these functions under the control of software including an operating system and any appropriate applications software. CPU 162 may include one or more processors 163 such as a processor from the Motorola family of microprocessors or the MIPS family of microprocessors. In an alternative embodiment, processor 163 is specially designed hardware for controlling the operations of router 110. In a specific embodiment, a memory 161 (such as non-volatile RAM and/or ROM) also forms part of CPU 162. However, there are many different ways in which memory could be coupled to the system.

The interfaces 168 are typically provided as interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with the router 110. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 162 to efficiently perform routing computations, network diagnostics, security functions, etc.

Although the system shown in FIG. 1 is one specific network device of the present invention, it is by no means the only network device architecture on which the present invention can be implemented. For example, an architecture having a single processor that handles communications as well as routing computations, etc. is often used. Further, other types of interfaces and media could also be used with the router.

Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 161) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc.

FIG. 2A, and FIG. 2B illustrate exemplary possible system embodiments. The more appropriate embodiment will be apparent to those of ordinary skill in the art when practicing the present technology. Persons of ordinary skill in the art will also readily appreciate that other system embodiments are possible.

FIG. 2A illustrates a conventional system bus computing system architecture 200 wherein the components of the system are in electrical communication with each other using a bus 205. Exemplary system 200 includes a processing unit (CPU or processor) 210 and a system bus 205 that couples various system components including the system memory 215, such as read only memory (ROM) 220 and random access memory (RAM) 225, to the processor 210. The system 200 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 210. The system 200 can copy data from the memory 215 and/or the storage device 230 to the cache 212 for quick access by the processor 210. In this way, the cache can provide a performance boost that avoids processor 210 delays while waiting for data. These and other modules can control or be configured to control the processor 210 to perform various actions. Other system memory 215 may be available for use as well. The memory 215 can include multiple different types of memory with different performance characteristics. The processor 210 can include any general purpose processor and a hardware module or software module, such as module 1232, module 2234, and module 3236 stored in storage device 230, configured to control the processor 210 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 210 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.

To enable user interaction with the computing device 200, an input device 245 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 235 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 200. The communications interface 240 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.

Storage device 230 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 225, read only memory (ROM) 220, and hybrids thereof.

The storage device 230 can include software modules 232, 234, 236 for controlling the processor 210. Other hardware or software modules are contemplated. The storage device 230 can be connected to the system bus 205. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 210, bus 205, display 235, and so forth, to carry out the function.

FIG. 2B illustrates a computer system 250 having a chipset architecture that can be used in executing the described method and generating and displaying a graphical user interface (GUI). Computer system 250 is an example of computer hardware, software, and firmware that can be used to implement the disclosed technology. System 250 can include a processor 255, representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. Processor 255 can communicate with a chipset 260 that can control input to and output from processor 255. In this example, chipset 260 outputs information to output 265, such as a display, and can read and write information to storage device 270, which can include magnetic media, and solid state media, for example. Chipset 260 can also read data from and write data to RAM 275. A bridge 280 for interfacing with a variety of user interface components 285 can be provided for interfacing with chipset 260. Such user interface components 285 can include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. In general, inputs to system 250 can come from any of a variety of sources, machine generated and/or human generated.

Chipset 260 can also interface with one or more communication interfaces 290 that can have different physical interfaces. Such communication interfaces can include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein can include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 255 analyzing data stored in storage 270 or 275. Further, the machine can receive inputs from a user via user interface components 285 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 255.

It can be appreciated that exemplary systems 200 and 250 can have more than one processor 210 or be part of a group or cluster of computing devices networked together to provide greater processing capability.

FIG. 3 illustrates a schematic block diagram of an example architecture 300 for a network fabric 312. The network fabric 312 can include spine switches 302_A, 302_B, . . . , 302_N(collectively “302”) connected to leaf switches 304_A, 304_B, 304_C, . . . , 304_N(collectively “304”) in the network fabric 312.

Spine switches 302 can be L3 switches in the fabric 312. However, in some cases, the spine switches 302 can also, or otherwise, perform L2 functionalities. Further, the spine switches 302 can support various capabilities, such as 40 or 10 Gbps Ethernet speeds. To this end, the spine switches 302 can include one or more 40 Gigabit Ethernet ports. Each port can also be split to support other speeds. For example, a 40 Gigabit Ethernet port can be split into four 10 Gigabit Ethernet ports.

In some embodiments, one or more of the spine switches 302 can be configured to host a proxy function that performs a lookup of the endpoint address identifier to locator mapping in a mapping database on behalf of leaf switches 304 that do not have such mapping. The proxy function can do this by parsing through the packet to the encapsulated, tenant packet to get to the destination locator address of the tenant. The spine switches 302 can then perform a lookup of their local mapping database to determine the correct locator address of the packet and forward the packet to the locator address without changing certain fields in the header of the packet.

When a packet is received at a spine switch 302_i, the spine switch 302, can first check if the destination locator address is a proxy address. If so, the spine switch 302, can perform the proxy function as previously mentioned. If not, the spine switch 302, can lookup the locator in its forwarding table and forward the packet accordingly.

Spine switches 302 connect to leaf switches 304 in the fabric 312. Leaf switches 304 can include access ports (or non-fabric ports) and fabric ports. Fabric ports can provide uplinks to the spine switches 302, while access ports can provide connectivity for devices, hosts, endpoints, VMs, or external networks to the fabric 312.

Leaf switches 304 can reside at the edge of the fabric 312, and can thus represent the physical network edge. In some cases, the leaf switches 304 can be top-of-rack (“ToR”) switches configured according to a ToR architecture. In other cases, the leaf switches 304 can be aggregation switches in any particular topology, such as end-of-row (EoR) or middle-of-row (MoR) topologies. The leaf switches 304 can also represent aggregation switches, for example.

The leaf switches 304 can be responsible for routing and/or bridging the tenant packets and applying network policies. In some cases, a leaf switch can perform one or more additional functions, such as implementing a mapping cache, sending packets to the proxy function when there is a miss in the cache, encapsulate packets, enforce ingress or egress policies, etc.

Moreover, the leaf switches 304 can contain virtual switching functionalities, such as a virtual tunnel endpoint (VTEP) function as explained below in the discussion of VTEP 408 in FIG. 4. To this end, leaf switches 304 can connect the fabric 312 to an overlay network, such as overlay network 400 illustrated in FIG. 4.

Network connectivity in the fabric 312 can flow through the leaf switches 304. Here, the leaf switches 304 can provide servers, resources, endpoints, external networks, or VMs access to the fabric 312, and can connect the leaf switches 304 to each other. In some cases, the leaf switches 304 can connect EPGs to the fabric 312 and/or any external networks. Each EPG can connect to the fabric 312 via one of the leaf switches 304, for example.

Endpoints 310A-E (collectively “310”) can connect to the fabric 312 via leaf switches 304. For example, endpoints 310A and 310B can connect directly to leaf switch 304A, which can connect endpoints 310A and 310B to the fabric 312 and/or any other one of the leaf switches 304. Similarly, endpoint 310E can connect directly to leaf switch 304C, which can connect endpoint 310E to the fabric 312 and/or any other of the leaf switches 304. On the other hand, endpoints 310C and 310D can connect to leaf switch 304B via L2 network 306. Similarly, the wide area network (WAN) can connect to the leaf switches 304C or 304D via L3 network 308.

Endpoints 310 can include any communication device, such as a computer, a server, a switch, a router, etc. In some cases, the endpoints 310 can include a server, hypervisor, or switch configured with a VTEP functionality which connects an overlay network, such as overlay network 400 below, with the fabric 312. For example, in some cases, the endpoints 310 can represent one or more of the VTEPs 408A-D illustrated in FIG. 4. Here, the VTEPs 408A-D can connect to the fabric 312 via the leaf switches 304. The overlay network can host physical devices, such as servers, applications, EPGs, virtual segments, virtual workloads, etc. In addition, the endpoints 310 can host virtual workload(s), clusters, and applications or services, which can connect with the fabric 312 or any other device or network, including an external network. For example, one or more endpoints 310 can host, or connect to, a cluster of load balancers or an EPG of various applications.

Although the fabric 312 is illustrated and described herein as an example leaf-spine architecture, one of ordinary skill in the art will readily recognize that the subject technology can be implemented based on any network fabric, including any data center or cloud network fabric. Indeed, other architectures, designs, infrastructures, and variations are contemplated herein.

FIG. 4 illustrates an exemplary overlay network 400. Overlay network 400 uses an overlay protocol, such as VXLAN, VGRE, VO3, or STT, to encapsulate traffic in L2 and/or L3 packets which can cross overlay L3 boundaries in the network. As illustrated in FIG. 4, overlay network 400 can include hosts 406A-D interconnected via network 402.

Network 402 can include a packet network, such as an IP network, for example. Moreover, network 402 can connect the overlay network 400 with the fabric 312 in FIG. 3. For example, VTEPs 408A-D can connect with the leaf switches 304 in the fabric 312 via network 402.

Hosts 406A-D include virtual tunnel end points (VTEP) 408A-D, which can be virtual nodes or switches configured to encapsulate and de-encapsulate data traffic according to a specific overlay protocol of the network 400, for the various virtual network identifiers (VNIDs) 410A-I. Moreover, hosts 406A-D can include servers containing a VTEP functionality, hypervisors, and physical switches, such as L3 switches, configured with a VTEP functionality. For example, hosts 406A and 406B can be physical switches configured to run VTEPs 408A-B. Here, hosts 406A and 406B can be connected to servers 404A-D, which, in some cases, can include virtual workloads through VMs loaded on the servers, for example.

In some embodiments, network 400 can be a VXLAN network, and VTEPs 408A-D can be VXLAN tunnel end points. However, as one of ordinary skill in the art will readily recognize, network 400 can represent any type of overlay or software-defined network, such as NVGRE, STT, or even overlay technologies yet to be invented.

The VNIDs can represent the segregated virtual networks in overlay network 400. Each of the overlay tunnels (VTEPs 408A-D) can include one or more VNIDs. For example, VTEP 408A can include VNIDs 1 and 2, VTEP 408B can include VNIDs 1 and 3, VTEP 408C can include VNIDs 1 and 2, and VTEP 408D can include VNIDs 1-3. As one of ordinary skill in the art will readily recognize, any particular VTEP can, in other embodiments, have numerous VNIDs, including more than the 3 VNIDs illustrated in FIG. 4.

The traffic in overlay network 400 can be segregated logically according to specific VNIDs. This way, traffic intended for VNID 1 can be accessed by devices residing in VNID 1, while other devices residing in other VNIDs (e.g., VNIDs 2 and 3) can be prevented from accessing such traffic. In other words, devices or endpoints connected to specific VNIDs can communicate with other devices or endpoints connected to the same specific VNIDs, while traffic from separate VNIDs can be isolated to prevent devices or endpoints in other specific VNIDs from accessing traffic in different VNIDs.

Servers 404A-D and VMs 404E-I can connect to their respective VNID or virtual segment, and communicate with other servers or VMs residing in the same VNID or virtual segment. For example, server 404A can communicate with server 404C and VMs 404E and 404G because they all reside in the same VNID, viz., VNID 1. Similarly, server 404B can communicate with VMs 404F, H because they all reside in VNID 2. VMs 404E-I can host virtual workloads, which can include application workloads, resources, and services, for example. However, in some cases, servers 404A-D can similarly host virtual workloads through VMs hosted on the servers 404A-D. Moreover, each of the servers 404A-D and VMs 404E-I can represent a single server or VM, but can also represent multiple servers or VMs, such as a cluster of servers or VMs.

VTEPs 408A-D can encapsulate packets directed at the various VNIDs 1-3 in the overlay network 400 according to the specific overlay protocol implemented, such as VXLAN, so traffic can be properly transmitted to the correct VNID and recipient(s). Moreover, when a switch, router, or other network device receives a packet to be transmitted to a recipient in the overlay network 400, it can analyze a routing or lookup table to determine where the packet needs to be transmitted, to ensure the traffic reaches the appropriate recipient. For example, if VTEP 408A receives a packet from endpoint 404B that is intended for endpoint 404H, VTEP 408A can analyze a routing table that maps the intended endpoint, endpoint 404H, to a specific switch that is configured to handle communications intended for endpoint 404H. VTEP 408A might not initially know, when it receives the packet from endpoint 404B, that such packet should be transmitted to VTEP 408D in order to reach endpoint 404H. Accordingly, by analyzing the routing table, VTEP 408A can lookup endpoint 404H, which is the intended recipient, and determine that the packet should be transmitted to VTEP 408D, as specified in the routing table based on endpoint-to-switch mappings or bindings, so the packet can be transmitted to, and received by, endpoint 404H as expected.

In some cases, the routing table may not yet include any mappings or bindings for the destination address in the packet. In such cases, the switch can broadcast or multicast the packet to multiple addresses, which are typically associated with multiple switches or routers, to ensure the packet reaches a device that is either connected to the destination device and thus can directly forward the packet to the destination, or otherwise knows where the packet needs to be forwarded (i.e., next hop) so it reaches its destination.

As one of ordinary skill in the art will readily recognize, the examples and technologies provided above are simply for clarity and explanation purposes, and can include many additional concepts and variations.

FIG. 5 illustrates an example multi-tenant fabric 500. The multi-tenant fabric 500 can be based on a network fabric, such as fabric 312 illustrated in FIG. 3. Accordingly, the multi-tenant fabric 500 can include spine and leaf switches, such as spine switches 302 and leaf switches 304. Moreover, in some cases, the ToR switches 506-516 can be leaf switches in the fabric 312, such as leaf switches 304.

The multi-tenant fabric 500 can include multiple tenants 502A-B and one or more providers, such as provider 504. For example, the multi-tenant fabric 500 can include tenants 502A-B and provider 504. Moreover, while the multi-tenant fabric 500 is illustrated in FIG. 5 as having two tenants (502A-B) and one provider (504), one of ordinary skill in the art will readily recognize that the number of tenants and providers in a multi-tenant fabric 500 can differ in other embodiments based on the specific environment and circumstances. Indeed, other embodiments with more or less tenants and/or providers are contemplated herein. However, the multi-tenant fabric 500 is illustrated as having two tenants and one provider as a non-limiting example for the sake of clarity.

The tenants 502A-B can refer to client or tenant space in the network which is assigned or allocated for the particular client or tenant. For example, the tenants 502A-B can be logical divisions or segments in the network which can be segregated from each other, such as virtual routing and forwarding (VRF) spaces. The tenants 502A-B can contain the tenant infrastructure for the associated tenants, to service those tenants accordingly. For example, the tenants 502A-B can include the infrastructure used for application and network services provided to those tenants.

Similarly, the provider 504 can refer to provider space in the network assigned or allocated for the particular provider. For example, the provider 504 can be a logical division or segment in the network which segregates the provider's infrastructure from other infrastructure. In some cases, the logical division for the provider 504 can be a VRF configured on the network. The provider 504 can contain provider infrastructure for a provider, such as a service or network provider. Thus, the provider 504 can include the necessary infrastructure and configuration to support the services provided and received by the provider associated with the provider space 504.

Each of the tenants 502A-B and provider 504 can include switches, such as ToRs 506-516, configured to connect the tenants 502A-B and provider 504 to other devices, clients, servers, and/or networks. For example, tenant 502A can include ToRs 506-510, which can reside in the space allocated for tenant 502A. Here, ToR 506 can connect tenant 502A to client 518, which can be a terminal, virtual machine, host, server, etc. ToR 506 can also connect to host 520 via VTEP 522. For example, ToR 506 can establish a tunnel with VTEP 522 to connect host 520 to tenant 502A. The host 520 here can include client 524, for example, which can be a terminal, virtual machine, server, service appliance, etc. For example, client 524 can be a virtual machine running a DHCP server that connects to ToR 506 through VTEP 522.

ToR 508 can similarly connect to host 520 through VTEP 522, and ultimately to client 524. In some cases, one or more connections can be configured to be part of a bridge domain (BD) to allow packets to be broadcast to the various devices associated with those connections. For example, the connections between ToRs 506 and 508 and client 518 and host 520 can be configured to be part of the same BD 528. Accordingly, ToR 506 and 508 can flood packets, such as control or data packets, to both client 518 and host 520 even when client 518 and host 520 are part of separate logical segments.

ToR 510 can reside on tenants 502A and 502B. Moreover, ToR 510 can connect to network 532, which can be a layer 2 (L2) or layer 3 (L3) network, for example. ToR 516 can reside on tenant 502B, and can connect host 530 to tenant 502B on the fabric 312. Host 530 can be a physical server or device, but can also include a virtual workload, such as a virtual server, a virtual appliance, or any virtual machine.

ToRs 512 and 514 can reside on provider 504, and can connect server 524 to the provider 504. The server 524 can be any type of server, including one or more physical and virtual servers, such as a DHCP server, a DNS server, a gateway policy server, a storage server, and so forth. However, in other cases, the server 524 can refer to any type of device or appliance, such as a terminal, a firewall, an intrusion detection system, a domain controller, etc. In some cases, the server 524 can have separate connections to the ToRs 512 and 514 configured to reside on the same BD 528. In other words, the connection from server 524 to ToR 512 and the connection from server 524 to ToR 514 can be part of the same BD. Thus, if ToR 512 or ToR 514 floods a packet over BD 528, the server 524 will receive the traffic irrespective of which ToR 512 or 514 flooded the packet.

As illustrated in the multi-tenant fabric 500, multiple ToRs 506-516 or devices serve the multiple tenants 502A-B, as well as provider 504 and the different devices and networks connected to the ToRs 506-516. Thus, when upgrading the ToRs 506-516, the different tenants, provider(s), devices, and networks can be affected by any downtime of the ToRs 506-516 which serve them. For example, upgrading all of the ToRs 506-516 at the same time would cause any tenant, provider, device, or network to experience a disruption of all services provided by the ToRs 506-516. On the other hand, upgrading all of the ToRs 506-516 sequentially may result in smaller disruptions to each affected entity, but it prolongs the upgrade window which, in larger networks, may extend to unreasonable or unfeasible levels. Accordingly, a graph as illustrated below can be generated to define an upgrade plan that minimizes the disruptions to each entity as well as the overall upgrade window.

The graph can be generated taking into account what services are provided by each of the ToRs 506-516, what entities (e.g., tenants, providers, devices, networks, etc.) are served by the ToRs 506-516 and thus are affected by disruptions to the ToRs 506-516, how many ToRs provide a specific service to any one entity (e.g., whether an entity is serviced by one ToR, two ToRs, three ToRs, etc., which would help determine a sequence for upgrading the ToRs servicing an entity with minimal disruption to that particular entity), how many and what type of services are provided by each ToR to each entity, and any other factor that may affect the level of disruption to one or more entities and the length of the upgrade window. As such, the graph can account for the relationship of each ToR to each entity, and the degree of disruption that would be experienced by any particular entity from an upgrade of one or more of the ToRs.

This way, the graph can be used to generate a multi-staged upgrade schedule that provides a sequence of upgrades and assigns ToRs to upgrade stages to yield minimal disruptions or downtime experienced by each entity and smaller upgrade windows. The graph can show a distribution of ToRs with connections representing services provided to entities, such as tenants, where a connection between two or more ToRs can indicate a service provided by the connected ToRs to an entity, and the connection can be depicted to represent the type and/or number of services provided by each ToR or connection of ToRs.

The ToRs in the graph can be illustrated based on specific graphical characteristics associated with their respectively assigned upgrade stage. For example, the ToRs can be colored in the graph where the specific color of the ToR in the graph can indicate which stage it should be upgraded in. Here, the upgrade schedule can define several upgrade stages where each stage is represented by a color. While color is used herein to describe the graphical characteristics used to depict the ToRs assigned to different stages, one of ordinary skill in the art will readily recognize that other characteristics, such as lines, patterns, symbols, size, shape, shades, numberings, etc., can be used in other embodiments to represent what upgrade stage a ToR is assigned to. However, color is used herein as a non-limiting example for the sake of clarity.

The disclosure now turns to a discussion of graphs for upgrading network devices in a network. A graph can be generated for implementing an upgrade schedule resulting in an upgrade window where tenant traffic and service impact is limited and the total upgrade window time is reduced. The image upgrades be based on a scheme, as described below, which can limit downtime and reduce the total upgrade time window. The upgrades can be performed from one or more centralized devices configured to manage images, such as one or more fabric controllers, to help manage the upgrade process. However, in some embodiments, the upgrades can be performed per device. Moreover, in some cases, the actual image download and upgrade can be delegated to an agent running on the switch, such as policy engine or a software upgrade engine.

As mentioned before, some switches, including spines such as spines 302 in FIG. 3, can have dual supervisor engines or dual-SUPed, (dual-supervised). Such switches can support ISSU, and hence image upgrades for those switches can be done with less disruption. On the other hand, many switches do not support ISSU. For example, many ToRs (e.g., ToRs 506-516) or leaf switches (e.g., leaf switches 304) typically do not support ISSU. Moreover, these switches are generally too numerous in datacenter networks to be upgraded sequentially without unnecessarily burdensome disruptions of services to tenants and clients. Precisely, many of these switches reside in large clusters which can extremely prolong the upgrade time window. To this end, the graphs and upgrade schedules described herein can be implemented to upgrade switches with minimal or limited service disruptions and smaller time windows.

Reference is now made to FIG. 6, which illustrates an example graph 600 showing a distribution of switches 602-624 for at least a portion of a multi-tenant network, such as multi-tenant network 500. The switches are represented as vertices on the graph 600 which can include, for example, the leaf switches 304 in FIG. 3 or the ToR switches 506-516 in FIG. 5. The multi-tenant network can include a fabric, such as fabric 312 with spine switches 302, and leaf switches 304 or ToR switches 506-516 which can be configured to provide services, such as network connectivity service or application service, to multiple tenants in the multi-tenant network. As previously mentioned, a tenant can be a customer, client, provider, or other users assigned to a physical and/or logical space in the network having infrastructure setup to provide one or more services to the tenant and associated devices.

The graph 600 can be generated to schedule upgrades to minimize upgrade time and limit service disruptions to tenants in the network. The upgrades can be scheduled in a multi-stage schedule, which can include multiple stages or time windows for upgrades. In some cases, the graph 600 can maximize the number of switches that can be upgraded in parallel in each upgrade stage. The graph 600 can also minimize impact to tenant traffic and service while reducing the overall upgrade time window.

The graph 600 can be generated by identifying vertices 602-624, which represent switches that serve the tenants in the multi-tenant network. The graph 600 can illustrate the distribution of vertices 602-624, and can include connections between the vertices 602-624. A connection between two vertices can represent a service being provided by the vertices to a same tenant. Each of the connections can be illustrated as a weak connection 626 or a strong connection 628. In some cases, a strong connection can represent an important service being provided by the connected vertices to the same tenant, whereas a weak connection, on the other hand, can represent a less important service being provided by the connected vertices to the same tenant. For example, an important service, such as DHCP or firewall service, can be used to form a strong connection between vertices that provide that same service to a same tenant. A less important service, such as network bandwidth or storage service, can be used to form a weak connection between vertices that provide that same service to the same tenant.

In other embodiments, a strong connection can be used to depict that the connected vertices provide the same service to the same tenant, such that bringing both vertices down would interrupt that service to that tenant, while a weak connection can be used to depict that the connected vertices provide different services to the same tenant.

The graph 600 can also include scoring of the vertices 602-624 to help determine the scheduling of upgrades. Here, the vertices can be graphically illustrated based on particular characteristics, as will be further described below, based on their associated score. The scores can then be used to assign vertices to upgrade stages in a multi-staged upgrade plan for the network.

In generating the graph 600, the connections between the vertices 602-624 can be shown as lines, as illustrated in FIG. 6. As previously mentioned, these connections can indicate that the interconnected vertices provide a service to the same tenant. The connections can be graphically depicted with specific characteristics to identify differences in the connections. For example, a dashed line can be used to depict a weak connection and a straight line can be used to illustrate a strong connection. Similarly, a straight line can be used to represent a weak connection when a bolded or emphasized line is used to represent a strong connection. In other cases, any other characteristic, such as color, pattern, line weight, numbering, dash type, etc., can be used to illustrate the connection as being a weak connection or a strong connection.

Indeed, in some cases, the connection strength can be depicted with greater granularity where additional levels of strength of connection are illustrated using various characteristics. For example, different characteristics or graphical connections can be used to depict connections having a strength level of level 1, level 2, level 3, level 4, and so forth. Moreover, the various strength levels can depend based on one or more factors, such as type of service provided, degree of redundancy or failover available to that tenant, etc. In some cases, the scores calculated for the vertices can also be used to determine the strength level of a connection.

For example, for a given pair of switches, represented by vertices 602-624, a weight of each edge can be calculated. In some embodiments, the weight can be the sum total of various tenants to whom the switches provide service (with some factor) and/or network connectivity to. For each vertex, the weight can be calculated as a sum of the edge of all edges which has this vertex as an endpoint. The weights can then be used to determine how to represent the vertex in the graph 600 and ultimately determine what stage from the multi-staged schedule to assign to that vertex for upgrading.

Each vertex can be illustrated based on a particular characteristic, such as a specific color, pattern, symbol, shape, size, etc. The particular characteristic can be selected based on the score of the vertex, the relationship of the vertex to other vertices, the service provided by that vertex, the tenant serviced by that vertex, the number of other vertices servicing the tenant serviced by that vertex, etc. In some embodiments, each vertex is colored based on the tenants they service with respect to other vertices or edges. For example, each vertex can be colored based on a color pattern.

Moreover, vertices which are interconnected by an edge are colored differently. Vertices interconnected by an edge represent switches servicing the same set of tenants. Accordingly, since vertices servicing a same tenant share an edge, those vertices are colored different so as to avoid upgrading all vertices to a tenant at the same time, which can lead to greater service disruption to that tenant. Instead, given that vertices with the same color are upgraded in parallel, the graph 600 can ensure that vertices that service the same tenant are upgraded in different stages by coloring those vertices with different colors. This can minimize service disruptions to that tenant.

In some embodiments, as seen in graph 600, any two vertices that share an edge (either a weak edge or a strong edge) represent switches that provide service to the same tenant. Thus, two vertices colored the same would not have any edge between them; meaning, the two vertices do not provide service to the same tenant (or the same set of tenants). The impact to each tenant is thereby minimized. This may be particularly the case if the upgrade schedule has enough distinct upgrade windows. Otherwise, in some embodiments, the upgrade schedule may be balanced to include less upgrade windows (e.g., to reduce the total upgrade window). In such cases, there may be some vertices which share a tenant service but are scheduled at the same upgrade window or stage. Here, the sharing of a stage or upgrade window between vertices that share a tenant may be identified based on one or more factors, including, but not limiting, the desired size of the total window, the type of service to that tenant, the estimated disruption to that tenant, the size of the upgrade window, prior history or agreements with that tenant, etc.

Furthermore, the graph 600 can be generated by one or more devices configured to generate the graph based on data about the multi-tenant network, including switches in the network, tenants in the network, services provided to each tenant, switches providing each service to each tenant, etc. The data can be collected by the one or more devices through user inputs, collected statistics, network monitoring, network analysis, configuration files, scripts, packets, probing, etc. In some embodiments, the graph 600 can be generated by a centralized device, such as a network controller. For example, the various switches in the network can be configured to report data to the centralized device, which can use the data to generate the graph 600 using a script or a program.

Reference is now made to FIG. 7, illustrating an example method 700 for generating a graph for creating an upgrade schedule. For the sake of clarity, the method is described in terms of a system, such as system 110 shown in FIG. 1, configured to practice the method. The steps outlined herein are exemplary and can be implemented in any combination thereof, including combinations that exclude, add or modify certain steps.

At step 702, the system 110 first generates graphical representations of network devices in a network, wherein a respective attribute of the graphical representations is selected based on at least one of respective services provided by the network devices to tenants in the network and identities of respective tenants serviced by the network devices. Here, the network can be a network fabric, such as fabric 312 illustrated in FIG. 3. Moreover, the fabric can include multiple tenants, such as the multi-tenant network 500 illustrated in FIG. 5. Further, the graphical representations can be images, objects, vertices, figures, lines, symbols, words, etc. For example, in some embodiments, the graphical representations are vertices or nodes representing switches in the network. In some embodiments, the graphical representations are graph-data structure based representations. Also, the network devices can be switches, routers, or any other network device. For example, the network devices can be switches, such as leaf switches 304 or ToR switches 506-516.

Furthermore, the respective attribute can include a color, a line weight, a pattern, a symbol, a texture, a shape, a size, a symbol, a number, or any other attribute. For example, in some embodiments, the respective attribute can be a color such that the graphical representations are colored based on a color selected for each graphical representation. Moreover, as previously mentioned, the respective attribute of a graphical representation of a switch can be selected based on what, if any, services the switch provides to a specific tenant, as well as what and how many other switches in the network provide that specific service, or any other service, to the tenant serviced by the switch. In other words, the respective attribute of a graphical representation of a switch can be selected based on a determination of what tenants are serviced by the switch, how many tenants are service by the switch, what type of service is provided by the switch to a specific client, what or how many other switches provide the same or other service to each tenant serviced by that switch, etc.

For example, assume the respective attribute in this example is color and the graphical representations are vertices for a graph. Here, the color of the vertices for each switch can be selected based on what tenant(s) that switch serves, what type of service it provides to that tenant(s), what other switches service that tenant(s), etc. Thus, for example, the system 110 (also called the network device, switch, or router) can determine that ToR 506 represented by vertex 1 provides DHCP service to tenant 502A, but tenant 502A also receives DHCP service from ToR 508 represented by vertex 2. Accordingly, the system 110 can pick a color for vertex 1 and vertex 2 knowing that both ToRs 506 and 508 provide DHCP service to the same tenant; namely, tenant 502A. In some embodiments, the system 110 will pick different colors for vertices that provide the same service to the same tenant. Thus, in this example, the system 110 can color vertex 1 with one color, such as blue, and color vertex 2 with a different color, such as red.

The colors can then be used, as will be described in steps 704-706 below, to generate a graph with colored vertices that represent switches in the network, and the colors can be used to assign upgrade stages to the vertices when performing a multi-stage upgrade. For example, all vertices colored blue can be upgraded in the same upgrade stage or window, and all vertices colored red can be upgraded in the same upgrade stage or window which is different than the upgrade stage or window used for the blue colored vertices.

Accordingly, in the previous example, ToR 506 represented by vertex 1 which is colored blue, can be upgraded in a stage that is different than the upgrade stage of ToR 508 represented by vertex 2 which is colored red. In this way, ToR 506 can be upgraded at the same stage as all other blue-colored vertices and ToR 508 can be upgraded at the same stage as all other red-colored vertices. Moreover, since ToR 506 and ToR 508 are represented by vertices with different colors, this can ensure that these two switches are upgraded in different stages. And given that these two switches both provide the same service to the same tenant, tenant 502A, this can stagger the upgrade of these switches so that tenant 502A experiences minimal disruption of services, as ToR 506 can remain up and running DHCP service while ToR 508 is upgraded and vice versa.

At step 704, the system 110 then generates a graph of the graphical representations, the graph showing a distribution of the network devices in the network, wherein the graphical representations are interconnected in the graph based on service roles of associated network devices with respect to tenants in the network and other network devices associated with the tenants in the network. The service roles can refer to what services are provided by the network devices and to what tenants. For example, the service roles can define what service, such as DHCP or firewall service, a switch provides to a specific tenant. The service roles can be considered relative to other network devices in the network and the tenants they service. In other words, the service role of a switch (e.g., what service it provides, how many services it provides, and what tenants it serves) can be identified by determining what services the switch provides to what tenants and what other switches serve the same tenant(s)—including the same service and/or other services. The information about the service roles of the network devices can then be used to generate the interconnections of the vertices in the graph.

For example, the system 110 can determine the service role of a switch by identifying what service it provides to what tenant(s). Thus, if ToR 506 provides DHCP service to tenant 502A, the system 110 can determine that the service role of ToR 506 is to provide DHCP service to tenant 502A. The system 110 can then determine what other switches serve that same tenant, tenant 502A. From our previous example, the system 110 can determine that ToR 508 also serves tenant 502A. Thus, the system 110 can determine that both ToRs 506 and 508 serve the same tenant (tenant 502A). In some cases, the system 110 can then determine if the service provided by both ToRs 506 and 508 to the same tenant (tenant 502A) are the same service (e.g., DHCP service) or if they provide different services to the same tenant. Based on this information, the system 110 can generate the interconnections. Here, the interconnections can be generated between switches that serve the same tenant. Accordingly, since both ToRs 506 and 508 serve tenant 502A, the system 110 can create an interconnection in the graph between ToRs 506 and 508.

The interconnections can also be illustrated having specific attributes based on the service roles. For example, the interconnections can be bolded, dashed, straight lines, heavier, lighter, colored, etc., to show specific attributes or details about the interconnections. The specific attributes or details can show whether an interconnection is a strong connection or a weak connection. A strong connection can be determined based on the type of service provided by the network device to a tenant. For example, if the service is an important service or the tenant does not have any redundancy or failover setup for that service, then the connection can be classified or identified as strong. On the other hand, if the service is of lesser importance or the tenant has redundancy setup for that service, then the service can be classified or identified as weak. In some cases, an important service can be an application service or a network service with high value to the customer or tenant, or otherwise which may result in high disruptions of stopped or interrupted.

For example, an important service can be DHCP service, firewall service, gateway policy server service, IDS, etc. On the other hand, a service of lesser importance can be a network connectivity service of lesser value to the customer or tenant, or otherwise a service which, if stopped, would result in less disruptions to the customer or tenant. For example, network bandwidth can be a service of less importance. Here, if the switch providing additional bandwidth is stopped, the tenant can continue to receive service, albeit at a lower bandwidth, and thus the tenant is minimally disrupted or inconvenienced.

In some embodiments, the interconnections between the vertices can be scored based on the service type (e.g., application service versus network connectivity service, value of service, etc.), quality of service (QoS) requirements, the number of devices servicing a corresponding tenant, the estimated disruption levels to the tenant resulting from a loss of service or downtime of the interconnected vertices, etc. The scores can then be used to select the respective attribute of the interconnections to illustrate the interconnections in the graph in a way that demonstrates their scores or values.

At step 706, the system 110 can schedule an upgrade of at least a portion of the network devices based on the graph, the upgrade being scheduled in stages, each of the stages including a portion of network devices selected for upgrade in that stage, wherein the portion of network devices for each stage is selected by identifying network devices having respective graphical representations assigned to a specific stage from the stages such that network devices having identical graphical representations assigned to the specific stage are selected for that specific stage. By scheduling the upgrade in stages, the system 110 can create a multi-stage upgrade schedule which it can use to upgrade devices in the multi-tenant network with minimal disruption and upgrade time window.

The number of stages in the schedule can depend on the size of the network, the number of tenants, the number of services provided, the number of switches in the network, the size and time of the upgrade, the upgrade requirements of the network, the average amount of service redundancy in the network, etc. As a non-limiting example, if the network only has 2-3 tenants, the number of stages can be reduced to under 5 stages. On the other hand, if the network has 100s or 1000s of tenants, the number of stages can be in the 100s or 1000s, for example.

Moreover, each of the network devices to be upgraded can be assigned to a specific stage for upgrade during that stage. For example, in a multi-stage upgrade schedule with 20 stages, ToR 506 can be assigned stage 2 and ToR 508 can be assigned stage 5, where each ToR is assigned a designated stage. All devices assigned to a particular stage can be upgraded during that stage. The upgrades during a particular stage can be performed in parallel or sequentially throughout the timespan or time window of the stage. Also, the various network devices can be upgraded in different stages in order to stagger or spread the upgrades and minimize impact. As previously mentioned, the network devices can be staggered in their upgrade based on the graph. For example, if vertices that are interconnected indicate that they serve the same tenant and thus would have different respective attributes, which would consequently mean that those vertices would be assigned to different stages in order to stagger the upgrades of devices that serve the same client.

Moreover, since the graph can illustrate estimated disruption levels through respective attributes of vertices and interconnections (e.g., strong versus weak, connections with varying scores, etc.), the estimated disruption levels can be taken into account when scheduling the upgrades over multiple stages. For example, strong interconnections that pertain to a specific tenant can be distributed to different stages so that strong interconnections are not upgraded in the same stage but instead are distributed over multiple stages. This can help minimize the disruption to the tenant and lower the window of time for the upgrade.

The upgrades can then be performed based on the scheduling generated. In some embodiments, the upgrades can be performed from a centralized location, such as a centralized network controller. Here, the network controller can download the images to the network devices for upgrade, or otherwise download a script to initialize a download of the images from the network controller or another location, such as a remote network location. In other embodiments, each of the devices to be upgraded can perform their own upgrade during their assigned stage based on the scheduling.

FIG. 8 illustrates an example method of generating a graph for upgrading devices in a network. At 802, a system defines the distribution of at least a portion of switches in a multi-tenant network as a graph with vertices representing the switches, such as graph 500 shown in FIG. 5. At step 804, the graph is initialized so that edges are provided between vertices and the weight of edges is determined based on a service provided to a same tenant.

At step 806, an uncolored vertex is located having a maximum weight. After the graph has been constructed, the maximal degree of each vertex can be found. In some instances, a graph with maximum degree can be colored using at the maximum degree+1 colors. The vertex visit order of the scheme can be determined based on the heuristic given below. If an upgrade window of the maximum degree+1*(Time to upgrade one switch) is acceptable to the service provider, the processing can complete. Each switch having the same vertex color can be upgraded in parallel.

The vertex weights can be stored in a Heap data structure, a tree, a graph, etc. The highest vertex can then be removed from the heap. The vertex can be colored at step 808. Here, the vertex can be colored with a used color (meaning, a color already allocated to another vertex that is not a neighbor vertex) if possible. If there is a color allocated to another vertex that is not a neighbor node at step 810, then that color can be used at step 812. If there is not a used color allocated to another vertex that is not a neighbor node, then if there is a new color available at step 814, that new color can be used at step 816. If there is no new color available at 814, then the color with the least weight can be chosen and used at 818. If there is a tie, such tie can be broken randomly to select the color.

The steps of coloring the node at 808 can be looped until the heap is empty. Moreover, each color can represent a different stage in the order in which the switches will be upgraded. Vertices with the same color can mean that those switches will be upgraded simultaneously in the same upgrade window. On the other hand, vertices with different colors can be assigned for upgrade during different upgrade windows.

FIG. 9 illustrates an example colored graph 900. The colored graph 900 can be generated by identifying vertices serving a same tenant and coloring the vertices according to a calculated weight or score of the edges of the vertices. The vertices colored similarly can be upgraded in parallel at a same stage. This can ensure that all switches providing service to the same tenants are not upgraded completely at the same time, thus allowing the upgrade of devices for each tenant to be distributed over multiple stages or time windows. This can reduce the upgrade time and tenant impact, while also decreasing upgrade total time.

The colored graph 900 can include vertices 902-924. As illustrated, each of the vertices 902-924 can be colored according to a particular color selected for that vertex. The colors used for the vertices 902-924 can be used to identify stages to upgrade the associated devices represented by the vertices 902-924 based on a multi-stage upgrade schedule. Since neighboring vertices represent vertices that serve the same tenant, these vertices can be colored differently to ensure they are assigned to different stages or time windows in the upgrade schedule. For example, vertex 902 can be colored white while neighboring vertices 904 and 924 can be colored with dotted circles. Moreover, like vertex 902, vertices 908 and 920 can be colored white, and thus can be upgraded at the same upgrade stage or time window as vertex 902, which is also colored white. Similarly, like vertices 904 and 924, vertex 914 can also be colored with dotted circles and thus upgraded in the same stage.

While the colored graph 900 is illustrated using colors and patterns, one of ordinary skill in the art will readily recognize that other characteristics, including other colors and patterns, can be implemented to depict varying stages for upgrading vertices in a graph. For example, the vertices can be labeled using numbers or symbols to depict varying stages, instead of, or in addition to, coloring the vertices. The colors and patterns illustrated in graph 900 are non-limiting examples for illustration purposes.

For clarity of explanation, in some instances the present technology may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.

In some embodiments the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.

Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.

Devices implementing methods according to these disclosures can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.

The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.

Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims. Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim.

Claims

1. A method comprising: defining a distribution of at least a portion of switches in a network via a graph, the graph configured to display the portion of switches via a plurality of vertices;determining a weight of each of the vertices;selecting, based on weight, an unmarked one of the plurality of vertices having a maximum weight of remaining unmarked vertices;determining whether a graphical attribute is allocated to an indirectly connected one of the plurality of vertices to the unmarked one of the plurality of vertices;when the graphical attribute is allocated to the indirectly connected one of the plurality of vertices, applying the graphical attribute to the unmarked one of the plurality of vertices; andwhen the graphical attribute is not allocated to the indirectly connected one of the plurality of vertices: determining if a new graphic attribute is available for allocation to the unmarked one of the plurality of vertices;in response to the new graphic attribute being available, marking the unmarked one of the plurality of vertices with the new graphic attribute;in response to the new graphic attribute being unavailable, marking the unmarked one of the plurality of vertices with an existing graphic attribute of another of the plurality of vertices;returning to the selecting until there are no unmarked vertices in the plurality of vertices;upgrading a plurality of the switches in a plurality of sequential stages, each of the plurality of sequential stages including a grouping of one or more of the plurality of the switches having a same graphical attribute in a same stage, the grouping of the one or more of the plurality of the switches upgraded in parallel during the same stage, the grouping of the one or more of the plurality of the switches servicing a same tenant.
2. The method of claim 1, further comprising: scheduling an upgrade of a plurality of the switches in the plurality of sequential stages, wherein the plurality of sequential stages scheduled for upgrading the plurality of the switches represented by identical ones of indirectly connected ones of the plurality of vertices.
3. The method of claim 2, wherein the identical ones include a same color, a same shading, or at least one of a same shape, a same size, or a same graphical attribute.
4. The method of claim 1, wherein each of the plurality of sequential stages is associated with a different graphical attribute having at least one of a different color or a different shading.
5. The method of claim 1, further comprising: wherein the plurality of sequential stages include a sequence defined by at least one of a plurality of different colors or one of a plurality of different shadings.
6. The method of claim 1, wherein each of the switches servicing a same tenant are represented by vertices having a different graphical attribute to cause each of the switches to be upgraded during different stages.
7. The method of claim 1, wherein any of the switches servicing different tenants are represented by vertices having a same graphical attribute to cause each of the switches to be upgraded during a same stage.
8. The method of claim 1, wherein the graphical attribute represents one of a plurality of service relationships between the switches and tenants in the network and represent estimated disruption levels resulting from a simultaneous upgrade of associated ones of the switches.
9. The method of claim 1, wherein, the plurality of sequential stages are prioritized based on estimated disruption levels, each of the plurality of the switches are assigned scores calculated based on the estimated disruption levels, and the plurality of the switches are associated with the attributes based on the scores.
10. A system comprising: a processor; anda computer-readable storage medium having stored therein instructions which, when executed by the processor, cause the processor to perform operations comprising:defining a distribution of at least a portion of switches in a network via a graph, the graph configured to display the portion of switches via a plurality of vertices;determining a weight of each of the vertices; selecting, based on weight, an unmarked one of the plurality of vertices having a maximum weight of remaining unmarked vertices;determining whether a graphical attribute is allocated to an indirectly connected one of the plurality of vertices to the unmarked one of the plurality of vertices; when the graphical attribute is allocated to the indirectly connected one of the plurality of vertices, applying the graphical attribute to the unmarked one of the plurality of vertices; andwhen the graphical attribute is not allocated to the indirectly connected one of the plurality of vertices: determining if a new graphic attribute is available for allocation to the unmarked one of the plurality of vertices;in response to the new graphic attribute being available, marking the unmarked one of the plurality of vertices with the new graphic attribute;in response to the new graphic attribute being unavailable, marking the unmarked one of the plurality of vertices with an existing graphic attribute of another of the plurality of vertices;returning to the selecting until there are no unmarked vertices in the plurality of vertices, upgrading a plurality of the switches in a plurality of stages, each of the plurality of stages including a grouping of one or more of the plurality of the switches having a same graphical attribute in a same stage, the grouping of the one or more of the plurality of the switches upgraded in parallel during the same stage, the grouping of the one or more of the plurality of the switches servicing a same tenant.
11. The system of claim 10, wherein the plurality of stages are prioritized based on estimated disruption levels.
12. The system of claim 11, wherein each of the plurality of the switches are assigned scores calculated based on the estimated disruption levels.
13. The system of claim 12, wherein the plurality of the switches are associated with attributes based on the scores.
14. The system of claim 10, wherein, each of the switches servicing a same tenant are represented by vertices having a different graphical attribute to cause each of the switches servicing the same tenant to be upgraded during different, and each of the switches servicing different tenants are represented by vertices having a same graphical attribute to cause each of the switches servicing the different tenants to be upgraded during a same stage.
15. A non-transitory computer-readable storage medium having stored therein instructions which, when executed by a processor, cause the processor to perform operations comprising: defining a distribution of at least a portion of switches in a network via a graph, the graph configured to display the portion of switches via a plurality of vertices;determining a weight of each of the vertices, selecting, based on weight, an unmarked one of the plurality of vertices having a maximum weight of remaining unmarked vertices;determining whether a graphical attribute is allocated to an indirectly connected one of the plurality of vertices to the unmarked one of the plurality of vertices;when the graphical attribute is allocated to the indirectly connected one of the plurality of vertices, applying the graphical attribute to the unmarked one of the plurality of vertices; andwhen the graphical attribute is not allocated to the indirectly connected one of the plurality of vertices:determining if a new graphic attribute is available for allocation to the unmarked one of the plurality of vertices;in response to the new graphic attribute being available, marking the unmarked one of the plurality of vertices with the new graphic attribute;in response to the new graphic attribute being unavailable, marking the unmarked one of the plurality of vertices with an existing graphic attribute of another of the plurality of vertices;returning to the selecting until there are no unmarked vertices in the plurality of vertices;initiate an upgrade of a plurality of the switches in a plurality of stages, each of the plurality of stages including a grouping of one or more of the plurality of the switches having a same graphical attribute in a same stage, the grouping of the one or more of the plurality of the switches upgraded in parallel during the same stage, the grouping of the one or more of the plurality of the switches servicing a same tenant.
16. The non-transitory computer-readable storage medium of claim 15, wherein, the network comprises a multi-tenant network, and the switches include at least one of a top-of-rack switch, a leaf switch, an aggregation switch, an edge device, a tunnel endpoint, or a virtual switch.
17. The non-transitory computer-readable storage medium of claim 15, wherein the graphical attribute includes at least one of a color or a shading, and at least one of a line weight, a shape, a size, a symbol, a number, a character, or a format.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/477,812 filed on Sep. 4, 2014, which claims priority to U.S. Provisional Patent Application Ser. No. 61/900,359 filed Nov. 5, 2013, the contents of which are incorporated by reference in their entireties.

US Referenced Citations (336)

Number	Name	Date	Kind
4298770	Nishihara et al.	Nov 1981	A
4636919	Itakura et al.	Jan 1987	A
4700016	Hitchcock et al.	Oct 1987	A
5115431	Williams et al.	May 1992	A
5859835	Varma et al.	Jan 1999	A
5926458	Yin et al.	Jul 1999	A
6252876	Brueckheimer et al.	Jun 2001	B1
6389031	Chao et al.	May 2002	B1
6456624	Eccles et al.	Sep 2002	B1
6650640	Muller et al.	Nov 2003	B1
6677831	Cheng et al.	Jan 2004	B1
6714553	Poole et al.	Mar 2004	B1
6757897	Shi et al.	Jun 2004	B1
6876952	Kappler et al.	Apr 2005	B1
6907039	Shen	Jun 2005	B2
6941649	Goergen	Sep 2005	B2
6952421	Slater	Oct 2005	B1
6954463	Ma et al.	Oct 2005	B1
6996099	Kadambi et al.	Feb 2006	B1
7068667	Foster et al.	Jun 2006	B2
7152117	Stapp et al.	Dec 2006	B1
7177946	Kaluve et al.	Feb 2007	B1
7372857	Kappler et al.	May 2008	B1
7411915	Spain et al.	Aug 2008	B1
7426604	Rygh et al.	Sep 2008	B1
7516211	Gourlay et al.	Apr 2009	B1
7539131	Shen	May 2009	B2
7580409	Swenson et al.	Aug 2009	B1
7630368	Tripathi et al.	Dec 2009	B2
7729296	Choudhary	Jun 2010	B1
7826400	Sakauchi	Nov 2010	B2
7826469	Li et al.	Nov 2010	B1
7848340	Sakauchi et al.	Dec 2010	B2
8233384	Osterhout et al.	Jul 2012	B2
8302301	Lau	Nov 2012	B2
8325459	Mutnury et al.	Dec 2012	B2
8339973	Pichumani et al.	Dec 2012	B1
8378223	Shiue et al.	Feb 2013	B1
8442063	Zhou et al.	May 2013	B1
8514712	Aswadhati	Aug 2013	B1
8687629	Kompella et al.	Apr 2014	B1
8782632	Chigurapati	Jul 2014	B1
8854972	Li	Oct 2014	B1
8868766	Theimer et al.	Oct 2014	B1
8908691	Biswas et al.	Dec 2014	B2
9036481	White	May 2015	B1
9106508	Banavalikar et al.	Aug 2015	B2
9178715	Jain et al.	Nov 2015	B2
9197551	DeCusatis et al.	Nov 2015	B2
9203188	Siechen et al.	Dec 2015	B1
9245626	Fingerhut et al.	Jan 2016	B2
9258195	Pendleton et al.	Feb 2016	B1
9325524	Banavalikar et al.	Apr 2016	B2
9374294	Pani	Jun 2016	B1
9402470	Shen et al.	Aug 2016	B2
9407501	Yadav et al.	Aug 2016	B2
9426060	Dixon et al.	Aug 2016	B2
9433081	Xiong et al.	Aug 2016	B1
9444634	Pani	Sep 2016	B2
9502111	Dharmapurikar et al.	Nov 2016	B2
9509092	Shen et al.	Nov 2016	B2
9544185	Yadav et al.	Jan 2017	B1
9544224	Chu et al.	Jan 2017	B2
9590914	Attar et al.	Mar 2017	B2
9627063	Dharmapurikar et al.	Apr 2017	B2
9634846	Pani	Apr 2017	B2
9635937	Shen et al.	May 2017	B2
9654300	Pani	May 2017	B2
9654385	Chu et al.	May 2017	B2
9654409	Yadav et al.	May 2017	B2
9655232	Saxena et al.	May 2017	B2
9667431	Pani	May 2017	B2
9667551	Edsall et al.	May 2017	B2
9674086	Ma et al.	Jun 2017	B2
9686180	Chu et al.	Jun 2017	B2
9698994	Pani	Jul 2017	B2
9716665	Attar et al.	Jul 2017	B2
9742673	Banerjee et al.	Aug 2017	B2
9755965	Yadav et al.	Sep 2017	B1
9769078	Attar et al.	Sep 2017	B2
9876715	Edsall et al.	Jan 2018	B2
20020126671	Ellis et al.	Sep 2002	A1
20020136268	Gan et al.	Sep 2002	A1
20020146026	Unitt et al.	Oct 2002	A1
20030035385	Walsh et al.	Feb 2003	A1
20030058837	Denney et al.	Mar 2003	A1
20030058860	Kunze et al.	Mar 2003	A1
20030067912	Mead et al.	Apr 2003	A1
20030067924	Choe et al.	Apr 2003	A1
20030097461	Barham et al.	May 2003	A1
20030115319	Dawson et al.	Jun 2003	A1
20030120884	Koob et al.	Jun 2003	A1
20030137940	Schwartz et al.	Jul 2003	A1
20030142629	Krishnamurthi et al.	Jul 2003	A1
20030174650	Shankar et al.	Sep 2003	A1
20030223376	Elliott et al.	Dec 2003	A1
20030231646	Chandra et al.	Dec 2003	A1
20040031030	Kidder et al.	Feb 2004	A1
20040062259	Jeffries et al.	Apr 2004	A1
20040073715	Folkes et al.	Apr 2004	A1
20040100901	Bellows	May 2004	A1
20040103310	Sobel et al.	May 2004	A1
20040111507	Villado et al.	Jun 2004	A1
20040160956	Hardy et al.	Aug 2004	A1
20040249960	Hardy et al.	Dec 2004	A1
20050007961	Scott et al.	Jan 2005	A1
20050010685	Ramnath et al.	Jan 2005	A1
20050013280	Buddhikot et al.	Jan 2005	A1
20050073958	Atlas et al.	Apr 2005	A1
20050083835	Prairie et al.	Apr 2005	A1
20050091239	Ward et al.	Apr 2005	A1
20050117593	Shand	Jun 2005	A1
20050175020	Park et al.	Aug 2005	A1
20050201375	Komatsu et al.	Sep 2005	A1
20050207410	Adhikari et al.	Sep 2005	A1
20050213504	Enomoto et al.	Sep 2005	A1
20050232227	Jorgenson et al.	Oct 2005	A1
20050240745	Iyer et al.	Oct 2005	A1
20060013143	Yasuie et al.	Jan 2006	A1
20060028285	Jang et al.	Feb 2006	A1
20060031643	Figueira	Feb 2006	A1
20060039364	Wright	Feb 2006	A1
20060072461	Luong et al.	Apr 2006	A1
20060075093	Frattura et al.	Apr 2006	A1
20060083179	Mitchell	Apr 2006	A1
20060083256	Mitchell	Apr 2006	A1
20060182036	Sasagawa et al.	Aug 2006	A1
20060193332	Qian et al.	Aug 2006	A1
20060198315	Sasagawa et al.	Sep 2006	A1
20060209688	Tsuge et al.	Sep 2006	A1
20060209702	Schmitt et al.	Sep 2006	A1
20060215572	Padhye et al.	Sep 2006	A1
20060215623	Lin et al.	Sep 2006	A1
20060221835	Sweeney	Oct 2006	A1
20060221950	Heer	Oct 2006	A1
20060227790	Yeung et al.	Oct 2006	A1
20060239204	Bordonaro et al.	Oct 2006	A1
20060250982	Yuan et al.	Nov 2006	A1
20060268742	Chu et al.	Nov 2006	A1
20060274647	Wang et al.	Dec 2006	A1
20060274657	Olgaard et al.	Dec 2006	A1
20060280179	Meier	Dec 2006	A1
20060285500	Booth, III et al.	Dec 2006	A1
20070016590	Appleby et al.	Jan 2007	A1
20070025241	Nadeau et al.	Feb 2007	A1
20070047463	Jarvis et al.	Mar 2007	A1
20070053303	Kryuchkov	Mar 2007	A1
20070058557	Cuffaro et al.	Mar 2007	A1
20070061451	Villado et al.	Mar 2007	A1
20070076605	Cidon et al.	Apr 2007	A1
20070091795	Bonaventure et al.	Apr 2007	A1
20070097872	Chiu	May 2007	A1
20070159987	Khan et al.	Jul 2007	A1
20070160073	Toumura et al.	Jul 2007	A1
20070165515	Vasseur	Jul 2007	A1
20070171814	Florit et al.	Jul 2007	A1
20070177525	Wijnands et al.	Aug 2007	A1
20070183337	Cashman et al.	Aug 2007	A1
20070211625	Liu et al.	Sep 2007	A1
20070217415	Wijnands et al.	Sep 2007	A1
20070223372	Haalen et al.	Sep 2007	A1
20070233847	Aldereguia et al.	Oct 2007	A1
20070258382	Foll et al.	Nov 2007	A1
20070258383	Wada	Nov 2007	A1
20070263587	Savoor	Nov 2007	A1
20070274229	Scholl et al.	Nov 2007	A1
20070280264	Milton et al.	Dec 2007	A1
20080031130	Raj et al.	Feb 2008	A1
20080031146	Kwak et al.	Feb 2008	A1
20080031247	Tahara et al.	Feb 2008	A1
20080092213	Wei et al.	Apr 2008	A1
20080123559	Haviv et al.	May 2008	A1
20080147830	Ridgill et al.	Jun 2008	A1
20080151821	Cho	Jun 2008	A1
20080151863	Lawrence et al.	Jun 2008	A1
20080177896	Quinn et al.	Jul 2008	A1
20080212496	Zou	Sep 2008	A1
20080219173	Yoshida et al.	Sep 2008	A1
20080225853	Melman et al.	Sep 2008	A1
20080259809	Stephan et al.	Oct 2008	A1
20080259925	Droms et al.	Oct 2008	A1
20080310421	Teisberg et al.	Dec 2008	A1
20090052332	Fukuyama et al.	Feb 2009	A1
20090067322	Shand et al.	Mar 2009	A1
20090094357	Keohane et al.	Apr 2009	A1
20090103566	Kloth et al.	Apr 2009	A1
20090116402	Yamasaki	May 2009	A1
20090122805	Epps et al.	May 2009	A1
20090161567	Jayawardena et al.	Jun 2009	A1
20090188711	Ahmad	Jul 2009	A1
20090193103	Small et al.	Jul 2009	A1
20090225671	Arbel et al.	Sep 2009	A1
20090232011	Li et al.	Sep 2009	A1
20090238196	Ukita et al.	Sep 2009	A1
20090268614	Tay et al.	Oct 2009	A1
20090271508	Sommers et al.	Oct 2009	A1
20100020719	Chu et al.	Jan 2010	A1
20100020726	Chu et al.	Jan 2010	A1
20100128619	Shigei	May 2010	A1
20100150155	Napierala	Jun 2010	A1
20100161787	Jones	Jun 2010	A1
20100189080	Hu et al.	Jul 2010	A1
20100191813	Gandhewar et al.	Jul 2010	A1
20100191839	Gandhewar et al.	Jul 2010	A1
20100223655	Zheng	Sep 2010	A1
20100260197	Martin et al.	Oct 2010	A1
20100287227	Goel et al.	Nov 2010	A1
20100299553	Cen	Nov 2010	A1
20100312875	Wilerson et al.	Dec 2010	A1
20110022725	Farkas	Jan 2011	A1
20110110241	Atkinson et al.	May 2011	A1
20110110587	Banner	May 2011	A1
20110138310	Gomez et al.	Jun 2011	A1
20110158248	Vorunganti et al.	Jun 2011	A1
20110170426	Kompella et al.	Jul 2011	A1
20110199891	Chen	Aug 2011	A1
20110199941	Ouellette et al.	Aug 2011	A1
20110203834	Yoneya et al.	Aug 2011	A1
20110228795	Agrawal et al.	Sep 2011	A1
20110239189	Attalla	Sep 2011	A1
20110243136	Raman et al.	Oct 2011	A1
20110249682	Kean et al.	Oct 2011	A1
20110268118	Schlansker et al.	Nov 2011	A1
20110273987	Schlansker et al.	Nov 2011	A1
20110280572	Vobbilisetty et al.	Nov 2011	A1
20110286447	Liu	Nov 2011	A1
20110292886	Lee	Dec 2011	A1
20110299406	Vobbilisetty et al.	Dec 2011	A1
20110310738	Lee et al.	Dec 2011	A1
20110321031	Dournov	Dec 2011	A1
20120007688	Zhou et al.	Jan 2012	A1
20120030150	McAuley et al.	Feb 2012	A1
20120030666	Laicher et al.	Feb 2012	A1
20120057505	Xue	Mar 2012	A1
20120063318	Boddu et al.	Mar 2012	A1
20120102114	Dunn et al.	Apr 2012	A1
20120147752	Ashwood-Smith et al.	Jun 2012	A1
20120163396	Cheng et al.	Jun 2012	A1
20120167013	Kaiser et al.	Jun 2012	A1
20120195233	Wang et al.	Aug 2012	A1
20120275304	Patel et al.	Nov 2012	A1
20120281697	Huang	Nov 2012	A1
20120300669	Zahavi	Nov 2012	A1
20120300787	Korger	Nov 2012	A1
20120314581	Rajamanickam et al.	Dec 2012	A1
20130055155	Wong et al.	Feb 2013	A1
20130064246	Dharmapurikar et al.	Mar 2013	A1
20130090014	Champion	Apr 2013	A1
20130097335	Jiang et al.	Apr 2013	A1
20130124708	Lee et al.	May 2013	A1
20130151681	Dournov et al.	Jun 2013	A1
20130182712	Aguayo et al.	Jul 2013	A1
20130208624	Ashwood-Smith	Aug 2013	A1
20130223276	Padgett	Aug 2013	A1
20130227108	Dunbar et al.	Aug 2013	A1
20130227689	Pietrowicz et al.	Aug 2013	A1
20130250779	Meloche et al.	Sep 2013	A1
20130250951	Koganti	Sep 2013	A1
20130276129	Nelson et al.	Oct 2013	A1
20130311663	Kamath et al.	Nov 2013	A1
20130311991	Li et al.	Nov 2013	A1
20130322258	Nedeltchev et al.	Dec 2013	A1
20130322446	Biswas et al.	Dec 2013	A1
20130322453	Allan	Dec 2013	A1
20130329605	Nakil et al.	Dec 2013	A1
20130332399	Reddy et al.	Dec 2013	A1
20130332577	Nakil et al.	Dec 2013	A1
20130332602	Nakil et al.	Dec 2013	A1
20140006549	Narayanaswamy et al.	Jan 2014	A1
20140016501	Kamath et al.	Jan 2014	A1
20140043535	Motoyama et al.	Feb 2014	A1
20140043972	Li et al.	Feb 2014	A1
20140047264	Wang et al.	Feb 2014	A1
20140050223	Foo et al.	Feb 2014	A1
20140056298	Vobbilisetty et al.	Feb 2014	A1
20140064281	Basso et al.	Mar 2014	A1
20140068750	Tjahjono et al.	Mar 2014	A1
20140086097	Qu et al.	Mar 2014	A1
20140086253	Yong et al.	Mar 2014	A1
20140105039	Mcdysan	Apr 2014	A1
20140105062	Mcdysan et al.	Apr 2014	A1
20140105216	Mcdysan	Apr 2014	A1
20140108489	Glines et al.	Apr 2014	A1
20140146817	Zhang	May 2014	A1
20140146824	Angst et al.	May 2014	A1
20140149819	Lu et al.	May 2014	A1
20140185348	Vattikonda et al.	Jul 2014	A1
20140185349	Terzioglu et al.	Jul 2014	A1
20140201375	Beereddy et al.	Jul 2014	A1
20140219275	Allan et al.	Aug 2014	A1
20140241353	Zhang et al.	Aug 2014	A1
20140244779	Roitshtein et al.	Aug 2014	A1
20140269705	DeCusatis et al.	Sep 2014	A1
20140269712	Kidambi	Sep 2014	A1
20140307744	Dunbar et al.	Oct 2014	A1
20140321277	Lynn, Jr. et al.	Oct 2014	A1
20140328206	Chan et al.	Nov 2014	A1
20140334295	Guichard et al.	Nov 2014	A1
20140341029	Allan et al.	Nov 2014	A1
20140372582	Ghanwani et al.	Dec 2014	A1
20150009992	Zhang	Jan 2015	A1
20150010001	Duda et al.	Jan 2015	A1
20150016277	Smith et al.	Jan 2015	A1
20150052298	Brand et al.	Feb 2015	A1
20150092551	Moisand et al.	Apr 2015	A1
20150092593	Kompella	Apr 2015	A1
20150113143	Stuart et al.	Apr 2015	A1
20150124611	Attar et al.	May 2015	A1
20150124629	Pani	May 2015	A1
20150124631	Edsall et al.	May 2015	A1
20150124633	Banerjee et al.	May 2015	A1
20150124640	Chu et al.	May 2015	A1
20150124644	Pani	May 2015	A1
20150124806	Banerjee et al.	May 2015	A1
20150124817	Merchant et al.	May 2015	A1
20150124821	Chu et al.	May 2015	A1
20150124823	Pani et al.	May 2015	A1
20150124824	Edsall et al.	May 2015	A1
20150124825	Dharmapurikar et al.	May 2015	A1
20150124826	Edsall et al.	May 2015	A1
20150124833	Ma et al.	May 2015	A1
20150127797	Attar et al.	May 2015	A1
20150188771	Allan et al.	Jul 2015	A1
20150236900	Chung	Aug 2015	A1
20150378712	Cameron et al.	Dec 2015	A1
20150378969	Powell et al.	Dec 2015	A1
20160036697	DeCusatis et al.	Feb 2016	A1
20160119204	Murasato	Apr 2016	A1
20160315811	Yadav et al.	Oct 2016	A1
20170085469	Chu et al.	Mar 2017	A1
20170207961	Saxena et al.	Jul 2017	A1
20170214619	Chu et al.	Jul 2017	A1
20170237651	Pani	Aug 2017	A1
20170237678	Ma et al.	Aug 2017	A1
20170250912	Chu et al.	Aug 2017	A1
20170346748	Attar et al.	Nov 2017	A1

Foreign Referenced Citations (2)

Number	Date	Country
WO 2003067799	Aug 2003	WO
2014071996	May 2014	WO

Non-Patent Literature Citations (16)

Entry
New methods to color the vertices of a graph, by Brelaz, published Apr. 1979 (Year: 1979).
Torkestani, J. A., & Meybodi, M. R. (2012). A new vertex coloring algorithm based on variable action-set learning automata. Computing and Informatics, 29(3), 447-466. (Year: 2012).
Aslam, Faisal, et al., “NPP: A Facility Based Computation Framework for Restoration Routing Using Aggregate Link Usage Information,” Proceedings of QoS-IP: quality of service in multiservice IP network, Feb. 2005, pp. 150-163.
Author Unknown, “Subset—Wikipedia, the free encyclopedia,” Dec. 25, 2014, pp. 1-3.
Chandy, K. Mani, et al., “Distribution Snapshots: Determining Global States of Distributed Systems,” ACM Transaction on Computer Systems, Feb. 1985, vol. 3, No. 1, pp. 63-75.
Khasnabish, Bhumip, et al., “Mobility and Interconnection of Virtual Machines and Virtual Network Elements; draft-khasnabish-vmmi-problems-03.txt,” Network Working Group, Dec. 30, 2012, pp. 1-29.
Kodialam, Murali, et. al, “Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels using Aggregated Link Usage Information,” Proceedings of IEEE INFOCOM, 2001, vol. 1, pp. 376-385.
Li, Li, et. al, “Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks,” IEEE Journal on Selected Areas in Communications, Feb. 7, 2005, vol. 23, No. 2, pp. 1-11.
Mahalingam, M., et al. “VXLAN: A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks,” VXLAN, Internet Engineering Task Force, Internet Draft, located at https://tools.ietf.org/html/draft-mahalingam-dutt-dcops-vxlan-06, Oct. 2013, pp. 1-24.
Moncaster, T., et al., “The Need for Congestion Exposure in the Internet”, Oct. 26, 2009, Internet—Draft, pp. 1-22.
Narten, T., et al., “Problem Statement: Overlays For Network Virtualization,” draft-ietf-nvo3-overlay-problem-statement-04, Internet Engineering Task Force, Jul. 31, 2013, pp. 1-24.
Pan, P., et. al, “Fast Reroute Extensions to RSVP-TE for LSP Tunnels,” RFC-4090. May 2005, pp. 1-38.
Raza, Saqib, et al., “Online Routing of Bandwidth Guaranteed Paths with Local Restoration using Optimized Aggregate Usage Information,” IEEE-ICC '05 Communications, May 2005, vol. 1, 8 pages.
Sinha, Shan, et al., “Harnessing TCP's Burstiness with Flowlet Switching,” Nov. 2004, 6 pages.
Whitaker et al., “Forwarding Without Loops in Icarus,” IEEE OPENARCH 2002, pp. 63-75.
Zhang, Junjie, et al., “Optimizing Network Performance using Weighted Multipath Routing,” Aug. 27, 2012, 7 pages.

Related Publications (1)

	Number	Date	Country
	20200293180 A1	Sep 2020	US

Provisional Applications (1)

	Number	Date	Country
	61900359	Nov 2013	US

Continuations (1)

	Number	Date	Country
Parent	14477812	Sep 2014	US
Child	16833305		US

Stage upgrade of image versions on devices in a cluster

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Term Extension

Abstract