Scalable resources portfolio selection with fairness based on economical methods

Authors:
Yu Hua;Dan Feng;Chanle Wu
Affiliations:
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;School of Computer, Wuhan University, Wuhan, China
Venue:
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
Year:
2006

Citing 6
Cited 1

Portfolio selection with transaction costs

Mathematics of Operations Research
Summary cache: a scalable wide-area web cache sharing protocol

IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Compressed bloom filters

IEEE/ACM Transactions on Networking (TON)
Spectral bloom filters

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Pricing, provisioning and peering: dynamic markets for differentiated Internet services and implications for network interconnections

IEEE Journal on Selected Areas in Communications

A novel price prediction scheme of grid resources based on time series analysis

UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fairness of scheduling resources are important to improve the whole performance. In this paper, we study the economy-based approach, i.e., portfolio selection, to realize the dynamic allocation of distributed and heterogeneous resources. The portfolio selection method emphasizes the mean-variance model, which can evaluate the final return and help the scheduler to adjust the allocation policy. We present the practical algorithms for network nodes and Bloom filter-based surveillance, which can support the efficient adjustment of a scheduler.