A new method for constructing infinite families of k-tight optimal double loop networks

Abstract The double loop network (DLN) is a circulant digraph with n nodes and outde-gree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0, 1,..., 40, infinite families of k-tight optimal DLN can be con-structed by the new method, where the number nk(t, a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed