FR2982728A1 - TECHNIQUE FOR PROCESSING A REQUEST FOR THE DISTRIBUTION OF A CONTENT - Google Patents

Abstract

The invention relates to a method for processing a content distribution request, implemented by a first access device (13) to content distribution services, accessing the network via a network. connection link (51) and sharing it with at least one second access device (14). The first device obtains first information relating to resources reserved by a second device, for at least one distribution of a content, and verifies with the aid of this first information, that the residual capacity of the connection link does not make it possible to distribute the required content. According to the invention, the first device also verifies, with the aid of this first information, that another content is being downloaded via the second device and sends to it second information relating to reserved resources. to distribute the required content, these reserved resources comprising at least a portion of the resources reserved by the second device.

Description

The invention is in the field of the distribution of digital content in a communication network, and more particularly the processing of a request for the distribution of a content. Auxiliary devices provide access to television and video-on-demand services provided by a communication network operator. Such an auxiliary device, also known under the name STB "Set Top Box", is in particular arranged to decode a signal received from the network access gateway into a content and to display the content on a screen, for example television. The auxiliary device complements a network access gateway, also provided by the network operator. This access gateway allows a set of equipment to access the communication network. These equipments form a local network. When several users of this local network wish to view content on several screens, there are several auxiliary devices STB, one per screen. The simultaneous use of these auxiliary devices STB poses a problem of management of access resources to the network. Indeed, the capacity of the link connecting the access gateway and the communication network is limited. To answer this problem, it is known to define rules for managing static resources. A first rule is to limit the number of auxiliary devices according to the capacity of the link. In particular, there are offers comprising two auxiliary devices. A second rule is to allow the distribution by means of an auxiliary device of a single data stream associated with a content, in real time or on demand, at a time. Implementing an admission control of a new data stream associated with content at an auxiliary device can enable dynamic management of resources. To this end, it is possible to implement the method of processing a service access request described in the patent application published under the number EP2141868. For a set of ancillary devices STB connected to the same access gateway to the communication network, each auxiliary device STB obtains information relating to network resources reserved by the other auxiliary devices of the set, for at least one service provided by through the access gateway. When one of these auxiliary devices processes a request for distribution of content, it verifies with the aid of this information that the access gateway has network resources necessary to allow access to the data flow associated with the content. If this is the case, the auxiliary device reserves the network resources and informs the other auxiliary devices connected to the access gateway. Otherwise, the auxiliary device rejects the content distribution request.

However, this method has the disadvantage that a distribution request of a content is rejected by an auxiliary device when another auxiliary device uses the bulk of the capacity of the link. One of the aims of the invention is to remedy the shortcomings / disadvantages of the state of the art and / or to make improvements thereto. According to a first aspect, the subject of the invention is a method for processing a request for distributing a digital content, said method being implemented by a first device for accessing content distribution services in a network. communication device, said first device accessing the network via a connection link and sharing said connection link with at least one second content distribution access device, said method comprising: a step of obtaining first information relating to network resources reserved by a second access device, for at least one distribution of digital content; a first verification step, using at least this first information, that the residual capacity of the connection link does not allow to distribute the required content; The method is remarkable in that it further comprises: a second verification step, using at least this first information, that another content is being downloaded via the second access device; ; a step of sending to the second access device second information relating to reserved resources for distributing the required content, said reserved resources comprising at least a portion of the resources reserved by said second access device. Thus, thanks to the invention, the use of the capacity of a connection link by a set of access devices to content distribution services is optimized. Such an access device can be an auxiliary device STB, a connected television, a computer, a mobile phone, a tablet, etc. Part of the capacity of the connection link is reserved for services such as access to Internet or Voice over IP. The remainder of the capacity of the connection link or available capacity is shared between the different streams of real-time data or video on demand. For example, one places oneself in the case where the second access device uses the capacity maximum to download a first content. As soon as a new distribution request for a second content is processed by the first device, the resources allocated to the distribution of the first content are decreased, in order to admit the distribution of the second content. Thus, the resources are distributed directly between the different access devices without requiring a centralization of the processing of the requests. The proposed solution is based on the knowledge of the resource information respectively reserved for the different current data streams for the content distribution services for all the access devices. This information makes it possible to determine the available capacity as soon as a new distribution request is to be processed. They also allow each access device to regulate its own consumption so that the capacity consumed by all the access devices does not exceed the available capacity of the connection link. Information about reserved network resources can be obtained through notifications exchanged between the devices. They may indicate a change in a reserved capacity or a change in the reserved capacity. These notifications can be broadcast in the local network.

The proposed solution thus enables efficient management of the capacity used for the data flows associated with the contents at the level of the devices accessing the network by the same connection link. This approach makes it possible to dispense with mechanisms implemented centrally, such as access control, smoothing or "shaping" mechanisms in English and prioritization in the communication network or on service platforms.

