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 subject disclosure relates to a method for instantiating cloud resources that are provided as service virtual machines. In one embodiment, a cloud service management system maps each one of the multiple abstraction layer slots to a virtual context of a logical resource. The virtual context is hosted by a respective virtual machine that is part of a pool of virtual machines. The system identifies an available abstraction slot from the multiple abstraction layer slots and reserves the slot so that the corresponding virtual context of the logical resource can be served to a requesting device. The system then marks the available abstraction layer slot as unavailable. Systems and computer readable media are also provided.

Abstract: A method, computer environment and cloud server configured to facilitate communication among plural networks established in the cloud server. The cloud server (400) includes hardware components (802) configured to process and store information; a hypervisor (430) configured to run on the hardware components (802) and also configured to provide a virtual platform in a kernel space (404); a first virtual machine (410) running on the virtual platform in a user space (402); a first L2aaS network (414) connected to the first virtual machine (410), the first L2aaS network (414) being located in the kernel space (404); a second virtual machine (416) running on the virtual platform in the user space (402); a second L2aaS network (418) connected to the second virtual machine (416), the second L2aaS network (418) being located in the kernel space (404); and a virtual router (424) located in the kernel space (404) and connected to the first L2aaS network (414) and the second L2aaS network (418).

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: 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: Presented are methods for performing a constant time flow lookup utilizing parallel processing technology. The methods are suitable for multiprocessor and/or multi-core processor computing environments. The method generates hash table driven tables of exact flow matching patterns and then provides the generated tables to parallel processing based flow selection procedure that iteratively finds the highest priority flow from the exact flow matching patterns. The method is scalable based on the linear relationship between the number of processors and/or processor cores and the time required to perform the lookup. The method is also portable because it does not require any special or custom hardware typically associated with this type of lookup.

Abstract: In one aspect, the present invention comprises a method or methods for introducing ad insertion and ad management into operator networks (Core Network or Radio Access Network), thereby improving ad management capabilities and avoiding the need for the operator to share internal network or UE information with third parties. In one or more embodiments, the contemplated method(s) and supporting apparatuses are applicable to scenarios where the network operator and a third-party ad provider have an agreement and where they do not.

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: 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: 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 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: Presented are methods for performing a constant time flow lookup utilizing parallel processing technology. The methods are suitable for multiprocessor and/or multi-core processor computing environments. The method generates hash table driven tables of exact flow matching patterns and then provides the generated tables to parallel processing based flow selection procedure that iteratively finds the highest priority flow from the exact flow matching patterns. The method is scalable based on the linear relationship between the number of processors and/or processor cores and the time required to perform the lookup. The method is also portable because it does not require any special or custom hardware typically associated with this type of lookup.