Recently, huge number of e-mails is sent and received. These e-mails are classified into spam and non spam ones which are processed with the same priority. To guarantee a higher priority service to non-spam e-mails than that is provided to spam e-mails, a two-priority queue scheme was proposed. There are some drawbacks in the two-priority queue scheme such as it fails to provide a Quality of Se...

We provide the first analytical expressions for expected waiting time of high-priority customers in delayed APQ by exploiting a classical conservation law work-conserving queues. Additionally, we describe an algorithm to compute times both low-priority and customers, which requires only truncation sums that converge quickly our experiments. These insights are used demonstrate how accumulation r...

Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an...