Abstract: A secure update is provided from a server to an end-point device. The server registers digital information, such as a name or a software package, and a verifiable key, such as a cryptographic hash, derived from the digital information. A publicly accessible transaction log stores the verifiable key in a block and provides an identifier of the block to the server. An end-point device receives the digital information and the identifier, and computes a separate verifiable key. The end-point device retrieves the verifiable key from the block of the publicly accessible transaction log, and compares the retrieved verifiable key to the separate verifiable key to determine whether the digital information has been compromised.

Abstract: A secure update is provided from a server to an end-point device. The server registers digital information, such as a name or a software package, and a verifiable key, such as a cryptographic hash, derived from the digital information. A publicly accessible transaction log stores the verifiable key in a block and provides an identifier of the block to the server. An end-point device receives the digital information and the identifier, and computes a separate verifiable key. The end-point device retrieves the verifiable key from the block of the publicly accessible transaction log, and compares the retrieved verifiable key to the separate verifiable key to determine whether the digital information has been compromised.

Abstract: The disclosed apparatuses and methods are directed to embedding of virtual links in an optical network. The method comprises: receiving an adaptation request for a virtual link within a virtual network embedded on an optical substrate network; generating a plurality of candidate embeddings based on a topology of the substrate network and a current embedding of the virtual link, each candidate embedding satisfying the adaptation request; determining a total cost of each candidate embedding based on a disruption cost of the candidate embedding; and selecting, as a new embedding, a candidate embedding from the plurality of candidate embeddings in accordance with the determined total cost of the selected candidate embedding.

Abstract: The disclosed apparatuses and methods are directed to embedding of virtual links in an optical network. The method comprises: receiving an adaptation request for a virtual link within a virtual network embedded on an optical substrate network; generating a plurality of candidate embeddings based on a topology of the substrate network and a current embedding of the virtual link, each candidate embedding satisfying the adaptation request; determining a total cost of each candidate embedding based on a disruption cost of the candidate embedding; and selecting, as a new embedding, a candidate embedding from the plurality of candidate embeddings in accordance with the determined total cost of the selected candidate embedding.

Abstract: The disclosed s, structures, and methods are directed to a method and a system for embedding a virtual network onto the substrate optical network comprising embedding the plurality of virtual nodes onto the plurality of substrate nodes in accordance with the plurality of location constraints, computing end-to-end latency associated with a plurality of substrate paths connecting a source substrate node and a destination substrate node, wherein the plurality of substrate paths contain the plurality of substrate links and the plurality of substrate nodes, and embedding a virtual link connecting a source virtual node and a destination virtual node onto the one of the plurality of substrate paths connecting the source substrate node and the destination substrate node, wherein the end-to-end latency associated with the one of the plurality of substrate paths is less than or equal to a maximum allowable latency for the virtual link.

Abstract: The disclosed s, structures, and methods are directed to a method and a system for embedding a virtual network onto the substrate optical network comprising embedding the plurality of virtual nodes onto the plurality of substrate nodes in accordance with the plurality of location constraints, computing end-to-end latency associated with a plurality of substrate paths connecting a source substrate node and a destination substrate node, wherein the plurality of substrate paths contain the plurality of substrate links and the plurality of substrate nodes, and embedding a virtual link connecting a source virtual node and a destination virtual node onto the one of the plurality of substrate paths connecting the source substrate node and the destination substrate node, wherein the end-to-end latency associated with the one of the plurality of substrate paths is less than or equal to a maximum allowable latency for the virtual link.

Abstract: Some aspects and embodiments of the present invention provide effective mechanisms for provisioning virtual networks on communication networks. In particular some aspects and embodiments provide an effective mechanism for embedding a virtual network into a multi-layered substrate network which utilizes a different communication technology at each layer. One such example is an IP network overlaid over an optical network, such as an OTN network. Embodiments jointly determine the assignment of virtual nodes and virtual links. Assigning the nodes and links together can provide for a more optimal solution than assigning the nodes and the links separately. Some embodiments generate a collapsed graph which includes the optical network and the IP network in a single layer. Accordingly some embodiments jointly determine the assignment of virtual nodes and virtual links within such a collapsed graph, which can provide more optimal assignments than considering assignments within each layer separately.

Abstract: Network Virtualization can be used to map a virtual network (VN) on a substrate network (SN) while accounting for possible substrate failures, known as the Survivable Virtual Network Embedding (SVNE) problem. The VN can be equipped with sufficient spare backup capacity to sustain the Quality of Service during substrate failures, and the resulting VN may be equipped accordingly. The present application discloses jointly optimizing spare backup capacity allocation and embedding a VN to provide full bandwidth in the presence of a single substrate link failure. A solution may be formulated as a Quadratic Integer Program that can be further transformed into an Integer Linear Program, or as a heuristic.

Abstract: The disclosed systems, structures, and methods are directed to a method for embedding the virtual network onto the elastic optical network comprising embedding the plurality of virtual nodes onto the plurality of substrate optical nodes in accordance with the plurality of location constraints provisioning the primary bandwidth demand associated with one of the plurality of virtual links connecting a source virtual node to a destination virtual node onto a plurality of disjoint substrate paths connecting a source substrate optical node and a destination substrate optical node, and embedding the one of the plurality of virtual links connecting the source virtual node to the destination virtual node onto the plurality of disjoint substrate paths connecting the source substrate optical node and the destination substrate optical node.

