Per-connection performance guarantees for cross-path ATM packet switch

Abstract

Recently, a novel quasi-static routing scheme called path switching has been proposed for a large-scale ATM packet switch, and a Clos-like switching network called the cross-path switch was designed for its implementation. In principle, the cross-path switch can support both multicast and multirate traffic and now we add the capacity of supporting multimedia traffic in it. In this paper, we develop a model to study the performance guarantees in a cross-path switch. Based on this model, we derive a set of deterministic bounds on propagation delay as well as backlogs at the switch on a per-connection basis. The results show that due to the quasi-static nature of the routing scheme implemented at the central stage, data traffic always becomes more bursty after passing through the cross-path switch. This leads to the criteria for the design of the route assignment algorithm.