Results 1  10
of
11
CongestionDependent Pricing of Network Services
 IEEE/ACM Transactions on Networking
, 1998
"... Weconsider a service provider (SP) who provides access to a communication network or some other form of online services. Users access the network and initiate calls that belong to a set of diverse service classes, differing in resource requirements, demand pattern, and call duration. ..."
Abstract

Cited by 156 (0 self)
 Add to MetaCart
Weconsider a service provider (SP) who provides access to a communication network or some other form of online services. Users access the network and initiate calls that belong to a set of diverse service classes, differing in resource requirements, demand pattern, and call duration.
Pricing in Multiservice Loss Networks: Static Pricing, Asymptotic Optimality, and Demand Substitution Effects
 IEEE/ACM Transactions On Networking
, 2002
"... We consider a communication network with xed routing that can accommodate multiple service classes, diering in bandwidth requirements, demand pattern, call duration, and routing. The network charges a fee per call which can depend on the current congestion level, and which aects user's demand. ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
(Show Context)
We consider a communication network with xed routing that can accommodate multiple service classes, diering in bandwidth requirements, demand pattern, call duration, and routing. The network charges a fee per call which can depend on the current congestion level, and which aects user's demand. Building on the singlenode results of Paschalidis and Tsitsiklis, 2000, we consider both problems of revenue and welfare maximization and show that static pricing is asymptotically optimal in a regime of many, relatively small, users. In particular, the performance of an optimal (dynamic) pricing strategy is closely matched by a suitably chosen classdependent static price, which does not depend on instantaneous congestion. This result holds even when we incorporate demand substitution eects into the demand model. More speci cally, we model the situation where price increases for a class of service might lead users to use another class as an imperfect substitute. For both revenue and welfare maximization objectives we characterize the structure of the asymptotically optimal static prices, expressing them as a function of a parsimonious number of parameters. We employ a simulationbased approach to tune those parameters and to eciently compute an eective policy away from the limiting regime. Our approach can handle large, realistic, instances of the problem.
Large deviations analysis of the generalized processor sharing policy
, 1999
"... ..."
(Show Context)
On the Estimation of Buffer Overflow Probabilities from Measurements
 IEEE Trans. on Info. Th
