Interconnecting segmented layer two network for cloud switching

In one embodiment, a layer-2 network that includes a cloud switch is partitioned into a plurality of segments, each segment including one or more cloud switch domains that are coupled via a logical port to a corresponding one of a plurality of internal logical shared media links. One of the internal logical shared media links is provisioned as a hub. One or more remaining internal logical shared media links are defaulted to be spokes. A spanning tree protocol (STP) is executed within each segment. The logical port of each cloud switch domain advertises a pseudo root bridge identifier (ID) to cause the internal logical shared media link to appear attached to a Root. The advertised pseudo root bridge ID of the hub is chosen to have a higher priority than the pseudo root bridge ID of the spokes to establish a hub and spoke relationship among the segments.

Method and apparatus for image processing

A method for image processing. The method comprises the steps of providing a touch panel, displaying an image on the touch panel, obtaining a dragging path generated by a user touching and dragging from a first to a second point on a surface of the touch panel, determining a rotation angle according to a relative position between the first and second points on the surface of the touch panel, and displaying the image rotated with the rotation angle on the touch panel.

GENERATION AND DELIVERY OF INTEREST-BASED COMMUNICATIONS

According to examples, a system for generating and delivering enhanced content utilizing remote rendering and data streaming is described. The system may include a processor and a memory storing instructions. The processor, when executing the instructions, may cause the system to generate one or more interests associated with a user, generate a taxonomy based on the one or more interests associated with the user and associate the one or more interests associated with the user. The processor, when executing the instructions, may then determine a relationship between a first user and a second user utilizing the one or more interests associated with the user; determine an arrangement of a plurality of users in relation to the user and a plurality of other users; and generate an engagement item in association with the user ...

Concerted Multi-Destination Forwarding in a Joint TRILL Fabric and VXLAN/IP Fabric Data Center

Coordinating gateways for multi-destination traffic across a TRILL fabric and a VXLAN/IP fabric with a plurality of TRILL IS-IS TLVs and a plurality of Layer 3 IS-IS TLVs is provided herein. The plurality of TRILL IS-IS TLVs and the plurality of Layer 3 IS-IS TLVs effectuate: grafting an IP multicast share tree with a plurality of TRILL distribution trees at only one of a plurality of gateways in a network interworking a TRILL fabric and a VXLAN/IP fabric; ensuring that multicast traffic traversing from the plurality of TRILL distribution trees is not looped back to the TRILL fabric through the VXLAN/IP fabric; restoring connectivity among a plurality of VXLAN/IP fabric partitions through the TRILL fabric if the VXLAN/IP fabric is partitioned; and restoring connectivity among a plurality of TRILL fabric partitions through the VXLAN/IP fabric if the TRILL fabric is partitioned. 1. A method comprising:grafting an IP multicast share tree with a plurality of TRILL distribution trees at only one of a plurality of gateways in a network interworking a TRILL fabric and a VXLAN/IP fabric;ensuring that multicast traffic traversing from the plurality of TRILL distribution trees is not looped back to the TRILL fabric through the VXLAN/IP fabric;restoring connectivity among a plurality of VXLAN/IP fabric partitions through the TRILL fabric if the VXLAN/IP fabric is partitioned; andrestoring connectivity among a plurality of TRILL fabric partitions through the VXLAN/IP fabric if the TRILL fabric is partitioned.2. The method of claim 1 , further comprising establishing affinity associations between a single gateway and only one of the plurality of TRILL distribution trees in regards to a first pseudo node.3. The method of claim 2 , further comprising:advertising a first TRILL TLV to the TRILL fabric, wherein the first TRILL TLV comprises at least a gateway allocation priority, a number of trees to allocate, and a list of TRILL distribution trees identified by RBridge nicknames; ...

Concerted multi-destination forwarding in a joint TRILL fabric and VXLAN/IP fabric data center

