Abstract: Systems and methods are presented for processing a dataset in a sequence of steps that define at least a portion of a data pipeline. The method includes: providing a plurality of trusted and isolated computing environments; providing one or more algorithms in each of the trusted and isolated computing environments, the one or more algorithms in each of the trusted and isolated computing environments being configured to process data in accordance with a different step in the data pipeline; receiving the dataset in a first of the trusted and isolated computing environments and causing the dataset to be processed by the one or more algorithms therein to produce a first processed output dataset; and causing the first processed output dataset to be processed in a second of the trusted and isolated computing environments by the one or more algorithms therein.

Abstract: In general, various capabilities related to fault-resilient services within communication networks are presented. The services may include broadcast services, multicast services, unicast services, or the like, as well as various combinations thereof. A capability for providing local protection to unicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for providing local protection to multicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees includes partitioning a graph into a pair of partitions based on a link coloring mechanism and constructing the pair of redundant trees based on the pair of partitions.

Abstract: In one example embodiment, a group server includes a processor configured to receive a data quota usage report corresponding to data quota usage by at least one of a plurality of lines, the plurality of lines forming a group subject to a pre-paid data usage agreement with a data service provider and determine a data quota for the at least one of the plurality of lines based on at least the received data quota usage report and an accuracy threshold.

Abstract: An IP fast reroute scheme offering full protection is disclosed for reducing the number of address lookups associated with a message packet. The IP fast reroute scheme offering full protection includes a router configured to forward the arriving packet to a next-hop neighbor node according to one of a first pointer and a second pointer associated to a destination node in a forwarding information table stored in a forwarding information memory storage; the first pointer is directed to a first next-hop neighbor node which is on the shortest path from the network node to the destination node; and the second pointer is directed to a second next-hop neighbor node different from the first next-hop neighbor node, the second next-hop neighbor node on a candidate cycle containing both the network node and the destination node having the greatest overlap with a sink tree rooted at the destination node.

Abstract: In one example embodiment, a group server includes a processor configured to receive a data quota usage report corresponding to data quota usage by at least one of a plurality of lines, the plurality of lines forming a group subject to a pre-paid data usage agreement with a data service provider and determine a data quota for the at least one of the plurality of lines based on at least the received data quota usage report and an accuracy threshold.

Abstract: In general, various capabilities related to fault-resilient services within communication networks are presented. The services may include broadcast services, multicast services, unicast services, or the like, as well as various combinations thereof. A capability for providing local protection to unicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for providing local protection to multicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees includes partitioning a graph into a pair of partitions based on a link coloring mechanism and constructing the pair of redundant trees based on the pair of partitions.

Abstract: In general, various capabilities related to fault-resilient services within communication networks are presented. The services may include broadcast services, multicast services, unicast services, or the like, as well as various combinations thereof. A capability for providing local protection to unicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for providing local protection to multicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees includes partitioning a graph into a pair of partitions based on a link coloring mechanism and constructing the pair of redundant trees based on the pair of partitions.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: determining that a new virtual gateway location should be created; selecting a data center of a plurality of data centers to host the new virtual gateway location; and establishing a virtual gateway at the selected data center, wherein the virtual gateway is configured to provide at least one device with connectivity to a Virtual Private Network (VPN) and connectivity to the Internet.

Abstract: A capability is provided for supporting fault-resilient propagation of traffic in networks using redundant multicast trees (RMTs). Fault-resilient propagation of traffic from a first node to a second node is supported using one or both of a pair of RMTs rooted at the first node and a pair of RMTs rooted at the second node. The pair of RMTs rooted at the first node includes a pair of node-disjoint paths from the first node to the second node. The pair of RMTs rooted at the second node includes a pair of node-disjoint paths from the second node to the first node. The first node propagates multicast traffic toward the second node using at least one of the RMTs in the pair of RMTs rooted at the first node. The first node propagates unicast traffic toward the second node using at least one of: at least one of the RMTs in the pair of RMTs rooted at the first node, or at least one of the RMTs in the pair of RMTs rooted at the second node.

Abstract: An IP fast reroute scheme offering full protection is disclosed for reducing the number of address lookups associated with a message packet. The IP fast reroute scheme offering full protection includes a router configured to forward the arriving packet to a next-hop neighbor node according to one of a first pointer and a second pointer associated to a destination node in a forwarding information table stored in a forwarding information memory storage; the first pointer is directed to a first next-hop neighbor node which is on the shortest path from the network node to the destination node; and the second pointer is directed to a second next-hop neighbor node different from the first next-hop neighbor node, the second next-hop neighbor node on a candidate cycle containing both the network node and the destination node having the greatest overlap with a sink tree rooted at the destination node.

Abstract: A capability is provided for supporting fault-resilient multicast using multiple sources. A method for supporting fault-resilient propagation of multicast traffic using Redundant Multicast Trees (RMTs) includes identifying each potential Shared Risk Link Group (SRLG) conflict associated with a pair of RMTs providing node-disjoint paths to a plurality of destination nodes, identifying each potential SRLG conflict that is an actual SRLG conflict, and, for each actual SRLG conflict, determining a detour path for protecting the links of the actual SRLG conflict. The pair of RMTs includes a first RMT from a first multicast source node to each of the destination nodes and a second RMT from a second multicast source node to each of the destination nodes. Each potential SRLG conflict includes a plurality of links.

Abstract: A capability is provided for supporting fault-resilient multicast using multiple sources. A method for supporting fault-resilient propagation of multicast traffic using Redundant Multicast Trees (RMTs) includes identifying each potential Shared Risk Link Group (SRLG) conflict associated with a pair of RMTs providing node-disjoint paths to a plurality of destination nodes, identifying each potential SRLG conflict that is an actual SRLG conflict, and, for each actual SRLG conflict, determining a detour path for protecting the links of the actual SRLG conflict. The pair of RMTs includes a first RMT from a first multicast source node to each of the destination nodes and a second RMT from a second multicast source node to each of the destination nodes. Each potential SRLG conflict includes a plurality of links.

Abstract: A capability is provided for supporting fault-resilient propagation of traffic in networks using redundant multicast trees (RMTs). Fault-resilient propagation of traffic from a first node to a second node is supported using one or both of a pair of RMTs rooted at the first node and a pair of RMTs rooted at the second node. The pair of RMTs rooted at the first node includes a pair of node-disjoint paths from the first node to the second node. The pair of RMTs rooted at the second node includes a pair of node-disjoint paths from the second node to the first node. The first node propagates multicast traffic toward the second node using at least one of the RMTs in the pair of RMTs rooted at the first node. The first node propagates unicast traffic toward the second node using at least one of: at least one of the RMTs in the pair of RMTs rooted at the first node, or at least one of the RMTs in the pair of RMTs rooted at the second node.

Abstract: A method and apparatus for providing IP-VPN services for customers and service providers utilizing layer-2 point-to-point connectivity. The method and apparatus include exchanging unique loop-back addresses of customer edges (CE) between the CEs via a respective data virtual circuit therebetween, and sending IP addresses of customer networks associated with each CE to an associated IP service controller (IPSC). The associated IPSC broadcasts the IP addresses of the associated customer networks to other IPSCs, and each CE sends to an associated IPSC, a list of received loop-back addresses. Each IPSC then sends to an associated CE, customer network addresses received from other IPSCs, and each CE populates a local routing table with information mapping the customer networks with a data virtual circuit.