Telefonaktiebolaget Lm Ericsson (publ)

Cisco Technology, Inc.

Hareesh Puthalath

Bob Melander

Stefan Hellkvist

Lars-Örjan Kling

Azimeh Sefidcon

Ayodele Damola

Andreas Johnsson

Thomas Johansson

Kjell Nyström

Enrique Eduardo Fernández Casado

Enrique Eduardo Fernandez Casado

Vinay Yadhav

Rerngvit Yanggratoke

Enrique Eduardo FERNÁNDEZ Casado

Kling Lars-ÖRjan

Nyström Kjell

Apparatuses and methods enable connecting tunnels channeling data flow from a user terminal and to a mobile network through a virtual switch in a network device which is configured to provide a service by processing data in the data flow. A method performed by a device having one or more processors includes establishing a first tunnel between the device and a node of the mobile network, and a second tunnel between the device and another network device of the mobile network, the first tunnel and the second tunnel operating according to Internet protocols. The method further includes connecting the first tunnel to the second tunnel using a virtual switch running on the device, and connecting a virtual machine running on the device to the virtual switch, the virtual machine being configured to provide a service by processing data in the data flow.

Apparatuses and methods related to connecting tunnels through a virtual switch

A method, computer environment and cloud server configured to facilitate communication among plural networks established in the cloud server. The cloud server () includes hardware components () configured to process and store information; a hypervisor () configured to run on the hardware components () and also configured to provide a virtual platform in a kernel space (); a first virtual machine () running on the virtual platform in a user space (); a first L2aaS network () connected to the first virtual machine (), the first L2aaS network () being located in the kernel space (); a second virtual machine () running on the virtual platform in the user space (); a second L2aaS network () connected to the second virtual machine (), the second L2aaS network () being located in the kernel space (); and a virtual router () located in the kernel space () and connected to the first L2aaS network () and the second L2aaS network (). The virtual router () is configured to provide router functionality between the first and second L2aaS networks ().

Layer 3 service implementation in cloud servers and method

An application, interface, device and method for coordinating a parameter across cloud domains of various distributed data centers. The method includes using an infrastructure service for generating one or more values of the parameter so that the values are different from each other; and providing the values to the respective cloud domains.

Method and architecture for distributed cloud domains

The application relates to a method and a system () for deploying cloud services to a cloud computing network () where the cloud services are to be provided to mobile cloud customers. Current cloud services are not optimized to take into account cloud service customers that are mobile which results in inefficient use of the transmission resources in the network. The problem is solved by a method and a system () for pre-deploying the required cloud service to a feasible cloud service processing environment (-) that is closest to the location where the cloud customer (-) plans to be at a certain estimated time of arrival and duration.

Method and system for cloud service deployment

The subject disclosure relates to a method for scheduling logical resources in cloud platforms. A cloud platform system identifies resource candidates for hosting a logical resource of a cloud service. The system filters the resource candidates by running them through a filter chain, a collection of serially connected filters. The filter chain may contain one or more reference filters that reference other filter chains. When the resource candidates encounter one of the reference filters, the other filter chains can be triggered and processed. The system selects one or more resources for hosting the logical resource from the filtered resource candidates.

Collaborative inter-service scheduling of logical resources in cloud platforms

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.

Method and node entity for enhancing content delivery network

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.

Dynamic cache selection method and system

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.

Method and node for distributing electronic content in a content distribution network

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 [C] that reflects a topology of the communication network and a dynamic cost [&#x394;] 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.

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.

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.

Method and node for finding content in a content distribution network, and method for creating a virtual representation of a content distribution network

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.

Growing community of inventors

Stockholm, Sweden

Hareesh Puthalath