, 2001
"... We propose estimators of the buffer overflow probability in queues fed by a Markovmodulated input process and serviced by an autocorrelated service process. These estimators are based on large deviations asymptotics for the overflow probability. We demonstrate that the proposed estimators are less l ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
(Show Context)
We propose estimators of the buffer overflow probability in queues fed by a Markovmodulated input process and serviced by an autocorrelated service process. These estimators are based on large deviations asymptotics for the overflow probability. We demonstrate that the proposed estimators are less likely to underestimate the overflow probability than the estimator obtained by certainty equivalence. As such, they are appropriate in situations where the overflow prob ability is associated with Quality of Service (QoS) and we need to provide firm QoS guarantees. We also show that as the number of observations in creases to infinity the proposed estimators converge with probability one to the appropriate target, and thus, do not lead to underutilization of the system in this limit.
On Estimating Buffer Overflow Probabilities under Markovmodulated Inputs
"... Based on large deviations asymptotics, we propose estimators for the buffer overflow probability in queues fed by a Markovmodulated input process and serviced by an autocorrelated service process. We demonstrate that these estimators are less likely to underestimate the overflow probability than ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Based on large deviations asymptotics, we propose estimators for the buffer overflow probability in queues fed by a Markovmodulated input process and serviced by an autocorrelated service process. We demonstrate that these estimators are less likely to underestimate the overflow probability than the estimator obtained by certainty equivalence. As such, they are appropriate in situations where the overflow probability is associated with Quality of Service (QoS) and we need to provide firm QoS guarantees. We also show that as the number of observations increases the proposed estimators converge with probability 1 to the appropriate target and thus do no lead to underutilization of the system in this limit.
Asymptotic Evaluation of Delay in the SRPT Scheduler
"... In this paper, we consider the ShortestRemainingProcessingTime (SRPT) scheduling algorithm. We consider the SRPT scheduling rule for a discretetime queueing system that is accessed by a large number of flows (a many flows regime). In such an asymptotic regime (large capacity and large number of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we consider the ShortestRemainingProcessingTime (SRPT) scheduling algorithm. We consider the SRPT scheduling rule for a discretetime queueing system that is accessed by a large number of flows (a many flows regime). In such an asymptotic regime (large capacity and large number of flows), we derive expressions for the packet delay distributions for batch arrival processes, and with bounded packet sizes. Using these results, we compare the delay asymptote (i.e., for any finite delay, and asymptotic in the number of flows) of the SRPT scheduler with that of a FIFO (FirstInFirstOut) scheduler, when there is a mix of packet sizes. Our analysis holds for any finite mix of packet sizes. We apply the result to a system accessed by packets which are one of two sizes: 1 or M, and the arrival process is i.i.d. across flows. We show that the difference in rate function of the delay asymptote between SRPT and FIFO for the size M packet decays as O ( 1 M γ) for any 0 < γ < 1 and M sufficiently large. Thus, for large packets, the delay distributions under FIFO and SRPT look similar. On the other hand, for the size 1 packet, the delay rate function under SRPT is invariant with M. However for FIFO, the delay rate function for the size 1 packet decays as O ( 1 M γ) for any 0 < γ < 1 and M large. This shows that for size 1 packets, SRPT performs increasingly better as the range in packet size increases. Thus, these results indicate that SRPT is a good policy to implement for webservers, where empirical evidence suggests a large variability in packet sizes.
CongestionDependent Pricing of Online Internet Services
, 1999
"... We consider a service provider (SP) who provides access to a communication network or some other form of online services. Users initiate calls that belong to a set of diverse service classes. The SP charges a fee per call, which can depend on the current congestion level, and which affects users&ap ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider a service provider (SP) who provides access to a communication network or some other form of online services. Users initiate calls that belong to a set of diverse service classes. The SP charges a fee per call, which can depend on the current congestion level, and which affects users' demand for calls. We provide a dynamic programming formulation of the problems of revenue and welfare maximization, and derive qualitative properties of the optimal solution. We show that the performance of an optimal pricing strategy is closely matched by a suitably chosen static price, which does not depend on instantaneous congestion. We establish that static pricing is asymptotically optimal in a number of limiting regimes, including one of many, relatively small, users. In nonstationary demand conditions this leads to the easily implementable timeofday pricing. Throughout, we compare the alternative formulations involving revenue or welfare maximization, respectively, and draw some qu...
FAST CLOSED FORM APPROXIMATION FOR DYNAMIC NETWORK RESOURCE ALLOCATION
"... We consider dynamic delay guarantee and bandwidth allocation in communications networks. Our scenario includes linear pricing scheme for both Quality of Service parameters. The goal is (i) to maximize the revenue and (ii) guarantee fair resource allocation for connections. On the contrary to the tra ..."
Abstract
 Add to MetaCart
(Show Context)
We consider dynamic delay guarantee and bandwidth allocation in communications networks. Our scenario includes linear pricing scheme for both Quality of Service parameters. The goal is (i) to maximize the revenue and (ii) guarantee fair resource allocation for connections. On the contrary to the traditional Lagrangian approach, we approach the problem by modified one, where the sum of the weights of the scheduler acts as the penalty term. This modified approach yields closed form approximate algorithm for updating the scheduler weights, being very fast and realtime implementable. We compare the algorithm with the bruteforce method, which optimizes weights in the large grid optimal bruteforce method has exponential complexity. The revenue obtained by the closed form method is about 99.9 % of the optimal, computationally expensive approach, thus being tempting both from the point of view of the service provider and the customers. NS2 simulator is used in the experiments.
Stochastics and Statistics Queueing
, 2001
"... systems with leadtime constraints: A fluidmodel approach for admission and sequencing control ..."
Abstract
 Add to MetaCart
(Show Context)
systems with leadtime constraints: A fluidmodel approach for admission and sequencing control