Abstract
The dynamics of queue has been intensively studied in the fields of computer sciences, massive manufacturing managements and so on. The traditional queue models are based on first-come-first-served protocol and the number of events coming into the system in a unit time is assumed to be well approximated by Poisson processes. On the other hand, the analysis of real human activity data such as e-mail corresponding logs and wireless communication archives shows that people process their tasks according to the priority-based decisions. Moreover, the number of input tasks follows a power law. Hence, here we introduce a generalized priority-based queue model whose number of input tasks is given by a power law. We present numerical solution of the model and compare it with a generalized Levy flight random walk problem.
Users
Please
log in to take part in the discussion (add own reviews or comments).