Abstract: A method and a cloud management node for enabling usage of a virtual machine in a distributed cloud of resources for processing and storing of data. When receiving a VM image from a client with a set of files of an operating system for running the virtual machine, the cloud management node distributes the VM image to a plurality of local data centers forming the distributed cloud. In return, the cloud management node receives local identifications of the VM image from the local data centers, and creates a mapping between the received local identifications and a global identification of the VM image. The global identification is then returned to the client, thereby enabling the client to change the VM image in the local data centers by referring to the global identification in communication with the cloud management node.

Abstract: Methods and nodes (200, 202) in a data distribution network, for distributing content to multiple consuming nodes (C1, C2, C3, . . . ). A first node (200) detects (2:2) multiple data flows (2:1b) of a first content from the first node to a second node (202) in the distribution network, when the first node operates as delivering node of the first content for the consuming nodes. The first node then instructs (2:4) the second node to operate as delivering node of the first content for the consuming nodes and redirects (2:5) the consuming nodes to use the second node as delivering node of the first content. The first node further reduces (2:6) the multiple data flows to a common data flow of the first content to the second node. Thereby, efficiency can be improved in the data distribution network by reducing the number of data flows between the first and second nodes.

Abstract: A method, unit and computer program performed by a packet separation unit in a communications network for enabling of data traffic separation comprising: obtaining a traffic rule set from a rule manager, determining a complementary rule related to the traffic rule set, arranging the rules in an hierarchical order such that a received data packet will be evaluated with the rule with the most likeliness to comply with a received data packet, receiving the data packet, directing the data packet to a local shared environment.

Abstract: The invention relates to a network device (10), a system (100) and a method performed by the network device and the system for providing live data streams to content-rendering devices (12a-d). The invention further relates to a computer program (22), and a computer program product (21) comprising computer readable medium having the computer program stored thereon.

Abstract: The present invention provides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable. The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.

Abstract: A method, unit and computer program performed by a packet separation unit in a communications network for enabling of data traffic separation comprising: obtaining a traffic rule set from a rule manager, determining a complementary rule related to the traffic rule set, arranging the rules in an hierarchical order such that a received data packet will be evaluated with the rule with the most likeliness to comply with a received data packet, receiving the data packet, directing the data packet to a local shared environment.

Abstract: There is described a method and apparatus for sending data through one or more packet data networks. A stripped-down packet is sent from a packet sending node towards a cache node, the stripped down packet including in its payload a pointer to a payload data segment stored in a file at the cache node. When the stripped-down packet is received at the cache node, the pointer is used to identify the payload data segment from data stored at the cache node. The payload data segment is inserted into the stripped-down packet in place of the pointer so as to generate a full size packet, which is sent from the cache node towards a client.

Abstract: Node, computer software and method for selecting a resource that is available at multiple caches connected in a communication network. The method includes receiving from a user a request for the resource; identifying one or more caches of the multiple caches that store the resource; determining a total cost associated with a path between the user and each cache of the one or more caches storing the resource, the total cost including a static cost that reflects a topology of the communication network and a dynamic cost which is indicative of changing conditions of the communication network; and selecting one cache from the one or more caches that store the resource based on a lowest total cost of the one cache.

Abstract: Methods and nodes (200, 202) in a data distribution network, for distributing content to multiple consuming nodes (C1, C2, C3, . . . ). A first node (200) detects (2:2) multiple data flows (2:1b) of a first content from the first node to a second node (202) in the distribution network, when the first node operates as delivering node of the first content for the consuming nodes. The first node then instructs (2:4) the second node to operate as delivering node of the first content for the consuming nodes and redirects (2:5) the consuming nodes to use the second node as delivering node of the first content. The first node further reduces (2:6) the multiple data flows to a common data flow of the first content to the second node. Thereby, efficiency can be improved in the data distribution network by reducing the number of data flows between the first and second nodes.

Abstract: A method and apparatus for handing over a terminal connection. A handover request is sent from a source base station to a target base station. A first control message (including a session identifier for identifying the session, and current parameters for the session) is also sent from the source base station to a control server. If the target base station is associated with a cache storage unit containing the content data, a second control message (including a session identifier for identifying the session, and current parameters) is sent from the control server to the target base station. At the target base station, the content data packets are retrieved from the cache storage unit, and a header of each retrieved content data packet is populated with parameters calculated using the received current parameters and session identifier. The content data packets are then sent from the base station towards the terminal.

