We study stochastic tree fluid networks driven by a multidimensional Lévy process. We are interested in (the joint distribution of) the steady-state content in each of the buffers, the busy periods, and the idle periods. To investigate these fluid networks, we relate the above three quantities to fluctuations of the input Lévy process by solving a multidimensional Skorokhod problem. This leads ...

One of the key challenges in multimedia networks is video delivery over wireless channels. MRC (Multi-Resolution Coding) Layered video, divides video into a base layer and multiple enhancement layers. In this paper, we aim to improve video quality, impacted by high channel contention, through mapping individual video layers to EDCA (Enhanced Distributed Channel Access) access categories in orde...

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0’s, and then evolves by changing each 0 to 1, with the n changes done in random order. What is the maximal number of runs of 1’s? We give asymptotic r...

The physics of human activities recently has been studied in the view point that they are dynamic processes of a complex system. The studies reveal that the human activities have bursty nature – occasional abrupt bursts of activity level for short periods of time, along with long periods of inactivity. Quantitative studies show that the distribution of the time, τ , between two consecutive acti...

We analyse Nash equilibrium in time of use of a congested facility. Users are risk averse with general concave utility. Queues are subject to varying degrees of random sorting, ranging from strict queue priority to a completely random queue. We define the key "no residual queue" property, which holds when there is no queue at the time the last user arrives at the queue, and prove that this prop...

Due to the natural randomness of broadband traffic, queues are required at various places in the asynchronous transfer mode (ATM) network to absorb instantaneous traffic bursts that may temporarily exceed the network bandwidth. A queue management algorithm will manage the queued cells in such a way that higher priority cells will always be served first, low priority cells will be discarded when...

A family of approaches for the implementation of Dynamic Programming optimization can be improved for real time applications if the queuing stage is improved. The computational cost of maintaining a priority queue (PQ) for the standard Dijkstra’s algorithm has a theoretical lower bound that is function of the queue population. However a perfect PQ is not a necessary condition for implementing t...

We introduce a framework for reducing the number of element comparisons performed in priority-queue operations. In particular, we give a priority queue which guarantees the worst-case cost of O(1) per minimum finding and insertion, and the worst-case cost of O(log n) with at most log n+O(1) element comparisons per minimum deletion and deletion, improving the bound of 2 logn+ O(1) on the number ...

The operating speed of a sequential decoder with stack algorithm is usually limited by the time to search the best node for further extension. This problem can be completely alleviated by using the systolic priority queue to replace the stack memory. However, the systolic priority queues developed previously are accessible only in the cases when the number of inputs processed is small. This is ...

We introduce a framework for reducing the number of comparisons performed in the deletion and minimum deletion operations for priority queues. In particular, we give a priority queue with constant cost per insertion and minimum finding, and logarithmic cost with at most logn + O(log logn) 1 comparisons per deletion and minimum deletion, improving over the bound of 2 logn + O(1) comparisons for ...