Design algorithm for packet‐switching networks with different classes of packets‐capacity, priority, and flow assignment under endto‐end packet delay constraint

This paper proposes a design algorithm for packet‐switching networks with different classes of packets under end‐to‐end packet delay constraint and a design algorithm for fault‐tolerant networks. the former is a heuristic capacity, priority, and flow assignment algorithm which locally minimizes the network cost while satisfying a constraint that the average transmission delay of each class of packets between two arbitrary nodes never exceed a value predetermined for the class. This algorithm is composed of three subalgorithms and the cost minimization is pursued by iterating these algorithms as long as the constraint is satisfied. the latter is a design algorithm for a fault‐tolerant network which satisfies the foregoing constraint even if an arbitrary single link fails. With this algorithm, an assignment with relatively large cost but satisfying the constraint is obtained first. Then a procedure of reducing the capacity of a link whose effect on cost reduction is great but whose effect on path delay increase is not so great is iterated to reduce the network cost as long as the constraint is satisfied.