Optimal distributed policies for choosing among multiple servers
暂无分享,去创建一个
[1] E. Çinlar. On the superposition of m-dimensional point processes , 1968, Journal of Applied Probability.
[2] Anthony Ephremides,et al. A simple dynamic routing problem , 1980 .
[3] S. Stidham,et al. Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .
[4] Jr. Shaler Stidham. Optimal control of admission to a queueing system , 1985 .
[5] Kai Hwang,et al. Correction to “optimal load balancing in a multiple processor system with many job classes” , 1985, IEEE Transactions on Software Engineering.
[6] D. Teneketzis,et al. Routing in queueing networks under imperfect information: stochastic dominance and thresholds , 1989 .
[7] S.E. Minzer,et al. Broadband ISDN and asynchronous transfer mode (ATM) , 1989, IEEE Communications Magazine.
[8] Anurag Kumar,et al. Adaptive Optimal Load Balancing in a Nonhomogeneous Multiserver System with a Central Job Scheduler , 1990, IEEE Trans. Computers.
[9] John N. Tsitsiklis,et al. Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..