Abstract: A method and a cloud management node for enabling usage of a virtual machine in a distributed cloud of resources for processing and storing of data. When receiving a VM image from a client with a set of files of an operating system for running the virtual machine, the cloud management node distributes the VM image to a plurality of local data centers forming the distributed cloud. In return, the cloud management node receives local identifications of the VM image from the local data centers, and creates a mapping between the received local identifications and a global identification of the VM image. The global identification is then returned to the client, thereby enabling the client to change the VM image in the local data centers by referring to the global identification in communication with the cloud management node.

Abstract: Node, computer software and method for selecting a resource that is available at multiple caches connected in a communication network. The method includes receiving from a user a request for the resource; identifying one or more caches of the multiple caches that store the resource; determining a total cost associated with a path between the user and each cache of the one or more caches storing the resource, the total cost including a static cost that reflects a topology of the communication network and a dynamic cost which is indicative of changing conditions of the communication network; and selecting one cache from the one or more caches that store the resource based on a lowest total cost of the one cache.

Abstract: There is described a client node for use in a network. The client node comprises a transmitter for requesting data from the network. A processor is operatively connected to the transmitter, and has installed thereon an operating system and an application. A receiver for receiving data from the network is operatively connected to the processor. The application is arranged to request content data from the network by opening a transport socket to the operating system. The operating system is arranged to establish contact with a master peer server in the network, receive a list of sources of the content data from the master peer server through such transport socket signalling, and establish contact with at least one source from the list of sources. The application is arranged to receive the content data from the at least one source without being aware that the content is delivered by at least one source from a list of sources. The list of sources may include nodes in a P2P network.

Abstract: The present invention relates to a method and node for efficiently distributing electronic content in a content distribution network (CDN) comprising a plurality of cache nodes. Embodiments of the present invention include a virtual node logically representing a set of cache nodes. The set of cache nodes is in turn defined based on an internal communication cost between the cache nodes. In each of the cache nodes represented by the virtual node statistics regarding content requests is collected, and based on this statistics it is determined whether specific content is to be cached in the virtual node or not. If it is determined to cache specific content in the virtual node, the specific content may be caused to be cached in one or more of the cache nodes represented by the virtual node.

Abstract: Node, computer software and method for selecting a resource that is available at multiple caches connected in a communication network. The method includes receiving from a user a request for the resource; identifying one or more caches of the multiple caches that store the resource; determining a total cost associated with a path between the user and each cache of the one or more caches storing the resource, the total cost including a static cost [Cf] that reflects a topology of the communication network and a dynamic cost [?] which is indicative of changing conditions of the communication network; and selecting one cache from the one or more caches that store the resource based on a lowest total cost of the one cache.

Abstract: The present invention provides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable. The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.

Abstract: The present invention prdvides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.

Abstract: There is described a method and apparatus for sending data through one or more packet data networks. A reduced size packet is sent from a packet sending node towards a cache node, the reduced size packet including in its payload a pointer to a payload data segment stored in a file at the cache node. When the reduced size packet is received at the cache node, the pointer is used to identify the payload data segment from data stored at the cache node. The payload data segment is inserted into the reduced size packet in place of the pointer so as to generate a full size packet, which is sent from the cache node towards a client.

Abstract: Embodiments of the present invention a method and a node for finding the shortest path to a cache node in a content delivery network (CDN) comprising requested content and a method for creating a virtual representation of a network. According to an embodiment of the present invention, the virtual representation is in the form of a virtual, hierarchical topology, and the cache nodes correspond to the cache nodes of the real network. All cache nodes are arranged at a first level and with the virtual nodes arranged at higher levels. In the virtual representation, all nodes (cache and virtual) are connected with virtual links such that there exist only one path between any two arbitrary cache nodes. Further, costs to the virtual links are assigned such that the path cost between any two arbitrary cache nodes in the virtual representation generally corresponds to the lowest path cost between corresponding cache nodes in the real network.

Abstract: The present invention provides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable. The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.