In this paper we present a new model able to combine quality of service (QoS) and mobility aspects in wireless ATM networks. Namely, besides the standard parameters of the basic ATM layouts, we introduce a new one, that estimates the time needed to reconstruct the virtual channel of a wireless user when it moves through the network. QoS guarantee dictates that the rerouting phase must be imperceptible. Therefore, a natural combinatorial problem arises in which suitable trade-offs must be determined between the different performance measures. We first show that deciding the existence of a layout with maximum hop count h, load 1 and distance d is NP-complete, even in the very restricted case h = 2, 1 = 1 and d = 1. We then provide optimal layout constructions for basic interconnection networks, such as chains and rings.
Flammini, M., Gambosi, G., Gasparini, A., Navarra, A. (2004). Dynamic layouts for wireless ATM. In EURO-PAR 2003 PARALLEL PROCESSING, PROCEEDINGS (pp.1056-1063) [10.1007/978-3-540-45209-6_143].
Dynamic layouts for wireless ATM
GAMBOSI, GIORGIO;
2004-01-01
Abstract
In this paper we present a new model able to combine quality of service (QoS) and mobility aspects in wireless ATM networks. Namely, besides the standard parameters of the basic ATM layouts, we introduce a new one, that estimates the time needed to reconstruct the virtual channel of a wireless user when it moves through the network. QoS guarantee dictates that the rerouting phase must be imperceptible. Therefore, a natural combinatorial problem arises in which suitable trade-offs must be determined between the different performance measures. We first show that deciding the existence of a layout with maximum hop count h, load 1 and distance d is NP-complete, even in the very restricted case h = 2, 1 = 1 and d = 1. We then provide optimal layout constructions for basic interconnection networks, such as chains and rings.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
