Abstract: A method includes receiving a data packet from a source endpoint included within a source endpoint group identified by a source endpoint group policy identifier, where the data packet includes a first multicast address. The method also includes transforming the data packet into a transformed data packet that includes a second multicast address constructed using the source endpoint group policy identifier and a multicast index that specifies a multicast forwarding policy between the source endpoint group and one or more destination endpoint groups identified by one or more destination endpoint group policy identifiers. The method further includes forwarding the transformed data packet toward one or more destination endpoints included within the one or more destination endpoint groups, with the forwarding being based on the second multicast address. The data packet may be routed using a forwarding path based on a multicast forwarding tree constructed for the second multicast address.

Abstract: In some examples, a network node receives a packet from an adjacent node in a packet-switched network. The receiving node can forward the packet to a destination node via a minimum cost forwarding node adjacent to the network node or to a non-minimum cost forwarding node adjacent to the network node based on routing criteria for the packet-switched network. The routing criteria can include whether the adjacent node that sent the packet to the receiving node is a non-minimum cost node between a source node and the destination node for the packet.

Abstract: A system includes spine network switching devices, leaf network switching devices, and server computing devices. The leaf network switching devices are not connected to one another. Each leaf network switching device is connected to each spine network switching device. Each server computing device is connected to each leaf network switching device. Each leaf network switching device transmits an advertisement indicating uplink bandwidth to each spine network device. Each server computing device distributes network traffic through the leaf network switching devices to the spine network switching devices based on the uplink bandwidth that the leaf network switching devices advertise.

Abstract: Some examples herein disclose identifying a service function chain based on a switch address from a packet. The examples disclose modifying the switch address to an address corresponding to a service function based on the identified service function chain. The examples also disclose forwarding the packet to the service function according to the modified switch address.

Abstract: According to examples, an apparatus may include a processor and a memory on which is stored machine readable instructions. The instructions may cause the processor to intercept a packet from a downstream service function classifier, in which the packet includes metadata that specifies an ordered set of service functions within a service function chain to be implemented on the packet, generate a correlation cookie that associates the packet with the service function chain, and encode the correlation cookie into the packet. The instructions may also cause the processor to store the correlation cookie and the metadata in a cache to correlate the correlation cookie and the metadata and send the packet with the encoded correlation cookie to the service function provider.

Abstract: A system includes spine network switching devices, leaf network switching devices, and server computing devices. The leaf network switching devices are not connected to one another. Each leaf network switching device is connected to each spine network switching device. Each server computing device is connected to each leaf network switching device. Each leaf network switching device transmits an advertisement indicating uplink bandwidth to each spine network device. Each server computing device distributes network traffic through the leaf network switching devices to the spine network switching devices based on the uplink bandwidth that the leaf network switching devices advertise.

Abstract: According to examples, an apparatus may include a processor and a memory on which is stored machine readable instructions. The instructions may cause the processor to intercept a packet from a downstream service function classifier, in which the packet includes metadata that specifies an ordered set of service functions within a service function chain to be implemented on the packet, generate a correlation cookie that associates the packet with the service function chain, and encode the correlation cookie into the packet. The instructions may also cause the processor to store the correlation cookie and the metadata in a cache to correlate the correlation cookie and the metadata and send the packet with the encoded correlation cookie to the service function provider.

Abstract: In accordance with examples disclosed herein, a filter table for Media Access Control (MAC) chaining contains mappings between signature addresses, service functions, and management functions, to identify corresponding service function chains. The filter table is to store statistic information about the packet. A controller is to uniquely identify a management function corresponding to the signature address, and modify tables of packet signature addresses usable to modify the packet to cause the packet to be forwarded to the management function. The controller is to update the statistic information about the packet.

Abstract: An example device in accordance with an aspect of the present disclosure includes identifying a service and/or management function among multiple functions based on an available capacity. Tables are updated to cause the packet to be forwarded to the identified function accordingly.

Abstract: In accordance with examples disclosed herein, a filter table for Media Access Control (MAC) chaining contains mappings between signature addresses, service functions, and management functions, to identify corresponding service function chains. The filter table is to store statistic information about the packet. A controller is to uniquely identify a management function corresponding to the signature address, and modify tables of packet signature addresses usable to modify the packet to cause the packet to be forwarded to the management function. The controller is to update the statistic information about the packet.

Abstract: Some examples herein disclose identifying a service function chain based on a switch address from a packet. The examples disclose modifying the switch address to an address corresponding to a service function based on the identified service function chain. The examples also disclose forwarding the packet to the service function according to the modified switch address.

Abstract: In some examples, a network node receives a packet from an adjacent node in a packet-switched network. The receiving node can forward the packet to a destination node via a minimum cost forwarding node adjacent to the network node or to a non-minimum cost forwarding node adjacent to the network node based on routing criteria for the packet-switched network. The routing criteria can include whether the adjacent node that sent the packet to the receiving node is a non-minimum cost node between a source node and the destination node for the packet.

