Dynamic resource allocation using known future benefits

Details Dynamic resource allocation using known future benefits Dynamic resource allocation using known future benefits

2006-08-01

2006-08-01

Wiley, David (Department: 2143)

Electrical computers and digital processing systems: multicomput

Computer network managing

Network resource allocating

C709S201000, C709S203000, C709S217000, C709S219000, C709S227000, C709S229000, C705S002000

Reexamination Certificate

active

07085837

ABSTRACT:
A benefit task system implements a policy for allocating resources to yield some benefit. The method implemented may be applied to a variety of problems, and the benefit may be either tangible (e.g., profit) or intangible (e.g., customer satisfaction). In one example, the method is applied to server allocation in a Web site server “farm” given full information regarding future loads to maximize profits for the Web hosting service provider. In another example, the method is applied to the allocation of telephone help in a way to improve customer satisfaction. In yet another example, the method is applied to distributed computing problem where the resources to be allocated are general purpose computers connected in a network and used to solve computationally intensive problems. Solution of the Web server “farm” problem is based on information regarding future loads to achieve close to the greatest possible revenue based on the assumption that revenue is proportional to the utilization of servers and differentiated by customer class. The method of server allocation uses an approach which reduces the Web server farm problem to a minimum-cost network flow problem, which can be solved in polynomial time. Similar solutions are applicable to other resource allocation problems.

REFERENCES:
patent: 4744026 (1988-05-01), Vanderbei
patent: 5216593 (1993-06-01), Dietrich et al.
patent: 5819019 (1998-10-01), Nelson
patent: 6260068 (2001-07-01), Zalewski et al.
patent: 6341266 (2002-01-01), Braun
patent: 6754883 (2004-06-01), DeBusk et al.
patent: 6901446 (2005-05-01), Chellis et al.
patent: 2002/0116300 (2002-08-01), DeBusk et al.
patent: 2003/0037146 (2003-02-01), O'Neill
Borodin, A., and El-Yaniv, R., “Online Computation and Competitive Analysis”, pp. 123-127 and 150-151, (1998).
Ahuja, R. K., Magnanti, T. L., and Orlin, J. B., “Network Flows: Theory, Algorithms, and Applications”, pp. 4-5 and 294-341, (1993).

Affiliated with

Also associated with

Rating

Dynamic resource allocation using known future benefits does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic resource allocation using known future benefits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic resource allocation using known future benefits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3648374