The proposed mechanism thus makes it possible to efficiently share a connection link between several access devices by allowing a progressive download for video on demand in the areas eligible for an ADSL television offer without the risk of disturbing new content distributions. such as real-time distributions. According to a particular characteristic, the distribution mode of the required content being a real-time distribution, the method further comprises a verification step that the sum of the residual capacity of the connection link and the resources reserved for access via the connection link for a download distribution is greater than the network resources needed to distribute the required content prior to the sending step. For content distributed in real time, it is first verified that the pre-emption of resources reserved for the download makes it possible to admit the distribution request. A request to distribute a content in real time is always treated primarily in relation to download distributions. However, there is no preemption on reserved resources to admit another real-time distribution. According to a particular characteristic, the distribution mode of the required content being a download distribution, the method further comprises a step of determining said reserved portion according to a strategy of distribution of resources between these first and second devices. It is possible for a download distribution to vary the resources throughout the download. The resource allocation strategy thus makes it possible to distribute the resources between the different access devices for the download distributions (and only these). This is for example a fair distribution between the different access devices.

According to a particular characteristic, the second information relating to reserved resources includes the distribution mode of the required content. The distribution of content can be made according to two distribution modes, in real time or by downloading. This allows each of the access devices sharing the connection link to determine that a download is in progress. Advantageously, the method further comprises an updating step for each method of distributing information relating to resources reserved for access via the connection link. This allows each of the access devices sharing the connection link to determine the capabilities in the network for each distribution mode. It is thus possible to ensure the quality of the content distribution services in an environment comprising several devices for accessing the content distribution services. According to a particular characteristic, the method further comprises: a verification step that the first information obtained results in exceeding the capacity of the connection link; a step of adjusting parameters associated with a content distribution by downloading by the first access device, in order not to exceed said capacity. Thus, the first access device can reduce the resources consumed for a download, to allow the second access device to admit a new distribution of content. According to a second aspect, the invention also relates to a device for accessing content distribution services in a communication network, accessing the network via a connection link and sharing the connection link with at least one connection network. a second device for accessing content distribution services. The access device comprises: means for obtaining first information relating to network resources reserved by a second access device (14), for at least one distribution of a digital content; verification means, arranged to verify, using at least this first information, that the residual capacity of the connection link does not allow to distribute a content, for which a distribution request is being processed. The access device is remarkable in that: the verification means are further arranged to verify, using at least this first information, that other content is being downloaded via the second device access; and in that the first access device further comprises sending means, activated by the verification means, for a second access device through which another content is being downloaded, second information relating to reserved resources for distributing the required content, said reserved resources comprising at least a portion of the resources reserved by said second access device. According to a particular characteristic, the verification means are further arranged to verify that the first information obtained results in exceeding the capacity of the connection link, and furthermore comprising means for adjusting parameters associated with a distribution of content by downloading. so as not to exceed said capacity. According to a third aspect, the invention furthermore relates to a system for accessing content distribution services in a communication network, comprising a first access device according to the second aspect and a second access device comprising means verification means, arranged to verify that the second information obtained results in exceeding the capacity of the connection link, and means for adjusting parameters associated with a download content distribution, in order not to exceed said capacity. fourth aspect, the invention relates to a program for a device for accessing content distribution services, comprising program code instructions for controlling the execution of the steps of the previously described method, when said program is executed by said program device and a recording medium readable by a device for accessing content distribution on which a program is recorded for a device.

The invention will be better understood with the aid of the following description of a particular embodiment of the method of the invention, with reference to the appended drawings in which: FIG. 1 represents a system for access to distribution services content in its environment; Figures 2a-2e show the steps of the method of processing a distribution request according to a particular embodiment of the invention; FIG. 3 represents a resource allocation table according to a particular embodiment; FIG. 4 represents a device for accessing content distribution services according to a particular embodiment of the invention.

FIG. 1 shows a system for accessing content distribution services enabling client entities 10, 11, 12 to access different content distribution applications such as television, video on demand or the consultation of content distribution services. pages of a website. Each client entity 10, 11, 12 accesses via a communication network 50 content proposed by content distribution entities, three of which are shown in Figure 1. A first distribution entity 40 hosts a website from which client entities can obtain pages of content. A second distribution entity 41 proposes contents intended to be distributed in real time, for example television contents. A third distribution entity 42 proposes content intended to be distributed for download, for example videos on demand. Thereafter, a distribution mode corresponds to a real-time distribution or a download distribution. The client entities 10, 11, 12 belong to a local area network 30 and access the communication network 50 via a connection link 51. More specifically, the second client entity 11 accesses the communication network 50 via a first access device 13 to the content distribution services; the third client entity 12 accesses the network via a second access device 14 to the content distribution services. We then place ourselves in the particular case where the first 13 and second 14 access devices to content distribution services are auxiliary devices or "Set Top Box" to access television and video services to demand, distributing audiovisual digital content. These auxiliary devices are in particular arranged to receive a distribution request of a content, to receive, decode and display a data flow associated with the required content. These auxiliary devices are called thereafter decoders. The second 11 and third 12 client entities are screens, such as televisions. The first client entity 10, the first 13 and second 14 decoders are connected to an access gateway 20, itself connected to the connection link 51. The connection link 51 is for example an ADSL telephone line access, for "Asymmetric Digital Subscriber Line". This connection link 51 has a predetermined capacity BL This capacity is for example expressed in the form of a bit rate. The first client entity 10 is for example a computer. The decoder can also be a connected television, a computer, a mobile phone, a tablet, etc. In this case, the client entity 11 and the decoder 12 form a single access device to the content distribution services.

