Learn More
– It has been shown that maximal weight matching algorithms for input-queued switches are stable under any admissible traffic conditions with a speedup of 2. As link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In Frame-Based Maximal Weight Matching (FMWM), a new(More)
— It has been shown that maximal size matching algorithms for input-queued switches are stable under any admissible traffic conditions with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In this letter we describe a(More)
– This paper presents an analysis of a discrete-time Markov-modulated process for generating heterogeneous bursty traffic in input-queued switches. The goals of the model described are two fold. First, it constitutes an expansion of the classic ON/OF F process to address scenarios in which multiple queues receive bursts from a shared input stream. Second,(More)
— Input-queued cell switches employing the oldest-cell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is stable for admissible traffic conditions when executed with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their(More)
– The distributed shared memory (DSM) packet switching architecture has attracted much attention recently , predominantly due to its ability to overcome the inherent memory-bandwidth limitation of output-queued switches. Its performance has been studied from a theoretical point of view by exploring the conditions under which it can emulate an output-queued(More)
  • 1