-
作者：Fagin, R; Karlin, AR; Kleinberg, J; Raghavan, P; Rajagopalan, S; Rubinfeld, R; Sudan, M; Tomkins, A
作者单位：International Business Machines (IBM); IBM USA; University of Washington; University of Washington Seattle; Cornell University; Massachusetts Institute of Technology (MIT)
摘要：We introduce backoff processes, an idealized stochastic model of browsing on the World Wide Web, which incorporates both hyperlink traversals and use of the ''back button.'' With some probability the next state is generated by a distribution over out-edges from the current state, as in a traditional Markov chain. With the remaining probability, however, the next state is generated by clicking on the back button and returning to the state from which the current state was entered by a ''forward ...
-
作者：Weber, M
作者单位：Technische Universitat Dresden
-
作者：Barbour, AD; Chryssaphinou, O
作者单位：University of Zurich; National & Kapodistrian University of Athens
摘要：Compound Poisson approximation is a useful tool in a variety of applications, including insurance mathematics, reliability theory, and molecular sequence analysis. In this paper, we review the ways in which Stein's method can currently be used to derive bounds on the error in such approximations. The theoretical basis for the construction of error bounds is systematically discussed, and a number of specific examples are used for illustration. We give no numerical comparisons in this paper, con...
-
作者：Martin, JB
作者单位：Universite PSL; Ecole Normale Superieure (ENS); Inria
摘要：We consider a Jackson-type network, each of whose nodes contains N identical channels with a single server. Upon arriving at a node, a task selects m of the channels at random and joins the shortest of the m queues observed. We fix a collection of channels in the network, and analyze how the queue-length processes at these channels vary as N --> infinity. If the initial conditions converge suitably, the distribution of these processes converges in local variation distance to a limit under whic...
-
作者：Bell, SL; Williams, RJ
作者单位：University of California System; University of California San Diego
摘要：This paper concerns a dynamic scheduling problem for a queueing system that has two streams of arrivals to infinite capacity buffers and two (nonidentical) servers working in parallel. One server can only process jobs from one buffer, whereas the other server can process jobs from either buffer. The service time distribution may depend on the buffer being served and the server providing the service. The system manager dynamically schedules waiting jobs onto available servers. We consider a par...
