Show simple item record

dc.contributor.authorBall, Michael O.en_US
dc.contributor.authorVakhutinsky, A.en_US
dc.date.accessioned2007-05-23T09:59:17Z
dc.date.available2007-05-23T09:59:17Z
dc.date.issued1995en_US
dc.identifier.urihttp://hdl.handle.net/1903/5646
dc.description.abstractATM networks 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 origination 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 so-called bandwidth packing problem. We develop and analyze an approximate algorithm for solving the problem in the specific context that arises in our setting.en_US
dc.format.extent1883331 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1995-58en_US
dc.relation.ispartofseriesCSHCN; TR 1995-22en_US
dc.subjectnetwork managementen_US
dc.subjectalgorithmsen_US
dc.subjectroutingen_US
dc.subjectATM networksen_US
dc.subjectIntelligent Signal Processing en_US
dc.subjectCommunications Systemsen_US
dc.titleCall Rerouting in an ATM Environmenten_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record