Abstract: Aspects of the disclosure are directed to a low-latency, low-overhead fault tolerant remote memory framework, which packs similar-size in-memory objects into individual page-aligned spans and applies erasure coding on these spans. The framework fully utilizes efficient one-sided remote memory accesses (RMAs) to swap spans in and out using minimal network input/outputs (I/Os), with compaction techniques that reduce remote memory fragmentation. The framework can achieve lower tail latency and higher application performance compared to other fault tolerance solutions, at the cost of potentially more memory usage.

Abstract: Performance issues in a service function chain having a plurality of resources and a plurality of network functions each having a network function queue are diagnosed. Each network function queue is monitored and queueing information for input packets for each of the plurality of network functions is dumped to a data store. Each resource that is under contention is identified as well as which of the network functions is a contender for the resources. A diagnosing algorithm is used to diagnose performance problems and an impact graph for each victim packet is generated. A summary of results as a list of rules is then provided.

Abstract: A processing system including at least one processor may obtain a time series of measurement values from a communication network and train a prediction model in accordance with the time series of measurement values to predict future instances of an event of interest, where the time series of measurement values is labeled with one or more indicators of instances of the event of interest. The processing system may then generate a deterministic finite automaton based upon the prediction model, convert the deterministic finite automaton into a rule set, and deploy the rule set to at least one network component of the communication network.

Abstract: Performance issues in a service function chain having a plurality of resources and a plurality of network functions each having a network function queue are diagnosed. Each network function queue is monitored and queueing information for input packets for each of the plurality of network functions is dumped to a data store. Each resource that is under contention is identified as well as which of the network functions is a contender for the resources. A diagnosing algorithm is used to diagnose performance problems and an impact graph for each victim packet is generated. A summary of results as a list of rules is then provided.

Abstract: Performance issues in a service function chain having a plurality of resources and a plurality of network functions each having a network function queue are diagnosed. Each network function queue is monitored and queueing information for input packets for each of the plurality of network functions is dumped to a data store. Each resource that is under contention is identified as well as which of the network functions is a contender for the resources. A diagnosing algorithm is used to diagnose performance problems and an impact graph for each victim packet is generated. A summary of results as a list of rules is then provided.

Abstract: The invention provides a packet loss detection system that in near-real time detects packet loss and reports the identities of the lost packets. The identities of the lost packets are based on a set of packet-specific information that includes five-tuple flow information of the packet and other unique packet identifiers. A set of meters are placed at various vantage points in the network, each meter generates digests summarizing all the traffic passing through itself The digests are exported to a collector/analyzer, which decodes the digests and performs an analysis to detect packet losses and to determine the lost packets' identities. The collector compares between the traffic digests generated by all the meters surrounding the segment. Mismatches among the digests indicate packet losses. The collector restores the identifiers of the lost packets by further decoding the mismatches between the digests.

Abstract: The invention provides a packet loss detection system that in near-real time detects packet loss and reports the identities of the lost packets. The identities of the lost packets are based on a set of packet-specific information that includes five-tuple flow information of the packet and other unique packet identifiers. A set of meters are placed at various vantage points in the network, each meter generates digests summarizing all the traffic passing through itself. The digests are exported to a collector/analyzer, which decodes the digests and performs an analysis to detect packet losses and to determine the lost packets' identities. The collector compares between the traffic digests generated by all the meters surrounding the segment. Mismatches among the digests indicate packet losses. The collector restores the identifiers of the lost packets by further decoding the mismatches between the digests.

Abstract: The invention provides a packet loss detection system that in near-real time detects packet loss and reports the identities of the lost packets. The identities of the lost packets are based on a set of packet-specific information that includes five-tuple flow information of the packet and other unique packet identifiers. A set of meters are placed at various vantage points in the network, each meter generates digests summarizing all the traffic passing through itself. The digests are exported to a collector/analyzer, which decodes the digests and performs an analysis to detect packet losses and to determine the lost packets' identities. The collector compares between the traffic digests generated by all the meters surrounding the segment. Mismatches among the digests indicate packet losses. The collector restores the identifiers of the lost packets by further decoding the mismatches between the digests.

Abstract: A network configuration that supports latency-equalization (LEQ) routing by effectively “storing” packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes.

Abstract: A network configuration that supports latency-equalization (LEQ) routing by effectively “storing” packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes.