Many multimedia applications, including audio and video, require quality of service( QOS) guarantees from network. A typical user is only concerned with the QOS requirements on end -to-end basis and does not care about the local switching node QOS. In this paper, we propose a general framework to map the end-to-end QOS requirement into the local switching node QOS requirements. Most of recent r...

Input buffered switches are known to suffer from head-of-line blocking that limits the throughput to 58.6%. It has been shown that with virtual output queueing (VOQ) 100% throughput can be achieved using arbitration algorithms. While dynamic algorithms decide based on some metrics in each time slot, a static arbitration called allocation reserves time slots for specific connections in advance. ...

We prove that the bu er bound in [CFZF98] can be improved, by using a modi cation of the proofs in the original paper [CFZF98], together with so-called network calculus bounds. We also show that the delay bound in [CFZF98] is the sum of worst case queuing delays at all nodes along the path of a connection.

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to PGPS, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log log N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to PGPS. Interestingly , both...

Worst-case latency is an important characteristic of information dissemination protocols. However, in sparse mobile ad hoc networks where end-to-end connectivity cannot be achieved and store-carry-forward algorithms are needed, such worst-case analyses have not been possible to perform on real mobility traces due to lack of suitable models. We propose a new metric called delay expansion that re...

In this paper we study the delay characteristics of Fair Queueing algorithms with a stochastic comparison approach. In integrated services networks, Fair Queueing (FQ) algorithms have received much attention, because they can guarantee an end-to-end session delay bound when the burstiness of the session traac is bounded, and they ensure the fair allocation of the bandwidth. The delay characteri...

ÐThis paper considers the support of hard real-time connections in ATM networks. In an ATM network, a set of hard realtime connections can be admitted only if the worst case end-to-end delays of cells belonging to individual connections are less than their deadlines. There are several approaches to managing the network resources in order to meet the delay requirements of connections. This paper...