Abstract: A process is implemented in a network element of a packet data to route packets with embedded virtual local area network information and an IP header to far end addresses of virtual forwarding instances. The method receiving a frame including an embedded virtual network identifier (VNI). The VNI is looked up to identify a virtual forwarding instance (VFI), the VFI having a correlated an I-Component Service Identifier (I-SID) and an internet protocol (IP) to backbone media access control (B-MAC) table that is shared with a set of VFIs each having correlated I-SIDs. The VFI resolves an IP address of the frame to a B-MAC address using the shared IP to B-MAC resolution table and encapsulates the frame with the I-SID and B-MAC; and the frame is then sent to the remote B-MAC address.

Abstract: A method is implemented in a multiprotocol label swapping (MPLS) edge switch (PE) for interworking the 802.1aq control plane with an Ethernet Virtual Private Network (EVPN) Border Gateway Protocol (BGP) control plane. The method and system elect designated forwarders (DFs) for a given Backbone-Virtual Local Area Network Identifier (B-VID) in a local Provider Backbone Bridged Network (PBBN) and thereby determine which PE uniquely transfers specific I-Component Source Identifier (I-SID) and Media Access Control (MAC) information for the B-VID from an Intermediate System-Intermediate System (IS-IS) database into a BGP database and transfers I-SID and MAC information in the BGP database into the IS-IS database of the PE.

Abstract: A three stage folded Clos network is used for Ethernet routing with improved efficiency for computational complexity, network administration, multicast addressing and load redistribution upon failure. The network includes an array of root nodes coupled to an array of edge nodes. Forwarding states are computed and installed for spanning trees rooted on the root nodes. When an edge node is identified as having a failed connection to a root node, a shortest path first (SPF) tree rooted on that edge node is constructed for each Backbone VLAN identifier (B-VID) for the spanning trees rooted on that root node and use the failed connection. A filtering database in each node is populated for edge node pairs having a common service identifier, and unicast and multicast data are forwarded between the edge node pairs according to the filtering database via the SPF trees using a hybrid multicast addressing.

Abstract: A node in a communication network selects between equal cost shortest paths (ECSPs) using split tiebreakers. The node advertises multiple system identifiers (IDs) for that node, and each system ID is associated with a different set of traffic IDs that distinguish different virtual networks in the network. The node receives sets of system IDs for each of the other nodes in the network. After constructing a plurality of different ECSPs between two nodes, the node selects one of the ECSPs for each traffic ID used between the two nodes. For a traffic ID, the node constructs path IDs for each of the ECSPs using one system ID of each node in the path that is associated with that traffic ID. Because of the configuration of the system IDs and the traffic IDs in the network, traffic affected by a failure will be distributed across a plurality of surviving ECSPs.

Abstract: A method in an Ethernet Bridge for improved load distribution in an Ethernet network that includes the Ethernet Bridge including determining a first set of one or more shortest paths between each Ethernet Bridge pair in the Ethernet network, selecting at least a first shortest path, calculating a link utilization value for each link of the Ethernet network, determining a second set of one or more shortest paths between each Ethernet Bridge pair in the Ethernet network, generating a path utilization value for each shortest path, selecting a second shortest path on the basis of said path utilization value, whereby the selection of the second shortest in light of path utilization minimizes the standard deviation of load distribution across the entire Ethernet network.

Abstract: A method implemented in a node of a multi-protocol label switching (MPLS) network for improved load distribution, including determining a first set of one or more shortest paths between each MPLS node pair, selecting at least a first shortest path by applying the common algorithm tie-breaking process, calculating a link utilization value for each link of the MPLS network, determining a second set of one or more shortest paths between each MPLS node pair, generating a path utilization value for each shortest path in the second set of shortest paths based on link utilization values corresponding to each shortest path, and selecting a second shortest path from the second set of shortest paths on the basis of said path utilization value, whereby the selection of the second subsets in light of path utilization minimizes the standard deviation of load distribution across the entire MPLS network.

Abstract: Systems, methods, and apparatuses for BFD to Y.1731 internetworking are described. In one embodiment, a method of processing defect conditions in a maintenance endpoint (MEP) of a first domain, the MEP a component of a bidirectional forwarding detection (BFD) to Y.1731 interworking interface (IWF) in a multi-protocol label switching (MPLS) network is described.

Abstract: Apparatus for mixing of a first gas and a second gas, including (i) a linear first tube for supply of the first gas, the first tube having an inlet for the first gas at an upstream end and tapering to form a nozzle at a downstream end, and (ii) a linear second tube for supply of the second gas. The second tube has an inlet for the second gas at an upstream end, a first portion which forms an annulus around the outer surface of the first tube upstream of the nozzle, and a second portion which forms a sheath around the nozzle of the first tube and which forms an area of expanded cross-section compared to the annulus.

