Abstract: System, method, and software for detecting anomalies in data generated by microservices. In one embodiment, an anomaly detector collects performance metrics for a microservice deployed in a data center for an application. The anomaly detector transforms the performance metrics into a time-series structured dataset for the microservice, and feeds the structured dataset to a machine learning system to determine whether an anomaly exists in the structured dataset based on an anomaly detection model. The anomaly detector performs an anomaly classification with the machine learning system based on an anomaly classification model and the structured dataset when an anomaly is detected in the structured dataset, and performs an action based on the anomaly classification.

Abstract: Packet-processing circuitry including one or more flow caches whose contents are managed using a cache-entry replacement policy that is implemented based on one or more updatable counters maintained for each of the cache entries. In an example embodiment, the implemented policy enables the flow cache to effectively catch and keep elephant flows by giving to the caught elephant flows appropriate preference in terms of the cache dwell time, which can beneficially improve the overall cache-hit ratio and/or packet-processing throughput. Some embodiments can be used to implement an Open Virtual Switch (OVS). Some embodiments are advantageously capable of implementing the cache-entry replacement policy with very limited additional memory allocation.

Abstract: A machine-implemented method of constructing multidimensional constellations having increased minimum distances between the constellation symbols thereof compared to those of comparable conventional constellations, e.g., QPSK and QAM constellations. An example multidimensional constellation so constructed may have eight or more dimensions and may be mapped onto degrees of freedom selected from, e.g., time, space, wavelength, polarization, and the in-phase and quadrature-phase components, of the optical field. The disclosed method is beneficially used to generate multidimensional modulation formats characterized by constant total optical transmit power per modulation time slot and/or applicable to the transmission of multidimensional constellation symbols having separate parts thereof primarily carried by different respective guided modes of the optical fiber. Example methods and apparatus for implementing such multidimensional modulation formats are also disclosed herein.

Abstract: Packet-processing circuitry including one or more flow caches whose contents are managed using a cache-entry replacement policy that is implemented based on one or more updatable counters maintained for each of the cache entries. In an example embodiment, the implemented policy enables the flow cache to effectively catch and keep elephant flows by giving to the caught elephant flows appropriate preference in terms of the cache dwell time, which can beneficially improve the overall cache-hit ratio and/or packet-processing throughput. Some embodiments can be used to implement an Open Virtual Switch (OVS). Some embodiments are advantageously capable of implementing the cache-entry replacement policy with very limited additional memory allocation.

Abstract: Various embodiments relate to a method for accelerating blockchains, the method comprising the steps of waiting for an event to occur, receiving a block, determining whether the block is valid, adding the block to a block tree, determining whether the block is a singular candidate, starting a timer for the block, determining whether the timer has expired for the block, determining whether the block is still singular after the time has expired for the block and processing the singular block.

Abstract: A machine-implemented method of constructing multidimensional constellations having increased minimum distances between the constellation symbols thereof compared to those of comparable conventional constellations, e.g., QPSK and QAM constellations. An example multidimensional constellation so constructed may have eight or more dimensions and may be mapped onto degrees of freedom selected from, e.g., time, space, wavelength, polarization, and the in-phase and quadrature-phase components, of the optical field. The disclosed method is beneficially used to generate multidimensional modulation formats characterized by constant total optical transmit power per modulation time slot and/or applicable to the transmission of multidimensional constellation symbols having separate parts thereof primarily carried by different respective guided modes of the optical fiber. Example methods and apparatus for implementing such multidimensional modulation formats are also disclosed herein.

Abstract: System, method, and software for detecting anomalies in data generated by microservices. In one embodiment, an anomaly detector collects performance metrics for a microservice deployed in a data center for an application. The anomaly detector transforms the performance metrics into a time-series structured dataset for the microservice, and feeds the structured dataset to a machine learning system to determine whether an anomaly exists in the structured dataset based on an anomaly detection model. The anomaly detector performs an anomaly classification with the machine learning system based on an anomaly classification model and the structured dataset when an anomaly is detected in the structured dataset, and performs an action based on the anomaly classification.

Abstract: Various embodiments relate to a method for managing information in a database. The method includes injecting a transaction into a first blockchain and injecting the transaction into a second blockchain, where the first blockchain and the second blockchain are in a same blockchain network. The first blockchain processes the transaction based on a first set of rules and the second blockchain processes the transaction based on a second set of rules different from the first set of rules. The second blockchain is a private blockchain that excludes one or more participants of the first blockchain.

