In this paper we investigate the problem of dynamic bandwidth reservation over the uplink of TDMA-based wireless networks providing prioritized services. The proposed multiple access protocol has the following salient features. First, it supports multiple levels of priorities. Second, it optimizes a unique cost function, that consists of a weighted sum of allocation "Deviation" functions, on a ...

In this paper, we devise and evaluate a new Grid-Based Priority Routing (GBPR) protocol for Underwater Wireless Sensor Networks (UWSNs). GBPR utilizes a 3D logical grid view of the monitored area to deliver data packets to sink nodes. Particularly, data packets are forwarded on a cell-by-cell-basis using elected sensor nodes called cell-heads. The unique feature in GBPR is the classification of...

In January 1991, the European Space Agency commissioned a study into the practicality of using process-based scheduling techniques in an on-board application environment, with Ada as the implementation language. This short paper summarises the results of that study.

The paper presents different combinations of queuing methods and their impact on the VoIP traffic delay within the network. In our experiment we combined three of the most useful queuing methods where we put together priority queuing (PQ) with class-based weighted fair queuing (CBWFQ), custom queuing (CQ) with CBWFQ and weighted fair queuing (WFQ) with CBWFQ. Each hybrid method is compared with...

We introduce the track parallelization problem (TPP) that consists in parallelizing the execution of task sets. For modelling and solving TPPs in a finite-domain constraintprogramming framework, we propose the TPP constraint along with a suitable solver for use in non-preemptive scheduling. We demonstrate how to infer redundant TPPs in school timetabling and we report a large-scale empirical st...

A novel CPU scheduling policy is designed and implemented. It is a configurable policy in the sense that a tunable parameter is provided to change its behavior. With different settings of the parameter, this policy can emulate the first-come first-serve, the processing sharing, or the feedback policies, as well as different levels of their mixtures. This policy is implemented in the Linux kerne...

Traffic control system is an interconnection of signaling devices positioned at road intersections, pedestrian crossings and other locations to control competing flows of traffic. This paper presents basic notions and application procedures of Priority Based Automatic Traffic Control Mechanism, and outlines current and potential applications of these methodologies for efficient traffic and tran...

We propose several variations of the adversarial queueing model to cope with packets that can have different priorities, the priority and variable priority models, and link failures, the failure and reliable models. We address stability issues in the proposed adversarial models. We show that the set of universally stable networks in the adversarial model remains the same in the four introduced ...

Recent studies have shown that it is possible to approximate throughput optimal scheduling using distributed Carrier Sense Multiple Access (CSMA). These studies build on the idea of maximal-weight scheduling, where the set of links scheduled in each slot are the non-conflicting links with maximum sum of their queue lengths. However, conditions imposed by real environments including imperfect ca...