Virtual trees routing protocol for a wireless ATM LAN
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 369-373
- https://doi.org/10.1109/icupc.1996.557928
Abstract
This paper presents a new routing algorithm for a wireless ATM (asynchronous transfer mode) LAN (local area network). The LAN combines positive aspects of connection-oriented and datagram communications schemes in its usage of the ATM VP/VC (virtual path/virtual channel) concept. In this scheme, a set of VPI (virtual path identifier) trees, rooted at each node in the LAN, are preestablished. This has the effect of emulating "connectionless" networking which simplifies handoffs and other mobility management tasks. Given that the VPI sink trees are preestablished, there is a need for a procedure to compute and update the routes of these VPI trees with changing conditions in the LAN. We first propose an off-line procedure to compute the initial VPI trees. Since traffic conditions are likely to change rapidly in mobile networks, we propose a distributed scheme called VTRP (virtual trees routing protocol) to dynamically update the routes of VPI trees in response to repeated congestion and/or topological changes in the network.Keywords
This publication has 8 references indexed in Scilit:
- BAHAMA: a broadband ad-hoc wireless ATM local-area networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Architectures for PCS mobility management on ATM transport networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Routing in an ATM-Based Mobile NetworkPublished by Springer Nature ,1996
- RednetPublished by Association for Computing Machinery (ACM) ,1995
- An architecture and methodology for mobile-executed handoff in cellular ATM networksIEEE Journal on Selected Areas in Communications, 1994
- ATM-based transport architecture for multiservices wireless personal communication networksIEEE Journal on Selected Areas in Communications, 1994
- Optimizedk‐shortest‐paths algorithm for facility restorationSoftware: Practice and Experience, 1994
- Disjoint paths in a networkNetworks, 1974