The rate constraint of transmitting multiple priority classes over a time-varying service-rate channel is studied in this work. This constraint specifies the maximum data rate that can be transmitted reliably with QoS (quality of service) guarantee. In our framework, the time-varying service channel is modeled by an N-state discrete Markov process, where each Markov state is associated with a c...

Current standards reserve one bit in the ATM cell header to indicate loss priority. When congestion occurs ai a queue lower priority cells can be discarded in order to insure a smaller cell loss rate for higher priority cells. Strategies for determining which cells to discard are termed space priority buffer management schemes. In ihis paper two adjustable space priority schemes are studied, wh...

Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requi...

Priority-based Functional Reactive Programming (P-FRP) has been recently introduced as a new functional programming formalism for real-time systems. P-FRP allows static priority assignment and guarantees real-time response by preempting lower priority tasks. Due to the state-less nature of functional programs, preempted tasks in P-FRP are aborted and restarted after the higher priority tasks ha...

Layered Multicasting with layered source coding scheme enables efficient distribution of real-time streaming media over heterogeneous networks such as the Internet. In layered multicast, rate control is required to cope with congestion quickly because packet losses in a layer with higher priority lead greater degradation of received quality. In addition, rate control for layered multicast is re...

Priority-based dynamic carrier allocation strategies can be classified into three categories: static-priority, dynamicpriority, and hybrid-priority strategies. Strategies based on static priorities do not consider the local carrier reuse conditions, while dynamic-priority strategies do take these conditions into consideration. Intuitively, one would expect dynamic-priority strategies to perform...

This note concerns charging, rate control and routing for a communication network using priority mechanisms at queues. It is argued that by appropriately marking packets at overloaded resources, end-systems can be provided with the information necessary to balance load across different routes and priorities. Keywords—Congestion pricing, differentiated services, priority queues, rate control, ro...

Priority arbitration is an essential part of the ATM switches in order to support the integration of telecommunication services with difference characteristics. Service priority contral selects the connection to output a cell among all connections destined to the same ontput port. Discard priority contral selects the connection to discard a cell when the shared buffer is full. In this paper we ...

We study the problem of priority inversion in distributed real-time and embedded systems and propose a solution based on a distributed version of the priority inheritance protocol (PIP). Previous approaches to priority inversions in distributed systems use variations of the priority ceiling protocol (PCP), originally designed for centralized systems as a modification of PIP that also prevents d...