Layouts for mobility management in wireless ATM networks

  • Authors:
  • Michele Flammini;Alfredo Navarra

  • Affiliations:
  • Computer Science Department, University of L'Aquila, Via Vetoio loc. Coppito, I-67010 L'Aquila, Italy;Department of Mathematics and Informatics, University of Perugia, Via Vanvitelli 1, I-06123 Perugia, Italy

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.06

Visualization

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 h, load l and distance d is NP-complete, even in the very restricted case h=2, l=1 and d=1. We then provide optimal layout constructions for basic interconnection networks, such as chains and rings.