In this paper we show that the widely used normalization constraint ∑ n i=1 wi = 1 does not apply to the priority vectors associated with reciprocal relations, whenever additive transitivity is involved. We show that misleading applications of this type of normalization may lead to unsatisfactory results and we give some examples from the literature. Then, we propose an alternative normalizatio...

In this paper we show how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N) time per operation and O(n) space. Here n denotes the number of elements stored in the dictionary and N denotes the size of the universe. Previously, this time bound required O(N) space E77].

A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c while never storing more than k elements during the transformation. We consider the set of all such related pairs (a, 7) in both the case that cs is a binary sequence and the case that o is a permutation of 1,2,. , n. We derive properties of this relation and use it to d...

This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs, the Point Coordinator Function (PCF) of IEEE 802.11, the Enhanced Distributed Coordinator Function (EDCF) of the proposed IEEE 802.11e extension to IEEE 802.11, Distributed Fair Scheduling (DFS), and Blackburst using the ns-2 simulator. The metrics used in the evaluation are throughput, medi...

In the future, voice communication is expected to migrate from the Public Switched Telephone Network (PSTN) to the Internet. Because of the particular characteristics (low volume and burstiness) and stringent delay and loss requirements of voice traffic, it is important to separate voice traffic from other traffic in the network by providing it with a separate queue. In this study, we conduct a...

A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeo between high e ciency, i.e., the ability to support many connections with delay bounds, and low complexity. The operations required by the RPQ multiplexer are similar to those of the simple, but ine cient, Static-Priority (SP) multiplexer. The overhead of RPQ, as compared to SP, ...

energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...

Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of t...