This paper proposes a traffic-adaptive dynamic routing method, which we have named RAG, for connectionless packet networks. Conventional traffic control methods discard the packets which cause congestion. Furthermore, conventional routing methods propagate control messages all over the network for gathering global topology information, and this causes more congestion. In contrast, RAG estimates traffic conditions all over a network without any communication between nodes and makes the best use of free links so that packets make detours to avoid congestive sites. RAG adopts distributed control based on game theory (non-communication, non-zero-sum, two-person). With RAG, nodes play a packet-forwarding game without any communication with each other, and each node controls ordering and routing of the forwarding packets based on the node's individual payoff table which is dynamically reconstructed by observation of surrounding nodes. Nodes cooperate with each other, except for punishment for disloyalty. Repetition of these local operations in nodes aims at the emergence of the gradual network-global traffic balancing. The results of experiments in comparison with the conventional shortest path first (SPF) routing method show that the throughput is about 1.58 times higher with the new method.
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
Kimihiro YAMAMOTO, Shozo NAITO, "A Traffic-Adaptive Dynamic Routing Method and Its Performance Evaluation" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 4, pp. 870-878, April 1999, doi: .
Abstract: This paper proposes a traffic-adaptive dynamic routing method, which we have named RAG, for connectionless packet networks. Conventional traffic control methods discard the packets which cause congestion. Furthermore, conventional routing methods propagate control messages all over the network for gathering global topology information, and this causes more congestion. In contrast, RAG estimates traffic conditions all over a network without any communication between nodes and makes the best use of free links so that packets make detours to avoid congestive sites. RAG adopts distributed control based on game theory (non-communication, non-zero-sum, two-person). With RAG, nodes play a packet-forwarding game without any communication with each other, and each node controls ordering and routing of the forwarding packets based on the node's individual payoff table which is dynamically reconstructed by observation of surrounding nodes. Nodes cooperate with each other, except for punishment for disloyalty. Repetition of these local operations in nodes aims at the emergence of the gradual network-global traffic balancing. The results of experiments in comparison with the conventional shortest path first (SPF) routing method show that the throughput is about 1.58 times higher with the new method.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_4_870/_p
Copy
@ARTICLE{e82-d_4_870,
author={Kimihiro YAMAMOTO, Shozo NAITO, },
journal={IEICE TRANSACTIONS on Information},
title={A Traffic-Adaptive Dynamic Routing Method and Its Performance Evaluation},
year={1999},
volume={E82-D},
number={4},
pages={870-878},
abstract={This paper proposes a traffic-adaptive dynamic routing method, which we have named RAG, for connectionless packet networks. Conventional traffic control methods discard the packets which cause congestion. Furthermore, conventional routing methods propagate control messages all over the network for gathering global topology information, and this causes more congestion. In contrast, RAG estimates traffic conditions all over a network without any communication between nodes and makes the best use of free links so that packets make detours to avoid congestive sites. RAG adopts distributed control based on game theory (non-communication, non-zero-sum, two-person). With RAG, nodes play a packet-forwarding game without any communication with each other, and each node controls ordering and routing of the forwarding packets based on the node's individual payoff table which is dynamically reconstructed by observation of surrounding nodes. Nodes cooperate with each other, except for punishment for disloyalty. Repetition of these local operations in nodes aims at the emergence of the gradual network-global traffic balancing. The results of experiments in comparison with the conventional shortest path first (SPF) routing method show that the throughput is about 1.58 times higher with the new method.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Traffic-Adaptive Dynamic Routing Method and Its Performance Evaluation
T2 - IEICE TRANSACTIONS on Information
SP - 870
EP - 878
AU - Kimihiro YAMAMOTO
AU - Shozo NAITO
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1999
AB - This paper proposes a traffic-adaptive dynamic routing method, which we have named RAG, for connectionless packet networks. Conventional traffic control methods discard the packets which cause congestion. Furthermore, conventional routing methods propagate control messages all over the network for gathering global topology information, and this causes more congestion. In contrast, RAG estimates traffic conditions all over a network without any communication between nodes and makes the best use of free links so that packets make detours to avoid congestive sites. RAG adopts distributed control based on game theory (non-communication, non-zero-sum, two-person). With RAG, nodes play a packet-forwarding game without any communication with each other, and each node controls ordering and routing of the forwarding packets based on the node's individual payoff table which is dynamically reconstructed by observation of surrounding nodes. Nodes cooperate with each other, except for punishment for disloyalty. Repetition of these local operations in nodes aims at the emergence of the gradual network-global traffic balancing. The results of experiments in comparison with the conventional shortest path first (SPF) routing method show that the throughput is about 1.58 times higher with the new method.
ER -