استراتژی های رقابتی برای یک مشکل انتساب تعمیم یافته آنلاین با محدودیت خدمات توالی

We investigate both deterministic and randomized online strategies for this problem. When the ratio ρ   between the largest and smallest possible weights obtained from assigning a request to a server is known in advance, we present an optimal deterministic online strategy with competitive ratio ρ1d. For randomized strategies, we first prove a lower bound on the competitive ratio, then we present a randomized strategy with competitive ratio less than 2, which does not need to know the value of ρ or d. Computational tests show that our proposed strategies have very good practical performance.