Abstract:
A method of controlling the rate of data transmission to a user via a communications link of a network wherein resource requests are communicated to a service provider. The resource requests are determined in accordance with an indication of the congestion level on the network and the user&#39;s defined parameters, such as their willingness to pay for the resource, wherein the resource request is weighted by a variable parameter, whose value is set in accordance with the congestion level on the network. This allows the rate controller to react efficiently and swiftly to network conditions as well as user defined parameters. By providing a computer programmed to act as a purchasing agent an automatic resource request to a service provider is enabled. An embodiment is described in which audio or video data is streamed to a user on the basis of the resource requests made on the user&#39;s behalf and is adjusted on the basis of user and network defined parameters. The invention could equally be used to provide appropriate data streaming for many different types of network traffic.

Description:
TECHNICAL FIELD  
       [0001]     The present invention relates to a method for controlling the rate of data transmitted to a user on a communications link, and in particular to a method of resource control wherein resource requests from a user to a service provider are determined in response to the amount of congestion on the communications link.  
       BACKGROUND TO THE INVENTION AND PRIOR ART  
       [0002]     The last two decades have seen the introduction of so-called ‘integrated’ networks, such as asynchronous transfer mode (ATM) and Internet Protocol (IP) networks, which are designed to carry both computer communications and telephony. The capacity of those networks needs to be allocated between users who require a constant bit-rate for the duration of a communication (e.g. telephone users), those who can tolerate some variation in the bit-rate supplied to them by the network (e.g. those transferring web-pages, software or e-mails), and those users who can tolerate less variation in the bit-rate supplied to them by the network (e.g. those transferring video clips or other real time applications).  
         [0003]     To deal with different user&#39;s requirements, integrated networks offer their users the ability to specify which service they wish to receive from the network (which, being an integrated network, can offer a plurality of different services). This specification can be made once at the start of a communication (the normal procedure in networks offering a connection-oriented service, such as ATM networks) and/or repeatedly during a communication.  
         [0004]     As mentioned, an Internet Protocol network is one type of integrated network. An IP network can offer a constant bit-rate service type (using the Resource Reservation Protocol (RSVP)), and a best efforts service type. Another service type gives packets sent by one class of users priority over packets sent by another class of user. Using RSVP, a user can additionally specify the amount of bandwidth he or she wishes to have available.  
         [0005]     Where a person has to make such a service specification many times because he or she is involved in a number of different communications and/or has to make a plurality of service specifications during a communication, it is beneficial if that specification is made on that person&#39;s behalf by a computer programmed to act as that person&#39;s agent.  
         [0006]     The present invention concerns how the computer acting as an agent determines the data rate request for the user.  
         [0007]     During the last five years not only has the amount in Internet traffic increased dramatically, but there has also been a significant diversification in the type of traffic flowing through computer networks. Until fairly recently, file transfer, email and simple web traffic formed the almost all the data flows on the Internet. Now applications may include multi-party and/or multi media data transmission. Such applications include “real-time” audio and video, interactive games, instant messaging, multi-party virtual worlds, network games, auctions, audio and video-conferencing and IP telephony.  
         [0008]     In view of the increase in data transmission, efficient control and management of the network resources is becoming increasing important. One of the problems faced by network users and service providers is congestion, a situation in which there is too much data for the network to handle. The consequence of which is delays or even loss of data.  
         [0009]     Traditionally, rate control in the Internet is taken care of by the Transmission Control Protocol (TCP). TCP is described in many references places, for example, “Fred Halsall, Data communications, computer networks and open systems, 6th ed., Addison-Wesley, 1995. TCP is a window based rate control algorithm, i.e. window based rate control is achieved by limiting the amount of data that can be in the network at any one time. TCP is stable and normally makes fairly efficient use of the available bandwidth, and distributes network resources fairly between different users. For file transfer and email, TCP performs well because, provided the file or email arrives within a reasonable time at its destination, it is not important at which rate the data was transmitted. However, TCP rate control gives rise to fluctuations in the transfer rate that are unacceptable for applications where the rate of data transmission is important, for example, real time applications, such as video and audio streaming. The reason for this is that if a single packet is lost the congestion window is halved. Further TCP guarantees that lost packets will be retransmitted until they arrive at the receiver. For some applications including real-time multimedia applications, this is not necessary. Problems with rate fluctuations which occur in networks running TCP have made it necessary to develop alternative rate control algorithms. It is believed that in time TCP will become a less preferred option, as it becomes less able to deal with the greater variety of services users demand.  
         [0010]     Further, as congestion on the Internet increases, network managers are looking for alternative ways to manage it. Also, multimedia multi-party internet protocol (IP) applications, such as those mentioned above, can be very demanding in terms of their Quality of Service (QoS) requirements. Standards are being developed to ensure that network resources can be applied where they are most needed. However, problems still surround how the demand for different classes of QoS should be managed.  
         [0011]     One solution to this problem may be congestion based pricing. The underlying idea being to charge users or, on a more abstract level, to charge applications. The charge may be either in terms of real currency or in some other terms, for example fictional currency. The charge is made for the network resources used. Also the charge increases depending on the level of network congestion. When bandwidth becomes scarce, the charge will increase, when congestion reduces the charge is decreased. This gives users, or applications, the incentive to back off the network at times of network congestion. Congestion based pricing is discussed by F. P. Kelly in “Charging and rate control for elastic traffic”, European Transactions on Telecommunications, vol. 8, pp33-37, January 1997.  
         [0012]     Conventional rate control techniques are based on variables which reflect network performance, such variables include packet loss or roundtrip time. Price based approaches exploit “shadow prices” (an expression borrowed from economics which is applied to situations where actual prices cannot be charged, or where actual prices do not reflect the real sacrifice made when some activity is pursued. Shadow prices are used in valuing any item, such as a network resource, which is implicitly rationed or constrained in some way.) and user determined policies that specify how much the user values the data rate they get from the network. One way of expressing this variable is the user&#39;s willingness to pay for a particular service.  
         [0013]     One such priced based technique for managing congestion is discussed in OF P Kelly, A K Maulloo, and D K H Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society 49 (1998), no. 3, 237-252”. In this paper, Kelly et al propose an “equation based algorithm”. Equation based algorithms are so called because they differ from window based algorithms, such as TCP, in that the sending rate is determined directly (without any other external constraints) using a mathematical equation. Contrary to window based rate control, equation based rate control does not place an explicit limit on the amount of outstanding data (data that has left the sender, but has not arrived at the receiver yet). At present, TCP, a window based algorithm, is not able to support such alternative equation based algorithms for rate control.  
         [0014]     The equation based rate control algorithm proposed by Kelly et al is known as the “primal” algorithm. The primal algorithm determines the request for a data rate which a user sends to his service provider, when requesting a download of data. The primal algorithm is an adaptive system which takes user determined parameters, such as the user&#39;s willingness to pay for a service together with network manager determined parameters, such as the price charged by the resource per unit flow, and network determined parameters, such as the transfer rate of the flow along a particular route and the congestion price, to determine the sending rate request which the user sends to his service provider.  
         [0015]     The primal algorithm has been shown to be stable. However, the rate of convergence, that is the rate at which the algorithm reaches a stable rate, is a particular problem with the primal algorithm. This causes problems in particular, at the beginning of a download, where it takes the primal algorithm too long to go from a very low data rate to the desired data rate, and in situations where congestion is to be avoided, where the user desires a relatively low data rate, with however, little variation.  
         [0016]     The present invention provides a solution to the problems identified above with respect to resource control in data transmission.  
       SUMMARY OF THE INVENTION  
       [0017]     According to the present invention, there is provided a method of controlling the rate of data transmission from a source of data to a user via a communications link, wherein processing means are provided to generate a signal representing a rate request which will be used in determining the rate at which data will be transmitted from the source to the user, said processing means generating the signal by carrying out the steps of: 
    obtaining an indication of the amount of congestion on said communications link,     selecting a value indicative of the user&#39;s willingness to pay for a given transmission data rate, and     determining the rate to be requested as a function of the indication of the amount of congestion and the user&#39;s willingness to pay weighted by a variable parameter, the processing means thereafter communicating the signal to the source of data and the rate of the data transmission from the data source to the user then being controlled on the basis of the signal.    
 
         [0021]     The inventors have realised that by weighting a function of the user&#39;s willingness to pay and an indication of the congestion to determine a data rate to be requested, the data rate requested can be controlled more efficiently. This enables improved allocation of resources of the network over prior art systems.  
         [0022]     Preferably, the rate to be requested is determined using the following iterative equation: 
 
 X   n+1   =x   n +delta*kappa* x   n   ξ ( w−x   n *μ) 
 
 where x n  is the data transmission rate (bits per second) as calculated at an nth iteration; and x n+1  is the rate to be determined; x n *μ is the charge to the user indicative of amount of congestion and is the product of x n  and congestion charge μ; w is the willingness to pay; delta is the time elapsed between two iterations; kappa is a constant gain parameter; and ξ (xi) is a parameter whose value is set depending on the indication of congestion or the user&#39;s willingness to pay. 
 
         [0023]     This has the advantage of enabling the rate controller to adopt different policies depending on the user&#39;s preferences and the network conditions. The data rate requests will have different values depending on the users preferences and the network conditions. The possible policies differ by their reactivity speed to sudden changes to the congestion level.  
         [0024]     According to a further aspect of the present invention, there is provided a rate controller for controlling the rate of data transmission from a source to a user via a communications link, said rate controller including processing means for generating a signal representing a rate request which will be used in determining the rate at which data will be transmitted from the source to the user, said processing means including means for obtaining an indication of the amount of congestion on said communications link, 
    selecting means for selecting a value indicative of the user&#39;s willingness to pay for a given transmission data rate,     determining means for determining the rate to be requested as a function of the indication of the amount of congestion and the user&#39;s willingness to pay weighted by a variable parameter, the processing means further including means for communicating the signal to the source, wherein the rate of the data transmission from the source to the user is controlled on the basis of the signal.    
 
         [0027]     According to a further aspect of the present invention, there is provided a method of controlling the rate of data transmission from a source of data to a user via a communications link, wherein processing means are provided to generate a signal representing a rate request which will be used in determining the rate at which data will be transmitted from the source to the user, said processing means generating the signal by carrying out the steps of: 
    obtaining an indication of the amount of congestion on said communications link, selecting a value indicative of the user&#39;s willingness to pay for a given transmission data rate,     determining the rate to be requested on the basis of the ratio of said value to said indication of the amount of congestion on said communications link.    
 
         [0030]     The inventors have realised that by assessing the ratio of a user determined parameter and the indication of the congestion on the network to determine a data rate request, the rate of convergence of the system is dependent only on the congestion level. This has the advantage that the rate control method does not affect the stability of the network.  
         [0031]     Preferably, the method of controlling the rate of data transmission determines the rate to be requested in accordance with the following equation:  
         x     n   +   1       =       x   n     +     δ   *   κ   *     (       w   μ     -     x   n       )             
 
 where x n  is the data transmission rate (bits per second) as calculated at an nth iteration and x n+1  is the rate to be determined; u is the congestion charge indicative of amount of congestion; w is the willingness to pay; delta is the time elapsed between two iterations; and kappa is a constant gain parameter. 
 
         [0032]     Further according to another aspect of the present invention, there is provided a rate controller for controlling the rate of data transmission from a source to a user via a communications link, said rate controller including processing means for generating a signal representing a rate request which will be used in determining the rate at which data will be transmitted from the source to the user, said processing means including means for obtaining an indication of the amount of congestion on said communications link, 
    selecting means for selecting a value indicative of the user&#39;s willingness to pay for a given transmission data rate,     determining means for determining the rate to be requested as on the basis of the ratio of the user&#39;s willingness to pay to said indication of the amount of congestion on said communications link, the processing means further including means for communicating the signal to the source, wherein the rate of the data transmission from the source to the user is controlled on the basis of the signal.    
 
         [0035]     Both apparatuses summarised above are preferably embodied in a general purpose computer, suitably programmed.  
         [0036]     This invention also extends to a computer programmed to perform the method of the invention, and to a computer program product loadable into the internal memory of a digital computer, comprising software code portions for performing the steps of the method of the invention, when said product is run on a computer. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0037]     By way of example only, specific embodiments of the present invention will now be described with reference to the accompanying Figures in which:  
         [0038]      FIG. 1  shows schematically the basic components of a general purpose computer disposed in a network connected to a content provider, capable of performing the invention;  
         [0039]      FIGS. 2   a  and  2   b  show demand functions;  
         [0040]      FIG. 3  illustrates an example of a network including users and content providers where the concept of proportional fairness is applied;  
         [0041]      FIG. 4  is a flowchart illustrating schematically the operation of an embodiment of the invention;  
         [0042]      FIG. 5  is a flowchart illustrating schematically the operation of an embodiment of a further embodiment of the invention; and  
         [0043]      FIG. 6  is a flowchart illustrating schematically the operation of yet a further embodiment of the invention. 
     
    
     BACKGROUND OF THE PREFERRED EMBODIMENTS  
       [0044]     In the preferred embodiment described below, reference is made to transmission of video data. However, the invention is not limited in this respect and may be applied to the transmission of any data. As mentioned above, the present invention has particular application to real time data such as video, audio data as well as interactive and multiparty applications.  
         [0045]      FIG. 1  shows an internetwork comprising a content provider&#39;s local area network  1  connected to a customer end configuration via an internet service provider&#39;s (ISP) network  6 . The content provider&#39;s local area network  1  includes a video server  4  having a stream adaptation module  24  and a memory  26  where the video data is stored. It is not essential that the memory  26  be located at a particular video server. The memory  26  may be remote from the server  4 .  
         [0046]     The customer end includes a video player  2  and a dynamic price handling module  8 , and a portion of the global Internet  6  which interconnects the user with the content provider.  
         [0047]     The internetwork in  FIG. 1  is suitable for use with methods for controlling congestion, such as congestion based pricing. The congestion level in the network is signalled to the user, for instance, by using the explicit notification protocol (ECN). The ECN protocol is standardised as part of the IETF Standard Track as RFC 3168[21], and is the subject of the Market Managed Multiservice Internet (M31) Consortium, a multi party collaboration including the applicants. For more information on the M31 Consortium reference is made to http://www.m3i.org.  
         [0048]     When a user sends a request for a download of data to the content provider, the internetwork shown in  FIG. 1  responds as described below. The content provider receives the request and when the data is ready for transmission begins to transmit data to the user via the network. The network provider linking the content provider to the user randomly mark data packets on its network. The larger their data rate, i.e. the number of packets per unit time, the higher the probability will be that a packet is marked. Thus the number of marked packets received at the user end will be indicative of congestion level. Marking of data is done in accordance with the explicit congestion notification protocol, which has been standardised as part of the IETF Standard Track as RFC 3168[21].  
         [0049]     The marks in the data are detected at the user end of the network by a metering module  14 . The location of the metering module  14  is not important provided it is disposed between the content provider and the user. For example, it may be disposed within the network or at the user&#39;s end.  
         [0050]     The metering module  14  produces an estimate of the marking rate for the data destined for the user, which is the ratio of marked packets among the received packets over an observation period.  
         [0051]     The user is charged an amount for each marked packet in the data stream received. This charge may bear a real monetary value and later be used to actually charge the user. Alternatively, the price per mark may also remain a fictional charge and simply represent an indication of the amount of data on the network, i.e. the level of congestion. If there is enough traffic with one user on the connection, then the number of marks will be an indication of the congestion on the network, that is the total amount of traffic on the network. Thus the congestion indication may represent a symbolic incentive for the user to reduce her consumption of the network&#39;s resource. In any case, the marking rate reflects the current congestion level in the network and is the main dynamic input to the control means  18  at the user&#39;s end to the control the data rate of the connection and thereby optimise the utility of the customer. The price charged by the network is proportional to the congestion level. The charge for the user is based on the product of the price charged by the network and the amount of data sent or received by the user.  
       DETAILED DESCRIPTION OF THE EMBODIMENTS  
       [0052]     The present invention is preferably embodied in a rate controller  16 , comprised within a dynamic price handling (DPH) agent  8 . In the example, shown in  FIG. 1 , the DPH agent is located at the user&#39;s end. This arrangement is preferable, however, the invention is not limited in this respect, and the DPH agent  8  may be located anywhere within the internetwork provided the user&#39;s preferences can be input to it, and provided its output can be transmitted onto the network. In particular, DPH may be located at the content provider&#39;s end.  
         [0053]     The role of the DPH is to perform the rate control of the data stream the user is interested in. When the user sets up a connection she specifies her control policy  32 . Then for the duration of the connection, the DPH monitors the evolution of the marking rate  30  and—when necessary—requests that the data rate delivered to the user over the network to be adjusted to a new target rate  36 . The delivery process itself may be carried out according to any method as long as it provides a working interface for rate control purposes. The improvement achieved by the present invention is to have a configurable rate control based on the congestion marks signalled by the network rather than a default rate control based on packet losses.  
         [0054]     The marking rate is retrieved from the metering module  14 , it represents the proportion of marked packets within the data stream during a period and is expressed in marks per packet. This period will not necessarily be the same for input to the price reactor  18  and to the rate controller  16 .  
         [0055]     The adjustment request from the rate controller is communicated to the server  4  via the quality of service controller  12  of the video client  2  over the control channel  38 . The stream adaptation module  24  of the video server will adjust the data sent to the user accordingly.  
         [0056]     The DPH agent  8  is now described in greater detail. Within the DPH agent  8  three main functions are performed: the policy selection, the price reaction and the rate control. While the policy selection is done mainly before the service is delivered to the customer, the price reaction and rate control are carried out during the duration of the connection. It may also be updated occasionally as the service is provided. The price reaction and rate control however, are performed continually while the service is being delivered, with the price reaction preferably, being performed on a longer timescale than rate control.  
         [0057]     When a connection is set up for download of data to a user, the user defines her strategy, i.e. how she will react to changes in the congestion indication (or congestion price). This is done by selecting a buying policy reflecting her needs using the policy selector  20 . A default policy, or more usually a selection of popular or commonly used policies, is provided by the content provider when the connection is set up, but the user is able to customize her buying policy to accommodate her preferences. The buying policy defines the demand function  32  of the user, and is used by the price reactor to determine the requested data rate. The demand function is the relationship between a given congestion indication (or congestion price) and the data rate the user is willing to accept for that congestion indication. Having selected a buying policy, the DPH agent is able to handle the transmission control on behalf of the user for the rest of the session. If the user wishes, however, the buying policy may be changed during the session.  
         [0058]     The policy selector allows the user to define how she would like the DPH to react to the congestion signal by choosing an adequate user policy. The user will always have to choose her policy when the connection is set up and she may modify or change it during the session. The default policy is adopted if the user does not want to configure the DPH. The user policy is the only input the DPH needs from the user to handle the rate control of the connection on the user&#39;s behalf.  
         [0059]     The policy selector  20  translates the user policy into a demand function  32  that gives the optimal rate the DPH should request for any congestion shadow price. A typical demand function is a decreasing function of the congestion price: the more congested the network, the less the user is willing to create traffic. In the implementation of the DPH, the decreasing function is represented as a set of points that give the value of the demand function for a number of values of the congestion price. The value of the demand function  32  for other congestion prices is obtained by linear interpolation.  
         [0060]     The price reactor module  18  periodically establishes the willingness to pay  34  of the user according to the user&#39;s demand function  32  obtained from the policy selector  20 , and to the marking rate  30  reported via the metering module  14 . In addition, the price reactor  18  infers an estimate of the congestion shadow price in the network from the marking rate  30  reported via the metering module  14 . This estimate reflects the congestion level in the network.  
         [0061]     The function of the rate controller  16  is to reach the optimal transmission data rate as smoothly as possible to avoid compromising the stability of the network. Consequently, the rate control module  16  monitors the congestion indication (or congestion price) on a shorter timescale than the price reactor  18  does. This is achieved using the rate control algorithm of the present invention, described in detail below  
         [0062]     In the embodiment shown in  FIG. 1 , the rate controller  16  determines which streaming data rate is to be requested, and communicates it to the quality of service controller which is embedded in the video player  12 , which sends a request message. The decision to request a data rate adaptation is performed by the quality of service controller, which sends a request to the content provider. However, it is not essential that the quality of service controller handles the communication to the content provider&#39;s server. The rate controller  16  may also communicate the request data rate to the content provider.  
         [0063]      FIG. 1  also shows the main components of the DPH agent  8  and how they interface together. The policy selector  20 , with which the user interacts, inputs the demand function  32  to the price reactor  18  at the start of the session. During the whole duration of the session, the marking rate  30  is communicated to the price reactor  18  and the rate controller  16 . At regular time intervals, the price reactor  18  updates the willingness to pay  34  which is communicated to the rate controller  16 . Periodically, according to the willingness to pay and the congestion price estimate (determined from the marking rate), the rate controller selects a new target data rate  36 , which the rate controller  16  or quality of service controller communicates to the content provider. Overall, the DPH agent  8  therefore, determines the adaptation signal for the data rate on the connection from the congestion indication signalled by the marking rate.  
         [0064]     The dynamic inputs to the DPH agent  8  are the marking rate, the price per mark and the demand function which includes the willingness to pay. However, usually, the price per mark and the demand function will not vary during a session.  
         [0065]     The marking rate is retrieved from the metering module  14  and represents the proportion of marked packets within the data stream during a period. This period will not necessarily be the same for the input to the price reactor  18  and to the rate controller  16 .  
         [0066]     The demand function  32  is communicated from the policy selector  20  to the price reactor  18 . The price reactor  18  determines the optimal streaming rate in bits per second for a set of discrete values of the congestion indication in marks per bit. The value of the demand function  32  for any congestion price is obtained by linear interpolation.  
         [0067]     The willingness to pay  34  is determined by the price reactor  18  and communicated to the rate controller  16 .  
         [0068]     The target rate  36 , expressed in bits per second, is preferably communicated to the quality of service controller  15  for further communication to the stream adaptation module  24  at the content provider&#39;s server  4 .  
         [0069]     With respect to the components of the DPH agent, the following additional description is given.  
         [0000]     The Policy Selector  
         [0070]     The policy selector  20  produces the user&#39;s selected policy which contains the demand function of the user, inferred from the utility function. For further details on how the demand function is extracted from the utility function, reference is made to “B. Briscoe, “Price Reaction Design”, Deliverable 3.2 (July 2000), M31 EU Vth Framework Project IST-1999-11429 http://www.m3i.org.  
         [0071]     The demand function is the relationship between the user&#39;s optimal preferred data rate and the estimated congestion price.  
         [0072]     By way of explanation,  FIG. 2  shows two demand functions.  FIG. 2   a  is a demand function whose purpose is to demand a constant data rate regardless of the congestion price. So, however high the congestion price, the user is prepared to pay in order to maintain her optimal data rate. The user policy related to this demand function is referred to as “constant quality of service”. In terms of utility function, the “constant quality of service” policy is a step form, i.e. the customer has no use of the data unless it is received completely.  
         [0073]      FIG. 2   b  shows a demand function which is intended to keep the charging rate constant over a period of time (the amount of money charged to the user for the data transmitted over a unit of time). The policy related to this demand function is referred to as “constant charge”. In terms of utility function, the “constant charge” policy corresponds to a user with a logarithmic utility for the bandwidth. It is added that the invention supports a wide variety of policies and is not limited in this respect. Further, any policy can be customised to accommodate a user&#39;s preference. The two policies discussed above, however, represent two of the most preferred policies.  
         [0000]     The Price Reactor  
         [0074]     The price reactor takes the user&#39;s policy which defines the demand function D(p) with respect to the shadow congestion price to determine the user&#39;s willingness to pay.  
         [0075]     The marking rate from the metering module  14  is the primary dynamic input to the price reactor  18 . The marking rate is evaluated by the price reactor  18  on a periodic basis.  
         [0076]     The first step (1) is to obtain the congestion price. The congestion price, p(·), in charging unit per bit is inferred from the marking rate, m(·), in marks per bit, and the price per mark,ppm, in charging unit per mark.  
         [0077]     (1) p=m*ppm, where p is the congestion price as a function of time, m is the marking rate as a function of time, and * hereinafter means multiplied by.  
         [0078]     The second step (2) is for the price reactor to determine an intermediate target rate in bits per second.  
         [0079]     (2) target_rate=D(p).  
         [0080]     The third step is to determine the willingness to pay, w, from the target rate.  
         [0081]     (3)w=target_rate*m.  
         [0082]     The willingness to pay is communicated to the rate controller.  
         [0000]     Rate Controller  
         [0083]     The rate controller  16  includes a memory  17  for storing the requested data rates and a processor. The rate controller  16  determines the data rate that is to be requested to the content provider on the basis of the willingness to pay of the user, the instantaneous congestion price and the data rates available from the content provider&#39;s server  4 .  
         [0084]     The rate controller  16  calculates the optimal data rate using a rate control algorithm according to the present invention. The rate control algorithm enables an optimal target rate to be calculated in order to adapt to changing congestion conditions without putting the network stability at risk.  
         [0085]     The rate control algorithm used by the rate controller  15  is: 
 
 x   n+1   =x   n +delta*kappa* X   n   ξ ( w−x   n *μ)  (4) 
 
 where x n  is the current target rate in bits per second as calculated at the nth iteration; μ is the congestion charge and is determined from the marking rate obtained from the metering module  14 ; w is the willingness to pay as updated by the price reactor  18 ; delta is the length of the metering cycle in seconds; kappa is a constant; and ξ(xi) is a parameter having a value between −1 and +1. ξ is discussed fully below. It is noted that μ in Formula (4) is used to give an indication of the congestion, and does not necessarily have any monetary implication. 
 
         [0086]     It is further added that kappa is constant and represents the ability of the system to adapt to a change in the requested data rate. Kappa, also denoted as κ in the text below, is referred to as the adaptation gain, that is the nominal speed of reaction. The tuning of kappa reflects the compromise between reactivity and stability. The higher the value of kappa, the swifter the reaction of the system (at the risk of causing instability). The lower the value of kappa, the more stable the data rate will remain (at the risk of barely adapting to a different requested data rate). If, for example, kappa were 0, the data rate would remain constant and would not adapt in spite of the requested data rate.  
         [0087]     Formula (4) represents a discretisation of a system of differential equations underlying the present algorithm as discussed below, and shown below in equation (5).  
         [0000]     Theoretical Background  
         [0088]     In order to fully appreciate the invention, some theoretical background of the rate control algorithm of the present invention is given in this section.  
         [0089]     For background, reference is made to “F P Kelly, A K Maulloo, and D K H Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society 49 (1998), no. 3, 237-252”, which sets out the primal algorithm and the concepts of stability and fairness of a system governed by an equation based congestion algorithm.  
         [0090]     The inventors of the subject application have deduced that the non-time delayed version of the primal algorithm is globally stable and proportionally fair, but the global stability is not guaranteed when time lags are taken into consideration. The inventors have found out that the kappa parameter in the algorithm is crucial: it has to be sufficiently small to achieve an acceptable level of local stability. However, setting kappa to the low values required to attain stability, results in a painstakingly slow convergence, which is also not acceptable. The inventors have found, that in fact, the rate of convergence in general in the primal algorithm is problematic. The lack of a mechanism like the slow-start in TCP is partly responsible for these problems. (It is noted that the name “slow-start” in TCP is counterintuitive: during uslow-start” the transfer rate actually changes very rapidly, not slowly, in order that the data rate reaches the optimum rate as quickly as possible. This nomenclature has its roots in TCP&#39;s history.)  
         [0091]     The algorithm of the present invention overcomes the problems with the primal algorithm. It is able to operate in different phases, like “slow-start”, i.e where the data rate changes rapidly, and congestion avoidance, i.e. where the data rate is kept constant. The algorithm of the present invention is referred to hereinafter as the ξ(xi) algorithm and is named after one of its parameters, which determines the “phase”, i.e. the mode, in which the algorithm operates.  
         [0092]     In the sections below, the ξ(xi) algorithm is presented and, some theoretical results on its stability and fairness are derived. Also, the presence of the ξ parameter, that allows the algorithm to operate in different phases is discussed. This discussion includes the discussion of phase transitions, that is when to move from one phase to another.  
         [0000]     ξ(xi) Algorithm  
         [0093]     To present the ξ algorithm, a mathematical model is required. Let J be a set of network resources, and c j  the (finite) capacity of resource j, for j∈J. Furthermore, take R ⊂ P(J), the set of possible routes, and x r , r∈R, the transfer rate of the flow through route r.  
         [0094]     Let A=(A jr , j∈J, r∈R), where A jr =0 if j∉r and 1 if j∈r.  
         [0095]     A vector of transmission rates x=(x r , r∈R) is feasible if x is greater than or equal to 0 and Ax is less than or equal to c.  
         [0096]     In addition, the functions p j (·), j∈J, where p j (y) is the price charged by resource j, per unit flow, when the total flow through resource j is y. Finally, take W=(w r , r∈R), the amounts users are willing to pay per unit time for each route, and kappa, the gain factor discussed above.  
         [0097]     The ξ algorithm can now be described by the system of differential equations:  
                 ⅆ     ⅆ   t       ⁢       x   r     ⁡     (   t   )         =     κ   ⁢           ⁢         x   r     ⁡     (   t   )       ξ     ⁢     (       wtp   r     -         x   r     ⁡     (   t   )       ⁢       ∑     j   ∈   r       ⁢       m   j     ⁡     (   t   )             )               (   5   )             
 
 where the summation is over a set of routes, and where  
                 m   j     ⁡     (   t   )       =       p   j     (       ∑     s   :     j   ∈   s         ⁢       x   s     ⁡     (   t   )         )             (   6   )             
 
 where the summation is over all routes ξ which contain resource j and where 4 is the reactivity parameter, as discussed below. 
 
         [0098]     It is assumed above that r ranges over R and j over the set J.  
         [0099]     As mentioned previously the prices p j (·) need not be prices in the strict sense of the word. The may, as mentioned, represent the level of congestion feedback from the network via the metering module  14 .  
         [0100]     It is observed that when ξ=0, the behaviour of the ξ algorithm is identical to that of the primal algorithm. However, when ξ is set to a value greater than zero, the algorithm is more aggressive than a standard additive increase, multiplicative decrease (AIMD) algorithm, and more resembles TCP&#39;s behaviour during “slow-start”. On the other hand, when ξ is less than zero, the transfer rate is kept almost constant, changing very slowly indeed. A more detailed analysis of how the algorithm&#39;s behaviour depends on ξ is given below.  
         [0000]     Stability and Fairness of the ξ Algorithm  
         [0101]     Stability and fairness are two important criteria applied to congestion algorithms to assess their performance.  
         [0102]     An algorithm is regarded as being stable if it has a stable operating point, that is a situation in which the transfer rate is kept constant under constant network conditions. An algorithm is regarded as having global stability if the stable operating point is reached automatically after a certain amount of time. Furthermore, an algorithm is regarded as having local stability if, after a stable situation has been reached, small perturbations of the network conditions, do not affect the stable operating point. And finally, assuming that an algorithm will converge to a stable operating point, what is the rate of convergence, that is how long does it take before a stable situation is reached.  
         [0103]     The concept of fairness pertains to situations where a number of flows share network resources. In real life situations, these resources are generally limited. Fairness is concerned with each flow getting its “fair share” of the available resources. What exactly is meant by “fair” depends on the sort of fairness used, as there are different criteria for assessing fairness. The type of fairness used to assess the 4 algorithm is proportional fairness.  
         [0104]     The inventors have shown that the ξ algorithm exhibits good stability and fairness. These two properties were considered by Kelly et al in “F P Kelly, A K Maulloo, and D K H Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society 49 (1998), no. 3, 237-252”. The inventors have applied the criteria of stability and proportional fairness defined in Kelly et al&#39;s paper to the ξ algorithm.  
         [0105]     In order to appreciate how the stability of the ξ algorithm has been determined theoretically, Lyapunov&#39;s second method is referred to. For the sake of completeness a brief discussion of Lyapunov&#39;s second method is given below. Reference is made to “William E Boyce and Richard C DiPrima, Elementary differential equations and boundary value problems, 6 th  edition, John Wiley &amp; Sons, Inc” for a fuller explanation of this method.  
         [0106]     Lyapunov&#39;s second method is used to establish the stability or otherwise of systems of differential equations, such as those set out above in equations (5) and (6) representing the present invention, and is as follows: Given an autonomous system of differential equations  
                   ⅆ     x   1         ⅆ   t       =       F   1     ⁡     (   x   )         ,         ⅆ     x   2         ⅆ   t       =       F   2     ⁡     (   x   )         ,       …   ⁢           ⁢       ⅆ     x   n         ⅆ   t         =       F   n     ⁡     (   x   )                 (   7   )             
 
 and a function V(x), defined on some domain D containing the origin, define the function V Y :  
                 V     Y   ′       ⁡     (   x   )       =           ∂   V       ∂     x   1         ⁢     (   x   )     ⁢       F   1     ⁡     (   x   )         +         ∂   V       ∂     x   2         ⁢       F   2     ⁡     (   x   )         +   …   +         ∂   V       ∂     x   n         ⁢     (   x   )     ⁢       F   n     ⁡     (   x   )                   (   8   )             
 
 Note that V Y  depends on the system of differential equations set out in equations (7). For convenience, the following definition is introduced: 
    Lyapunov function: consider the system of differential equations (7) and assume that it has an isolated critical point {circumflex over (x)}. A function V(x) that is continuous, has continuous partial derivatives, has a global maximum at {circumflex over (x)}, and for which {dot over (V)}(x-{circumflex over (x)}) is positive definite on some domain D containing the origin, is called a Lyapunov function for the autonomous system represented by equations (7).    
 
         [0108]     Using this definition the following theorem can be stated (proof omitted): 
    Theorem 1: suppose that the autonomous system represented by equations (7) has an isolated critical point {circumflex over (x)}. If there exists a Lyapunov function V for this system, then {circumflex over (x)} is an asymptotically stable critical point. If the function {dot over (V)}(x−{circumflex over (x)}) given in the definition above is positive semidefinite instead of positive definite, then the origin is a stable critical point.    
 
         [0110]     To assess the stability of the ξ algorithm Kelly&#39;s approach was used. Thus, the following formula is defined:  
               U   ⁡     (   x   )       =         ∑     r   ∈   R       ⁢       w   r     ⁢   ln   ⁢           ⁢     x   r         -       ∑     j   ∈   J       ⁢       ∫   0       ∑     s   :     j   ∈   s         ⁢     x   s         ⁢         p   j     ⁡     (   y   )       ⁢           ⁢     ⅆ   y                     (   9   )             
 
         [0111]     Where U(x) is the user&#39;s utility function, from which the demand function, as discussed above, is derived.  
         [0112]     It is assumed that w r &gt;0, r∈R, and that for j∈J the functions p j (y), where y≧0, are non-negative, not identically zero, continuous, and increasing.  
         [0113]     The following Theorem 2 is proposed: the continuous, strictly concave function U(x) is a Lyapunov function for the system of differential equations (5) and (6). The unique value x maximising U(x) is an asymptotically stable point of the system.  
         [0114]     The following proof is given: it follows from the assumptions on w r , r∈R, and p j , j∈J. that U(x) is strictly concave on x  20  with an interior maximum. Hence, the maximising value of x, which we shall call {circumflex over (x)}, is unique.  
         [0115]     Observe that U has continuous partial derivatives, and that  
                       ⅆ     ⅆ   t       ⁢     U   ⁡     (     x   ⁡     (   t   )       )         =       ⁢       ∑     r   ∈   R       ⁢         ∂   U       ∂     x   r         ⁢     ⅆ     ⅆ   t       ⁢       x   r     ⁡     (   t   )                         =       ⁢     κ   ⁢       ∑     r   ∈   R       ⁢             x   r     ⁡     (   t   )       ξ         x   r     ⁡     (   t   )         ⁢       (       w   r     -         x   r     ⁡     (   t   )       ⁢       ∑     j   ∈   r       ⁢       p   j     (       ∑     s   :     j   ∈   s         ⁢       x   s     ⁡     (   t   )         )           )     2             ,                 (   10   )             
 
 establishing that  
         ⅆ     ⅆ   t       ⁢     U   ⁡     (       x   ⁡     (   t   )       -     x   ^       )           
 
 is a positive definite on some domain containing the origin. 
 
         [0116]     It is thus shown that U is a Lyapunov function for the system represented by equations (5) and (6).  
         [0117]     Application of Theorem 1 yields the second part of the Theorem.  
         [0118]     To assess the fairness of the ξ algorithm the following Kelly definition of proportional fairness was used.  
         [0119]     Suppose that the network has a set of J resources, and let c j  be the finite capacity of resource j, for jεJ. Further more, take R ⊂ P(J), the set of possible routes, and x r ,rεR the transfer rate of the flow through route r. Finally we define A=(A jr ,jεJ,rεR), where 
 
 A   jr =0 if j∉r and 1 if jεr. (11) 
 
         [0120]     A vector of sending rates x=(x r ,rεR) is feasible if x≧0 and Ax ≦c.  
         [0121]     Proportional fairness is defined as follows: A vector of rates x is proportionally fair if it is feasible, and if for any other feasible vector {circumflex over (x)}, the aggregate of proportional changes is zero or negative:  
                 ∑     r   ∈   R       ⁢           x   ^     r     -     x   r         x   r         ≤   0.           (   12   )             
 
         [0122]     Without showing proof, the following Theorem  3  is stated from “Jean-Yves Le Boudec, Rate adaptation, congestion control and fairness: A tutorial.”.  
         [0123]     Theorem 3: For every network situation there exists a unique proportionally fair allocation. It is obtained by maximising  
         ∑     r   ∈   R       ⁢     ln   ⁢           ⁢       x   r     .           
 
         [0124]     Theorem 3 is particularly useful because it gives a practical way of computing a proportionally fair allocation. Simply maximising the function  
         ∑     r   ∈   R       ⁢     ln   ⁢           ⁢       x   r     .           
 
 suffices 
 
         [0125]      FIG. 3  illustrates proportional fairness using a network with two resources  300 ,  302  and three users  304 ,  306  and  308 . Both resources  300 ,  302  have capacity  12  (arbitrary units). The proportionally fair allocation is shown: user  304  has 4 units, users  306  and  308  have 8 units. Proportional fairness gives priority to small flows.  
         [0126]     An extension to the proportional fairness concept is the idea of weighted proportion fairness. The definition is as follows: A vector of rates x is proportionally fair if it is feasible, and if for any other feasible vector {circumflex over (x)}, the aggregate of weighted proportional changes is zero or negative:  
                 ∑     r   ∈   R       ⁢       w   r     ⁢           x   ^     r     -     x   r         x   r           ≤   0           (   13   )             
 
 with w=(w r ,rεR) a vector of weights, n.b. w here is not to be confused with the willingness to pay, shortened to w. 
 
         [0127]     Theorem 3 can be adapted to cover weighted proportional fairness. It is now necessary to maximise  
         ∑     r   ∈   R       ⁢       w   r     ⁢   ln   ⁢           ⁢       x   r     .           
 
 It is to be noted that the uniqueness of the solution is not guaranteed any longer, but depends on the weighting vector, w. 
 
         [0128]     Theorem 4: the functions p j ,j∈J, may be chosen such that the vector x maximising U(x) approximates arbitrarily closely a vector of rates that is weighted proportionally fair, with vector of weights w.  
         [0129]     The following proof of Theorem  4  is given: let the functions p j ,j∈J, be defined as  
                 p   j     ⁡     (   y   )       =         (     y   -     c   j     +   ɛ     )     +     /     ɛ   2               (   14   )             
 
 where pj is a price function and E dictates the slope of the price functions. (The superscript+indicates that if the quantity within the brackets has a negative value, then it takes the value zero, and if the quantity within the brackets is positive, then it keeps its positive value.) 
 
         [0130]     These functions are continuous. As ε→0, the vector maximising U(x) approximates arbitrarily closely the solution of the fairness problem  
             max   ⁢       ∑     r   ∈   R       ⁢       w   r     ⁢   ln   ⁢           ⁢     x   r                 (   15   )             
 
 subject to Ax≦c over x≧0. 
 
         [0131]     Hence, by Theorem  3 , set out above, x is proportionally fair per unit charge.  
         [0132]     It is important to note that both Theorems  2  and  4  remain valid when a different value for ξ is taken for each route or user, that is taking ξ=(ξ r ),r∈R instead of just ξ.  
         [0133]     The ξ algorithm and phases  
         [0134]     The ξ algorithm has the distinct advantage over other equation based congestion algorithms depending on its implementation discussed below, of weighting the data rate to be requested by a variable parameter, ξ. This enable, for example, the ξ algorithm to operate in different phases, i.e. depending on the network conditions at a particular time, its reaction to the particular conditions will be different, allowing it to adapt, and to ultimately cause data in the network to be handled more efficiently. The phase of the algorithm is determined by the value of ξ. The switching from one phase to another depends on network and user defined conditions. The present invention based on an assessment of these conditions causes the phase switch to occur automatically, to thus ensure a more efficient resource management. An embodiment showing the phase switch is shown in  FIG. 5 .  
         [0135]     In the embodiment discussed below with reference to  FIG. 4 , ξ is a weighting variable parameter.  
         [0136]     In the embodiments discussed below with reference to  FIG. 5 , ξ takes one of two values depending on the network conditions and the user&#39;s willingness to pay. ξ is not however, limited in this respect and can take an infinite number of values. In this section the behaviour of the ξ algorithm is observed with respect to a limited small subset of examples where ξ has the value 0, −1 and +1. Also discussed in this section are the network and user defined conditions which apply to cause the algorithm to switch phases, ie. the conditions that apply to cause ξ to change value. By responding to network conditions, the change in the selection of the value of ξ will change the behaviour of the network, and in particular, as discussed above with reference to  FIG. 1  and below with reference to  FIG. 5 , the requested data rate that is sent to a content provider.  
         [0137]     In the first of the examples, ξ is selected to be equal to zero. When ξ=0, the algorithm behaves in the same way as the primal algorithm.  
         [0138]     In the second example, ξ is set to be equal to +1. It was mentioned earlier with reference to the prior art, that one of the problems of the primal algorithm is slow convergence due to the absence of a mechanism like slow-start in TCP. Setting ξ=1 solves this problem: it provides a phase in which the transfer rate increases exponentially. This causes the algorithm to act “aggressively” to generate rapidly changing data rate requests which are sent to the content provider. This phase is particularly useful at the beginning of a data download, where the user will want to go from zero data rate request to a stable downloading data rate as quickly as possible. The proof in Theorem 4 with respect to the stability does not depend upon the value of ξ, so in theory the aggressive rate control strategy that is the result of setting ξ to +1 does not compromise stability.  
         [0139]     In the third example, ξ is set to −1. Whereas ξ=1 results in aggressive rate changes, setting ξ=−1 has exactly the opposite effect: the transfer rate will be adapted extremely slowly. This means that the convergence will be slow, but once equilibrium is reached, small perturbations will have little or no effect. In other words the local stability will be extremely good. This situation is very desirable for some applications, notably real-time video or audio streams. Thus, this phase is very useful in situations where no drastic adaptation of the transfer rate seems to be required, and the only changes are due to small perturbations in shadow price information around an equilibrium.  
         [0140]     The present invention allows for the possibility of setting; to ξ or +1 when relatively rapid changes of data rate request are required, for example to get sufficiently fast convergence, while setting ξ=−1 at other times to satisfy the needs of several different types of applications, for example, real time data download applications and multimedia applications.  
         [0141]     The invention is not limited with respect to what determines the value of ξ. For example, however, one set of parameters to apply when changing ξ=1 or 0 to ξ=−1 is in response to the marking rate which gives rise to congestion indication and the price charged by the network. When that price is within a tolerance parameter, beta, close to the price the user is willing to pay, ξ can be set to −1 because when the price charged is more or less the same as the price the user is willing to pay, the data rate request should be kept as close to the user&#39;s willingness to pay as possible. This mechanism is explained in more detail with reference to  FIGS. 4 and 5 .  
         [0142]     A preferred implementation of the invention is in software: the rate controller  16  acts as a single middleware that runs in the background on a user&#39;s machine. It captures a user specified buying policy from the policy selector  20  along with the real-time dynamic pricing information from the marking module  14  and produces a requested data rate using the ξ algorithm described above.  
         [0143]     The form in which the ξ algorithm was present above, as a system of differential equations, makes it unsuitable to be implemented in software directly. Computers provide a discrete environment and cannot cope with the inherently continuous nature of a differential equation. To implement the invention in software, it is therefore necessary to include a discretisation step and to transform the differential equations into difference equations.  
         [0144]     This results in equation (4), which may also be written as the following system:  
                   x   r     ⁡     [     t   +   1     ]       =         x   r     ⁡     [   t   ]       +     δκ   ⁢           ⁢         x   r     ⁡     [   t   ]       ξ     ⁢     (       w   r     -         x   r     ⁡     [   t   ]       ⁢       ∑     j   ∈   r       ⁢       m   j     ⁡     [   t   ]             )           ⁢     
     ⁢   where   ⁢     
     ⁢           m   j     ⁡     [   t   ]       =       p   j     (       ∑     s   :     j   ∈   s         ⁢       x   s     ⁡     [   t   ]         )       ,             (   16   )             
 
 and δ is the discretisation step size. Other techniques for solving differential equations numerically, for example numerical integration, could also be used. 
 
         [0145]     The step size δ is important. It should not be too small, because of restrictions on computing power and the availability of price feedback, but a step size that is too large will result in errors. Preferably, the step size δ is chosen in accordance with the frequency of the price feedback availability. This will vary from network to network depending on the marking rate in the network. The period over which marks are collected and counted should not be too short, for then the number of marks will always be either 0 or 1, or perhaps a little higher, and most of the price information will then be conveyed by the number of marks in any one period. On the other hand, from the point of view of the rate control algorithm, it is desirable to have price feedback as frequently as possible.  
         [0146]     Those skilled in the art will have no difficulty in providing a program to collect the parameters discussed above, applying the algorithm to those parameters to generate the network resource control described above, and shown step by step in  FIGS. 4 and 5 .  
         [0147]     The procedure for implementing resource control using the rate controller of the present invention is shown in  FIGS. 4 and 5 . The rate controller  16  functions according to the 4 algorithm shown in equations (4) and alternatively notated in equation (16).  
         [0148]     As mentioned above, the rate controller  16  preferably forms part of the DPH agent  8  shown in  FIG. 1 .  
         [0149]     With reference to  FIG. 4 , at step  41 , the indication of the congestion is obtained. In step  42 , the willingness to pay is selected in response to the price reactor as described with reference to  FIG. 1 . In step  43  the dynamic input values are retrieved: the data rate, x n  is retrieved from the memory  17  in the rate controller  16  and the indication of congestion is obtained from the price reactor  18  if not already retrieved. In step  58 , the difference, D, between the willing ness to pay and m*x n  is computed. In step  44 , the data rate to be requested is determined as a function of the indication of the congestion and the willingness to pay. In step  45 , the output of step  44  is weighted by a variable parameter, xi.  
         [0150]     In step  46  the data rate to be requested is communicated to the content provider. In particular, this is done via the stream adaptation module  24 .  
         [0151]     In step  47 , it is ascertained whether or not the data transfer is complete. If it is complete, the algorithm ends. If the transfer is not complete, it is ascertained in step  48  whether the willingness to pay, w, is to remain the same, or whether this user determined parameter is to change. If the willingness to pay is to remain unchanged, the algorithm proceeds directly to step  43  for the next iteration. If the willingness to pay is changed, the algorithm returns to step  41 .  
         [0152]     A further embodiment is now described with reference to  FIG. 5 . At step  50  the adaptation gain factor, kappa, and the discretisation constant, delta, are set. As mentioned, the selection of kappa will reflect a compromise reached between reactivity, also referred to as convergence and stability. The higher the value of kappa the ampler the reaction, and the greater the risk of instability. The lower the value of kappa, the more stable the data rate, and the greater the risk of not adapting enough. The choice of the value of delta will depend on the computing resource available, the marking rate and the frequency of the price feedback. At step  50 , the constant beta is also set. This constant is a tolerance parameter reflecting the limits with respect to the network determined parameter, that is the price derived from the congestion indicators, within which the user determined parameter, that is the willingness to pay, should fall if the requested data rate is to remain stable. If the willingness to pay with respect to the price does fall within the tolerance parameter, xi is set to zero. If, on the other hand, the willingness to pay with respect to the price does not fall within the tolerance parameter, xi is set to 1 or to any other small positive value, to cause the algorithm to react speedily to request a higher data rate. The value of beta will depend on the network, and preferably lies between 1 and 10%. For example, if beta is set to 0.05, i.e. 5%, then the values obtained in step  60  is [0.95*w;1.05*w], or in other words, when that value differs from w by less than 5%, xi is set to 0 for a gentle adaptation, otherwise xi is set to 1 or a small positive value for the aggressive adaptation. In the particular example given above, the value of xi is a step function, however, how xi varies is not limited, and xi may also vary continuously, for example, with the difference between the price and the willingness to pay.  
         [0153]     The values kappa, delta and beta do not have to remain fixed throughout the session or download. However, usually, they will remain fixed during one session.  
         [0154]     In step  52 , the price estimate, g, also referred as the congestion charge, is retrieved from the price reactor. It is noted that the price estimate μ may also be referred to as the congestion charge. In step  54  the willingness to pay, w, is set in response to the price reactor as described with reference to  FIG. 1 . In step  56  the dynamic input values are retrieved: the data rate, x n  is retrieved from the memory  17  in the rate controller  16  and the price estimate, m, from the price reactor  18  if not already retrieved. In step  58 , the difference, D, between the willingness to pay and μ*x n  is computed. The product of μ*x n , is the indication of congestion.  
         [0155]     In step  60 , it is established whether the difference, D, lies within the range 1-beta*w and 1+beta*w. If D does lie within the range then xi is set to 0 in step  64 . If D does not lie within the range, xi is set to 1 or a small positive value in step  62 . Once xi is set, the next step  66  is to compute the difference, D, multiplied by x n  to the power xi, that is D* x n   ξ . In step  68 , the output from step  66  is multiplied by the gain factor, kappa, and the time step, delta. In step  70 , the output from step  68  is added to the data rate, x n , to obtain the requested data rate, x n +1. In step  74 , the rate controller memory  17  is updated. X n  is replaced with x n+1 , and set as x n . In step  72  the data rate to be requested, x n+1 , is communicated to the content provider. In particular, this is done via the stream adaptation module  24 . This may be communicated to the stream adaptation module via the quality of service controller  15 .  
         [0156]     In step  76 , it is ascertained whether or not the data transfer is complete. If it is complete, the algorithm ends. If the transfer is not complete, it is ascertained in step  78 , whether time step, delta, has elapsed since this step was last carried out. If the time period, delta, has not elapsed, the algorithm waits until it has. If the time period has elapsed, in step  80 , it is ascertained whether the willingness to pay, w, is to remain the same, or whether this user determined parameter is to change. If the willingness to pay is to remain unchanged, the algorithm proceeds directly to step  56  for the next iteration. If the willingness to pay is changed, the algorithm returns to step  52 .  
         [0157]     With reference to  FIG. 6  the procedure for implementing resource control according to a different algorithm using the rate controller is shown. The rate controller  16  is comprised in the DPH agent  8  as for the previous algorithm and as shown in  FIG. 1 , but generates a request for data rate according to a different algorithm.  
         [0158]     As with the xi algorithm, the algorithm is a discretisation of a system of differential equations. Hereinafter the algorithm, whose procedure is shown in  FIG. 5  is referred to as the scalable algorithm.  
         [0159]     The system of differential equations representing the scalar algorithm is:  
                   ⅆ     ⅆ   t       ⁢       x   r     ⁡     (   t   )         =     κ   (           wtp   r     ⁡     (   t   )           ∑     j   ∈   r       ⁢       μ   j     ⁡     (   t   )           -       x   r     ⁡     (   t   )         )       ,           (   17   )             
 
 for r∈R. 
 
         [0160]     This system of differential equations was developed from the willingness to pay (w). As mentioned previously, the willingness to pay represents the amount a user is willing to pay for the service provided by the network. In general this amount can vary over time, so willingness to pay becomes a function of time. The scalar algorithm, rather than taking a single data stream, describes the overall behaviour of the network.  
         [0161]     Again, as with the xi algorithm, the form in which the scalar algorithm was presented above in equation (17), as a system of differential equations, makes it unsuitable to be implemented in software directly. Computers provide a discrete environment and cannot cope with the inherently continuous nature of a differential equation. To implement the invention in software, it is therefore necessary to include a discretisation step and to transform the differential equations into difference equations. This results in equation (18), which may also be written as the following system:  
               x     n   +   1       =       x   n     +     δ   *   κ   *     (       w   μ     -     x   n       )                 (   18   )             
 
 where the parameters are the same as those referred to above with respect to the xi algorithm. 
 
         [0162]     The advantage of a rate controller implemented according to the scalar algorithm is that the convergence properties depend only on the relative variation of the congestion charge (μ), that is, it will take as long to settle to the new equilibrium when the congestion level goes from 9% to 12% as when the congestion goes from 3% to 4%.  
         [0163]     The implementation of this algorithm is now described with reference to  FIG. 5 . At step  90 , the gain factor, kappa, and the time step, delta, are set. At step  92 , the price estimate (μ) is retrieved from the price reactor  18 . At step  94 , the willingness to pay (w) is set in response to the price estimate (m). At step  96  the dynamic input values are retrieved. The data rate (x n ) is retrieved from the memory  17  in the rate controller  16  and the price estimate (μ) is retrieved from the memory of the price reactor  18 . At step  98 , the difference (D) between the willingness to pay (w) divided by the price estimate (p) and the data rate (x n ) is computed. At step  100 , the output from the previous step  98  is multiplied by the gain factor (kappa) and the time step (delta). A step  102 , the output from previous step  100  is added to the data rate (x n ) to obtain the request data rate (x n+1 ). At step  104  the memory  17  in the rate controller  16  is updated. X n  is replaced with x n+1 . At step  106 , the value of x n+1  is communicated to the stream adaptation module  24 . At step  108 , it is ascertained whether the data transfer is complete. If it is complete, the program stops. If it is not complete, at step  110 , it is ascertained whether time step, delta, has elapses since this step was last carried out. If the time period, delta, has not elapsed, the algorithm waits until it has. If the time period has elapsed, in step  112 , it is ascertained whether the willingness to pay, w, is to remain the same, or whether this user determined parameter is to change. If the willingness to pay is to remain unchanged, the algorithm proceeds directly to step  96  for the next iteration. If the willingness to pay is changed, the algorithm returns to step  92 .  
         [0164]     Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise”, “comprising” and the like are to be construed in an inclusive as opposed to exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to”.