Abstract: Leaf nodes of a tree structure, also having a root node and intermediate nodes, communicate with endpoints via access networks and store mappings from permanent virtual IP (VIP) addresses for the endpoints to physical IP (PIP) addresses for the endpoints on the access networks. The root node and intermediate nodes store pointers for the endpoints' leaf nodes and associated access networks. When a connection setup request (CSR) for a destination endpoint is received from a corresponding node, the receiving leaf node passes the CSR up through the tree structure to a lowest common ancestor (LCA) node for the receiving leaf node and one or more destination leaf nodes associated with the destination endpoint. The LCA node uses its pointers to pass the CSR down towards the one or more destination leaf nodes, which use the corresponding VIP-to-PIP mappings to forward the CSR to the destination endpoint.

Abstract: Network-based, unsupervised classifiers are provided. The classifiers identify both known and unknown attacks aimed at industrial networks without the need to have a priori knowledge of known malicious attack patterns.

Abstract: Various example embodiments for supporting scheduling of deterministic flows in time synchronized networks are presented. Various example embodiments for supporting scheduling of deterministic flows in a time synchronized network may be configured to support scheduling of deterministic flows in the time synchronized network based on assignment of transmission start times to data flows of communication devices such that the communication devices may transmit data of the data flows at the transmission start times in a manner tending to reduce or eliminate collisions in the time synchronized network.

Abstract: Various example embodiments for supporting scheduling of deterministic flows in time synchronized networks are presented. Various example embodiments for supporting scheduling of deterministic flows in a time synchronized network may be configured to support scheduling of deterministic flows in the time synchronized network based on assignment of transmission start times to data flows of communication devices such that the communication devices may transmit data of the data flows at the transmission start times in a manner tending to reduce or eliminate collisions in the time synchronized network.

Abstract: Network-based, unsupervised classifiers are provided. The classifiers identify both known and unknown attacks aimed at industrial networks without the need to have a priori knowledge of known malicious attack patterns.

Abstract: The present disclosure generally discloses improvements in computer performance for supporting various capabilities for enabling Internet-of-Things (IoT) devices to communicate via communication networks. The capabilities for enabling IoT devices to communicate via communication networks may include IoT device connectivity capabilities, IoT device discovery capabilities, IoT device networking capabilities, or the like.

Abstract: Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.

Abstract: The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

Abstract: Various exemplary embodiments relate to a method of offline traffic matrix unaware segment routing. The method may include determining the fraction of traffic between a node i and a node j is routed though node k, by minimizing the maximum value of any link e carrying traffic between node i and node j based upon the following constraints: using a dual variable ?(e,e?) where e? is an alternate link to e? for comparison, the fraction of traffic from i to j that is routed through intermediate node k is greater than or equal to zero; the total traffic from i to j that is routed through intermediate node k is equal to 1 for all (i,j) pairs; and determining when the total capacity for link e as constrained by the dual variable is less than or equal to the capacity, c of link e? for all e?.

Abstract: Various exemplary embodiments relate to a method of online segment routing in a network having an ingress node, an egress node, and a plurality of links, l. The method may include determining for a plurality of links l dual weights ?(l); receiving a new flow; determining an intermediate node k providing a minimum weight two segment path from the ingress node to egress node for the new flow based upon the flow that results on link l from the new flow through intermediate node k and the dual weight values ?(l) for the links l; and routing the new flow to the intermediate node k along the minimum weight path when the minimum weight path has a weight less than or equal to one.

Abstract: Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.

Abstract: A method and a system are disclosed for making available telecommunication network resources associated with network subscribers and exposed by a Network Service Gateway (NSG) to clients of the NSG services based on stored subscriber availability preferences. The method and system can be implemented using an availability Policy Server that sits next to or inside of the NSG. The Policy Server interprets the stored availability preferences of subscribers in response to requests for subscriber information. These availability preferences are translated into a low-level policy rule language. The Policy Server implements a policy rule evaluator to evaluate policies written in this language. Policies written in the low-level language are referred to as aPolicies (availability policies). An aPolicy receives as input a stream of events. Based on these events, the aPolicy may decide to take one or more actions. The NSG or clients of the NSG will carry out the execution of the actions.

