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: 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.

Abstract: 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.

Abstract: 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.

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: 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 invention involves local media rendering of a multi-party call, performed by a Client User Equipment (1). The media is encoded by each party in the call, and sent as a media stream to a Media server (2), 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.

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: 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.

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 invention involves local media rendering of a multi -party call, performed by a Client User Equipment (1). The media is encoded by each party in the call, and sent as a media stream to a Media server (2), 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.

Abstract: 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.

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 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.

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: 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.

Abstract: The present invention relates to a method for storing arbitrarily wide expressions (31) in a set of Content Addressable Memory (CAMs) elements (33) where each CAM element is of lesser width than the expression (31). 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 (33). The invention further relates to a device and a computer program for performing the method.

Abstract: The present invention relates to multiprocessing systems in which signals or processes are scheduled in order of their priority level. The invention is based on batch-wise acceptance and scheduling of job signals, and utilizes at least one delay queue for temporarily storing job signals to the processing system before they are accepted for scheduling. The processing system further comprises circuitry for batch-wise insertion of the temporarily stored job signals into the job scheduler of the multiprocessing system. In this way, the utilization of the parallel processing units is increased and the number of changes between different priority levels in the multiprocessing system is minimized.

Abstract: To provide an approach to software update with scaleable disturbance there is proposed a state copying method for a computation system with at least two logic partitions wherein a state of new software in a standby partition is updated to the state of old software in an executing partition while continuing execution of the old software. Data is transferred from the executing partition to the standby partition in a scaleable way and as soon as the same state is achieved for the standby partition and the executing partition the execution is switched to the new, software. This provides a scaleable degree of disturbance due to the software update.