Abstract: A method for failure recovery in a virtual network environment including a virtual network having virtual nodes and virtual links mapped onto substrate nodes and substrate paths, respectively, of a substrate network, the method comprising, in response to an indication of failure of at least one substrate node in the substrate network: re-mapping a virtual node mapped to a failed substrate node to a selected substrate node other than the failed substrate node; and re-mapping a virtual link mapped to a substrate path that involves the failed substrate node to a substrate path that does not involve the failed substrate node; wherein the re-mapping is carried out to achieve at least one re-mapping objective.

Abstract: A secure update is provided from a server to an end-point device. The server registers digital information, such as a name or a software package, and a verifiable key, such as a cryptographic hash, derived from the digital information. A publicly accessible transaction log stores the verifiable key in a block and provides an identifier of the block to the server. An end-point device receives the digital information and the identifier, and computes a separate verifiable key. The end-point device retrieves the verifiable key from the block of the publicly accessible transaction log, and compares the retrieved verifiable key to the separate verifiable key to determine whether the digital information has been compromised.

Abstract: Techniques for virtual network embedding (VNE) with dedicated protection of multiple virtual networks against a single node or link failure are described. The virtual network embedding provides dedicated protection without using redundant substrate network resources for each of the individual virtual networks (VNs) elements.

Abstract: Some aspects and embodiments of the present invention provide effective mechanisms for provisioning virtual networks on communication networks. In particular some aspects and embodiments provide an effective mechanism for embedding a virtual network into a multi-layered substrate network which utilizes a different communication technology at each layer. One such example is an IP network overlaid over an optical network, such as an OTN network. Embodiments jointly determine the assignment of virtual nodes and virtual links. Assigning the nodes and links together can provide for a more optimal solution than assigning the nodes and the links separately. Some embodiments generate a collapsed graph which includes the optical network and the IP network in a single layer. Accordingly some embodiments jointly determine the assignment of virtual nodes and virtual links within such a collapsed graph, which can provide more optimal assignments than considering assignments within each layer separately.

Abstract: Network Virtualization can be used to map a virtual network (VN) on a substrate network (SN) while accounting for possible substrate failures, known as the Survivable Virtual Network Embedding (SVNE) problem. The VN can be equipped with sufficient spare backup capacity to sustain the Quality of Service during substrate failures, and the resulting VN may be equipped accordingly. The present application discloses jointly optimizing spare backup capacity allocation and embedding a VN to provide full bandwidth in the presence of a single substrate link failure. A solution may be formulated as a Quadratic Integer Program that can be further transformed into an Integer Linear Program, or as a heuristic.

Abstract: Disclosed are application-aware packet transmission methods and apparatuses for a terminal. The application-aware packet transmission method comprises classifying applications according to delay sensitivities of the applications, determining a transmission pattern of packets for the classified applications; and transmitting the packets based on the determined transmission pattern. Thus, a battery of the terminal may be efficiently managed by applying user preferences and configuring transmission patterns of packets to be transmitted for each application differently. In addition, degradation of application performances and user experiences for the uses of applications can be prevented.

Abstract: A method for failure recovery in a virtual network environment including a virtual network having virtual nodes and virtual links mapped onto substrate nodes and substrate paths, respectively, of a substrate network, the method comprising, in response to an indication of failure of at least one substrate node in the substrate network: re-mapping a virtual node mapped to a failed substrate node to a selected substrate node other than the failed substrate node; and re-mapping a virtual link mapped to a substrate path that involves the failed substrate node to a substrate path that does not involve the failed substrate node; wherein the re-mapping is carried out to achieve at least one re-mapping objective.

Abstract: Embedding a virtual network onto a physical network may be done in such a manner to ensure that the embedded virtual network maintains connectivity in the event of failure of k links in the physical network. The embedding determines virtual links that must be embedded onto disjoint paths in the physical network and then embeds the virtual network according to ensure the determined virtual links are embedded on disjoint paths.

Abstract: Techniques for virtual network embedding (VNE) with dedicated protection of multiple virtual networks against a single node or link failure are described. The virtual network embedding provides dedicated protection without using redundant substrate network resources for each of the individual virtual networks (VNs) elements.

Abstract: Embedding a virtual network onto a physical network may be done in such a manner to ensure that the embedded virtual network maintains connectivity in the event of failure of k links in the physical network. The embedding determines virtual links that must be embedded onto disjoint paths in the physical network and then embeds the virtual network according to ensure the determined virtual links are embedded on disjoint paths.

Abstract: Disclosed are application-aware packet transmission methods and apparatuses for a terminal. The application-aware packet transmission method comprises classifying applications according to delay sensitivities of the applications, determining a transmission pattern of packets for the classified applications; and transmitting the packets based on the determined transmission pattern. Thus, a battery of the terminal may be efficiently managed by applying user preferences and configuring transmission patterns of packets to be transmitted for each application differently. In addition, degradation of application performances and user experiences for the uses of applications can be prevented.