Abstract: A method is disclosed to forward Ethernet frames associated with a service instance at a node (a “forwarding node”) in a network supporting an implementation of a protocol for creating logical loop-free topologies. The method starts with receiving a number of MMRPDUs at the forwarding node from links in the first network (receiving links), where each MMRPDU of the first plurality of MMRPDUs contains a first interested node list including one or more interested nodes identified by MAC addresses. Then a service instance identifier (SID) is identified for the service instance and a first set of MAC addresses interested in the service instance is formed. Then a number of MMRPDUs are sent to links associated with the service instance, where each MMRPDU contains a second set of MAC addresses interested in the service instance. The sending may be accompanied by the node installing filtering at the forwarding node accordingly.

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

Abstract: A flow classification process is used at the edge of the shortest path bridging network to determine a flow label for attachment to a client frame entering the network. Any of several flow labels can be assigned to a client frame traversing the network to a particular egress node, and the flow labels are used by forwarding nodes to select among multiple equal-cost paths. In several embodiments, the flow label is calculated as a function of the client frame contents, which provide an entropy source for randomizing the selection of the flow label. This entropy source comprises the Internet Protocol (IP) header in the client frame, in some embodiments, but may comprise other client frame content in other cases.

Abstract: A method is implemented in a provider edge switch (PE) for interworking an 802.1aq control plane with an Ethernet Virtual Private Network (EVPN) Border Gateway Protocol (BGP) control plane. The method includes receiving an Intermediate System-Intermediate System (IS-IS) protocol data unit (PDU) including an IS-IS Type Length Value (TLV) by the PE and determining whether the received IS-IS PDU requires a change in a configuration of designated forwarder (DF). The method further includes determining whether the PE is still the DF for one or more Backbone-Virtual Local Area Network Identifiers (B-VIDs), and removing local DF associated network layer reachability information (NLRI) from a BGP database.

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

Abstract: A method in a network element is provided for improved convergence in a network that includes the network element. The network element is one of a plurality of network elements in the network each of which implement the method. The network element includes a database to store the topology of the network. The topology of the network includes a plurality of network elements and links between the network elements. The method classifies convergence actions for the network element to identify convergence actions that can be implemented prior to complete digest synchronization during a convergence process to simplify and reduce convergence latency once digest synchronization is achieved.

Abstract: A method is implemented in a network element for modifying the characteristics of tree construction for use in virtual network connectivity in a network that includes the network element. A virtual network is associated with a set of virtual network attachment points that are mapped to network elements in a topology of the network where the virtual network is individually associated with an equal cost tree (ECT) set. The method generates individual ECT sets to interconnect sets of virtual network attachment points for connectivity establishment and maintenance of the connectivity in the network. The method modifies link metrics across the topology of the network to be used for computing an ECT set to bias a tie-breaking process for selecting between equal cost paths toward either producing minimal cost shortest path multicast trees or maximizing unicast path diversity in the multiple ECT sets that are generated.

Abstract: A method is implemented in a network element of a service network. The network element executes a packet processing element (PPE) of a plurality of PPEs, where each PPE in the plurality of PPEs executes a stage of packet processing for the service network and where the plurality of PPEs are connected to one another by a plurality of switch fabrics. The PPEs self-select a subset of a set of equivalent service chains to service with each service chain defining a subset and sequence of the plurality of PPEs. Each PPE self-selects the subset of equivalent service chains to process based upon knowledge of the plurality of PPEs servicing that stage of the full set of service chains such that there is spreading of load across all available PPEs in that stage. There is no single point of failure and minimal reassignment of PPEs for a set of equivalent data flows traversing the plurality of PPEs of the service network for changes in topography of the plurality of PPEs in the service network.

Abstract: A device for roasting a food item includes a stand having a frame adapted to be positioned on a surface of a cooking device. The frame includes an upper frame member. A food hanger is adapted to support the food item and engages the upper frame member in a removable fashion so that a majority of the food item is suspended below the upper frame member and above the surface of the cooking device when the frame is positioned thereon.

Abstract: A method is implemented in a provider edge switch (PE) for interworking an 802.1aq control plane with an Ethernet Virtual Private Network (EVPN) Border Gateway Protocol (BGP) control plane. The method includes receiving an Intermediate System-Intermediate System (IS-IS) protocol data unit (PDU) including an IS-IS Type Length Value (TLV) by the PE and determining whether the received IS-IS PDU requires a change in a configuration of designated forwarder (DF). The method further includes determining whether the PE is still the DF for one or more Backbone-Virtual Local Area Network Identifiers (B-VIDs), and removing local DF associated network layer reachability information (NLRI) from a BGP database.

