Dynamically scaling system area networks

Abstract

New network components joining running system area networks can require communication path reconfigurations. We present a novel efficient algorithm to dynamically reconfigure the network with an arbitrary topology, for the case of newly joining node. We define a restoration graph which overcomes the restriction of the up/down algorithm. We obtain an upper bound in terms of the number of messages generated in order to reconfigure the network. The termination and the liveness properties of the proposed algorithm are proven. The validation and performance improvement of the system area network (SAN) with the proposed algorithm in comparison to the up/down algorithm is presented.