The present technology pertains to computer networking management, and more specifically pertains to the Spanning Tree Protocol (STP) in a switched network.
Spanning Tree Protocol (STP) is a link management protocol that can provide path redundancy while preventing loops in a network. For a conventional network, such as an Ethernet network, only one active path can exist between any two nodes for the network to function properly. If a loop were to form in the network, the amount of traffic that could be passed between infrastructure devices (e.g., switches, bridges, relays, among others) can quickly utilize the entire bandwidth available within each of the devices affected.
STP is compliant with IEEE 802.1D, entitled “Media Access Control (MAC) Bridges,” and which is incorporated herein by reference. STP can use a Spanning-Tree Algorithm (STA) to calculate an optimal loop-free path throughout a switched network by defining a tree with a root bridge and a loop-free path from the root to all infrastructure devices in the network. STP can force redundant data paths into a standby (blocked) state to create redundancy but not loops. If a network segment in the spanning tree fails and a redundant path exists, the STA can recalculate the spanning tree topology and activate the standby path. Infrastructure devices send and receive STP frames, called bridge protocol data units (BDPUs), at regular intervals. The devices do not forward these frames, but can use the frames to construct a loop-free path.
When two interfaces on a bridge are part of a loop, the STP port priority and path cost settings can determine which interface is put in the forwarding state and which is put in the blocking state. The port priority value can represent the location of an interface in the network topology and how well it is located to pass traffic. The STP path cost value can represent media speed.
The amount of computing resources utilized by STP, such as CPU, memory, and input/output (I/O), can be generally proportional to the product of the number of ports and the number of virtual LANs (VLANs) enabled on each port. With the proliferation of high port density switches (e.g., layer 2 (L2) and layer 3 (L3) switches) and Virtual Ethernet Port Aggregator (VEPA) devices that enable each switch front panel port to be virtualized into many more customer usable physical ports, new systems and approaches are required to optimize STP to keep a network operating system scalable and efficient.
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:
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.
Aspects of the technology encompass methods for automatically configuring a network infrastructure device, based on discovered system capabilities of a network peer. In some embodiments, a method of the technology can include steps for receiving system capabilities information from a network peer of the network infrastructure device, determining a device type of the network-peer based on the system capabilities information, and automatically configuring a port of the network infrastructure device based on the determined device type of the network peer.
Disclosed are system, methods and non-transitory computer-readable storage media for optimizing the Spanning Tree Protocol (STP) in a switched network. STP port type can include “edge” or “network” ports. Edge ports are connected directly to hosts while network ports are connected to other network infrastructure devices, such as bridges, switches, relays, components thereof, among others. As edge ports are connected to host devices, edge ports may not need the full STP state machine required by network ports. For example, edge ports can be placed in a forwarding state without running through the entire STP state machine. In addition, the periodic BDPUs transmitted during operation of STP may not need to be sent to edge ports, which can further reduce resource utilization on the system. In various embodiments, STP port type for a network infrastructure device can be controlled based on the dynamically discovered neighbor device type of the directly connected (network) peer of the device using the Link Level Discovery Protocol (LLDP). LLDP can provide system capabilities of a link level peer to identify whether the link level peer is a host or a network infrastructure device. In various embodiments, the exchange of system capabilities can serve as a trigger to configure an STP port as a network port for ports connected to network infrastructure devices or edge ports for ports directly connected to host devices.
The amount of computing resources utilized by STP, such as CPU, memory, and input/output (I/O), can be generally proportional to the product of the number of ports and the number of virtual LANs (VLANs) enabled on each port. With the proliferation of high port density switches (e.g., layer 2 (L2) and layer 3 (L3) switches) and Virtual Ethernet Port Aggregator (VEPA) devices that enable each switch front panel port to be virtualized into many more customer usable physical ports, new systems and approaches are required to optimize STP to keep a network operating system scalable and efficient. In addition, the need to properly configure those ports is also increasing. The disclosed technology addresses the need in the art for reducing the overhead associated with utilizing STP. By optimizing the STP process, ports can be dynamically set by discovering the directly coupled neighboring device and controlling the setting of the STP port type which can reduce resource utilization on the system.
Referring to
STP can run on network infrastructure devices that are 802.1D-compliant. STP can be implemented on such devices in order to prevent loops in the network. STP can be used in situations where redundant links, but not loops, are desirable. Redundant links can be important as backups in the case of a failover in a network. A failure of a primary activates the backup links so that users can continue to utilize the network. Without STP operating on the bridges and switches, such a failure can result in a loop.
Referring to
Referring to
In order to provide desired path redundancy, as well as to avoid a loop condition, STP can define a tree that spans all the switches in an extended network. STP can force certain redundant data paths into a standby (blocked) state and leave other paths in a forwarding state. If a link in the forwarding state becomes unavailable, STP can reconfigure the network and reroutes data paths through the activation of the appropriate standby path. In STP, the switches in a network can elect a root bridge that becomes the focal point in the network. Other decisions in the network, such as which port to block and which port to put in forwarding mode, can also be made from the perspective of this root bridge. A switched environment, which can be different from a bridge environment, may deal with multiple VLANs. When a root bridge is implemented in a switching network, the root bridge can be referred to as the root switch. Each VLAN can be required to have its own root bridge because each VLAN can be a separate broadcast domain. The roots for the different VLANs can all reside in a single switch or in various switches.
The switches in the network can exchange information for use in the root switch selection and for subsequent configuration of the network. Bridge protocol data units (BPDUs) can carry this information. A switch can compare the parameters in the BPDU that the switch sends to a neighbor with the parameters in the BPDU that the switch receives from the neighbor. When the switches first come up, the switches can start the root switch selection process. Each switch can transmit a BPDU to the directly connected switch on a per-VLAN basis. As the BPDU goes out through the network, each switch can compare the BPDU that the switch sends to the BPDU that the switch receives from the neighbors. The switches can then agree on which switch is the root switch. The switch with the lowest bridge ID in the network wins this election process. In other embodiments, other election processes can be employed, e.g., highest bridge ID. After identifying or electing the root switch, the switches generally adhere to these rules:
STP Rule 1—All ports of the root switch are set to forwarding mode. Next, each switch determines the best path to get to the root. The switches determine this path by a comparison of the information in all the BPDUs that the switches receive on all ports. The switch can use the port with the least amount of information in the BPDU in order to get to the root switch. The port with the least amount of information in the BPDU can be the root port. After a switch determines the root port, the switch can proceed to rule 2.
STP Rule 2—The root port is set to forwarding mode. In addition, the switches on each LAN segment can communicate with each other to determine which switch is best to use in order to move data from that segment to the root bridge. This switch can be called the designated switch.
STP Rule 3—In a single LAN segment, the port of the designated switch that connects to that LAN segment is placed in forwarding mode.
STP Rule 4—All the other ports in all the switches (VLAN-specific) are placed in blocking mode. The rule only applies to ports that connect to other bridges or switches. STP does not affect ports that connect to workstations or PCs. These ports can remain forwarded.
STP can calculate the path cost based on the media speed (bandwidth) of the links between switches and the port cost of each port forwarding frame. Spanning tree selects the root port based on the path cost. The port with the lowest path cost to the root bridge can become the root port. The root port is always in the forwarding state. If the speed/duplex of the port is changed, the STP can recalculate the path cost automatically. A change in the path cost can change the spanning tree topology.
As mentioned, data centers are increasingly deploying high port density L2 and L3 switches in their networking infrastructure. Further, many data centers are integrating more and more Virtual Ethernet Port Aggregator (VEPA) devices into their networks. VEPA devices, which enable each switch front panel port to be virtualized, can add many more customer usable physical ports to a system. Consequently, computing resource utilization (e.g., CPU, memory, I/O) for a network infrastructure device will rise proportionally.
One significant contributor to CPU, memory, and I/O utilization on network infrastructure devices can be the processing required by STP. With STP, a network infrastructure device can be required to maintain protocol state information about every enabled VLAN on every port on the device. For example, the device may need to maintain such information to determine per VLAN and/or private VLAN (PVLAN) count. Hence, reducing overhead for STP wherever possible without affecting the operation of the protocol can be beneficial to both network operating system software stability and scalability.
One approach for optimizing STP operation is to control the STP type of the port. STP port type can include edge port or network port. Edge ports can be connected directly to hosts. Network ports can be connected to network infrastructure devices. Edge ports may not need the full STP state machine required by network ports. For example, each host-facing port in a network infrastructure device with a large number of edge ports can be set to STP edge mode, wherein the protocol operation can be pruned back and the port can be placed in a forwarding state without running through the entire protocol state machine. The periodic BPDUs transmitted during operation of STP may not be sent on edge ports, further reducing resource utilization on the system. In other embodiments, the periodic BPDUs transmitted during operation of STP may be extended: increasing the time between transmissions.
In certain conventional approaches, the ports of network infrastructure devices can be configured manually by a network administrator. However, with the deployment of high port density network infrastructure devices and VEPA appliances in data centers, the number of ports in the data centers has risen significantly. To the extent manual configuration of STP port type is feasible; manually configuring the port type can be inefficient and error-prone. Another conventional approach assumes that ports residing on VEPA appliances are likely to be connected to end hosts, and all ports on such devices can be configured as edge ports. In certain situations, however, ports on VEPA appliances can be connected to networking infrastructure devices such that a putative edge port may actually be attached to a device that is not an end host. This can cause loops in the network and result in network instability.
Systems and approaches in accordance with various embodiments may overcome one or more of the aforementioned and other deficiencies experienced in conventional approaches for operating STP by employing a mechanism wherein the STP port type (e.g., edge or network) can be dynamically configured based on a neighbor discovery trigger. In various embodiments, network infrastructure devices are configured to run a protocol for discovering network device capabilities, such as Link Level Discovery Protocol (LLDP) or Cisco Discovery Protocol (CDP), for example. For example, LLDP can be used by the network infrastructure devices to exchange system capabilities (e.g., System Capabilities TLV type is 7 in LLDP) to identify whether the link level peer is a host device or a network device. The system capability TLV exchange can serve as a trigger to configure the STP port as a network port for a port connected to a switch, bridge, relay, components thereof, among other network infrastructure devices (e.g., LLDP capability values 3, 9, 10, and/or 11), or an edge port for a port connected to an end host (e.g., LLDP capability value 8).
LLDP is standardized as IEEE 802.1AB, entitled “Station and Media Access Control Connectivity Discovery”, and which is incorporated herein by reference. LLDP is a link layer protocol that allows an IEEE 802 LAN station to report the capabilities and current status of the system associated with a MAC service access point (MSAP). The MSAP can provide the MAC service to a logical link control (LLC) entity, and that LLC entity can provide a link service access point (LSAP) to an LLDP agent that transmits and receives information to and from the LLDP agents of other stations attached to the same LAN. The information can be distributed and received in each LLDP data unit (LLDPDU) and can be stored in one or more Management Information Bases (MIBs).
The information fields in each LLDP frame are contained in an LLDPDU as a sequence of variable length information elements, that each include “type,” “length,” and “value” fields (known as TLVs), where type identifies what kind of information is being sent, length indicates the length of the information string in octets, and value is the actual information that needs to be sent (for example, a binary bit map or an alphanumeric string that can contain one or more fields).
Each LLDPDU can contain four mandatory TLVs, including a chassis ID TLV, port ID TLV, time to live (TTL) TLV, and end of LLDPU TLV. An LLDPU can also contain zero or more optional TLVs, as allowed by the maximum size of the LLDPU, and as selected by network management.
A non-zero value in the TTL field of the TTL TLV can tell the receiving LLDP agent how long all information pertaining to this LLDPDU's MSAP identifier is valid so that all the associated information can later be automatically discarded by the receiving LLDP agent if the sender fails to update it in a timely manner. A zero value can indicate that any information pertaining to this LLDPDU's MSAP identifier is to be discarded immediately. The end of LLDPDU TLV can mark the end of the LLDPDU.
The maximum length of the LLDPDU is the maximum information field length allowed by the particular transmission rate and protocol. In IEEE 802.3 MACs, for example, the maximum LLDPDU length is the maximum data field length for the basic, untagged MAC frame (e.g., 1500 octets).
As mentioned, TLVs are generally grouped as mandatory TLVs and optional TLVs. Mandatory TLVs can be considered to be basic to the management of network stations and that are a required capability of all LLDP implementations. Each TLV in this category can be identified by a unique TLV type value that indicates the particular kind of information contained in the TLV. Optional TLVs can include organizationally specific extension sets of TLVs that are defined by standards groups such as IEEE 802.1 and IEEE 802.3 and others to enhance management of network stations that are operating with particular media and/or protocols. TLVs in this category can be identified by a common TLV type value that indicates the TLV as belonging to the set of organizationally specific TLVs. Each organization can be identified by an organizationally unique identifier (OUI). Organizationally specific TLV subtype values can indicate the kind of information contained in the TLV.
The TLV information string length field can contain the length of the information string, in octets. The TLV information string can be fixed or variable length, and can include one or more information fields with associated subtype identifiers and field length Designators. The information string can also contain either binary or alpha-numeric information that is instance specific for the particular TLV type and/or subtype.
The System Capabilities TLV, TLV type 7, can be an optional TLV that identifies the primary function(s) of the system and whether or not these primary functions are enabled.
The system capabilities field contains a bit-map of the capabilities that define the primary function(s) of the system. The bit positions for each function and the associated Management Information Base (MIB) or standard that may be supported are listed in Table 2.
A binary one in the associated bit indicates the existence of that capability. Individual systems may indicate more than one implemented functional capability (for example, both a bridge and router capability). As mentioned, the system capability TLV exchange can serve as a trigger to configure the STP port type as a network port for bridges, switches, relays, among other infrastructure devices (e.g., LLDP capability values 3, 9, 10, and/or 11), or an edge port for end hosts (e.g., LLDP capability value 8).
In various embodiments, the LLDP operation can be enabled on all devices of a network. Further, LLDP running on the devices of the network can be configured to support the System Capabilities TLV since the capability TLV exchange is optional.
While STP port type setting is one of the parameters available to control STP behavior on a port, further optimization can also be implemented. For example, STP implementation for the Cisco® Nexus 2000 HIF significantly reduces the number of BPDU packets that are sent on a link after the port transitions to forwarding. That is, once the configuration trigger is available, more optimizations can be done on the basis of the capabilities of the link level peer. In addition, a STP port that is placed in forwarding mode, can be placed in portfast mode which causes the port to enter the forwarding state almost immediately. By using portfast mode, the port can reduce the time of listening and learning states which can allow a server or workstation to come online faster.
Moreover, when setting a port in a blocking state, the port can be set to block all traffic. However, in some embodiments, the port can be set to a blocking mode with one or more exemptions for certain types of traffic. For example, a port can be set to block all traffic but allow STP traffic and/or LLDP traffic. This way, the port can become aware if a change is made in the network such that the port should be set from one port type to another.
In various embodiments, every type of port is supported rather than just ports hosted on a VEPA device. In some embodiments, no assumption is made about the attached device. In this manner, loops can be prevented so long as the LLDP stack implementing system capability TLV exchange is enabled on all data center devices.
Referring to
The interfaces 704 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 network device 700. 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 can 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 702 to efficiently perform routing computations, network diagnostics, security functions, etc.
Although the system shown in
Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 710) 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.
Referring to
The communications interface 840 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 830 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) 825, read only memory (ROM) 820, and hybrids thereof.
The storage device 830 can include software modules 832, 834, 836 for controlling the processor 810. Other hardware or software modules are contemplated. The storage device 830 can be connected to the system bus 805. 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 810, bus 805, display 835, and so forth, to carry out the function.
Referring to
The chipset 860 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 the processor 855 analyzing data stored in storage 870 or 875. Further, the machine can receive inputs from a user via user interface components 885 and execute appropriate functions, such as browsing functions by interpreting these inputs using the processor 855.
It can be appreciated that exemplary systems 800 and 850 can have more than one processor 810 or be part of a group or cluster of computing devices networked together to provide greater processing capability.
Referring to
At block 902, system capabilities information from a link lever peer is received. For example, a network infrastructure device 700, 800 can receive system capabilities information from a link level peer that is a direct neighbor. The information can be received via a port of the network infrastructure device 700, 800. The system capability information can be received via a protocol for discovering network device capabilities, such as LLDP. In order for a device to provide the system capability information via LLDP, the LLDP operation and TLV exchange needs to be activated on each device in the network. For example, an operator can enable the LLSP operation and TLV exchange when each device in the network when each device is installed. After receiving system capabilities information, the method 900 can proceed to block 904.
At block 904, a device type of link level peer is determined. For example, a network infrastructure device 700, 800 can determine the device type of the link level peer based on the received system capabilities information from the link level peer. For example, using the system capabilities information shown in Table 2, the network infrastructure device 700, 800 can determine if the neighbor device is a network port (e.g., LLDP capability values 3, 9, 10, and/or 11) or an edge port for end hosts (e.g., LLDP capability value 8). After determining the device type, the method 900 can proceed to block 906.
At block 906, a STP port type is configured for the port based on the determined device type. For example, a network infrastructure device 700, 800 can configure the STP port type of the port based on the determined device type. For example, the STP port type can be set to a network port if the device type is one of, a Media Access Control (MAC) bridge, a Customer Virtual Local Area Network (C-VLAN) component of a VLAN bridge, a Service VLAN (S-VLAN) of a VLAN Bridge, or a Two-port MAC Relay (TPMR). The STP port can be set to an edge port based on the determined type being an end station. For ports that are configured as edge ports, the edge ports can be placed in a forwarding state or a portfast state without running through the entire STP state machine. In addition, the periodic BDPUs can be reduced and/or eliminated to reduce the resource utilization on the system.
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, 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.
This application is a Continuation of U.S. patent application Ser. No. 14/459,085, entitled “SPANNING TREE PROTOCOL (STP) OPTIMIZATION TECHNIQUES”, filed on Aug. 13, 2014, which claims priority to U.S. Provisional Patent Application No. 61/900,378, filed Nov. 5, 2013, both of which are incorporated herein by reference in their entirety.
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 |
5801597 | Carter et al. | Sep 1998 | A |
5859835 | Varma et al. | Jan 1999 | A |
5926458 | Yin et al. | Jul 1999 | A |
6252876 | Brueckheimer et al. | Jun 2001 | B1 |
6388208 | Kiani et al. | May 2002 | B1 |
6389031 | Chao et al. | May 2002 | B1 |
6456624 | Eccles et al. | Sep 2002 | B1 |
6486405 | Lin | Nov 2002 | B2 |
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 |
7002430 | Benham et al. | Feb 2006 | B2 |
7068667 | Foster et al. | Jun 2006 | B2 |
7152117 | Stapp et al. | Dec 2006 | B1 |
7177946 | Kaluve et al. | Feb 2007 | B1 |
7232959 | Hsu | Jun 2007 | B2 |
7249337 | Gisin et al. | Jul 2007 | B2 |
7372857 | Kappler et al. | May 2008 | B1 |
7397320 | Bokhari | Jul 2008 | B1 |
7411915 | Spain | Aug 2008 | B1 |
7426604 | Rygh et al. | Sep 2008 | B1 |
7448880 | Osaka | Nov 2008 | B2 |
7516211 | Gourlay | 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 |
8283991 | Essenwanger | Oct 2012 | B1 |
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 |
8624688 | Essenwanger | Jan 2014 | B2 |
8687629 | Kompella et al. | Apr 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 | 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 | 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 |
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 |
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 | 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 |
20110203843 | Kushita | 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 |
20110299406 | Vobbilisetty et al. | Dec 2011 | A1 |
20110310738 | Lee et al. | Dec 2011 | A1 |
20110321031 | Dournov et al. | 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 |
20130162364 | Lin | 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 |
20140236512 | Yan | 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 |
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 |
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 et al. | Apr 2016 | A1 |
20160315811 | Yadav et al. | Oct 2016 | A1 |
20170085469 | Chu et al. | Mar 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 |
Number | Date | Country |
---|---|---|
WO 03067799 | Aug 2003 | WO |
WO 2014071996 | May 2014 | WO |
Entry |
---|
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. |
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. |
Author Unknown, “Subset—Wikipedia, the free encyclopedia,” Dec. 25, 2014, pp. 1-3. |
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. |
Number | Date | Country | |
---|---|---|---|
20170207961 A1 | Jul 2017 | US |
Number | Date | Country | |
---|---|---|---|
61900378 | Nov 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14459085 | Aug 2014 | US |
Child | 15480286 | US |