Input Queued(IQ) switch architecture has been of recent interest due to its low memory bandwidth requirement. A scheduling algorithm is required to schedule the transfer of packets through cross-bar switch fabric at everytime slot. The performance, that is throughput and delay, of a switch depends on the scheduling algorithm. The Maximum weight matching(MWM) algorithm is known to deliver 100% t...

Input Queued(IQ) switch architecture has been of recent interest due to its low memory bandwidth requirement. A scheduling algorithm is required to schedule the transfer of packets through cross-bar switch fabric at everytime slot. The performance, that is throughput and delay, of a switch depends on the scheduling algorithm. The Maximum weight matching(MWM) algorithm is known to deliver 100% t...

∗ This work was performed while Daming Hang worked as an intern at Microsoft Research China. Abstract -The provision of Quality of Service (QoS) in terms of delay guarantee to real-time applications is a challenging issue in differentiated services (DiffServ) networks. There is a great demand to maintain individual flow’s traffic pattern when scheduling aggregated traffic. In this paper, we pro...

Many per-flow scheduling algorithms have been proposed to provide rate and delay guarantees to flows. It is often argued that the need for maintaining per-flow state and performing per-packet classification seriously limits the scalability of routers that employ such per-flow scheduling algorithms. Consequently, design of algorithms that can provide per-flow rate and delay guarantees without re...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x Chapter 1: Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Chapter 2: Network Model of Wireless Sensor-Actuator Networks . . . . . 3 2.1 Routing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Transmission Scheduling Model . . . . . . . . . . . . . ....

We investigate the trade-off between energy consumption and delay for critical data collection in low duty cycle wireless sensor networks, where a causality constraint exists for routing and link scheduling. We characterize the energy-delay region (E-D region) and formulate a combinatorial optimization problem to determine the link scheduling with the causality constraint. A new multiple-degree...

The goal of this paper is to consider a co-design approach between the controller of a process control application and the frame scheduling for CAN-Based Networked Control Systems in order to simultaneously improve the Quality of Control (QoC) of the process control and the Quality of Service (QoS) of the CAN-based network. First, we present a way to calculate the closed-loop communication time...

This paper addresses the modelling and evaluation of cell scheduling policies in ATM multiplexers using stochastic Petri nets. In particular, we compare four cell scheduling policies: a FIFO policy with and without non-preemptive priorities, a threshold priority policy as recently proposed by Lee and Sengupta, and an extension thereof. The aim of this paper is twofold. First, we want to stress ...

Memory bandwidth is a scarce resource in multicore systems. Scheduling has a dramatic impact on the delay introduced by memory contention, but also on the effectiveness of frequency scaling at saving energy. This paper investigates the cross-effects between tasks running on a multicore system, considering memory contention and the technical constraint of chip-wide frequency and voltage settings...

Consider a network in which adjacent nodes exchange messages via multiple communication channels. Multiple channels between adjacent nodes are desirable due to their cost effectiveness and improved fault-tolerance. We consider the problem of providing deterministic quality of service guarantees in this network. We show that any scheduling protocol designed for a single channel can be converted ...