Kelly, F.P. 1994a. On tariffs, policing and admission control for multiservice networks. Operations Research Letters 15, 1--9.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... CBR) #fl (Variable Bit Rate VBR) o oofl , #fl # (guaranteed service) #fl (controlled load) # fl fi # #fl Internet, #fl fi # Internet. fi #fl # # # fi (time volume pricing schemes) # # o oo fi o oo ( fi o oo o oo #fl # ) fi # # fi fi #fl fl [Kel94] xvi # fl [CKW97] fi fl o oo # # a priori #fl # # fl (# #fl # # o ooo oo fi) a posteriori #fl # o oo o oo (# fi o oo o oo) fi # fl fl fi fi o oo o oo #fl # . oe # fi fl # o oo # # fl fl # (fi # # fi fl ) fl . # o oo fi ....

.... fl o oo # # a priori #fl # # fl (# #fl # # o ooo oo fi) a posteriori #fl # o oo o oo (# fi o oo o oo) fi # fl fl fi fi o oo o oo #fl # . oe # fi fl # o oo # # fl fl # (fi # # fi fl ) fl . # o oo fi #o oo o oo fl o oo : on off [Kel94] # [CKW97] # T [CKW97] fl fi , o oo fi # fl fi # fl o oofi fi o oo o oo: #o oo# (pricing with renegotiation) fi o oofl (virtual bucket pricing scheme) #o oo# #fl fi o oofi # fi o oo o oo, # # #o oo# # # fi fl. fl o oo #fl # # ## ##fl. fi ....

[Article contains additional citation context not shown here]

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....Nash bargaining solution, from cooperative game theory, as capturing natural assumptions as to what constitutes fairness. The need for networks to operate in a public (and therefore potentially noncooperative) environment has stimulated work on charging schemes for broadband networks: see Kelly [15] for a scheme based on time and volume measurements for non elastic traffic, MacKie Mason and Varian [16] for a description of a smart market based on a per packet charge when the network is congested, and the collection edited by McKnight and Bailey [17] for several further papers and ....

Kelly FP (1994). On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15, 1--9.

