Distributed call rerouting in multiclass broadband networks

Abstract

Broadband integrated services digital networks (B-ISDN) must handle multiclass traffic with diverse quality of service requirements. We consider a multiclass routing model in which routes are calculated in a distributed fashion by the call originating nodes. Within this general context, we address the problem of rerouting a set of previously routed calls to avoid a failed link. Under the approach we propose, a single node executes an aggregate, global rerouting of all affected calls and then converts the set of aggregate routes into an allocation of bandwidth on each link to call origination nodes for the purpose of rerouting. The bandwidth allocation is distributed to each origination node, which in turn then calculates routes for the individual calls. The problem faced by each call origination node is a variant of the socalled bandwidth packing problem. We develop and analyze an approximate algorithm for solving this problem in the specific context that arises in our setting.