Abstract: A method and a system for supporting rendezvous based instant group conferencing among mobile users allows a conference originator to initiate and setup instant group conferencing to a set of participants even when the participants may not be immediately available to commit to the conference call at the time of its initiation. All negotiations for obtaining commitments from the participants are performed by the system, thus relieving the originator of the time consuming task of negotiating with the participants. The system automatically decides as to when to actually dial out to the participants to setup the conference call after obtaining commitment from all (or a quorum of) required participants.

Abstract: A system and related method for supporting non-intrusive and effective voice communication among mobile users in which voice calls between mobile users are managed based on callee availability, caller-callee relationships, and non-intrusive information exchange, including interactive exchange at the time of call setup but prior to the call being answered. Callee availability can be based on callee device status, calendar activities, location, past behavior and other factors. The caller-callee relationships specify whether the callee is available, unavailable or on restricted availability relative to the caller. The interactive exchange can be implemented using voice and/or text/graphic displays on caller and callee mobile device. Callees are provided with options for handling the call. Callers are provided with information regarding the callee's current and future availability and willingness to receive a voice call from the caller, thus maximizing the chance of caller reaching the callee on every voice call.

Abstract: A system and related method for supporting non-intrusive and effective voice communication among mobile users in which voice calls between mobile users are managed based on callee availability, caller-callee relationships, and non-intrusive information exchange, including interactive exchange at the time of call setup but prior to the call being answered. Callee availability can be based on callee device status, calendar activities, location, past behavior and other factors. The caller-callee relationships specify whether the callee is available, unavailable or on restricted availability relative to the caller. The interactive exchange can be implemented using voice and/or text/graphic displays on caller and callee mobile device. Callees are provided with options for handling the call. Callers are provided with information regarding the callee's current and future availability and willingness to receive a voice call from the caller, thus maximizing the chance of caller reaching the callee on every voice call.

Abstract: A methodology for making joint channel and routing assignments in multi-radio wireless mesh networks that takes into account interference constraints, the number of channels in a network and the number of radio available at each mesh router, and maximizes bandwidth allocation subject to fairness constraints. In particular, the methodology provides for routing, channel assignment and link scheduling in multi-radio mesh wireless networks utilizing a constant factor approximation technique that models the interference and fairness constraints and is able to account for the number of radios at each of the wireless nodes of a wireless mesh network.

Abstract: Congestion in connection-oriented data networks is alleviated by simulating the rerouting of circuits to uncongested parts of the network and then rerouting such circuits in a manner that causes little, or no, disruption to other parts of the network.

Abstract: Method and apparatus for provisioning a protection pathway of a link joining a first point in a network and a second point in the network. The method includes the step of determining a shortest path between the first point and the second point in a protection graph, computing a length of said shortest path, determining if said link should be added to the protection graph according to said computed length and setting the shortest path in the protection graph as protection path for said link. The second step of determining includes evaluating the protection graph to determine if there no existing path or an existing path that is longer than a hop limit. Based on this evaluation, the method either adds the link or makes no change to the protection graph.

Abstract: Improved network design techniques are provided. More particularly, the invention provides network design techniques that support fast restoration. In one aspect of the invention, a technique for designing a protection capacity to be reserved in a network comprises the following steps/operations. Link capacities associated with a network topology and existing working traffic in the network are obtained. Capacity partitions are determined for links in the network topology. Each of at least a portion of the capacity partitions comprise a protection capacity portion and a working capacity portion that equals or exceeds the existing working traffic on a corresponding link, such that upon a failure on the link, the working traffic on the link is rerouted over a pre-provisioned detour path using the protection capacity portion on one or more links on the detour path. Further, the capacity partition determination step/operation substantially guarantees protection for existing working traffic in the network.

Abstract: Improved network design techniques are provided. More particularly, the invention provides network design techniques for pre-provisioning networks to support fast restoration with minimum overbuild. In one aspect of the invention, a technique for designing a protection capacity to be reserved in a network comprises the following steps/operations. One or more link capacities associated with a network topology are obtained, wherein the network is assumed to have no pre-existing working traffic. A capacity partition is determined for at least one link in the network topology, the capacity partition comprising a working capacity portion and a protection capacity portion, the protection capacity portion being reserved for rerouting working traffic upon a failure. The capacity partition determination step/operation enables control over the number of backup tunnels, associated with the at least one link, on which working traffic can be rerouted.