Abstract: In order to achieve path diversity for dual-homed User-Network Interface clients connected to a Generalized Multiprotocol Label Switching control plane enabled transport network that is operated in an overlay mode, the overlay extension service model is enhanced by adding shared constraint information for path diversity in the optical transport network. In particular, within the provider network, shared constraint information of a first traffic path is determined and a data element indicative of the shared constraint information is returned by a first provider edge node to a customer edge device via a User-Network Interface. When the customer edge device requests a second traffic path through the provider network to be established from a second provider edge node and to be disjoint from said first traffic path, the customer edge device forwards the data element to the second provider edge node to enable path calculation of the second traffic path using the shared constraint information as exclusion list.

Abstract: In order to achieve path diversity for dual-homed User-Network Interface clients connected to a Generalized Multiprotocol Label Switching control plane enabled transport network that is operated in an overlay mode, the overlay extension service model is enhanced by adding shared constraint information for path diversity in the optical transport network. In particular, within the provider network, shared constraint information of a first traffic path is determined and a data element indicative of the shared constraint information is returned by a first provider edge node to a customer edge device via a User-Network Interface. When the customer edge device requests a second traffic path through the provider network to be established from a second provider edge node and to be disjoint from said first traffic path, the customer edge device forwards the data element to the second provider edge node to enable path calculation of the second traffic path using the shared constraint information as exclusion list.

Abstract: Domain-wide unique node identifiers and domain-wide unique service identifiers are distributed within a MPLS domain using routing system LSAs. Nodes on the MPLS network compute shortest path trees for each destination and install unicast forwarding state based on the calculated trees. Nodes also install multicast connectivity between nodes advertising common interest in a common service identifier. Rather than distributing labels to be used in connection with unicast and multicast connectivity, the nodes deterministically calculate the labels. Any number of label contexts may be calculated. The labels may either be domain wide unique per unicast path or per multicast, or may be locally unique and deterministically calculated to provide forwarding context for the associated path. Multicast and unicast paths may be congruent, although this is not a requirement.

Abstract: Domain-wide unique node identifiers and domain-wide unique service identifiers are distributed within a MPLS domain using routing system LSAs. Nodes on the MPLS network compute shortest path trees for each destination and install unicast forwarding state based on the calculated trees. Nodes also install multicast connectivity between nodes advertising common interest in a common service identifier. Rather than distributing labels to be used in connection with unicast and multicast connectivity, the nodes deterministically calculate the labels. Any number of label contexts may be calculated. The labels may either be domain wide unique per unicast path or per multicast, or may be locally unique and deterministically calculated to provide forwarding context for the associated path. Multicast and unicast paths may be congruent, although this is not a requirement.

Abstract: Domain-wide unique node identifiers and domain-wide unique service identifiers are distributed within a MPLS domain using routing system LSAs. Nodes on the MPLS network compute shortest path trees for each destination and install unicast forwarding state based on the calculated trees. Nodes also install multicast connectivity between nodes advertising common interest in a common service identifier. Rather than distributing labels to be used in connection with unicast and multicast connectivity, the nodes deterministically calculate the labels. Any number of label contexts may be calculated. The labels may either be domain wide unique per unicast path or per multicast, or may be locally unique and deterministically calculated to provide forwarding context for the associated path. Multicast and unicast paths may be congruent, although this is not a requirement.

Abstract: A method and apparatus is disclosed which enables detection of undesired packets received at a device in a network, where the device is a member of a group of devices in the network. A registration table stores transform identifiers for each member of a group and controls the forwarding of the transform identifiers to the members of the group as members are added and deleted. A transform identifier indicates a format or transformation of a packet transmitted by an associated member. The transform identifier can therefore be used at a receiving device to distinguish between transmissions by different members of the group, thereby enabling the receiving device to extract sequence information associated with the member from the packet. The sequence information can be compared against an expected sequence number for the member to determine whether the packet is an undesirable or rogue packet.

Abstract: A method and apparatus is disclosed which enables detection of undesired packets received at a device in a network, where the device is a member of a group of devices in the network. A registration table stores transform identifiers for each member of a group and controls the forwarding of the transform identifiers to the members of the group as members are added and deleted. A transform identifier indicates a format or transformation of a packet transmitted by an associated member. The transform identifier can therefore be used at a receiving device to distinguish between transmissions by different members of the group, thereby enabling the receiving device to extract sequence information associated with the member from the packet. The sequence information can be compared against an expected sequence number for the member to determine whether the packet is an undesirable or rogue packet.

Abstract: Optical By-Pass (OBP) links may be created by adding wavelengths between nodes on the network. The OBP may extend between any pair of nodes on the network. Intermediate nodes on the OBP are transient nodes and simply forward traffic optically. An OBP extends between a pair of nodes and, unlike express links, is created in such a manner that it does not affect the previous allocation of resources on the network. This enables capacity to be added between pairs of nodes on the network to alleviate congestion at a portion of the network, without changing other traffic patterns on the network. This enables inclusion of an OBP to be deterministic and of linear impact on the network. The OBP links may be statically provisioned or created on demand. Optionally, the OBP links may be crated to coincide with PBB-TE tunnels on the network.