No limitation is attached to the number of client entities and decoders. According to the invention, the first decoder 13 stores for the digital content distribution services the following data in a resource allocation table 100, represented in FIG. 3: a first value Blivel of capacity 200, corresponding to the resources reserved for the content distributed in real time through it; a second value BVoD1 of capacity 201, corresponding to the resources reserved for the content or contents distributed for download through it; a third value BliveG of capacity 202, corresponding to the resources reserved for the content or contents distributed in real time in the access system 25; a fourth value BVoDG of capacity 203, corresponding to the resources reserved for the content or contents distributed for download in the access system 25.

The first 13 and second 14 decoders exchange information relating to resources of the connection link 51 that they reserve. More precisely, when one of the two capacity values Blivel and / or BVoD1 has been modified, the first decoder 13 sends to the second decoder 14 a message comprising the variation or variations of the modified values.

Conversely, the first decoder 13 receives from the second decoder 14 the variations of the capacity values Blive2 and BVoD2 reserved by it when they are modified. The messages exchanged include a mode of distribution and a variation of the value of the capacity, positive or negative, for this mode of distribution. According to the variations received, the first decoder 13 updates the third BliveG and fourth BVoDG capacity values stored respectively in the fields 202 and 203 of the resource allocation table 100. The messages exchanged are acknowledged by an acknowledgment message. An acknowledgment corresponds for example to a message indicating a zero variation. Advantageously, when more than two decoders belong to the access system 25, the message also comprises an identifier of the decoder transmitter of the message. It is also possible to timestamp the messages exchanged. This message timestamp makes it possible to analyze the exchanges, for example in the event of a malfunction. The message can be transmitted in broadcast mode or "Multicast". By way of non-limiting example, the first 13 and second 14 decoders are subscribed to a multicast broadcast group, and broadcast the messages in the multicast broadcast group. They may also be messages that comply with the UPnP network protocol for "Universal Plug and Play". The use of this protocol has the advantage of also being able to be used for the discovery of the equipment connected to the local network. Alternatively, the Bonjour protocol standardized by Apple offers a notification mechanism in addition to the services of terminal / service discovery, addressing, printing. The Bonjour protocol is based on standardized protocols described in the IETF. Preferably, message exchanges are secure to prevent misuse of the mechanism by malicious users. In nominal mode, the sum of the third BliveG and fourth BVoDG capacitance values is less than the BL capacity of the connection link 51. Specifically, a portion Bint of the BL capacity is reserved for access to the Internet. Thus, the sum of the third BliveG and fourth BVoDG capacity values and the reserved capacity for Internet access is less than the BL capacity of the connection link 51. The first 13 and second 14 decoders have the value of the BL capacity of the connection link 51 and the value of the Bint capacity reserved for access to the Internet. These two values are for example broadcast in the multicast broadcast group. Specifically, the UPnP IGD protocol, for "Internet Gateway Device", and UPnP DM, for "Device Management", can be used to transmit the reserved capacity for Internet traffic and the capacity of the connection link 51. No limitation n ' is attached to the mode of obtaining these two values. The Bres attributable capacity value thus corresponds to the difference between these two values: Bres = BL -Bint In addition, it is subsequently considered that the allocation of resources to process a request to distribute content in real time has priority. compared to download content distributions. More specifically, when the available resources are not sufficient to accept a content distribution request in real time and at least one content is being downloaded via one of the decoders, a portion of the resources allocated to this download is preempted to accept the distribution request in real time. In addition, a resource distribution strategy is first defined between the decoders. By way of non-limiting example, it is possible to distribute resources equitably between the different decoders. Other resource distribution strategies can also be envisaged, for example by defining a master decoder that has a higher resource reservation right than the other decoders. As another example, it is possible for decoders to negotiate the resource allocation strategy. No limitation is attached to this resource allocation strategy. We will now describe in relation to FIGS. 2a-2e the method of processing a request for the distribution of a digital content, as implemented by the first decoder 13, in a particular embodiment. It will be recalled here that the first 13 and second 14 decoders have the value of the allocable capacity Bres of the connection link 51. It is assumed that the first decoder 13 has obtained information relating to network resources reserved by the second decoder 14 and has stored the third BliveG and fourth BVoDG capacity values in its resource allocation table 100. In a waiting step, not shown in Figures 2a-2e, the first decoder 13 is waiting for detection of an event. FIG. 2a corresponds to the steps implemented by the first decoder 13 when the detected event corresponds to a distribution request of a first content C1 distributed in real time, requiring resources B. In a step E1, the first decoder 13 detects this event. In a step E10, the first decoder 13 determines the available capacity Bav from the residual capacity Bres of the connection link 51 and the capacity values BliveG and BVoDG used in the access system 25. More precisely: Bav = Bres - BliveG - BVoDG In a step El 1, the first decoder 13 checks whether the available capacity Bav is greater than or equal to the required capacity B for the distribution of the first content Cl. If in step Ell, the available capacity Bav is greater than equal to the required capacity B for the distribution of the first content C1, the distribution request of the first content C1 can be accepted. In a step E111, the first decoder 13 updates the resource allocation table 100, more precisely the first capacity value Blivel 200 as well as the third capacity value BliveG 202. In a step E112, the first decoder 13 notifies the second decoder 14, by transmitting information relating to the reserved network resources, in particular the variation of the Blivel capacity reserved for the real-time distribution of the first content C1. In a step E113, the first decoder 13 receives an acknowledgment from the second decoder 14. The acknowledgment message comprises, where appropriate, the modifications made by the second decoder 14 on the first Blive2 and / or second BVoD2 capacitance values, more precisely the variations of these capacitance values.

