Telefonaktiebolaget Lm Ericsson (publ)

Lars-Örjan Kling

Hareesh Puthalath

Stefan Hellkvist

Tomas Holm

Robert Bengt Skog

Thomas Johansson

Anders K Eriksson

Per Anders Holmberg

Kjell Nyström

Kjell G Torkelsson

Erlendur Karlsson

Bo Arne Astrom

Thomas L Lindquist

Jonas Bertil Bjurel

Sten E Johnson

Andreas Cleverdal

Johan Ditmar

Carl Ålund

Qiang Li

Johan Christer Johansson

Ioannis Fikouras

Joerg Niemoeller

Bo Åström

Bjorn E Jonsson

Oleg Avsan

Terje Egeland

Håkan Otto Ahl

Nikhil Tikekar

Robert E Penny

H&auml;kan O Ahl

Yonghui Jin

Ake Lindholm

Hákan Otto Ahl

Anders Eriksson

Staffan ÅLund

Jonas Bjurel

Thomas Stig Johansson

Sten Edward Johnson

M Indian Inst Of Tech Powai Sohoni

Method and arrangement for supporting connectivity of a wireless device to a network infrastructure. An infrastructure provider associates a set of device identification numbers to a first radio access provider in a subscription database of the infrastructure provider. The infrastructure provider also sets the first radio access provider as a preferred roaming partner in a SIM that comprises a subscriber identifier with a network identifier of the infrastructure provider. The SIM is provided for use in the device, to enable access to the network infrastructure over a radio access network of the first radio access provider based on the subscriber identifier and the preferred roaming partner in the SIM.

Method and arrangement for connectivity in a communication network

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

Local media rendering of a multi-party call, performed by a Client User Equipment. The media is encoded by each party in the call, and sent as a media stream to a Media server, and the media server receives a request for media streams from each Client User Equipment, each media stream in the request associated with a client priority. The Media server selects the media streams to send to each Client User Equipment, based on the request, and further such that the number of streams does not exceed a determined maximum number, which is based, e.g., on the available bandwidth.

Local media rendering

Apparatus for operating as a server node within a private IP network to host or aggregate a plurality of resources. The apparatus comprises an address controller for obtaining a private IP network IP address, for allocating a server node port number to said resources, and for causing the server node to listen on that server node port. A resource configurator is provided for determining for each of said resources a resource private Uniform Resource Identifier, URI, or URI path together with resource metadata, and for sending to a gateway, interconnecting the private IP network with a public IP network, an advertisement containing said private URI or URI path and respective resource metadata. The apparatus further comprises a resource request receiver for receiving requests at said server node port, for identifying private URIs or URI paths included within the requests, and for delivering resources corresponding to said URI or URI paths.

Enabling external access to multiple services on a local server

A method of allowing a data connection between a first node attached to a private IP network and a second node external to the private IP network and connected to a public IP network. The method comprises allocating a private network IP address, a hostname, and a service name to said first node, the service name associated with a service provided by the first node. A gateway allocates a unique public network side port number to the first node. A mapping between the private network IP address and public network side port is included in a connection table. Records are installed in a Domain Name System of the public IP network that include: a service record defining said hostname and public network side port number as the location for said service name; and an address record defining a public IP address of said gateway as the location for said hostname.

Routing traffic towards a mobile node

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

The invention involves local media rendering of a multi-party call, performed by a Client User Equipment (). The media is encoded by each party in the call, and sent as a media stream to a Media server (), and the media server receives a request for media streams from each Client User Equipment, each media stream in the request associated with a client priority. The Media server selects the media streams to send to each Client User Equipment, based on the request, and further such that the number of streams does not exceed a determined maximum number, which is based e.g. on the available bandwidth.

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.

A method and a streaming server for timely delivering of frames/packets to a client. The method includes fetching of stream data from an operating cog in a calendar wheel and by use of the fetched stream data the frame/packet indicated in the operating cog is transmitted from its location in a video storage to the client. The stream data includes information on stream, movie and frame. Optionally also information on packet is provided.

Precise delivering of frames for video on demand streaming

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

A method and compiler for compiling hierarchical command based policy rules to a flat filter list structure adapted for storage in a Content Addressable Memory (CAM), wherein the policy rules are organized in a tree-structure of classifiers. First, all of the possible search paths in the tree structure are found, and then only the valid search paths according to defined criteria are added to the flat filter list. The CAM may be a Ternary Content Addressed Memory.

Compiling method for command based router classifiers

The present invention relates to a telecommunications node () that is able to handle IP-traffic and to terminate telecommunications traffic, which node includes means for simple and effective load distribution between resources (-) in the node. The inventive telecommunications node () includes board internal IP-subnets () with associated subnet interfaces () having interface addresses and a distributed forwarding engine structure where every device board () associated with the handling of IP-traffic is provided with a forwarding engine (-). Each board internal IP-subnet () is associated with at least one predetermined node resource (-) for processing telecommunications traffic, thereby enabling a resource manager () to perform load distribution by ordering a destination address for a selected stream of IP-traffic, which is to terminate in the node, to be based on the interface address associated with a selected board internal IP-subnet ().

Method and apparatus for forwarding of telecommunications traffic

Signal elements are mapped to a limited range of identifiers by emulating a 'virtual' space of identifiers larger than the real limited space of identifiers. The larger virtual identifier space is implemented by an intermediate memory, which provides storage of identifiers assigned from the real space of identifiers. For each signal element to be mapped to an identifier, the intermediate memory is addressed by a hash value calculated from at least part of the signal element, thus allowing access to an identifier. The larger virtual space gives a better distribution of signal elements to the identifiers; and reduces the probability of different signal elements being mapped to the same identifier ('clashing'). For an efficient reduction of the clashing probability, identifiers with a low probability of being active are assigned to the intermediate memory to represent new signal elements.

Efficient mapping of signal elements to a limited range of identifiers

The present invention relates to a method for storing arbitrarily wide expressions () in a set of Content Addressable Memory (CAMs) elements () where each CAM element is of lesser width than the expression (). The CAM element may be a physical CAM or part of a physical CAM. The invention also relates to a method for searching wide expressions in such sets of CAM elements (). The invention further relates to a device and a computer program for performing the method.

Growing community of inventors

Södertälje, Sweden

Lars-Örjan Kling