Abstract: A method is disclosed to forward Ethernet frames associated with a service instance at a node (a “forwarding node”) in a network supporting an implementation of a protocol for creating logical loop-free topologies. The method starts with receiving a number of MMRPDUs at the forwarding node from links in the first network (receiving links), where each MMRPDU of the first plurality of MMRPDUs contains a first interested node list including one or more interested nodes identified by MAC addresses. Then a service instance identifier (SID) is identified for the service instance and a first set of MAC addresses interested in the service instance is formed. Then a number of MMRPDUs are sent to links associated with the service instance, where each MMRPDU contains a second set of MAC addresses interested in the service instance. The sending may be accompanied by the node installing filtering at the forwarding node accordingly.

Abstract: A method in a network element is provided for improved convergence in a network that includes the network element. The network element is one of a plurality of network elements in the network each of which implement the method. The network element includes a database to store the topology of the network. The topology of the network includes a plurality of network elements and links between the network elements. The method classifies convergence actions for the network element to identify convergence actions that can be implemented prior to complete digest synchronization during a convergence process to simplify and reduce convergence latency once digest synchronization is achieved.

Abstract: A network element acting as a forwarding plane within a software-defined network to reduce negative effects of slow-path packet processing is described. The network element, upon receiving a first packet, determines whether it matches any flow entry within a set of flow tables. When the first packet does not match any flow entry of the set of flow tables, the network element performs a miss procedure including inserting at least a portion of the first packet into a packet miss table of the network element, which is accessed by a controller. The controller may access the packet miss table using a pull mechanism. The miss procedure may also include accessing a configurable default rule table of the network element, which includes rules enabling limited forwarding for those packets that do not match any entry of the set of flow tables.

Abstract: A method is implemented in a network element for modifying the characteristics of tree construction for use in virtual network connectivity in a network that includes the network element. A virtual network is associated with a set of virtual network attachment points that are mapped to network elements in a topology of the network where the virtual network is individually associated with an equal cost tree (ECT) set. The method generates individual ECT sets to interconnect sets of virtual network attachment points for connectivity establishment and maintenance of the connectivity in the network. The method modifies link metrics across the topology of the network to be used for computing an ECT set to bias a tie-breaking process for selecting between equal cost paths toward either producing minimal cost shortest path multicast trees or maximizing unicast path diversity in the multiple ECT sets that are generated.

Abstract: The invention provides a method of conducting a money transfer transaction. The method comprises obtaining identification data from a customer at a point-of-sale terminal; verifying the obtained identification data by matching the identification data with customer data maintained in computer memory; obtaining transaction details from the customer, the transaction details including a transaction value and a recipient international mobile subscriber identity (IMSI) associated with a mobile device; displaying a summary of the proposed money transfer transaction on a display device in communication with the point-of-sale terminal; obtaining confirmation of the money transfer transaction from the customer; obtaining payment from the customer representing the transaction value; and associating the transaction value with the recipient IMSI. Also provided are methods of conducting a payment transaction and related money transfer and payment transaction systems.

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 technique for explicit path control for traffic forwarding in a network comprising multiple nodes is described. A device embodiment comprises a path computation element that is configured to receive, from an edge node, control protocol data units of a control protocol. The path computation element is further configured to determine an explicit path from information contained in the received control protocol data units and to instruct the edge nodes to perform an action to have the explicit path installed in the network.

Abstract: Methods and devices for implementing Shortest Path Bridging over a VPLS network. The method includes determining, from IS-IS PDU information received by a PE switch, whether a DF configuration for the PE switch needs to be changed and, if so, the method further includes determining whether the PE switch remains a DF for one or more B-VIDs. If the PE switch is no longer a DF for one or more B-VIDs, the method further includes removing local DF associated information for the PE switch from each PW adjacency's LDP database, and removing, from a local IS-IS database, DF associated remote LDP information. The method also includes, if the PE switch has become a DF for one or more of the B-VIDs, adding, from the IS-IS database, local DF information for the PE switch to the LDP databases, and adding, from the LDB databases, DF associated remote information for the PE switch to the IS-IS database.

Abstract: A method is disclosed to forward Ethernet frames associated with a service instance at a node (a “forwarding node”) in a network supporting an implementation of a protocol for creating logical loop-free topologies. The method starts with receiving a number of MMRPDUs at the forwarding node from links in the first network (receiving links), where each MMRPDU of the first plurality of MMRPDUs contains a first interested node list including one or more interested nodes identified by MAC addresses. Then a service instance identifier (SID) is identified for the service instance and a first set of MAC addresses interested in the service instance is formed. Then a number of MMRPDUs are sent to links associated with the service instance, where each MMRPDU contains a second set of MAC addresses interested in the service instance. The sending may be accompanied by the node installing filtering at the forwarding node accordingly.