Gigabit networking
The virtual path layout problem in fast networks (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
The layout of virtual paths in ATM networks
IEEE/ACM Transactions on Networking (TON)
Optimal layouts on a chain ATM network
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Virtual Path Layouts in ATM Networks
SIAM Journal on Computing
Wireless Networks - Selected Papers from Mobicom'99
Mobile Communications Handbook
Mobile Communications Handbook
On the design of efficient ATM routing schemes
Theoretical Computer Science
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Integrated Broadband Networks; An Introduction to ATM-Based Networks
Integrated Broadband Networks; An Introduction to ATM-Based Networks
Concrete Math
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Scalable Approach to Routing in ATM Networks
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A survey of wireless ATM MAC protocols
PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
Virtual Path Layout in ATM Path with Given Hop Count
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Wireless ATM layouts for chain networks
Mobile Networks and Applications
PCS mobility support over fixed ATM networks
IEEE Communications Magazine
Hi-index | 0.06 |
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.