We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
In this paper, we analyze the stability of large scale superpeer networks against attacks. Two different kinds of attacks namely deterministic and degree dependent attack have bee...
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
Matthew Andrews, Baruch Awerbuch, Antonio Fern&aac...
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
Input buffered switches with Virtual Output Queueing (VOQ) can be unstable when presented with unbalanced loads. Existing scheduling algorithms, including iSLIP for Input Queued (...
Neil J. Gunther, Kenneth J. Christensen, Kenji Yos...