
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J.F. Kurose, R. Simha, "A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems," IEEE Transactions on Computers, vol. 38, no. 5, pp. 705717, May, 1989.  
BibTex  x  
@article{ 10.1109/12.24272, author = {J.F. Kurose and R. Simha}, title = {A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {5}, issn = {00189340}, year = {1989}, pages = {705717}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.24272}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems IS  5 SN  00189340 SP705 EP717 EPD  705717 A1  J.F. Kurose, A1  R. Simha, PY  1989 KW  decentralized algorithms; microeconomic approach; optimal resource allocation; distributed computer systems; divisible resource; optimal file allocation; optimization criteria; communication cost; average processing delay; file access; mathematical economics; iteration; rapid convergence; convergence behavior; simulation; distributed processing; economic cybernetics; operations research. VL  38 JA  IEEE Transactions on Computers ER   
[1] C. Agnew, "The dynamic control of congestion prone systems through pricing," Ph.D. dissertation, Stanford Univ., Nov. 1973.
[2] K. Arrow and F. Hahn,General Competitive Analysis. San Francisco, CA: Holden Day, 1971.
[3] D. P. Bertsekas and R. G. Gallager, "Second derivative algorithms for minimum delay distributed routing in networks,"IEEE Trans. Commun., vol. COM32, no. 8, pp. 911919, Aug. 1984.
[4] D. Bersekas and R. Gallager,Data Networks. Englewood Cliffs, NJ: PrenticeHall, 1987.
[5] C. G. Cassandras and Y. C. Ho, "An event domain formalism for sample path perturbation analysis of discrete event dynamic systems,"IEEE Trans. Automat. Contr., vol. AC30, no. 12, 1985.
[6] R. Casey, "Allocation of copies of files in an information network,"AFIPS Proc., vol. 40, pp. 617625, 1973.
[7] S. Ceri, G. Pelagatti, and G. Martella, "Optimal file allocation in a computer network: A solution based on the knapsack problem,"Comput. Networks, vol. 6, pp. 345357, 1982.
[8] P. Chen, "Optimal file allocation in multilevel storage systems,"Proc. AFIPS, vol. 42, no. 2, pp. 277282, 1973.
[9] W. W. Chu, "Optimal file allocation in a multiple computer system,"IEEE Trans. Comput., vol. C18, pp. 885889, 1969.
[10] L. W. Dowdy, and D. V. Foster, "Comparative models of the file sssignment problem,"ACM Comput. Surveys, vol. 14, no. 2, pp. 287313, June 1982.
[11] K. Eswaran, "Placement of records of a file and file allocation in a computer network,"IFIP Conf. Proc., pp. 304307, 1974.
[12] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624633, Nov. 1976.
[13] R. G. Gallager, "A minimum delay routing algorithm using distributed computation,"IEEE Trans. Commun., vol. COM25, no. 1, pp. 7385, Jan. 1977.
[14] G. Heal, "Planning without prices,"Rev. Econ. Studies, vol. 36, pp. 346362, 1969.
[15] Y. C. Ho, L. Servi, and R. Suri, "A class of centerfree resource allocation algorithms,"Large Scale Syst., vol. 1, pp. 5162, 1980.
[16] L. Hurwicz, "The design of mechanisms for resource allocation,"Amer. Econ. Rev., vol. 63, no. 2, pp. 130, 1973.
[17] L. Kleinrock,Queueing Systems: Vol. 1, Theory. New York: WileyInterscience, 1975.
[18] J. F. Kurose, M. Schwartz, and Y. Yemini, "A microeconomic approach to optimization of channel access policies in multiaccess networks," inProc. 5th Int. Conf. Distrib. Comput. Syst., Denver, CO, May 1985, pp. 7080.
[19] E. S. Levitin and B. T. Polyak, "Constrained minimization problems,"USSR Comput. Math. Math. Phys., vol. 6, pp. 150, 1966.
[20] S. Mahmoud and J. S. Riordan, "Optimal allocation of resources in distributed information networks,"ACM Trans. Database Syst., vol. 1, no. 1, pp. 6678, Mar. 1976.
[21] C. V. Ramamoorthy and K. M. Chandy, "Optimization of memory hierarchies in multiprogrammed systems,"J. ACM, vol. 17, pp. 426 445, July 1970.
[22] J. Rothnie and N. Goodman, "A survey of research and development in distributed database management," inProc. 1977 Conf. Very Large Databases, 1977.
[23] R. Suri, "A decentralized approach to optimal file allocation in computer networks," inProc. 18th IEEE Conf. Decision Contr., IEEE Press, 1979, pp. 141146.
[24] G. H. Thaker and J. B. Cain, "Interactions between routing and flow control algorithms,"IEEE Trans. Commun., vol. COM34, Mar. 1986.
[25] B. Wah, "File placement in distributed computer systems,"IEEE Computer, vol. 17, pp. 2333, Jan. 1984.
[26] M. Wasan,Stochastic Approximation, Cambridge Tracts in Mathematics and Mathematical Physics No. 58, Cambridge, MA: Cambridge, Univ. Press, 1969.
[27] C. M. Woodside and S. K. Tripathi, "Optimal allocation of file servers in a local network environment,"IEEE Trans. Software Eng., vol. SE12, no. 8, pp. 844848, 1986.