摘要 : In this note a two-class generalized processor sharing (GPS) system is considered. We analyze the probability that the virtual delay of a particular class exceeds some threshold. We apply Schilder's theorem to calculate the logari... 展开 In this note a two-class generalized processor sharing (GPS) system is considered. We analyze the probability that the virtual delay of a particular class exceeds some threshold. We apply Schilder's theorem to calculate the logarithmic many-sources asymptotics of this probability in the important case of Gaussian inputs. (c) 2007 Elsevier B.V. All rights reserved. 收起