Abstract: A method is implemented by a networking device functioning as a computing node. The method resolves sub-trees of a loosely specified multicast distribution tree (MDT). The method utilizes global identifiers for sub-trees of the MDT to enable differentiation of traffic destined for different sub-trees of the MDT at shared replication nodes. The method can be implemented at or for each of the nodes of the network that are part of the MDT.

Abstract: A method implemented by a network device for multicasting packets in a network. The method reduces an overall number of hops that copies of a packet traverse in the network to serve a set of multicast destination nodes. The method includes receiving a packet, determining a first subset of multicast destination nodes that is a subset of the set of multicast destination nodes that is reachable on a shortest path through a first outgoing interface, determining a second subset of multicast destination nodes that is a subset of the set of multicast destination nodes that is reachable on a shortest path through a second outgoing interface, determining whether the first subset of multicast destination nodes is a proper subset of the second subset of multicast destination nodes, and removing the first outgoing interface from consideration in response to determining that the first subset is a proper subset of the second subset.

Abstract: A method is implemented by a networking device that is functioning as a computing node. The method resolves sub-trees of a loosely specified multicast distribution tree (MDT). The method utilizes global identifiers for sub-trees to enable differentiation of traffic of different sub-trees at shared replication nodes. The method is implemented at each of the nodes of the network that are part of the MDT.

Abstract: A method of supporting service chaining at a network device of a data network is disclosed. The data network offers a set of services associated with a set of network devices, where subscribers of the data network are served by chains of one or more services. The method starts upon receiving a frame, and the network device selects a chain of one or more services for the frame to be processed by the data network. The network device encapsulates the frame with a reflected frame message (RFM) header, the RFM header containing source information associated with the network device, destination information associated with an immediate next service for the frame to be processed, an operation code indicating the frame being an RFM frame. Then the network device sends the encapsulated frame out of the network device according to the destination information of the encapsulated frame.

Abstract: A method and system implemented by a computing device to establish a session between a residential gateway and a virtual edge network function (vENF) in a network function virtualization infrastructure (NFVI) over an access network where a plurality of residential gateways are connected to the access network through a plurality of access nodes that tunnel edge network function requests to the NFVI via a NFVI gateway the broadcasts initial service requests to a plurality of VENF in the NFVI. The method defines a process for a vENF to self-select to service an initial service session request from the residential gateway.

Abstract: A method is provided that is implemented by a network device to simplify a topology graph of a network to generate a multicast distribution tree, the method to reduce the complexity of the topology graph while enabling a creation of the multicast distribution tree such that the computational complexity of generating the multicast distribution tree is reduced, the method including computing a shortest path to all nodes of the topology graph rooted at a source node S, determining a metric for each adjacency on each shortest path of the topology graph for the multicast group G, construct an (S, G) graph with only source node S, leaves and candidate replication points, and prune the (S, G) graph using a set of pruning processes to fully resolve the multicast distribution tree, where full resolution can be determined, and the first set of pruning processes if successful are known to produce a minimum cost tree.

Abstract: A method is implemented by a network device executing a local computation engine and a link state routing protocol. The local computation engine and the link state protocol support automatic establishment of redundant paths and cautious restoration in a packet network. The method includes receiving an explicit path (EP) type length value (TLV) via a link state routing protocol, executing a shortest path algorithm to obtain a shortest path for loose hops of a path identified by the EP TLV, the shortest path to be a primary path, updating a network graph to prune links of the primary path or bias links of the primary path, and calculating a backup path using the shortest path algorithm on the updated network graph.

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 provided that is implemented by a network device to simplify a topology graph of a network to generate a multicast distribution tree, the method to reduce the complexity of the topology graph while enabling a creation of the multicast distribution tree such that the computational complexity of generating the multicast distribution tree is reduced, the method including computing a shortest path to all nodes of the topology graph rooted at a source node S, determining a metric for each adjacency on each shortest path of the topology graph for the multicast group G, construct an (S, G) graph with only source node S, leaves and candidate replication points, and prune the (S, G) graph using a set of pruning processes to fully resolve the multicast distribution tree, where full resolution can be determined, and the first set of pruning processes if successful are known to produce a minimum cost tree.

