In this paper, we propose an efficient algorithm of quick routing for private Wireless ATM (Asynchronous Transfer Mode) networks. This algorithm uses hierarchical source routing, which first establishes a connection between the sending node and the home node (which has the terminal location information), and then, partially releases the connection and reroutes it between the sending node and the receiving node. This results in less delay than found in other conventional routing methods, and avoids passing through congested nodes, because this algorithm uses traffic estimation based on queuing theory. We also show the effectiveness of this algorithm with the use of computer simulations.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Riwu JIN, Shinji SUGAWARA, Tetsuya MIKI, Nobuo NAKAJIMA, "Quick Routing Algorithm on Wireless ATM Network" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 7, pp. 1312-1321, July 2002, doi: .
Abstract: In this paper, we propose an efficient algorithm of quick routing for private Wireless ATM (Asynchronous Transfer Mode) networks. This algorithm uses hierarchical source routing, which first establishes a connection between the sending node and the home node (which has the terminal location information), and then, partially releases the connection and reroutes it between the sending node and the receiving node. This results in less delay than found in other conventional routing methods, and avoids passing through congested nodes, because this algorithm uses traffic estimation based on queuing theory. We also show the effectiveness of this algorithm with the use of computer simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_7_1312/_p
Copy
@ARTICLE{e85-b_7_1312,
author={Riwu JIN, Shinji SUGAWARA, Tetsuya MIKI, Nobuo NAKAJIMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Quick Routing Algorithm on Wireless ATM Network},
year={2002},
volume={E85-B},
number={7},
pages={1312-1321},
abstract={In this paper, we propose an efficient algorithm of quick routing for private Wireless ATM (Asynchronous Transfer Mode) networks. This algorithm uses hierarchical source routing, which first establishes a connection between the sending node and the home node (which has the terminal location information), and then, partially releases the connection and reroutes it between the sending node and the receiving node. This results in less delay than found in other conventional routing methods, and avoids passing through congested nodes, because this algorithm uses traffic estimation based on queuing theory. We also show the effectiveness of this algorithm with the use of computer simulations.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Quick Routing Algorithm on Wireless ATM Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1312
EP - 1321
AU - Riwu JIN
AU - Shinji SUGAWARA
AU - Tetsuya MIKI
AU - Nobuo NAKAJIMA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2002
AB - In this paper, we propose an efficient algorithm of quick routing for private Wireless ATM (Asynchronous Transfer Mode) networks. This algorithm uses hierarchical source routing, which first establishes a connection between the sending node and the home node (which has the terminal location information), and then, partially releases the connection and reroutes it between the sending node and the receiving node. This results in less delay than found in other conventional routing methods, and avoids passing through congested nodes, because this algorithm uses traffic estimation based on queuing theory. We also show the effectiveness of this algorithm with the use of computer simulations.
ER -