In a step E114, the first decoder 13 updates the third BliveG and fourth BVoDG capacity values in the resource allocation table 100 as a function of any variations received in step E113. In a step E14, the first decoder 13 transmits the distribution request of the first content C1 to the second distribution entity 41. The distribution of the first content C1 is thus initialized. The first decoder 13 then returns waiting for detection of a new event. If in step Ell, the available capacity Bav is less than the required capacity B for the distribution of the first content C1, in a step E12, the first decoder 13 checks whether a content is being distributed for download via it. More specifically, the first decoder 13 checks whether it is possible to preempt on this download part of the resources necessary for the distribution of the first content C1 required in real time. The first decoder 13 also checks whether content is being downloaded for download in the access system 25 and whether it is possible to preempt on this download part of the resources necessary for the distribution of the first content C1 required in real time. . These checks are implemented from the second capacity value BVoD1 201 and the fourth capacity value BVoDG 203 stored in the resource allocation table 100. If this is the case, in a step E121, the first decoder 13 then determines the ability to preempt its own download according to the resource allocation strategy and updates the resource allocation table 100. Specifically, the first capacity value Blivel 200 is updated with the capacity B, the second capacity value BVoD1 201 is updated according to the part of the resources preempted, the third capacity value BliveG is updated in function of the capacity B and the fourth capacity value BVoDG 203 is updated according to the update performed for the second capacity value BVoD1. In a step E122, the first decoder 13 notifies the second decoder 14, by transmitting information relative to the reserved network resources, in particular the variation of the first value of capacity Blivel and if necessary, the variation of the second value of capacity BVoD 1. It is emphasized here that in this case, the sum of the reserved resources may be greater than the attributable capacity Bres. This makes it possible to implement the preemption mechanism. In a step E123, the first decoder 13 receives an acknowledgment from the second decoder 14. The acknowledgment message includes the variation of the second capacitance value BVoD2 if it is modified. In a step E124, the first decoder 13 updates, if necessary, the resource allocation table 100, notably the fourth capacity value BVoDG. In a step E125, the first decoder 13 adjusts the parameters of the download session, for example the parameters of the TCP session, for "Transport Control Protocol", according to the preempted part of the resources. These parameters are for example the size of the TCP window, the introduction of a delay in the transmission of acknowledgments, the number of packets that can be acknowledged in a single acknowledgment. The first decoder 13 then implements the step E14 initialization of the distribution in real time, previously described and then goes back to waiting for detection of a new event. If in step E12, no download was in progress via the first decoder 13, in a step E13, the first decoder 13 checks if at least one download is in progress on the second decoder 14. This check is implementation from the fourth capacity value BVoDG 203 stored in the resource allocation table 100. If this is the case, in a step E131, the first decoder 13 updates the resource allocation table 100. The first capacity value Blivel 200 and the third capacity value BliveG are updated according to the capacity B. In a step E132, the first decoder 13 notifies the second decoder 14, by transmitting information relating to the reserved network resources , including the variation of the first Blivel capacity value. It is emphasized here that in this case, the sum of the reserved resources is greater than the attributable capacity Bres. This makes it possible to implement the preemption mechanism. In a step E133, the first decoder 13 receives an acknowledgment from the second decoder 14. In a step E134, the first decoder 13 updates the resource allocation table 100. More precisely, the fourth capacity value BVoDG 203 is updated, if necessary, as a function of the variation of the second capacity value BVoD2 received from the second decoder 14. The first decoder 13 then implements the step E14 of initialization of the real-time distribution, previously described, and then returns to waiting for detection of a new event. If in step E13, no download is in progress on the second decoder 14, the first decoder 13 rejects the distribution request of the first content Cl and then returns waiting for detection of a new event. It is emphasized here that when resources are preempted, the variations of the first Blivel and second BVoD1 capacity values transmitted in the notification result in exceeding the Bres attributable capacity. Upon receipt of this notification and detection of this overshoot, the receiver decoder will reduce the capacity it uses for a download. Thus, by very simple exchanges between the two decoders, it is possible to accept a content distribution request in real time by preempting if necessary resources reserved for downloads. FIG. 2b corresponds to the steps implemented by the first decoder 13 when the detected event corresponds to a distribution request of a second content C2 distributed by downloading by the distribution entity 42. In a step E2, the first decoder 13 detects this event.

In a step E20, similar to step E10, the first decoder 13 determines the available capacity B1b. In a step E21, the first decoder 13 checks whether at least one download is in progress in the access system 25. This check is implemented from the fourth capacity value BVoDG 203 stored in the allocation table 100. Resource.

If this is the case, in a step E211, the first decoder 13 determines according to the resource allocation strategy which part of the resources allocated for the download implemented by the second decoder 14 must be preempted and updates the table. 100 allocation of resources. The second capacity value BVoD1 201 is updated according to the available capacity Bav and the preempted capacity value.

In a step E212, the first decoder 13 notifies the second decoder 14, by transmitting information relating to reserved network resources, including the variation of the second capacity value BVoD1. It is emphasized here that in this case, the sum of the reserved resources is greater than the attributable capacity Bres. This makes it possible to implement the preemption mechanism.