Coordinating gateways for multi-destination traffic across a TRILL fabric and a VXLAN/IP fabric with a plurality of TRILL IS-IS TLVs and a plurality of Layer 3 IS-IS TLVs is provided herein. The plurality of TRILL IS-IS TLVs and the plurality of Layer 3IS-IS TLVs effectuate: grafting an IP multicast share tree with a plurality of TRILL distribution trees at only one of a plurality of gateways in a network interworking a TRILL fabric and a VXLAN/IP fabric; ensuring that multicast traffic traversing from the plurality of TRILL distribution trees is not looped back to the TRILL fabric through the VXLAN/IP fabric; restoring connectivity among a plurality of VXLAN/IP fabric partitions through the TRILL fabric if the VXLAN/IP fabric is partitioned; and restoring connectivity among a plurality of TRILL fabric partitions through the VXLAN/IP fabric if the TRILL fabric is partitioned.

Synchronization of traffic multiplexing in link aggregation

Synchronization of traffic multiplexing in link aggregation is described. In an embodiment, a first link aggregator and a second link aggregator are associated with a plurality of links. The first link aggregator maintains an identifier for each link indicating at least a state of enabled or disabled. A synchronized clock is established between the first link aggregator and the second link aggregator. A particular link of the plurality of links is transitioned. Wherein, the transitioning is performed by the first link aggregator sending, to the second link aggregator, a first message identifying a particular time to transition the particular link. The first link aggregator receives, from the second link aggregator, a second message indicating that the particular time is acceptable. In response to a determination that the second message indicates that the particular time is acceptable and that the synchronized clock has reached the particular time, transitioning the link.

Flexible and scalable virtual network segment pruning

A segment within a virtual network is identified as being supported by a segment bundling device. The segment within the virtual network supports a first host connected to a first bridging device and a second host connected to a second bridging device. The segment bundling device is used to receive virtual network address information describing the virtual network segmentation identifier (ID) for the segment used for receiving virtual network traffic for the first and second host. A segment bundling table associating a bundle ID with the virtual network segmentation identifier based on the upper ID and the lower ID of the virtual network ID is generated by the segment bundling device. The segment bundling device is used to distribute the segment bundling table to traffic forwarding devices in the virtual network that interface with the first bridging device and the second bridging device.

SYNCHRONIZATION OF TRAFFIC MULTIPLEXING IN LINK AGGREGATION

Synchronization of traffic multiplexing in link aggregation is described. In an embodiment, a first link aggregator and a second link aggregator are associated with a plurality of links. The first link aggregator maintains an identifier for each link indicating at least a state of enabled or disabled. A synchronized clock is established between the first link aggregator and the second link aggregator. A particular link of the plurality of links is transitioned. Wherein, the transitioning is performed by the first link aggregator sending, to the second link aggregator, a first message identifying a particular time to transition the particular link. The first link aggregator receives, from the second link aggregator, a second message indicating that the particular time is acceptable. In response to a determination that the second message indicates that the particular time is acceptable and that the synchronized clock has reached the particular time, transitioning the link. 1. A method comprising:associating a first link aggregator device and a second link aggregator device with a plurality of network data communication links, wherein the first link aggregator device maintains an identifier for each link indicating at least a state of enabled or disabled;establishing a synchronized clock between the first link aggregator and the second link aggregator;transitioning a particular link of the plurality of links to a different state by:the first link aggregator sending, to the second link aggregator, a first message that identifies a particular time when the particular link should transition;the first link aggregator receiving, from the second link aggregator, a second message that indicates whether the particular time is acceptable;in response to determining that the synchronized clock has reached the particular time and the second message indicates the particular time is acceptable, updating the identifier for the particular link with the different state.2. The method of ...

System and method for virtual portchannel load balancing in a trill network

An example method includes storing a portion of virtual PortChannel (vPC) information in a TRansparent Interconnect of Lots of Links network environment, deriving, from the portion of vPC information, a physical nickname of an edge switch to which a frame can be forwarded, and rewriting an egress nickname in a TRILL header of the frame with the physical nickname. In example embodiments, the vPC information can include respective vPC virtual nicknames, EtherChannel hash algorithms, hash values, and physical nicknames of edge switches associated with vPCs in the network environment. In some embodiments, the portion of vPC information can be derived from an Interested vPC Type Length Value (TLV) information of an Intermediate System to Intermediate System (IS-IS) routing protocol data unit (PDU).

Automated equal-resistance routing in compact pattern

