1,364 research outputs found
On the Stability of Isolated and Interconnected Input-Queued Switches under Multiclass Traffic
In this correspondence, we discuss the stability of scheduling algorithms for input-queueing (IQ) and combined input/output queueing (CIOQ) packet switches. First, we show that a wide class of IQ schedulers operating on multiple traffic classes can achieve 100 % throughput. Then, we address the problem of the maximum throughput achievable in a network of interconnected IQ switches and CIOQ switches loaded by multiclass traffic, and we devise some simple scheduling policies that guarantee 100 % throughput. Both the Lyapunov function methodology and the fluid modeling approach are used to obtain our results
Network Coding in a Multicast Switch
We consider the problem of serving multicast flows in a crossbar switch. We
show that linear network coding across packets of a flow can sustain traffic
patterns that cannot be served if network coding were not allowed. Thus,
network coding leads to a larger rate region in a multicast crossbar switch. We
demonstrate a traffic pattern which requires a switch speedup if coding is not
allowed, whereas, with coding the speedup requirement is eliminated completely.
In addition to throughput benefits, coding simplifies the characterization of
the rate region. We give a graph-theoretic characterization of the rate region
with fanout splitting and intra-flow coding, in terms of the stable set
polytope of the 'enhanced conflict graph' of the traffic pattern. Such a
formulation is not known in the case of fanout splitting without coding. We
show that computing the offline schedule (i.e. using prior knowledge of the
flow arrival rates) can be reduced to certain graph coloring problems. Finally,
we propose online algorithms (i.e. using only the current queue occupancy
information) for multicast scheduling based on our graph-theoretic formulation.
In particular, we show that a maximum weighted stable set algorithm stabilizes
the queues for all rates within the rate region.Comment: 9 pages, submitted to IEEE INFOCOM 200
Scheduling algorithms for high-speed switches
The virtual output queued (VOQ) switching architecture was adopted for high speed switch implementation owing to its scalability and high throughput. An ideal VOQ algorithm should provide Quality of Service (QoS) with low complexity. However, none of the existing algorithms can meet these requirements.
Several algorithms for VOQ switches are introduced in this dissertation in order to improve upon existing algorithms in terms of implementation or QoS features. Initially, the earliest due date first matching (EDDFM) algorithm, which is stable for both uniform and non-uniform traffic patterns, is proposed. EDDFM has lower probability of cell overdue than other existing maximum weight matching algorithms. Then, the shadow departure time algorithm (SDTA) and iterative SDTA (ISDTA) are introduced. The QoS features of SDTA and ISDTA are better than other existing algorithms with the same computational complexity. Simulations show that the performance of a VOQ switch using ISDTA with a speedup of 1.5 is similar to that of an output queued (OQ) switch in terms of cell delay and throughput. Later, the enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm based on the Birkhoff-von Neumann decomposition (BVND) algorithm, which can provide rate and cell delay guarantees, is introduced. Theoretical analysis shows that the performance of EBVND is better than BVND in terms of throughput and cell delay. Finally, the maximum credit first (MCF), the Enhanced MCF (EMCF), and the iterative MCF (IMCF) algorithms are presented. These new algorithms have the similar performance as BNVD, yet are easier to implement in practice
- …