Abstract: This invention is directed to a duckbill valve arrangement (10) for a beverage dispensing container (70). The arrangement (10) includes a tube (11) having a resilient tube wall (12) with an outer surface (15) and defining an internal passageway (13). The arrangement (10) further includes a duckbill valve (30) mounted within the passageway (13). The duckbill valve (30) includes a resiliently closable valve mouth (41) arranged to be opened upon compression of the tube (11). At least one groove (20, 21) extends along the outer surface (15) of the tube wall (12) for reducing the force required to compress the tube (11) and open the duckbill valve (30).

Abstract: A method is implemented by a networking device that is functioning as a computing node. The method resolves sub-trees of a loosely specified multicast distribution tree (MDT). The method utilizes global identifiers for sub-trees to enable differentiation of traffic of different sub-trees at shared replication nodes. The method is implemented at each of the nodes of the network that are part of the MDT.

Abstract: A method of supporting service chaining at a network device of a data network is disclosed. The data network offers a set of services associated with a set of network devices, where subscribers of the data network are served by chains of one or more services. The method starts upon receiving a frame, and the network device selects a chain of one or more services for the frame to be processed by the data network. The network device encapsulates the frame with a reflected frame message (RFM) header, the RFM header containing source information associated with the network device, destination information associated with an immediate next service for the frame to be processed, an operation code indicating the frame being an RFM frame. Then the network device sends the encapsulated frame out of the network device according to the destination information of the encapsulated frame.

Abstract: A method is implemented by a network device in a network including a plurality of network devices. The method implements multicast forwarding configuration resulting in reduced state for the network by utilizing unicast tunneling between a root, replication points and leaves that implement each multicast distribution tree. The method selects a multicast group to determine forwarding configuration for the selected multicast group, prunes a shortest path tree for the selected multicast group to generate a source group tree, and determines whether the network device is a root or a replication node for the source group tree. The method further checks whether a downstream leaf or replicating node is adjacent to the network device, and where the selected branch does not have an adjacent replication node or leaf, identifies the next replicating node or leaf on the selected branch, and configures the network device to forward multicast group traffic using a unicast tunnel.

Abstract: According to another embodiment of the invention, TWAMP path discovery is performed to determine a sequence of IP addresses of a forward direction TWAMP E2E path to be traversed by two different TWAMP test sessions between a Sender and a Reflector. Then, additional TWAMP test request packets are transmitted for the different TWAMP test sessions; and TWAMP test reply messages are received responsive to respective ones of the TWAMP test request packets. Responsive to the TWAMP test reply messages, a PM is determined that is specific to the different sequences of IP addresses of the forward direction TWAMP E2E paths traversed by the two different TWAMP test sessions.

Abstract: This invention is directed toward a beverage dispensing module and flexible pouch. The beverage dispensing module is suitable for alcoholic beverages. The beverage dispensing module includes an outlet arrangement for selectively dispensing beverage, a pressurizing arrangement including resilient bias means connected to a roller and a beverage pouch fluidly connected to the outlet arrangement and mounted with the roller. The resilient bias means, outlet arrangement and roller are configured to form an overpressure, relative to atmospheric pressure, within the pouch.

Abstract: According to another embodiment of the invention, TWAMP path discovery is performed to determine a sequence of IP addresses of a forward direction TWAMP E2E path to be traversed by two different TWAMP test sessions between a Sender and a Reflector. Then, additional TWAMP test request packets are transmitted for the different TWAMP test sessions; and TWAMP test reply messages are received responsive to respective ones of the TWAMP test request packets. Responsive to the TWAMP test reply messages, a PM is determined that is specific to the different sequences of IP addresses of the forward direction TWAMP E2E paths traversed by the two different TWAMP test sessions.

Abstract: The present invention is directed to a beverage dispensing system including at least one beverage dispensing container, a computing device and a base unit upon or within which, in use, the at least one container is positioned. The at least one container includes a reservoir of beverage, a communication element for storing data indicative of contents of the beverage dispensing container, a manually actuatable dispensing valve selectively controlling flow of beverage from the reservoir to a container outlet, and pressurizing means for pressurizing beverage against the dispensing valve such that when the dispensing valve is opened beverage flows from the reservoir and out the container outlet.

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 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 and system implemented by a computing device to establish a session between a residential gateway and a virtual edge network function (vENF) in a network function virtualization infrastructure (NFVI) over an access network where a plurality of residential gateways are connected to the access network through a plurality of access nodes that tunnel edge network function requests to the NFVI via a NFVI gateway the broadcasts initial service requests to a plurality of VENF in the NFVI. The method defines a process for a vENF to self-select to service an initial service session request from the residential gateway.