Described is technology for automatically generating a routing for an integrated circuit (IC) design. Information describing pin-pairs of an integrated circuit (IC) design is received. An initial routing of the IC design is determined by (i) defining connected wires between each pin-pair in the set of pin-pairs, and (ii) evaluating a target resistance for the pin-pair over the connected wires, wherein each connected wire is routed with other connected wires. A resistance adjustment is applied to adjust wire resistance of the connected wires of the initial routing. The resistance adjustment can be based on a square routing in response to a wire resistance being below the target resistance; or the resistance adjustment can be based on a multi-layer stacking in response to the wire resistance being above the target resistance. The routing is provided in patterns as generated by the initial routing and the resistance adjustment.

INTERCONNECTING SEGMENTED LAYER TWO NETWORK FOR CLOUD SWITCHING

In one embodiment, a layer-2 network that includes a cloud switch is partitioned into a plurality of segments, each segment including one or more cloud switch domains that are coupled via a logical port to a corresponding one of a plurality of internal logical shared media links. One of the internal logical shared media links is provisioned as a hub. One or more remaining internal logical shared media links are defaulted to be spokes. A spanning tree protocol (STP) is executed within each segment. The logical port of each cloud switch domain advertises a pseudo root bridge identifier (ID) to cause the internal logical shared media link to appear attached to a Root. The advertised pseudo root bridge ID of the hub is chosen to have a higher priority than the pseudo root bridge ID of the spokes to establish a hub and spoke relationship among the segments. 1. A method comprising:partitioning a layer-2 network that includes a cloud switch into a plurality of segments, each segment including one or more cloud switch domains that are coupled via a logical port to a corresponding one of a plurality of internal logical shared media links of s the cloud switch;provisioning one of the plurality of internal logical shared media links as a hub internal logical shared media link and one or more remaining internal logical shared media links as spoke internal logical shared media links; andexecuting a spanning tree protocol (STP) within each segment of the plurality of segments, the logical port of each cloud switch domain to advertise a pseudo root bridge identifier (ID) for the internal logical shared media link coupled thereto during execution of the STP to cause the internal logical shared media link to appear attached to a Root, the advertised pseudo root bridge ID of the hub internal logical shared media link to have a higher priority than the pseudo root bridge ID of the spoke internal logical shared media links to establish a hub and spoke relationship among the segments.2. ...

Flexible and Scalable Virtual Network Segment Pruning

A segment within a virtual network is identified as being supported by a segment bundling device. The segment within the virtual network supports a first host connected to a first bridging device and a second host connected to a second bridging device. The segment bundling device is used to receive virtual network address information describing the virtual network segmentation identifier (ID) for the segment used for receiving virtual network traffic for the first and second host. A segment bundling table associating a bundle ID with the virtual network segmentation identifier based on the upper ID and the lower ID of the virtual network ID is generated by the segment bundling device. The segment bundling device is used to distribute the segment bundling table to traffic forwarding devices in the virtual network that interface with the first bridging device and the second bridging device. 1. A method comprising:identifying a segment as being supported by a segment bundling device, the segment supporting a first host connected to a first bridging device and a second host connected to a second bridging device within a network;receiving, using the segment bundling device, virtual network address information describing the virtual network segmentation identifier (ID) for the segment that is used to receive virtual network traffic for the first and second host, wherein the virtual network ID comprises an upper ID and a lower ID;generating, using the segment bundling device, a segment bundling table associating a bundle ID with the virtual network segmentation identifier based on the upper ID and the lower ID of the virtual network ID; anddistributing, using the segment bundling device, the segment bundling table to traffic forwarding devices in the network that interface with the first bridging device and the second bridging device.2. The method of claim 1 , wherein receiving virtual network addressing information comprises receiving claim 1 , within a link state packet ...

Scaling interconnected IP fabric data centers

Techniques which provide scalable techniques for managing multicast traffic in interconnected IP fabric data centers. More specifically, embodiments presented herein disclose an aggregated source technique used to address scalability issues for interconnected IP fabric data centers as well as disclose a secondary rendezvous point technique used to address backbone network (S, G) multicast state scalability. Additionally, embodiments disclosed herein include an approach for border leaf load balancing based on group destination addresses used by VTEPs.

Intermediary Method, Intermediary Device, and Recording Medium/Program