.... selection for QoS indications (aka QoS alerts [67] in the case of violations in the requested QoS and periodic QoS availability notifications for bandwidth, delay, jitter and loss; cost of service, which specifies the price the user is willing to incur for the level of service [10]. Cost of service is a very important factor when considering QoS specification. If there is no notion of cost of service involved in QoS specification, there is no reason for the user to select anything other than maximum level of service, e.g. guaranteed service; and . flow synchronization ....

Kelly FP (1993) On Tariffs, Policing and Admission Control for Multiservice Networks. Proc. Multiservice Networks '93, Cosener's House, Abingdon, July 1993, and Internal Report, Statistical Laboratory, University of Cambridge, UK

.... currently available in the literature are based on the price directed approach #Cocchi et al. 1993; MacKie Mason and Varian, 1995b; Jordan and Jiang, 1995; Jiang and Jordan, 1995; Wang et al. 1997; Murphy and Murphy, 1994; Murphy et al. 1994; Parris et al. 1992; Parris and Ferrari, 1992; Kelly, 1994; Kelly et al. 1998; Gupta et al. 1997; Courcoubetis et al. 1997; MacKie Mason and Varian, 1995a; Low and Varaiya, 1993; de Veciana and Baldick, 1998; Thomas and Teneketzis, 1997#. Since in this paper we follow the price directed approach to resource allocation, we critically review the results ....

.... approach to resource allocation, we critically review the results reported in #Cocchi et al. 1993; MacKie Mason and Varian, 1995b; Jordan and Jiang, 1995; Jiang and Jordan, 1995; Wang et al. 1997; Murphy and Murphy, 1994; Murphy et al. 1994; Parris et al. 1992; Parris and Ferrari, 1992; Kelly, 1994; Kelly et al. 1998; Gupta et al. 1997; Courcoubetis et al. 1997; MacKie Mason and Varian, 1995a; Low and Varaiya, 1993; de Veciana and Baldick, 1998; Thomas and Teneketzis, 2 1997# so that we can point out to the contributions of our work. The work currently available on decentralized ....

[Article contains additional citation context not shown here]

Kelly, F. #1994#. On tari#s, policing and admission control for multiservice networks. Operations Research Letters, 15:1#9.

.... = st. The above approximation is appropriate for the case where buffers in the network are small. We refer to this bound as the on off bound. Next we describe a charging scheme based on the simple bound (2) which is linear in measurements of time and volume. The approach was first introduced in [8], and later extended in Usage based charging using effective bandwidths: studies and reality. October 9, 1998. 4 [5] The user is offered tariffs corresponding to tangents to this effective bandwidth function. A tangent at the point m has the form f(m; h; M) a(m; h) b(m; h)M , where the ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....users who access the network wish to complete certain tasks (e.g. send an e mail, access a piece of information from a Web page, place an internet phone call) and packets are completely transparent to them. Thus, it is not clear whether packet based pricing schemes are always appropriate. Kelly [Kel94] and Courcoubetis, Kelly, and Weber [CKW] propose the pricing of real time traffic with QoS requirements, in terms of its effective bandwidth , and provide approximations that only involve time and volume charges. A central question that has received little formal treatment relates to determining ....

F. P. Kelly, On tariffs, policing and admission control for multiservice networks, Operations Research Letters 15 (1994), 1--9.

....given by ff(m; h) 1 st log 1 tm H(t) e sH(t) Gamma 1) 2) An important property of ff(m; h) is that it is concave in m. Next we describe a charging scheme based on the simple bound (2) which is linear in measurements of time and volume. The approach was first introduced in [8], and later extended in [6] The user is offered tariffs corresponding to tangents to this effective bandwidth function. A tangent at the point m has the form f(m; h; M) a(m; h) b(m; h)M , where the coefficients are given by b(m; h) e sH(t) Gamma 1 s[H(t) mt(e sH(t) Gamma 1) ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....whole duration of a call, and two schemes that require measurements in distinct time intervals, smaller than the duration of a call: pricing with renegotiation and the virtual bucket scheme. The former, which we will refer to as time volume pricing schemes, were initiated by the work of Kelly [6], and further extended in [3] In [2] we investigated the incentive compatibility of these schemes and the effect of pricing on a network s equilibrium for Internet Wide Area Network (WAN) traffic. As noted above, a user s charge will depend on other issues in addition to the amount of resources ....

....prices, making it difficult for them to behave rationally ; the latter is a requirement for economically efficient and stable network operation. For the above reasons, conservative approximations of (1) which involve easy to measure quantities are desirable. One such approximation considered in [6] is the on off bound which depends solely on a connection s peak rate h, which in the rest of the paper we assume is policed, and its mean rate m. When a connection, in addition to having his peak rate policed, is policed by a leaky bucket with leak rate ae and bucket size fi, a tighter bound ....

[Article contains additional citation context not shown here]

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....be f H (V=T )T , where V is the volume transferred in that period. There is an alternative charging scheme through which users provide the network provider with an estimate of their mean rate, which the provider can use to perform more effective admission control [12] According to the scheme [13, 5], users select a tariff pair (a; b) from some set offered by the provider, and are charged using the simple formula aT bV , where T is the duration of the charging period and V is the transferred volume. The tariffs (a; b) correspond to tangents to some bound of the effective bandwidth, for ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....will be f H (V=T )T , where V is the volume transferred in that period. There is an alternative charging scheme through which users provide the network provider with an estimate of their mean rate, which the provider can use to perform more effective admission control [11] According to the scheme [12, 5], users select a tariff pair (a; b) from some set offered by the provider, and are charged using the simple formula aT bV , where T is the duration of the charging period and V is the transferred volume. The tariffs (a; b) correspond to tangents to some bound of the effective bandwidth, for ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....to preserve its own QoS requirements, and the requirements of the other connections it is multiplexed with. Recently [2] a mathematical theory for creating usagebased charging schemes using the notion of the effective bandwidth has been developed. The approach, which builds on the initial work of [10], allows for the design of tariffs that can take into account an arbitrary number of measured traffic parameters. Experiments with real traffic (Internet WAN and MPEG 1 compressed video) 1] have shown that an important class of the above tariffs, where charges are based solely on time and volume, ....

....the given traffic contract. Such a scheme is unfair to users that happen to send less traffic than the maximum allowed by their contract, hence encourages them to send the maximum traffic that their contract allows (similar to to the previous approach) The charging approach developed initially in [10] and then in [2] takes into account both static traffic contract parameters (known a priori) and dynamic parameters (measured a posteriori) In particular, the approach shows how to transform simple tariffs of the form aT bV , where T is the duration and V is the volume of a connection ....

[Article contains additional citation context not shown here]

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....whole duration of a call, and two schemes that require measurements in distinct time intervals, smaller than the duration of a call: pricing with renegotiation and the virtual bucket scheme. The former, which we will refer to as time volume pricing schemes, were initiated by the work of Kelly [6], and further extended in [3] In [2] we investigated the incentive compatibility of these schemes and the effect of pricing on a network s equilibrium for Internet Wide Area Network (WAN) traffic. As noted above, a user s charge will depend on other issues (e.g. economic, regulatory, marketing) ....

....prices, making it difficult for them to behave rationally ; the latter is a requirement for economically efficient and stable network operation. For the above reasons, conservative approximations of (1) which involve easy to measure quantities are desirable. One such approximation considered in [6] is the on off bound which depends solely on a connection s peak rate h, which in the rest of the paper we assume is policed, and its mean rate m. When a connection, in addition to having his peak rate policed, is policed by a leaky bucket with leak rate ae and bucket size fi, a tighter bound ....

[Article contains additional citation context not shown here]

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....than the rate of their access pipe. In this paper we consider usage based pricing schemes that are based on bounds of the effective bandwidth. These schemes are linear in two measurements (the duration of a connection and the total volume transferred) and were initiated by the work of Kelly [6], and further extended in [2] to include both a priori parameters (such as leaky bucket parameters) and a posteriori parameters (such as the total volume) and for an arbitrary number of measurements. In [1] we investigated the incentive compatibility of these schemes and the effects of pricing on ....

