Thomas Giammo
Abstract
A computer facility, when attempting to derive a charging algorithm from scratch, is under the best of circumstances faced with a formidable task. Even after the basic structure of the pricing algorithm has been determined, a substantial amount of work remains in estimating the volume of future workloads in terms compatible with the algorithm structure, determining the anticipated direct and indirect costs, relating algorithm elements with accounting data, implementing billing mechanisms, etc. In the face of the overall amount of work involved, there appears to be a general tendency to treat the determining of the general structure of the pricing algorithm itself as being a relatively straight-forward process which can be worked out using generally accepted principles, in contrast to the choice and calculation of the algorithm's various coefficients which of course must be executed using the specific parameters pertinent to the given installation.
- J. P. Buzen, "Computational Algorithms for Closed Queuing Networks with Exponential Servers", Commun. ACM 16, No.9 - September 1973. Google Scholar
Digital Library
- J. P. Buzen, "Queuing Network Models of Multiprogramming", Ph. D. Thesis, Division of Engineering and Physics Harvard University - 1971.Google Scholar
- K. M. Chandy, U. Herzog, and L. Woo, "Parametric Analysis of Queuing Networks", IBM J. RES. DEV. January 1975, PP. 36, 42.Google ScholarDigital Library
- T. P. Giammo, "Validation of a Computer Performance Model of the Exponential Queuing Network Family", submitted to Inter, Sym. on Comp. Per. M. M. and E. Google ScholarDigital Library
- H. Kobayashi and M. Reiser, "Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms", IBM J. RES. DEV. PP. 283, 294, May 1975.Google Scholar
Recommendations
Pricing commodities
How should a seller price her goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his budget? We provide efficient algorithms that compute near-optimal prices for ...
Auctions and differential pricing: optimal seller and bidder strategies in second-chance offers
The second chance offer is a common seller practice on eBay. It consists of price discrimination against the losing bidder, who is offered an identical item at the value of his or her highest bid. Prior work has shown that, if the goods are private-...
Pricing Rule in a Clock Auction
We analyze a discrete clock auction with lowest-accepted-bid (LAB) pricing and provisional winners, as adopted by India for its 3G spectrum auction. In a perfect Bayesian equilibrium, the provisional winner shades her bid, whereas provisional losers do ...
Comments