Provides brokerage methods, brokerage equipment and computer programs. An intermediary method for intermediary transactions of goods or services between an orderer and an orderer by using a computer communicatively connected to the orderer's terminal and the orderer's terminal, wherein information on the goods or services to be ordered is sent to the orderer's terminal, the selection of the goods or services to be ordered is accepted through the orderer's terminal, and settlement is processed for the receipt and ordering of the selected goods or services. The evaluation of the orderer by the orderer who placed the goods or services and the evaluation of the orderer by the orderer are received from both the orderer's terminal and the orderer's terminal, and the computer executes processing to store the received evaluations of the orderer and the orderer in a distributed ledger. 118-. (canceled)19. An intermediary method for intermediary transactions of goods or services between an orderer and an order receiver using a computer communicatively connected to an orderer's terminal and an order receiver's terminal , comprising:sending information on goods or services to be ordered to the order receiver's terminal;accepting the selection of goods or services to be ordered through the orderer's terminal;processing a settlement for receiving and ordering the selected goods or services;receiving the evaluation of the order receiver by the orderer who placed the said goods or services and the evaluation of the orderer by the order receiver from both the orderer's terminal and the order receiver's terminal; andperforming the process of storing the received evaluations of the orderer and the order receiver in a distributed ledger by the computer.20. The intermediary method according to claim 19 , further comprising:ranking each user, including the said orderer and the said order receiver, based on the evaluation stored in the said distributed ledger by the computer; andsending ...

Synchronization of traffic multiplexing in link aggregation

Synchronization of traffic multiplexing in link aggregation is described. In an embodiment, a first link aggregator and a second link aggregator are associated with a plurality of links. The first link aggregator maintains an identifier for each link indicating at least a state of enabled or disabled. A synchronized clock is established between the first link aggregator and the second link aggregator. A particular link of the plurality of links is transitioned. Wherein, the transitioning is performed by the first link aggregator sending, to the second link aggregator, a first message identifying a particular time to transition the particular link. The first link aggregator receives, from the second link aggregator, a second message indicating that the particular time is acceptable. In response to a determination that the second message indicates that the particular time is acceptable and that the synchronized clock has reached the particular time, transitioning the link.

METHOD AND APPARATUS FOR ADAPTIVE FAST START IN LINK AGGREGATION

In one embodiment, a period between periodic transmissions of protocol data units (PDUs) used to form or maintain a link aggregation group is initially set to a fixed value. When a stress condition is detected, the period between periodic transmissions of PDUs is increased from the initial value. When the stress condition is determined to have eased, the period between periodic transmissions of PDUs is reduced back toward the fixed value. 1. A method comprising:initially setting a period between periodic transmissions of protocol data units (PDUs) used to form or maintain a link aggregation group to a fixed value;detecting, by a network device, a stress condition affecting the link aggregation group;in response to detecting the stress condition, increasing the period between periodic transmissions of PDUs by a selected amount from the initial fixed value;determining, by the network device, that the stress condition has eased; andin response to determining that the stress condition has eased, decreasing the period between periodic transmissions of PDUs by a selected amount back toward the initial fixed value.2. The method of claim 1 , wherein the increasing further comprises:determining whether the stress condition is recent or is persistent;if the stress condition is recent, selecting the amount of increase to produce linear growth in the period; andif the stress condition is persistent, selecting the amount of increase to produce exponential growth in the period.3. The method of claim 1 , wherein the decreasing further comprises:checking a reduction condition; andallowing a decrease to the period between periodic transmissions of PDUs only when the reduction condition is met.4. The method of claim 1 , wherein the period between periodic transmissions of PDUs is a partner periodic time of a partner network device's periodic timer that triggers the periodic transmission of PDUs to the network device.5. The method of claim 4 , wherein the partner periodic time is ...

GRACE STATE AND PACING IN LINK AGGREGATION

