Methods and apparatus for cost minimization of multi-tiered...

Multiplex communications – Generalized orthogonal or special mathematical techniques

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S104000, C717S151000

Reexamination Certificate

active

07626917

ABSTRACT:
Techniques are provided for determining a capacity allocation in a multi-tiered computing system. In one aspect of the invention, a technique for designing capacity allocation for a multi-tiered computing system, each tier of the computing system having one or more computing devices (e.g., servers), comprises the following steps/operations. Input parameters relating to capacity allocation are obtained. A capacity allocation is computed based on at least a portion of the input parameters, the capacity allocation being computable such that one or more end-to-end performance measures are substantially satisfied for multiple service classes. The capacity allocation computation may minimize a cost function. The capacity allocation computation may also satisfy one or more mean delay guarantees for the multiple service classes, one or more tail distribution guarantees for the multiple service classes, or both one or more mean delay guarantees and one or more tail distribution guarantees for the multiple service classes.

REFERENCES:
patent: 4256925 (1981-03-01), Goode
patent: 6144639 (2000-11-01), Zhao et al.
patent: 0364090 (1990-04-01), None
Z. Liu et al., “On Maximizing Service-Level-Agreement Profits,” Proceedings of the 3rd ACM Conference on Electronic Commerce, pp. 213-223, Oct. 14-17, 2001.
Stefan M. Stefanov, “Convex Separable Minimization Subject to Bounded Variables,” Computational Optimization and Applications, vol. 18, No. 1, pp. 27-48, Jan. 2001.
M.S. Kodialam et al., “Algorithms for Separable Nonlinear Resource Allocation Problems,” Operations Research, vol. 46, No. 2, pp. 272-284, Mar.-Apr. 1998.
C.G. Kang et al., “Combined Channel Allocation and Routing Algorithms in Packet Switched Networks,” Computer Communications, Elsevier Science, vol. 20, No. 13, pp. 1175-1190, Nov. 25, 1997.
I. Toshihide et al., “Resource Allocation Problems: Algorithmic Approaches,” The MIT Press, pp. 1-2, 15-20 and 53-58, 1988.
N. Bansal et al., “Analysis of SRPT Scheduling: Investigating Unfairness,” Proceedings of Performance and ACM Sigmetrics, pp. 1-22, 2001.
P.J. Burke, “The Dependence of Delays in Tandem Queues”, The Annals of Mathematical Statistics, vol. 35, No. 2, pp. 874-875, Jun. 1964.
E.G. Coffman, Jr. et al., “Waiting Time Distributions for Processor-Sharing Systems,” Journal of the Association for Computing Machinery, vol. 17, No. 1, pp. 123-130, Jan. 1970.
D.S. Hochbaum et al., “Convex Separable Optimization Is Not Much Harder Than Linear Optimization,” Journal of the Association for Computing Machinery, vol. 37, No. 4, pp. 843-862, Oct. 1990.
W.E. Leland, “Load-Balancing Heuristics and Process Behavior,” Proceedings of Performance and ACM Sigmetrics, pp. 54-69, 1986.
P. Jelenković et al., “Resource Sharing with Subexponential Distributions,” Proceedings of IEEE INFOCOM, vol. 3, 10 pages, Jun. 2002.
Z. Liu et al., “Optimal Control of Resource Allocation in e-Business Environments with Strict Quality-of-Service Performance Guarantees,” Proceedings of the 41st IEEE Conference on Decision and Control, FrP02-1, pp. 4431-4439, Dec. 2002.
D.A. Menasće et al, “Business-Oriented Resource Management Policies for E-Commerce Servers,” Performance Evaluation 42, An International Journal, pp. 223-239, 2000.
A.P. Zwart et al, “Sojourn Time Asymptotics in the M/G/1 Processor Sharing Queue,” Queueing Systems 35, pp. 141-166, 2000.
Pramod Pancha, “Guaranteeing Bandwidth . . . Networks”, Proc. of IEEE Global Telecommunications Conference, Nov. 14-16, 1995, pp. 1064-1070, vol. 2.
1995, Proc. of IEEE Global Telecommunications Conference, vol. 2 1064p-1070p, Pancha P. et al., “Guaranteeing bandwidth and minimizing delay in packet-switched (ATM) networks” (Nov. 14-16, 1995).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Methods and apparatus for cost minimization of multi-tiered... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and apparatus for cost minimization of multi-tiered..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for cost minimization of multi-tiered... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4130402

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.