摘要:
The present invention relates to a server and a method for achieving a fast channel change in e.g. an IPTV system. This is achieved by selecting a source for retrieving the requested channel based on the current load of the FCC server. The source may be the streaming server providing the regular multicast stream or a buffer providing a buffered version of the requested channel. According to one embodiment requests for fast channel change (relating to the same channel) are grouped and served and served as a bundle over multicast. By doing that one can alleviate the load on the FCC server and the network since multiple clients can share the same stream.
摘要:
A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.
摘要:
The present invention relates to a method and a node in an IETV network. The node according to the present invention is configured to use the knowledge of the user channel switching behaviour in order to predict user channel switching and to make the channels predicted to be used available close to the STB of the user in advance of the anticipated channel switch.
摘要:
A method, resource manager, and computer program performed by a resource manager in a communications network connected to at least two hosts for enabling of resource component allocation related to the hosts, comprising determining a metric of a resource component for performance monitoring of an application at the hosts, transmitting an instruction to measure the metric to respective host, receiving a respective resource frame of the application from respective host, determining resource allocation for the application based on the received resource frames.
摘要:
Exemplary methods for distributed multi-component network-aware service placement in a resource pool include utilizing a hierarchy of agents associated with computing resources of a cloud architecture. An agent in the hierarchy can merge solution encodings to find cover sets indicating feasible placement solutions that can cover an entire application placement request. The agent can partition the components across its children nodes such that global network traffic is minimized. An application graph is generated with components as vertices and edges indicating connections between the components and having associated weights indicating a data transfer rate between the components. The edges can be sorted, and each cover set can be processed by repeatedly assigning unassigned pairs of components having higher data transfer rates to a common assignment set. If multiple placement solutions are found, determined placement costs for each can be used to identify the preferred placement.