In one embodiment, one or more indicia of stress are monitored. Based on the one or more indicia of stress, it is determined a stress condition exists. In response to the stress condition, one or more link aggregation actors and partners are caused to enter a grace state for a grace period. While the one or more link aggregation actors and partners are in the grace state, link aggregation formation is paced on a plurality of links by delaying formation of one or more new link aggregation groups on the plurality of links until a hold is released. Upon expiration of the grace period, the grace state is exited. 1. A method comprising:monitoring, by a network device, for one or more indicia of stress;determining, based on the one or more indicia of stress, a stress condition exists;in response to the stress condition, causing one or more link aggregation actors and partners to enter a grace state for a grace period;while the one or more link aggregation actors and partners are in the grace state, pacing link aggregation formation on a plurality of links by delaying formation of one or more new link aggregation groups on the plurality of links until a hold is released; andexiting the grace state upon expiration of the grace period.2. The method of claim 1 , further comprising:periodically releasing the hold on a subset of links of a selected size.3. The method of claim 2 , wherein the selected size is increased or decreased in response to changes in severity of the stress condition.4. The method of claim 1 , further comprising:while the one or more link aggregation actors and partners are in the grace state, maintaining one or more existing link aggregation groups with implicit keepalive signals that sustain the one or more existing link aggregation groups in lieu of receipt of periodic protocol data units (PDUs).5. The method of claim 4 , further comprising:checking one or more test conditions indicative of a control plane problem, andwherein the maintaining the one or ...

SYSTEM AND METHOD FOR VIRTUAL PORTCHANNEL LOAD BALANCING IN A TRILL NETWORK

An example method includes storing a portion of virtual PortChannel (vPC) information in a TRansparent Interconnect of Lots of Links network environment, deriving, from the portion of vPC information, a physical nickname of an edge switch to which a frame can be forwarded, and rewriting an egress nickname in a TRILL header of the frame with the physical nickname. In example embodiments, the vPC information can include respective vPC virtual nicknames, EtherChannel hash algorithms, hash values, and physical nicknames of edge switches associated with vPCs in the network environment. In some embodiments, the portion of vPC information can be derived from an Interested vPC Type Length Value (TLV) information of an Intermediate System to Intermediate System (IS-IS) routing protocol data unit (PDU). 1. A method , comprising:storing a portion of virtual PortChannel (vPC) information in a TRansparent Interconnect of Lots of Links (TRILL) network environment;deriving, from the portion of vPC information, a physical nickname of an edge switch to which a frame can be forwarded; andrewriting an egress nickname in a TRILL header of the frame with the physical nickname.2. The method of claim 1 , wherein the vPC information includes respective vPC virtual nicknames claim 1 , EtherChannel hash algorithms claim 1 , hash values claim 1 , and physical nicknames of edge switches associated with vPCs in the network environment.3. The method of claim 1 , wherein the egress nickname is a selected one of a vPC virtual nickname and a distribution tree nickname.4. The method of claim 1 , wherein the portion of vPC information is derived from at least one of an Interested vPC Type Length Value (TLV) information and a vPC Reachability TLV information of an Intermediate System to Intermediate System (IS-IS) routing protocol data unit (PDU).5. The method of claim 1 , wherein the frame is not forwarded on a link claim 1 , and wherein a portion of vPCs are represented in the portion of vPC ...

Trill optimal forwarding and traffic engineered multipathing in cloud switching

In one embodiment, a plurality of leaf switches that include host facing ports are configured as a cloud switch. An indication of connectivity between the leaf switches of the cloud switch and routing bridges (RBridges) external to the cloud switch may be added to link state packets (LSPs) sent over the at least one logical shared media link. A lookup table may be generated that specifies next hop leaf switches. The generated lookup table may be used to forward frames to one or more particular nexthop leaf switches. Further, traffic engineering parameters may be collected. Equal cost multipath (ECMP) nexthop leaf switches and distribution trees to reach one or more destinations may be examined. Traffic may be distributed across ones of them based on the traffic engineering parameters.

MST EXTENSIONS FOR FLEXIBLE AND SCALABLE VN-SEGMENT LOOP PREVENTION