In a step E213, the first decoder 13 receives an acknowledgment from the second decoder 14.

In a step E214, the first decoder 13 updates the resource allocation table 100. More specifically, the fourth capacity value BVoDG 203 is updated as a function of the variation of the second capacity value BVoD2 received from the second decoder 14.

In a step E23, the first decoder 13 initializes the download session of the second content C2, in particular by adjusting the parameters of the session according to the available capacity BVoD1. The distribution of the second content C2 is thus initialized. Thus, by preempting the reserved resources, it is possible to admit a content distribution request.

The first decoder 13 then returns waiting for detection of a new event. If in step E21, no download is in progress via the second decoder 14, in a step E22, the first decoder 13 checks whether the available capacity Bav is greater than or equal to zero. If in step E22, the available capacity Bav is greater than zero, in a step E221, the first decoder 13 updates the resource allocation table 100, more precisely the second capacity value BVoD1 201 with the available capacity as well as the fourth capacity value BVoDG 203. In a step E222, the first decoder 13 notifies the second decoder 14, by transmitting information relating to the reserved network resources, in particular the variation of the first capacitance value BVoD1. In a step E223, the first decoder 13 receives an acknowledgment from the second decoder 14. In a step E224, the first decoder 13 updates if necessary the resource allocation table 100.

The first decoder 13 then implements the initialization step E23 of the download session previously described and then returns to waiting for detection of a new event. If in step E22, the available capacity Bav is equal to zero, in a step E24, the first decoder 13 rejects the distribution request of the second content C2 and then returns to waiting for detection of a new event. As pointed out above with respect to FIG. 2a, when resources are pre-empted, the variations of the first and second BVivD capacity values transmitted in the notification cause the Bres attributable capacity to be exceeded. Upon receipt of this notification and detection of this overshoot, the receiver decoder will reduce the capacity it uses for a download. Thus, by very simple exchanges between the two decoders, it is possible to dynamically distribute the resources by preempting the reserved resources to admit a content distribution request if necessary.

FIG. 2c corresponds to the steps implemented by the first decoder 13 when the detected event corresponds to a distribution end of the first content C1 distributed in real time. In a step E3, the first decoder 13 detects this event.

In a step E30, the first decoder 13 updates the resource allocation table 100 to take into account the stop of the distribution of the first content Cl in real time. The first Blivel 200 capacity value is set to zero and the third BliveG capacity value is updated taking into account the real-time distribution stop. In a step E31, the first decoder 13 checks whether a download is in progress via it. If this is the case, in a step E311, similar to step E10, the first decoder 13 determines the available capacity Bav. In a step E312, the first decoder 13 determines the capacity that can be allocated to the download in progress, in particular according to the available capacity Bav of the resources and according to the strategy of distribution of the resources. Then the first decoder 13 updates the resource allocation table 100. More precisely, the second capacity value BVoD1 201 is updated according to the determined capacity, and the fourth capacity value BVoDG 203 is updated as a function of the update carried out for the second capacity value BVoD1.

In a step E313, the first decoder 13 notifies the second decoder 14, by transmitting information relating to the reserved network resources, in particular the variation of the first capacity value Blivel and, if appropriate, the variation of the second capacity value BVoD1. . In a step E314, the first decoder 13 receives an acknowledgment from the second decoder 14. In a step E315, the first decoder 13 updates the resource allocation table 100. More specifically, the fourth capacity value BVoDG 203 is updated as a function of the variation of the second capacity value BVoD2 received from the second decoder 14.

In a step E316, similar to the step E125, the first decoder 13 adjusts the parameters of the download session according to the capacity update performed. The first decoder 13 then returns waiting for detection of a new event. If in step E31, no download is in progress via it, in a step E321, the first decoder 13 notifies the second decoder 14, by transmitting information on reserved network resources, including the variation of the first Blivel capacity value. The second decoder 14 can take advantage of this release of resources to increase the capacity of the connection link that it uses as described later in connection with FIG. 2e. In a step E322, the first decoder 13 receives an acknowledgment from the second decoder 14.

In a step E323, the first decoder 13 updates the resource allocation table 100. More specifically, the fourth capacity value BVoDG 203 is updated as a function of the variation of the second capacity value BVoD2 received from the second decoder 14. The first decoder 13 then goes back waiting for detection of a new event.

FIG. 2d corresponds to the steps implemented by the first decoder 13 when the detected event corresponds to a distribution end of the second C2 content distributed for download. In a step E4, the first decoder 13 detects this event. In a step E40, the first decoder 13 updates the resource allocation table 100 to take into account the stopping of the distribution of the second C2 content for download. The second capacity value BVoD1 201 is set to zero and the fourth capacity value BVoDG 203 is updated taking into account the stop of the download distribution. In a step E41, the first decoder 13 notifies the second decoder 14, by transmitting information relating to reserved network resources, including the variation of the second capacity value BVoDl. The second decoder 14 can take advantage of this release of resources to increase the capacity of the connection link that it uses as described later in connection with FIG. 2e. In a step E42, the first decoder 13 receives an acknowledgment from the second decoder 14. In a step E43, the first decoder 13 updates the resource allocation table 100. More specifically, the fourth capacity value BVoDG 203 is updated as a function of the variation of the second capacity value BVoD2 received from the second decoder 14.