Abstract: An optical data receiver includes optical hybrids, light detectors and a digital signal processor. Each optical hybrid outputs mixtures of a corresponding one of the polarization components of a received data-modulated optical carrier with reference light. Each light detector outputs digital measurements of the mixtures from a corresponding one of the optical hybrids. The digital signal processor identifies data symbols of a constellation having parts transmitted on both polarization components of the data-modulated optical carrier responsive to receipt of the digital measurements. The transmitted data-modulated optical carrier has about a same total light intensity in each modulation time slot thereof. Each data symbol is defined by in-phase and quadrature-phase electric field coordinates of both polarization components. Pairs of in-phase and quadrature-phase electric coordinates of each of the polarization components are on a preselected set of one or more concentric circles about an origin.

Abstract: An optical data receiver includes optical hybrids, light detectors and a digital signal processor. Each optical hybrid outputs mixtures of a corresponding one of the polarization components of a received data-modulated optical carrier with reference light. Each light detector outputs digital measurements of the mixtures from a corresponding one of the optical hybrids. The digital signal processor identifies data symbols of a constellation having parts transmitted on both polarization components of the data-modulated optical carrier responsive to receipt of the digital measurements. The transmitted data-modulated optical carrier has about a same total light intensity in each modulation time slot thereof. Each data symbol is defined by in-phase and quadrature-phase electric field coordinates of both polarization components. Pairs of in-phase and quadrature-phase electric coordinates of each of the polarization components are on a preselected set of one or more concentric circles about an origin.

Abstract: We disclose a signal-routing method directed at improving the throughput of an optical network by taking into account the fiber nonlinearity in the process of solving a joint signal-routing and power-control problem for the optical network. Based on the obtained solution, a network controller may set the signal-routing configurations of the various network nodes and the optical gains of the various optical amplifiers to enable the optical network to carry the traffic in a manner that results in a higher throughput than that achievable with the use of conventional signal-routing and/or power-control methods.

Abstract: We disclose a signal-routing method directed at improving the throughput of an optical network by taking into account the fiber nonlinearity in the process of solving a joint signal-routing and power-control problem for the optical network. Based on the obtained solution, a network controller may set the signal-routing configurations of the various network nodes and the optical gains of the various optical amplifiers to enable the optical network to carry the traffic in a manner that results in a higher throughput than that achievable with the use of conventional signal-routing and/or power-control methods.

Abstract: Various embodiments provide a method and apparatus for allocating resources to processes by using statistical allocation based on the determined maximum average resource demand at any time across all applications (“ ?”), and the determined maximum resource demand at any time by any application (“C”). In particular, resource allocation includes an auto-scaling scheme based on ? and C.

Abstract: A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.

Abstract: A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.

Abstract: The system for scheduling advertisements includes at least one ad bidder and an ad scheduler. The ad bidder is configured to receive bidding information for a plurality of ads from one or more advertisers. The bidding information for each ad includes at least one target profile information and a bid associated with the target profile information. The bid indicates expected revenue for showing the ad to a viewer having actual profile information corresponding to the target profile information associated with the bid. The ad scheduler is configured to schedule which of the plurality of ads is received by which of a plurality of viewers based on the actual profile information of the plurality of viewers and the bidding information such that an ad scheduled for one of the plurality of viewers is influenced by a correspondence of the scheduled ad to others of the plurality of viewers.

Abstract: Example embodiments provide scheduling a plurality of ads to be shown to a plurality of viewers of a multimedia network. One example embodiment includes determining target view rates for each of the plurality of ads based on expected revenue associated with each of the plurality of ads, determining, for each of the plurality of ads, a queue value based on a target view rate and an actual view rate associated with the ad, the actual view rate being a number of views of the ad in a previous time slot, and selectively showing ads, from among the plurality of ads, to the plurality of viewers based on the queue values.

Abstract: The present invention relates to a system and method for managing user profiles based on keyword content associated with a user. The user associated keyword content represents a website requested by the user or video data viewed by the user, in which the user profile is created and maintained at the customer premise equipment as opposed to the network infrastructure associated with the service provider. For example, the system includes a customer premise equipment (CPE) configured to create a user profile. The user profile includes at least one keyword representing keyword content associated with the user and at least one score representing importance of a corresponding keyword.

Abstract: The invention includes a method and apparatus for determining a routing table for use in a network comprising a plurality of type-one nodes and a plurality of type-two nodes where the type-two nodes use respective type-two routing tables having one next-hop node associated with each of a plurality of destination nodes of the network. The method includes obtaining, from the type-one nodes and the type-two nodes, link status information associated with each of a plurality of links of the network, obtaining traffic measurement information from the type-one nodes and the type-two nodes, and determining, using the link status and traffic measurement information, type-one routing tables for the respective type-one nodes. The type-one routing tables are determined as a group in a substantially coordinated manner, and each type one routing table includes a plurality of next-hop nodes associated with each of the destination nodes.

Abstract: A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.