In one embodiment, a first number of multiple spanning tree instances (MSTIs) are defined within a network. A second number of network segments associated with segmentation identifier (IDs) are also configured, where the first number of MSTIs is less than the second number of segmentation IDs. Segmentation ID to MSTI mappings are maintained that map each defined segmentation ID of the second number of network segments to one of the first number of MSTIs. A segmentation mapping digest is computed of the segmentation ID to MSTI mappings. Multiple spanning tree (MST) bridge protocol data units (BPDUs) are broadcast that include the digest of the segmentation ID to MSTI mappings. 1. A method comprising:defining a first number of multiple spanning tree instances (MSTIs) within a network;configuring a second number of network segments associated with segmentation identifier (IDs), wherein the first number of MSTIs is less than the second number of segmentation IDs;maintaining, in a memory, segmentation ID to MSTI mappings that map each defined segmentation ID of the second number of network segments to one of the first number of MSTIs;computing, by a processor, a segmentation mapping digest of the segmentation ID to MSTI mappings; andbroadcasting multiple spanning tree (MST) bridge protocol data units (BPDUs) that include the digest of the segmentation ID to MSTI mappings.2. The method of claim 1 , further comprising:receiving MST BPDUs from a particular other domain; andcomparing a segmentation mapping digest in the received MST BPDUs from the particular other domain with the computed segmentation mapping digest.3. The method of claim 2 , further comprising:when the segmentation mapping digest in the received MST BPDUs matches the computed segmentation mapping digest, concluding the particular other domain belongs to a same MST region; andin response to concluding the particular other domain belongs to the same MST region, load balancing frames among MSTIs using the ...

SYNCHRONIZATION OF TRAFFIC MULTIPLEXING IN LINK AGGREGATION

Synchronization of traffic multiplexing in link aggregation is described. In an embodiment, a first link aggregator and a second link aggregator are associated with a plurality of links. The first link aggregator maintains an identifier for each link indicating at least a state of enabled or disabled. A synchronized clock is established between the first link aggregator and the second link aggregator. A particular link of the plurality of links is transitioned. Wherein, the transitioning is performed by the first link aggregator sending, to the second link aggregator, a first message identifying a particular time to transition the particular link. The first link aggregator receives, from the second link aggregator, a second message indicating that the particular time is acceptable. In response to a determination that the second message indicates that the particular time is acceptable and that the synchronized clock has reached the particular time, transitioning the link. 122-. (canceled)23. A method comprising:associating a first link aggregator device and a second link aggregator device with a plurality of network data communication links, wherein the first link aggregator device stores an identifier for each link of the plurality of network data communication links which specifies whether the link is enabled or disabled;establishing a synchronized clock between the first link aggregator device and the second link aggregator device;transitioning a particular link of the plurality of network data communication links to a different state by:the first link aggregator device sending, to the second link aggregator device, a first message that identifies a particular time when the particular link should transition;the first link aggregator device receiving, from the second link aggregator device, a second message that indicates whether the particular time is acceptable;in response to determining that the synchronized clock has reached the particular time and the second ...

METHOD AND APPARATUS FOR ADAPTIVE FAST START IN LINK AGGREGATION

In one embodiment, a period between periodic transmissions of protocol data units (PDUs) used to form or maintain a link aggregation group is initially set to a fixed value. When a stress condition is detected, the period between periodic transmissions of PDUs is increased from the initial value. When the stress condition is determined to have eased, the period between periodic transmissions of PDUs is reduced back toward the fixed value. 1. A method comprising:detecting, by a network device, a first stress condition affecting a link aggregation group while the link aggregation group is forming, the link aggregation group comprising the network device and a partner network device;based on the first stress condition, increasing a time period between periodic transmissions of control data by adding a first delay factor to the time period;detecting, by the network device, a second stress condition affecting the link aggregation group after the link aggregation is formed; andbased on the second stress condition, increasing the time period by adding a second delay factor to the time period, wherein the second delay factor is greater than the first delay factor.2. The method of claim 1 , further comprising:initially setting the time period to a low fixed value.3. The method of claim 1 , wherein the control data comprises protocol data units (PDUs).4. The method of claim 1 , wherein detecting the first stress condition comprises one of:monitoring a completion time of one or more individual aggregation operations; ormonitoring a number of consecutive expirations of a PDU receipt timer.5. The method of claim 1 , further comprising:detecting, by the network device, a third stress condition affecting the link aggregation group, wherein the third stress condition is detected when a threshold number of subsequent expirations of a PDU timer is detected; andbased on the third stress condition, multiplying the time period by a third delay factor.6. The method of claim 5 , wherein ...

Msdc scaling through on-demand path update

