Combinatorial design of multi-ring networks with combined routing and flow control

In this paper we present a novel design technique for packet switched networks. The design is based on the construction of multiple virtual rings, which enjoy the one-bridge property: the path between any two nodes is either confined to a single ring or traverses exactly two rings (passing through a single bridge node). Our best designs are constructed by using finite generalized quadrangles of combinatorial design theory. We present novel routing and flow control protocols that capitalize on the one-bridge property of the multi-ring network. Our protocols ensure that (i) no loss due to congestion occurs inside a network, under arbitrary traffic patterns; (ii) all the packets reach their destinations within bounded time with low jitter; and (iii) the bandwidth is allocated fairly and no host is starved. We provide both a theoretical analysis and an extensive simulation-based performance evaluation of our protocols.