IEICE TRANSACTIONS on Communications
An Adaptive Routing Protocol with Balanced Stochastic Route Exploration and Stabilization Based on Short-Term Memory
Summary :
Due to rapid increases in the number of users and diversity of devices, temporal fluctuation of traffic on information communication network is becoming large and rapid recently. Especially, sudden traffic changes such as flash crowds often cause serious congestion on the network and result in nearly fatal slow down of date-communication speed. In order to keep communication quality high on the network, routing protocols that are scalable and able to quickly respond to rapid, and often unexpected, traffic fluctuation are highly desired. One of the promising approaches is the distributed routing protocol, which works without referring global information of the whole network but requires only limited informatin of it to realize route selection. These approaches include biologically inspired routing protocols based on the Adaptive Response by Attractor Selection model (ARAS), in which routing tables are updated along with only a scalar value reflecting communication quality measured on each router without evaluating communication quality over the whole network. However, the lack of global knowledge of the current status of the network often makes it difficult to respond promptly to traffic changes on the network that occurs at outside of the local scope of the protocol and causes inefficient use of network resources. In order to solve the essential problem of the local scope, we extend ARAS and propose a routing protocol with active and stochastic route exploration. The proposed protocol can obtain current communication quality of the network beyond its local scope and promptly responds to traffic changes occur on the network by utilizing the route exploration. In order to compensate destabilization of routing itself due to the active and stochastic exploration, we also introduce a short-term memory to the dynamics of the proposed attractor selection model. We conform by numerical simulations that the proposed protocol successfully balances rapid exploration with reliable routing owning to the memory term.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E99-B No.11 pp.2280-2288
- Publication Date
- 2016/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2016NEP0008
- Type of Manuscript
- Special Section PAPER (Special Section on Deepening and Expanding of Information Network Science)
- Category
Authors
Tomohiro NAKAO
Osaka University
Jun-nosuke TERAMAE
Osaka University
Naoki WAKAMIYA
Osaka University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Tomohiro NAKAO, Jun-nosuke TERAMAE, Naoki WAKAMIYA, "An Adaptive Routing Protocol with Balanced Stochastic Route Exploration and Stabilization Based on Short-Term Memory" in IEICE TRANSACTIONS on Communications,
vol. E99-B, no. 11, pp. 2280-2288, November 2016, doi: 10.1587/transcom.2016NEP0008.
Abstract: Due to rapid increases in the number of users and diversity of devices, temporal fluctuation of traffic on information communication network is becoming large and rapid recently. Especially, sudden traffic changes such as flash crowds often cause serious congestion on the network and result in nearly fatal slow down of date-communication speed. In order to keep communication quality high on the network, routing protocols that are scalable and able to quickly respond to rapid, and often unexpected, traffic fluctuation are highly desired. One of the promising approaches is the distributed routing protocol, which works without referring global information of the whole network but requires only limited informatin of it to realize route selection. These approaches include biologically inspired routing protocols based on the Adaptive Response by Attractor Selection model (ARAS), in which routing tables are updated along with only a scalar value reflecting communication quality measured on each router without evaluating communication quality over the whole network. However, the lack of global knowledge of the current status of the network often makes it difficult to respond promptly to traffic changes on the network that occurs at outside of the local scope of the protocol and causes inefficient use of network resources. In order to solve the essential problem of the local scope, we extend ARAS and propose a routing protocol with active and stochastic route exploration. The proposed protocol can obtain current communication quality of the network beyond its local scope and promptly responds to traffic changes occur on the network by utilizing the route exploration. In order to compensate destabilization of routing itself due to the active and stochastic exploration, we also introduce a short-term memory to the dynamics of the proposed attractor selection model. We conform by numerical simulations that the proposed protocol successfully balances rapid exploration with reliable routing owning to the memory term.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2016NEP0008/_p
Copy
@ARTICLE{e99-b_11_2280,
author={Tomohiro NAKAO, Jun-nosuke TERAMAE, Naoki WAKAMIYA, },
journal={IEICE TRANSACTIONS on Communications},
title={An Adaptive Routing Protocol with Balanced Stochastic Route Exploration and Stabilization Based on Short-Term Memory},
year={2016},
volume={E99-B},
number={11},
pages={2280-2288},
abstract={Due to rapid increases in the number of users and diversity of devices, temporal fluctuation of traffic on information communication network is becoming large and rapid recently. Especially, sudden traffic changes such as flash crowds often cause serious congestion on the network and result in nearly fatal slow down of date-communication speed. In order to keep communication quality high on the network, routing protocols that are scalable and able to quickly respond to rapid, and often unexpected, traffic fluctuation are highly desired. One of the promising approaches is the distributed routing protocol, which works without referring global information of the whole network but requires only limited informatin of it to realize route selection. These approaches include biologically inspired routing protocols based on the Adaptive Response by Attractor Selection model (ARAS), in which routing tables are updated along with only a scalar value reflecting communication quality measured on each router without evaluating communication quality over the whole network. However, the lack of global knowledge of the current status of the network often makes it difficult to respond promptly to traffic changes on the network that occurs at outside of the local scope of the protocol and causes inefficient use of network resources. In order to solve the essential problem of the local scope, we extend ARAS and propose a routing protocol with active and stochastic route exploration. The proposed protocol can obtain current communication quality of the network beyond its local scope and promptly responds to traffic changes occur on the network by utilizing the route exploration. In order to compensate destabilization of routing itself due to the active and stochastic exploration, we also introduce a short-term memory to the dynamics of the proposed attractor selection model. We conform by numerical simulations that the proposed protocol successfully balances rapid exploration with reliable routing owning to the memory term.},
keywords={},
doi={10.1587/transcom.2016NEP0008},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - An Adaptive Routing Protocol with Balanced Stochastic Route Exploration and Stabilization Based on Short-Term Memory
T2 - IEICE TRANSACTIONS on Communications
SP - 2280
EP - 2288
AU - Tomohiro NAKAO
AU - Jun-nosuke TERAMAE
AU - Naoki WAKAMIYA
PY - 2016
DO - 10.1587/transcom.2016NEP0008
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E99-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2016
AB - Due to rapid increases in the number of users and diversity of devices, temporal fluctuation of traffic on information communication network is becoming large and rapid recently. Especially, sudden traffic changes such as flash crowds often cause serious congestion on the network and result in nearly fatal slow down of date-communication speed. In order to keep communication quality high on the network, routing protocols that are scalable and able to quickly respond to rapid, and often unexpected, traffic fluctuation are highly desired. One of the promising approaches is the distributed routing protocol, which works without referring global information of the whole network but requires only limited informatin of it to realize route selection. These approaches include biologically inspired routing protocols based on the Adaptive Response by Attractor Selection model (ARAS), in which routing tables are updated along with only a scalar value reflecting communication quality measured on each router without evaluating communication quality over the whole network. However, the lack of global knowledge of the current status of the network often makes it difficult to respond promptly to traffic changes on the network that occurs at outside of the local scope of the protocol and causes inefficient use of network resources. In order to solve the essential problem of the local scope, we extend ARAS and propose a routing protocol with active and stochastic route exploration. The proposed protocol can obtain current communication quality of the network beyond its local scope and promptly responds to traffic changes occur on the network by utilizing the route exploration. In order to compensate destabilization of routing itself due to the active and stochastic exploration, we also introduce a short-term memory to the dynamics of the proposed attractor selection model. We conform by numerical simulations that the proposed protocol successfully balances rapid exploration with reliable routing owning to the memory term.
ER -
English