In one embodiment, a copy of an original packet of a traffic flow is created at an ingress leaf node of a cloud switch. The ingress leaf node forwards the original packet along a less-specific path through the cloud switch, the less-specific path based on a domain index of an egress domain for the original packet. The copy of the original packet is modified to create a more specific path learn request packet. The ingress leaf node forwards the more specific path learn request packet along the less-specific path through the cloud switch. The ingress leaf node received back a more specific path learn request reply packet that includes an indication of a fabric system port. The ingress leaf node then programs a forwarding table based on the indication of the fabric system port, to have subsequent packets of the traffic flow forwarded along a more-specific path.

Msdc scaling through on-demand path update

In one embodiment, a copy of an original packet of a traffic flow is created at an ingress leaf node of a cloud switch. The ingress leaf node forwards the original packet along a less-specific path through the cloud switch, the less-specific path based on a domain index of an egress domain for the original packet. The copy of the original packet is modified to create a more specific path learn request packet. The ingress leaf node forwards the more specific path learn request packet along the less-specific path through the cloud switch. The ingress leaf node received back a more specific path learn request reply packet that includes an indication of a fabric system port. The ingress leaf node then programs a forwarding table based on the indication of the fabric system port, to have subsequent packets of the traffic flow forwarded along a more-specific path.

METHOD AND APPARATUS FOR SCALING INTERCONNECTED IP FABRIC DATA CENTERS

Techniques which provide scalable techniques for managing multicast traffic in interconnected IP fabric data centers. More specifically, embodiments presented herein disclose an aggregated source technique used to address scalability issues for interconnected IP fabric data centers as well as disclose a secondary rendezvous point technique used to address backbone network (S, G) multicast state scalability. Additionally, embodiments disclosed herein include an approach for border leaf load balancing based on group destination addresses used by VTEPs. 1. A networking device , comprising:a processor; and receiving a packet with a header encapsulating a MAC frame, wherein the packet has a group address as a destination address,', 'replacing a source address in the header with an address of the networking device, and', 'forwarding the packet towards the destination identified by the destination address., 'a memory storing an application, which, when executed on the processor performs an operation for processing network traffic on the network device, the operation comprising2. The networking device of claim 1 , wherein the networking device is a border leaf in a first IP data center fabric and wherein the border leaf connects the first IP data center fabric to a second IP data center fabric over an IP backbone network.3. The networking device of claim 2 , wherein the operation further comprises claim 2 , sending one or more join messages to the source address identified in the packet to establish a multicast state in first the data center.4. The networking device of claim 2 , wherein the operation further comprises claim 2 , prior to replacing the source address in the header claim 2 , forwarding the packet towards one or more leafs networking devices in the first IP data center fabric.5. The networking device of claim 2 , wherein the networking device is a secondary rendezvous point and root of a multicast tree for the first data center claim 2 , and wherein the IP ...

Msdc scaling through on-demand path update

In one embodiment, a copy of an original packet of a traffic flow is created at an ingress leaf node of a cloud switch. The ingress leaf node forwards the original packet along a less-specific path through the cloud switch, the less-specific path based on a domain index of an egress domain for the original packet. The copy of the original packet is modified to create a more specific path learn request packet. The ingress leaf node forwards the more specific path learn request packet along the less-specific path through the cloud switch. The ingress leaf node received back a more specific path learn request reply packet that includes an indication of a fabric system port. The ingress leaf node then programs a forwarding table based on the indication of the fabric system port, to have subsequent packets of the traffic flow forwarded along a more-specific path.

Synchronization of traffic multiplexing in link aggregation

Synchronization of traffic multiplexing in link aggregation is described. In an embodiment, a first link aggregator and a second link aggregator are associated with a plurality of links. The first link aggregator maintains an identifier for each link indicating at least a state of enabled or disabled. A synchronized clock is established between the first link aggregator and the second link aggregator. A particular link of the plurality of links is transitioned. Wherein, the transitioning is performed by the first link aggregator sending, to the second link aggregator, a first message identifying a particular time to transition the particular link. The first link aggregator receives, from the second link aggregator, a second message indicating that the particular time is acceptable. In response to a determination that the second message indicates that the particular time is acceptable and that the synchronized clock has reached the particular time, transitioning the link.