The first decoder 13 then returns waiting for detection of a new event. FIG. 2e corresponds to the steps implemented by the first decoder 13 when the detected event corresponds to a reception of a notification coming from the second decoder 14. In a step E5, the first decoder 13 detects this event.

In a step E50, the first decoder 13 updates the resource allocation table 100 to take into account the received capacity values. The third BLiveG capacity value 202 and / or the fourth BVoDG capacity value 203 are updated according to the values received in the notification. In a step E51, similar to step E10, the first decoder 13 determines the available capacity B1b.

In a step E52, the first decoder 13 checks whether the available capacity Bav is greater than zero. If this is the case, in a step E53, the first decoder 13 checks whether a download via it is in progress. If a download is in progress, in a step E531, the first decoder 13 updates the resource allocation table 100. More precisely, the second capacity value BVoD1 201 is updated according to the available capacity Bav, and the fourth capacity value BVoDG 203 is updated as a function of the update carried out for the second capacity value BVoD1. In a step E532, the first decoder 13 notifies the second decoder 14, by transmitting information relating to reserved network resources, including the variation of the second capacity value BVoDl. In a step E533, the first decoder 13 receives an acknowledgment from the second decoder 14. In a step E534, the first decoder 13 updates the resource allocation table 100. More specifically, the fourth capacity value BVoDG 203 is updated if necessary. In a step E535, analogous to step E125, the first decoder 13 adjusts the parameters of the download session according to the capacity update performed. The first decoder 13 then returns waiting for detection of a new event.

If in step E53, no download is in progress via it, in a step E535, the first decoder 13 transmits an acknowledgment of the notification. The first decoder 13 then returns waiting for detection of a new event. If in step E52, the available capacity Bav is less than zero, in a step E521, the first decoder 13 updates the resource allocation table 100. More specifically, the second capacity value BVoD1 201 is decreased to take into account the observed deficit of the available capacity Bav, and the fourth capacity value BVoDG 203 is updated according to the update carried out for the second value of BVoDl capacity. In a step E522, the first decoder 13 notifies the second decoder 14, by transmitting information on reserved network resources, including the variation of the second capacity value BVoDl. In a step E523, the first decoder 13 receives an acknowledgment from the second decoder 14.

In a step E524, the first decoder 13 updates the resource allocation table 100. More specifically, the fourth capacity value BVoDG 203 is updated if necessary. In a step E525, similar to step E125, the first decoder 13 adjusts the parameters of the download session according to the capacity update performed. The first decoder 13 then returns waiting for detection of a new event. The method has been described by placing itself at the level of the first decoder 13. It is understood that the second decoder 14 also implements the steps of the method of processing a distribution request, as described.

The method has been described in an access system comprising two decoders. It is easily transposable by those skilled in the art to access systems comprising more than two decoders. The description of the method was made for an embodiment in which the first decoder 13 obtained information relating to network resources reserved by the second decoder 14 and deduced the third BliveG and fourth BVoDG capacity values in its table 100 allocation of resources. When a new decoder joins the local network 30, this new decoder implements a discovery mechanism of the local network. The new decoder then announces on the local network 30. In response, the already connected decoder or decoders broadcast their own first and second capacitance values in the local network 30. This allows the new decoder to initialize its own table 100. 'allocation of resources. A decoder leaving the local network 30 also transmits a message for releasing resources reserved for it. In one embodiment, a monitoring mechanism of a connected / disconnected state or "keepalive" makes it possible to check whether a decoder has not left the local network 30 without releasing the resources reserved for it. If a decoder is detected as disconnected, that is to say it has left the local network without releasing the reserved resources, the connected decoders then broadcast in the local network 30 their own first and second capacitance values. This allows them to update the third and fourth capacity values of the resource allocation table 100, based on the reservations that were made by the connected decoders.

