In high-speed switches the Input Queued(IQ) architecture is very popular due to its low memory-bandwidth requirement compared to the Output Queued (OQ) switch architecture which is extremely desirable in terms of performance but requires very high memory-bandwidth. In the past decade researchers and industry people have been trying hard to £nd good scheduling algorithm for IQ switches. The two ...

On a network having m edges and n nodes, Hsu and Huang’s self-stabilizing algorithm for maximal matching stabilizes in at most 2m+ n moves.  2001 Elsevier Science B.V. All rights reserved.

We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is O(n) moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under th...

Given a bipartite graph G(V,E), V = A ∪̇B where |V | = n, |E| = m and a partition of the edge set into r ≤ m disjoint subsets E = E1 ∪̇E2 ∪̇ . . . ∪̇Er, which are called ranks, the rank-maximal matching problem is to find a matching M of G such that |M ∩ E1| is maximized and given that |M ∩ E1| is maximized, |M ∩ E2| is also maximized, and so on. Such a problem arises as an optimization criteria ov...

As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams. In this paper, we introduce a new approach to handling graph strea...

The maximal matching problem has received considerable attention in the selfstabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that un...

This paper proposes an innovative Pipeline-based Maximalsized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matc...