Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this contribution, we analyze a discretetime two-class preemptive repeat identical priority queue with infinite buffer space and generally distributed serv...

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These waiti...

The problem of content delivery with a required QoS is currently one of the most important. In ad-hoc networks it is IEEE 802.11 EDCA which tries to face this problem. This paper describes several EDCA line topology configurations with mixed priorities of nodes. Detailed conclusions about the innovative results help to understand the behavior of EDCA in the presence of hidden and exposed nodes....

This paper describes a complete system for reading typewritten lexicon words in noisy images in this case museum index cards. The system is conceptually simple, and straightforward to implement. It involves three stages of processing. The first stage extracts row-regions from the image, where each row is a hypothesized line of text. The next stage scans an OCR classifier over each row image, cr...

A priority queue, a container data structure equipped with the operations insert and delete-minimum, can re-order its input in various ways, depending both on the input and on the sequence of operations used. If a given input σ can produce a particular output τ then (σ, τ) is said to be an allowable pair. It is shown that allowable pairs on a fixed multiset are in one-to-one correspondence with...

IEEE 802.11p Vehicular Ad-Hoc Network (VANET) applies one control channel (CCH) and six service channels (SCHs). CCH is dedicated for broadcasting traffic safety messages, SCHs are dedicated for transmission of varying application messages. In IEEE 802.11p standard, Coordinated Universal Time (UTC) scheme is recommended for coordinating channel access on CCH and multiple SCHs, Enhanced Distribu...

We implement and prove correct 2-3 finger trees. Finger trees are a general purpose data structure, that can be used to efficiently implement other data structures, such as priority queues. Intuitively, a finger tree is an annotated sequence, where the annotations are elements of a monoid. Apart from operations to access the ends of the sequence, the main operation is to split the sequence at t...

This work is in the line of designing efficient checkers for testing the reliability of some massive data structures. Given a sequential access to the insert/extract operations on such a structure, one would like to decide, a posteriori only, if it corresponds to the evolution of a reliable structure. In a context of massive data, one would like to minimize both the amount of reliable memory of...

Most existing routing strategies to improve transport efficiency have little attention what order should the packets be delivered, just simply used first-in-first-out queue discipline. However, it is far from optimal. In this paper we apply priority queuing discipline to random routing strategy on networks of mobile agents, in which the packets have high priority to transfer directly to their d...

Voice over Internet Protocol (VoIP) has grown quickly in the world of telecommunication. Wireless Local Area Networks (WLANs) are the most performance assuring technology for wireless networks, and WLANs have facilitated high-rate voice services at low cost and good flexibility. In a voice conversation, each client works as a sender or a receiver depending on the direction of traffic flow over ...