Telefonaktiebolaget Lm Ericsson (publ)

Kjell Nyström

Thomas Johansson

Lars-Örjan Kling

Hareesh Puthalath

Stefan Hellkvist

Thomas Stig Johansson

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

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

Growing community of inventors

Trångsund, Sweden

Kjell Nyström