The description of the method has been made for one embodiment, in which a decoder receiving a notification from another decoder processes it immediately, for example by decreasing the resources reserved for a download. In an access system comprising more than two decoders, it is planned to delay the processing of the notification under certain conditions, in order to prevent several decoders from decreasing their respective consumption in parallel. As a non-limiting example, when a new decoder announces itself in the local network, it obtains a sequence number in the access system. Thus, a decoder, receiving a first notification, the information contained therein resulting in exceeding the available capacity of the connection link, determines whether the network includes another decoder of higher order number. If this is the case, the decoder delays the processing of the first notification, pending receipt of a second notification from this other decoder. On receipt of this second notification, the decoder checks again if there is another decoder of higher order number, and so on. If there is no other higher order number decoder, the decoder processes the last received notification. Note that the timing of the processing of a notification is to be limited in time to avoid a blockage of the process. Illustrative examples of the implementation of the method will now be described in the environment comprising the two decoders. In these examples, the capacity of the BL link is 8192 kbps and the capacity reserved for Bint Internet traffic is 256 kbps. The resource allocation table 100 of the first decoder 13 and Table 2 that of the second decoder 14 are listed as Tablel. The data stored therein are represented in the form of a quadruplet (Blivel, BVoD1, BliveG, BVoDG). In a first example, the first decoder 13 processes a request for distribution of a first real-time content requiring a capacity of 2700 kbit / s. The available capacity (7936) being greater than the required capacity (2700) (E11), the first decoder 13 transmits (E112) a notification to the second decoder 14 indicating (Live, +2700). The Tablel table includes the following data (2700, 0, 2700, 0). The second decoder 14 receives (E5) the notification and updates Table2. No download is in progress (E52). The second decoder 14 acknowledges the notification (E535). The Table2 table includes the following data (0, 0, 2700, 0). The second decoder 14 processes a request to distribute a second content for download. Since the available capacity (5236) is greater than zero (E22), the second decoder 14 transmits (E222) a notification to the first decoder 13 by indicating (VoD, +5236). The Table2 table includes the following data (0, 5236, 2700, 5236). The first decoder 13 receives (E5) the notification and updates Tablel. No download is in progress (E53). The first decoder 13 acknowledges the notification (E535). The Tablel table includes the following data (2700, 0, 2700, 5236). It is assumed that then the first decoder 13 stops the distribution of the first content Cl in real time. The first decoder 13 transmits (E112) a notification to the second decoder 14 indicating (Live, -2700). The Tablel table includes the following data (0, 0, 0, 5236). The second decoder 14 receives (E5) the notification, updates Table2. A download is in progress (E53). The second decoder 14 transmits (E532) a notification to the first decoder 13 indicating (VoD, +2700). The Table2 table includes the following data (0, 7936, 0, 7936). The first decoder 13 receives (E5) the notification and updates Tablel. The Tablel table includes the following data (0, 0, 0, 7936). The first decoder 13 transmits an acknowledgment to the second decoder 14, which receives it (E533). The second decoder 14 updates the parameters of the session according to the new capacity. It should be noted that once the distribution of the content in real time has been completed via the first device 13, the freed capacity could be reassigned to the current download of the second content C2. In a second example, we return to the initial conditions where no distribution is in progress. The first decoder 13 processes a request to distribute a third content C3 for download. Since the available capacity is greater than zero (E22), the first decoder 13 transmits (E222) a notification to the second decoder 14 by indicating (VoD, +7936). The Tablel table includes the following data (0, 7936, 0, 7936). The second decoder 14 receives (E5) the notification and updates Table2. The second decoder 14 acknowledges the notification (E535). The Table2 table includes the following data (0, 0, 0, 7936). The second decoder 14 processes a request to distribute a fourth content C4 for download. The second decoder 14 verifies that a download is in progress in the access system 25 (E21). It determines the capacity to allocate according to the resource allocation strategy and transmits (E211) a notification to the first decoder 13 indicating (VoD, +3968). The Table2 table includes the following data (0, 3968, 0, 11904). The first decoder 13 receives (E5) the notification and updates Tablel. The available capacity is negative (E52). The first device 13 determines (E521) that it must decrease the reserved capacity for downloading the third content C3 and transmits (E522) a notification to the second decoder 14 indicating (VoD, -3968). The second decoder 14 acknowledges the notification (E535). The first decoder 13 updates the parameters of the session according to the new capacity. The Tablel table includes the following data (0, 3968, 0, 7936). The Table2 table includes the following data (0, 3968, 0, 7936). In this way, a download in progress uses all the available capacity until the other decoder processes a download distribution request. From this moment, the resources are distributed for download between the two decoders according to the resource allocation strategy. Then, the first decoder 13 processes a request for distribution of a first real-time content requiring a capacity of 2700 kbit / s. The first decoder 13 determines that the available capacity (0) is less than the required capacity (E11). A download is in progress via it (E12). The first decoder verifies if a download is also in progress via the second decoder and determines (E121) the ability to reserve for its download according to the resource allocation strategy. The first device transmits a notification (E122) to the second decoder 14 indicating (Live, +2700) and (VoD, -1350). The second decoder 14 receives (E5) the notification and updates Table2. The available capacity is negative (E52). The second decoder 13 determines (E521) that it must decrease the reserved capacity for downloading the fourth content C4 and transmits (E522) a notification to the first decoder 13 indicating (VoD, -1350). The first decoder 13 acknowledges the notification (E535). The first decoder 13 updates the parameters of the session according to the new capacity. The second decoder 14 updates the parameters of the session according to the new capacity. The Tablel table includes the following data (2700, 2618, 2700, 5236). The Table2 table includes the following data (0, 2618, 2700, 5236). In this way, as soon as content is to be distributed in real time, the capacity allocated to downloads decreases to free up capacity. From this moment, the resources are distributed for download between the two decoders according to the resource allocation strategy. In the embodiment described, the decoders exchange the variations of the values of the reserved capacities. In another embodiment, the reserved capacity values are transmitted. The message includes an identifier of the capacity that is modified (real time or download) and a value of the capacity. In this other embodiment, when more than two decoders are present in the local network 30, the resource allocation table 100 also stores the capacity values reserved by each of the decoders.

