15 research outputs found

    Analysis of priority queues with session-based arrival streams

    Get PDF
    In this paper, we analyze a discrete-time priority queue with session-based arrivals. We consider a user population, where each user can start and end sessions. Sessions belong to one of two classes and generate a variable number of fixed-length packets which arrive to the queue at the rate of one packet per slot. The lengths of the sessions are generally distributed. Packets of the first class have transmission priority over the packets of the other class. The model is motivated by a web server handling delay-sensitive and delay-insensitive content. By using probability generating functions, some performance measures of the queue such as the moments of the packet delays of both classes are calculated. The impact of the priority scheduling discipline and of the session nature of the arrival process is shown by some numerical examples

    Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps

    Get PDF
    In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high and the low priority traffic in the steady state and also for some performance measures such as the mean value of the system contents and the packet delay. The behavior of the priority queues with priority jumps will be illustrated by using these results and is compared to the FIFO scheme

    Low-percentage Ln3+ doping in a tetranuclear lanthanum polyoxometalate assembled from [Mo7O24]6- polyanions yielding visible and near-infrared luminescence

    Get PDF
    A rare case of low-percentage trivalent lanthanide doping in multinuclear lanthanide polyoxometalates (LnPOMs) was investigated. The [La-4(MoO4) (H2O)(16-) (Mo7O24)(4)](14-) polyanion was chosen as the host material for this study. In this polyanion the central [La-4(MoO4)](10+) core is coordinated by four heptamolybdate groups as well as 16 water molecules. The tetranuclear lanthanum POM was doped with 5% of Eu3+, Tb3+, Sm3+, Dy3+, Nd3+, Er3+, and Yb3+ (according to synthesis), and the structures and luminescence properties of the x%Ln:LaPOMs were investigated. Additionally a series of tetranuclear lanthanide POMs built from [Mo7O24](6-) heptamolybdate polyanions with Eu3+, Tb3+, Sm3+, Dy3+, and Nd3+ instead of La3+ were synthesized, and a detailed analysis revealed that the tetranuclear clusters formed monomers or dimers linked through oxygen bridges. The smaller lanthanide ions, namely, Er3+ and Yb3+, did not form tetranuclear clusters, but instead mononuclear sandwich-type POMs were obtained. The obtained structures were shown to be lanthanide-specific, and not a result of different synthetic/crystallization conditions. The luminescence properties of the x%Ln:LaPOMs were compared with the luminescence properties of the LnPOMs

    Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling

    Get PDF
    In order to differentiate the perceived QoS between traffic classes in heterogeneous packet networks, equipment discriminates incoming packets based on their class, particularly in the way queued packets are scheduled for further transmission. We review a common stochastic modelling framework in which scheduling mechanisms can be evaluated, especially with regard to the resulting per-class delay distribution. For this, a discrete-time single-server queue is considered with two classes of packet arrivals, either delay-sensitive (1) or delay-tolerant (2). The steady-state analysis relies on the use of well-chosen supplementary variables and is mainly done in the transform domain. Secondly, we propose and analyse a new type of scheduling mechanism that allows precise control over the amount of delay differentiation between the classes. The idea is to introduce N reserved places in the queue, intended for future arrivals of class 1
    corecore