Abstract: A system and method that facilitates the migration of one or more Virtual Machines (VMs) throughout a communications network, such as a cloud network, is disclosed. A management system monitors a current traffic matrix to determine if the network is congested. If the network is congested, the management system determines a minimum number of VMs that must be migrated to unused VM sites to ease the congestion and optimize the distribution of traffic in the network. Additionally, the management system also identifies which VMs should be migrated to which unused VM sites, and a sequence in which the migration should be performed to return the bandwidth distribution in the network to an acceptable level. In addition, the management system may determine which unused VM site or sites is best for the addition of one or more new VMs or groups of VMs.

Abstract: A method that improves multi-area routed Ethernet network design, in which multipath implementation in each of the areas is independent of each other area to allow optimal network design in each area. The network implements a shortest path bridging medium access control (SPBM) protocol. The areas include a Level 2 (L2) routing area coupled to a Level 1 (L1) routing area via multiple area border bridges (ABBs). The L1 routing area including a backbone edge bridge (BEB) coupled to the ABBs via multiple L1 multipath instances identified by respective backbone VLAN identifiers (B-VIDs). The ABBs receive an advertisement from the BEB that indicates a set of BEB identifiers, each of which identifies the BEB and is associated with a respective B-VID. Each of the BEB identifiers is unique. The ABBs also advertise into the L2 routing area, and translate the B-VIDs based on service identifiers for frames transiting the ABBs.

Abstract: A method provides load distribution that selects one of a set equal cost paths for each flow that minimizes imbalance in the distribution of flows across the set of equal cost paths. The method includes calculating the set of equal cost paths to each destination node, generating a set of next hop discriminators, each next hop discriminator to uniquely identify one of the equal cost next hops, populating the load distribution table by storing, according to a distribution mechanism, in each load distribution table entry one of the next hop discriminators from the set of next hop discriminators, receiving a first PDU from a first flow and performing a lookup of one of the next hop discriminators in the load distribution table by using values at the bit locations of the first PDU directly as an index into a CAM.

Abstract: An optical apparatus comprising a first mirror (12), a second mirror (14), and at least one support (30) for holding the second mirror in substantially a predetermined position relative to said first mirror (12), wherein said at least one support (30) comprises at least one actuator (32) arranged to adjust the position of the second mirror (14), and said optical apparatus further comprises at least one light source (40a-40-c) rigidly fixed to the first mirror (12) in a predetermined orientation for providing a beam of light (42a-42c) directed at said second mirror (14), at least one corresponding alignment sensor (46a-46c) for detecting the beam of light (44a-44c) reflected from said second mirror (14), and arranged to provide an output signal indicative of the position of the incident reflected beam, and a controller (50) arranged to receive said output signal, and to thereby control said actuator (32) to adjust the position of the second mirror (14).

Abstract: Method and apparatus for performing load spreading in a network are described. According to one embodiment, a request to allocate network resources for a flow is received from a load distribution module in an edge network element. The request includes a resource requirement for the flow. A path is selected from the currently available equal cost paths, and a path identifier value that represents the path selected is determined. The path identifier value is used by the nodes in the network to correctly perform multipath forwarding for the flow. The path identifier value that represents the path selected is communicated to the load distribution module in the edge network element, and is to be inserted by the edge network element into subsequent frames belonging to the flow to be used in subsequent forwarding decisions by nodes along the path selected.

Abstract: A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.

Abstract: Embodiments of the invention include a computer-implemented method of shared backup path computation in an multiprotocol label switching (MPLS) network, the shared backup path to be used upon a failure of at least one working path of the MPLS network.

Abstract: A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.

Abstract: A method to provide load distribution that selects one of a set equal cost paths for each flow that minimizes imbalance in the distribution of flows across the set of equal cost paths, the method including calculating the set of equal cost paths to each destination node, generating a set of next hop discriminators for the set of equal cost paths, each next hop discriminator in the set of next hop discriminators to uniquely identify one of the equal cost next hops, populating the load distribution table by storing, according to a distribution mechanism, in each load distribution table entry one of the next hop discriminators from the set of next hop discriminators, receiving a first PDU from a first flow and performing a lookup of one of the next hop discriminators in the load distribution table by using values at the bit locations of the first PDU directly as an index into a CAM.

Abstract: A network element disposed in a network, where the network element implements a process to manage load distribution across a plurality of network interfaces of the network. The network element redirects traffic flow directed toward the plurality of network interfaces in response to changes in configuration of the plurality of network interfaces, where each traffic flow is a set of protocol data units (PDUs), having an ordered delivery requirement, and where the PDUs are transmitted across the network between a source node and a destination node. The redirection process minimizes data traffic flow disruption when the load distribution is determined using a set of load distribution tables instead of a hashing algorithm.

Abstract: Systems, methods, and apparatuses for BFD to Y.1731 internetworking are described. In one embodiment, a method of processing defect conditions in a maintenance endpoint (MEP) of a first domain, the MEP a component of a bidirectional forwarding detection (BFD) to Y.1731 interworking interface (IWF) in a multi-protocol label switching (MPLS) network is described.

Abstract: A node and a method are described herein for computing forwarding trees to distribute traffic in a network. In addition, a network is described herein that has a plurality of nodes interconnected to one another by a plurality of network links, and each node is configured to perform multiple rounds of forwarding tree computations to distribute traffic load on one or more of the network links to the other nodes.