The bandwidth adaptation is the technique that allows the flexibility in bandwidth allocation for a call. Using the bandwidth adaptation technique, the number of call admission in the system can be increased significantly. In this paper we propose a priority based bandwidth adaptation scheme that can release multi-level of bandwidth from the existing calls to accept call requests. The amount of...

In this paper we investigate further the performance of a fault tolerant load sharing replicated buffered banyan network switch design. We look at the effect increasing the Switch Element (SE) degree has on the performance of the system and propose a simple modification to the system to transmit priority traffic. These results highlight the excellent performance and flexibility that these load ...

In this paper, we consider the construction of an optical priority queue with a single (M + 1) × (M + 1) switch and M fiber delay lines. The M fiber delay lines are connected from M outputs of the switch back to M inputs of the switch, leaving one input (resp. output) of the switch for the input (resp. output) of the priority queue. It was known in [8][9] that with an appropriate choice of the ...

In this paper we present the approximate waiting time analysis of two class non-preemptive priority queues. The traffics of the queue are characterized by ”two parameter description”, which means that the mean and the squared coefficient of variation of the inter arrival times and of the service times are given. The solution is based on the separate analysis of the low and high priority queue. ...

This paper discusses admission control in a two-priority system. The main aim is to evaluate the maximum load that can be admitted to a finite low priority buffer when the constraint on the packet loss ratio is given. To calculate the admissible low priority load we propose the approximate analysis that exploits just two first moments of stochastic processes involved. The method lets us derive ...

A priority queue is a data type where the element with the smallest key value can be found and deleted, and new elements can be inserted. It is also called a priority queue when the element with the largest key value is wanted, instead of the smallest. In some cases, it is interesting to find and delete both the smallest and the largest element, as well as to be able to insert new elements. A s...

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we introduce a resilient priority queue. The deletemin operation of a resilient priority queue retur...

We consider a synchronized bufferless Clos ATM switch with input cell processor queues. The arrival process to each input port of the switch is assumed to be bursty and it is modeled by an Interrupted Bernoulli Process. Two classes of cells are considered. Service in an input cell processor queue is head-of-the-line without preemption. In addition, space preemption is used. That is, a high prio...

This paper identifies various parametrized dynamic priority queue disciplines from literature which are complete in two class M/G/1 queue. Equivalence between these queue disciplines is established by obtaining non linear transformation in closed form. Motivation behind these completeness and equivalence results is discussed from optimal control perspective. Some comments on global FCFS policy ...