Abstract: Systems and methods for conducting secure, privacy-preserving, verifiable omic transactions are provided. An omic service may authenticate one or more individual users and store each users omic information as encrypted data, without storing decryption keys, and also ensure fidelity and correct correspondence of each user's data with the user. A dedicated private virtual appliance can be instantiated to obtain encrypted omic data, query each user for decryption keys, decrypt the user omic data, perform an omic calculation, report results and terminate itself, thereby erasing all copies of decrypted user omic data. Alternatively, the appliance can operate with user-managed genome storage. A genome-on-a-stick construct facilitates end user interaction with such omic service providers.

Abstract: Systems and methods for automatically managing the bandwidth requirements of application workloads may include learning the bandwidth requirements using historical data, predicting the required bandwidth for a time interval and provisions the services to deliver the appropriate bandwidth to the applications. Systems and methods for automatically managing the bandwidth requirements of application workloads may also include monitoring for the actual bandwidth requirements of the applications and adapt dynamically to changing requirements.

Abstract: Systems and methods for discovery of a controller in an OpenFlow network may include using an OpenFlow capable switch to discover the controller without the help of other components, such as DHCP. The link discovery protocol may be configured on the switch and the discovery process may use an out-of-band or an in-band communication. In one example, a link discovery protocol packet is sent out of all ports of a switch that meet the eligibility criteria. The response is guaranteed because of a TTL like mechanism in the packet. Each port on a switch that receives this link discovery protocol packet takes an action depending on its current state.

Abstract: A link state information correction scheme is implemented by the present disclosure. In one embodiment, the correction scheme is implemented by a reload logic module that cooperates with link state protocol logic configured on a reload routing element (or routing element that has reloaded or hard restarted). The reload logic module is configured to receive a database descriptor message at a reload routing element, where the database descriptor message is received from a neighbor routing element during an adjacency formation. The reload logic module is also configured to determine whether the database descriptor message identifies a stale version of a link state advertisement (LSA), where the LSA is self-originated by the reload routing element. The reload logic module is also configured to generate a new version of the LSA during the adjacency formation.

Abstract: An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.

Abstract: Systems and methods for verifiable, private and secure omic analysis are provided. Secure multiparty computation techniques can be utilized to enable two parties to perform an omic transaction, such as determining genetic compatibility with one another, by jointly computing a result without either party disclosing their genetic information to the other. Privacy-preserving techniques to ensure authenticity of each party's omic data and metadata are also provided. Personalized matching scores can be computed, in which each party's score is weighted to reflect user preferences associated with the matching analysis.

Abstract: An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.

Abstract: A link state information correction scheme is implemented by the present disclosure. In one embodiment, the correction scheme is implemented by a reload logic module that cooperates with link state protocol logic configured on a reload routing element (or routing element that has reloaded or hard restarted). The reload logic module is configured to receive a database descriptor message at a reload routing element, where the database descriptor message is received from a neighbor routing element during an adjacency formation. The reload logic module is also configured to determine whether the database descriptor message identifies a stale version of a link state advertisement (LSA), where the LSA is self-originated by the reload routing element. The reload logic module is also configured to generate a new version of the LSA during the adjacency formation.