Article ID Journal Published Year Pages File Type
419791 Discrete Applied Mathematics 2009 14 Pages PDF
Abstract

In this paper, we present a new model that combines quality of service and mobility aspects in wireless ATM networks. Namely, besides the hop count and load parameters of the basic ATM layouts, we introduce a new notion of distance that estimates the time needed to reconstruct the virtual channel of a wireless user when he moves through the network. Quality of service guarantee dictates that the rerouting phase must be imperceptible, that is, the maximum distance between two virtual channels must be maintained as low as possible. Therefore, a natural combinatorial problem arises in which suitable trade-offs must be determined between the different performance measures. We first show that establishing the existence of a layout with maximum hop count hh, load ll and distance dd is NP-complete, even in the very restricted case h=2h=2, l=1l=1 and d=1d=1. We then provide optimal layout constructions for basic interconnection networks, such as chains and rings.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,