Virtual embeddings on regular topology networks

Abstract

The paper considers distributed processing over a switch-based LAN and addresses loss-free routing of non-reserved, bursty data traffic. The approach is based on embedding multiple virtual rings onto the underlying network topology with the following two constraints: (i) each virtual ring is Hamiltonian (i.e., includes each node exactly once), and (ii) rings are mutually edge disjoint. New techniques to obtain such virtual rings in the hypercube and circulant networks are presented. Each virtual ring may operate like a buffer insertion ring with fairness. The routing algorithm on the multiple virtual rings is a generalization of convergence routing and it ensures loss-free and deterministic delivery of bursty traffic. The bounds on the length of routing are studied both analytically and computationally. It is shown that an upper bound of O(N/d) on the maximum length of routing can be obtained on the networks with d virtual ring embeddings.