Moreover, in the embodiment described, when a modification is to be made to a download session, the values of the session are modified. An alternative to decrease or increase the speed of a download is also provided. In this alternative, a content is segmented into a series of successive elementary blocks. An elementary block is the content for a duration, which can be variable. By way of nonlimiting example, these elementary blocks may be of fixed duration, of the order of a few seconds. An elementary block is then encoded by a network entity into a plurality of data segments at different quality levels. More precisely, the elementary block is encoded at a given bit rate, which corresponds to a given quality of rendering quality. No limitation is attached to the type of coding used to obtain these data segments. Thus, to decrease the bit rate, the decoder or a network entity selects a lower quality level. We will now describe a device 13 for access to content distribution services in a particular embodiment of the invention with reference to FIG. 4. Such an access device 13 comprises: a transmission module 102 / reception, arranged in particular to obtain first information relating to network resources reserved by a second access device 14 and to send to a second access device via which another content is being downloaded second information relating to reserved resources for distributing the required content; - A control module 106, arranged to verify using at least these first information: - that the residual capacity of the connection link does not distribute content, for which a distribution request is being processed; - or other content is being downloaded through the second access device; the table 100, as described above; an application module 104 implementing the content distribution services; a module 108 for decoding a received data stream for a restitution to the client entity 11. When the control module verifies that other content is being downloaded, the control module 106 is furthermore arranged to determine which part of the resources reserved by this second access device must be preempted for the distribution of the required content and to activate the transmission / reception module 102 to send the second information, including the pre-empted part. The control module 106 is furthermore arranged to check that the first information obtained results in exceeding the capacity of the connection link and for activating the application module 104, the latter being furthermore arranged to adjust parameters associated with a content distribution. by download, so as not to exceed this capacity.

The modules 102, 104, 106 are arranged to implement the previously described method. These are preferably software modules comprising software instructions for executing the steps of the method described above, implemented by a device 13, 14 for access to content distribution services. The invention therefore also relates to: a program for such a device, comprising program code instructions intended to control the execution of the steps of the method described above, when said program is executed by said device; - A recording medium readable by a device on which is recorded the program for such a device. The software modules can be stored in or transmitted by a data carrier.

This may be a hardware storage medium, for example a CD-ROM, a magnetic diskette or a hard disk, or a transmission medium such as an electrical signal, optical or radio, or a telecommunications network. The invention also relates to a system 25 for accessing content distribution services in a communication network, comprising a first access device 13 as described above and a second access device 14 comprising a control module 106. arranged to verify that the second information obtained from the first device causes the capacity of the connection link to be exceeded, and an application module 104, arranged to adjust parameters associated with a download content distribution, so as not to exceed this ability.

Claims (11)

REVENDICATIONS1. A method of processing a request to distribute a digital content, said method being implemented by a first access device (13) to content distribution services in a communication network, said first device accessing the network via a connection link (51) and sharing said connection link with at least a second access device (14) to the content distribution services, said method comprising: - a step of obtaining first information relating to network resources reserved by a second access device, for at least one distribution of digital content; a first verification step (Ell, E21), using at least this first information, that the residual capacity of the connection link does not make it possible to distribute the required content; characterized in that the method further comprises: a second verification step (E12), using at least this first information, that another content is being downloaded via the second access device ; a sending step (E132, E212) destined for the second access device for second information relating to reserved resources for distributing the required content, said reserved resources comprising at least part of the resources reserved by said second access device; . The method of claim 1, further comprising, the distribution mode of the required content being a real time distribution, a verification step that the sum of the residual capacity of the connection link and the resources reserved for access by the intermediate of said connection link for a download distribution is greater than the network resources necessary to distribute the required content, prior to the sending step. The method of claim 1, further comprising, the distribution mode of the required content being a download distribution, a step of determining said reserved portion according to a resource allocation strategy between said first and second devices. The method of claim 1, wherein the second reserved resource information includes the distribution mode of the required content. 5. The method of claim 4, further comprising an updating step for each distribution mode of information relating to resources reserved for access via said connection link. The method of claim 1, further comprising: - a step of verifying that the first information obtained results in exceeding the capacity of the connection link; a step of adjusting parameters associated with a content distribution by downloading by the first access device, in order not to exceed said capacity. 7. First access device (13) to content distribution services in a communication network, accessing the network via a connection link and sharing said connection link with at least one second device; access to content distribution services, comprising: means (102) for obtaining first information relating to network resources reserved by a second access device (14) for at least one distribution of digital content; verification means (106) arranged to check, using at least one of these first pieces of information, that the residual capacity of the connection link does not make it possible to distribute a content, for which a distribution request is being processed ; characterized in that: - the verification means are further arranged to verify, using at least this first information, that another content is being downloaded through the second access device; and in that the first access device further comprises sending means (102), activated by the verification means, destined for a second access device via which another content is in progress download, second information relating to reserved resources for distributing the required content, said reserved resources comprising at least part of the resources reserved by said second access device. The first access device according to claim 7, wherein the verification means are further arranged to verify that the first information obtained results in exceeding the capacity of the connection link, and further comprising means for adjusting the parameters (104) associated with a download content distribution, so as not to exceed said capacity. 9. System (25) for accessing content distribution services in a communication network, comprising a first access device according to claim 7 and a second access device comprising verification means (106), arranged to verify that the second information obtained results in exceeding the capacity of the connection link, and means for adjusting parameters (104) associated with a download content distribution, so as not to exceed said capacity. A program for a device for accessing content distribution services, comprising program code instructions for controlling the execution of the steps of the method according to one of claims 1 to 6, when said program is executed by said device. 11. Recording medium readable by a device for accessing content distribution services on which the program according to claim 10.10 is recorded.