Msdc scaling through on-demand path update

In one embodiment, a copy of an original packet of a traffic flow is created at an ingress leaf node of a cloud switch. The ingress leaf node forwards the original packet along a less- specific path through the cloud switch, the less- specific path based on a domain index of an egress do main for the original packet. The copy of the original packet is modified to create a more specific path learn request packet. The ingress leaf node forwards the more specific path learn request packet along the less-specific path through the cloud switch. The ingress leaf node received back a more specific path learn request reply packet that includes an indication of a fabric system port. The ingress leaf node then programs a forwarding table based on the indication of the fabric system port, to have subsequent packets of the traffic flow forwarded along a more-specific path.

Msdc scaling through on-demand path update

In one embodiment, a copy of an original packet of a traffic flow is created at an ingress leaf node of a cloud switch. The ingress leaf node forwards the original packet along a less- specific path through the cloud switch, the less- specific path based on a domain index of an egress do main for the original packet. The copy of the original packet is modified to create a more specific path learn request packet. The ingress leaf node forwards the more specific path learn request packet along the less-specific path through the cloud switch. The ingress leaf node received back a more specific path learn request reply packet that includes an indication of a fabric system port. The ingress leaf node then programs a forwarding table based on the indication of the fabric system port, to have subsequent packets of the traffic flow forwarded along a more-specific path.

Flexible and scalable virtual network segment pruning

MSDC scaling through on-demand path update

In one embodiment, a copy of an original packet of a traffic flow is created at an ingress leaf node of a cloud switch. The ingress leaf node forwards the original packet along a less-specific path through the cloud switch, the less-specific path based on a domain index of an egress domain for the original packet. The copy of the original packet is modified to create a more specific path learn request packet. The ingress leaf node forwards the more specific path learn request packet along the less-specific path through the cloud switch. The ingress leaf node received back a more specific path learn request reply packet that includes an indication of a fabric system port. The ingress leaf node then programs a forwarding table based on the indication of the fabric system port, to have subsequent packets of the traffic flow forwarded along a more-specific path.

Flexible and scalable virtual network segment pruning

A segment within a virtual network is identified as being supported by a segment bundling device. The segment within the virtual network supports a first host connected to a first bridging device and a second host connected to a second bridging device. The segment bundling device is used to receive virtual network address information describing the virtual network segmentation identifier (ID) for the segment used for receiving virtual network traffic for the first and second host. A segment bundling table associating a bundle ID with the virtual network segmentation identifier based on the upper ID and the lower ID of the virtual network ID is generated by the segment bundling device. The segment bundling device is used to distribute the segment bundling table to traffic forwarding devices in the virtual network that interface with the first bridging device and the second bridging device.

Flexible and scalable virtual network segment pruning

A segment within a virtual network is identified as being supported by a segment bundling device. The segment within the virtual network supports a first host connected to a first bridging device and a second host connected to a second bridging device. The segment bundling device is used to receive virtual network address information describing the virtual network segmentation identifier (ID) for the segment used for receiving virtual network traffic for the first and second host. A segment bundling table associating a bundle ID with the virtual network segmentation identifier based on the upper ID and the lower ID of the virtual network ID is generated by the segment bundling device. The segment bundling device is used to distribute the segment bundling table to traffic forwarding devices in the virtual network that interface with the first bridging device and the second bridging device.

Grace state and pacing in link aggregation

In one embodiment, one or more indicia of stress are monitored. Based on the one or more indicia of stress, it is determined a stress condition exists. In response to the stress condition, one or more link aggregation actors and partners are caused to enter a grace state for a grace period. While the one or more link aggregation actors and partners are in the grace state, link aggregation formation is paced on a plurality of links by delaying formation of one or more new link aggregation groups on the plurality of links until a hold is released. Upon expiration of the grace period, the grace state is exited.

Method and apparatus for adaptive fast start in link aggregation

In one embodiment, a period between periodic transmissions of protocol data units (PDUs) used to form or maintain a link aggregation group is initially set to a fixed value. When a stress condition is detected, the period between periodic transmissions of PDUs is increased from the initial value. When the stress condition is determined to have eased, the period between periodic transmissions of PDUs is reduced back toward the fixed value.