....prices, making it difficult for them to behave rationally ; the latter is a requirement for economically efficient and stable network operation. For the above reasons, conservative approximations of (1) which involve easy to measure quantities are desirable. One such approximation considered in [6] is the on off approximation, which depends solely on a connection s peak rate h, which in the rest of the paper we assume is policed, and its mean rate m. When a connection, in addition to having his peak rate policed, is policed by a leaky bucket with leak rate ae and bucket size fi, a ....

[Article contains additional citation context not shown here]

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

No context found.

Kelly, F.P. 1994a. On tariffs, policing and admission control for multiservice networks. Operations Research Letters 15, 1--9.

....k which achieves the minimum in (6) If t l, then the bound (7) reduces to (8) which is appropriate when the buffers are small and the argument minimizing expression (6) corresponds to the peak rate h. We refer to this as the on off bound. Charges based on this bound have been considered in [7]. In many cases [3] the worst case traffic consists of blocks of an inverted T pattern repeating periodically or with random gaps, with the size of the blocks and gaps depending on the values of s, t. In this paper we consider the periodic pattern shown in Figure 2, which gives the following ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1-9, 1994.

No context found.

Kelly, F.P. (1994a). On tariffs, policing and admission control of multiservice networks. Operations Research Letters, 15, 1-9.

....achieves the minimum in (6) If t l, then the bound (7) reduces to . 10g which is appropriate when the buffers are small and the argument minimizing expression (6) corresponds to the peak rate h. We refer to this as the on off bound. Charges based on this bound have been considered in [8]. In many cases [3] the worst case traffic consists of blocks of an inverted T pattern repeating periodically or with random gaps, with the size of the blocks and gaps depending on the values of s, t. In this paper we consider the periodic pattern shown in Figure 2, which gives the following ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1-9, 1994.

....(7) reduces to ff on off (m; h) 1 s log 1 m h (e sh Gamma 1) 8) which is appropriate when the buffers are small and the argument minimizing expression (6) corresponds to the peak rate h. We refer to this as the on off bound. Charges based on this bound have been considered in [8]. In many cases [3] the worst case traffic consists of blocks of an inverted T pattern repeating periodically or with random gaps, with the size of the blocks and gaps depending on the values of s; t. In this paper we consider the periodic pattern shown in Figure 2, which gives the following ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....= 1 st log 1 Gamma m h m h e sh ; 12) appropriate for the case where buffers in the network are small and the argument minimizing expression (10) corresponds to the peak rate of h. We refer to this as the peak approximation. Charges based on this bound have been considered in [10]. A last, but more accurate, approximation can be obtained in the case where a connection is policed by a single leaky bucket (ae; fi) Then the worst case traffic (for given values of s; t) consists of blocks of an inverted T shape being either periodic or having random gaps. We call this the ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....reduces to ff pm (m; h) 1 s log 1 m h (e sh Gamma 1) 8) which is appropriate when the buffers are small and the argument minimizing expression (6) corresponds to the peak rate h. We refer to this as the peak mean bound. Charges based on this bound have been considered in (Kelly 1994). In many cases (Courcoubetis, Kelly and Weber 1997) the worst case traffic (for given values of s; t) consists of blocks of an inverted T pattern repeating periodically or with random gaps. In this paper we consider the periodic pattern shown in Figure 1, which gives the following effective ....

Kelly, F. P. (1994) On tariffs, policing and admission control for multiservice networks.

....(7) reduces to ff pm (m; h) 1 s log 1 m h (e sh Gamma 1) 8) which is appropriate when the buffers are small and the argument minimizing expression (6) corresponds to the peak rate h. We refer to this as the on off bound. Charges based on this bound have been considered in [7]. In many cases [3] the worst case traffic (for given values of s; t) consists of blocks of an inverted T pattern repeating periodically or with random gaps. In this paper we consider the periodic pattern shown in Figure 2, which gives the following effective bandwidth approximation (referred to ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

....reduces to ff on off (m; h) 1 s log 1 m h (e sh Gamma 1) 8) which is appropriate when the buffers are small and the argument minimizing expression (6) corresponds to the peak rate h. We refer to this as the on off bound. Charges based on this bound have been considered in [7]. In many cases [3] the worst case traffic consists of blocks of an inverted T pattern repeating periodically or with random gaps, with the size of the blocks and gaps depending on the values of s; t. In this paper we consider the periodic pattern shown in Figure 2, which gives the following ....

F. P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

No context found.

Kelly, F. P. (1994a) On tariffs, policing and admission control for multiservice networks.

No context found.

F.P. Kelly. On tariffs, policing and admission control for multiservice networks. Operations Research Letters, 15:1--9, 1994.

No context found.

F. P. Kelly, \On taris, policing and admission control for multiservice networks," Operations Research Letters, vol. 15, pp. 1-9, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC