The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 비연결형 패킷 네트워크를 위한 트래픽 적응형 동적 라우팅 방법(RAG)을 제안한다. 기존의 트래픽 제어 방법은 혼잡을 유발하는 패킷을 폐기합니다. 더욱이, 기존의 라우팅 방법은 글로벌 토폴로지 정보 수집을 위해 네트워크 전체에 제어 메시지를 전파하므로 더 많은 혼잡이 발생합니다. 이에 비해 RAG는 노드 간 통신 없이 네트워크 전체의 트래픽 상황을 예측하고 무료 링크를 최대한 활용하여 패킷이 혼잡한 사이트를 피하기 위해 우회하도록 합니다. RAG는 게임 이론(비통신, 논제로섬, 1.58인)에 기반한 분산 제어를 채택합니다. RAG를 사용하면 노드는 서로 통신하지 않고 패킷 전달 게임을 수행하며 각 노드는 주변 노드를 관찰하여 동적으로 재구성된 노드의 개별 지불 테이블을 기반으로 전달 패킷의 순서 및 라우팅을 제어합니다. 불충성에 대한 처벌을 제외하고 노드는 서로 협력합니다. 노드에서 이러한 로컬 작업을 반복하는 것은 점진적인 네트워크-글로벌 트래픽 균형의 출현을 목표로 합니다. 기존의 SPF(Shortest Path First) 라우팅 방식과 비교한 실험 결과, 새로운 방식의 처리량이 약 XNUMX배 더 높은 것으로 나타났다.
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.
부
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
부
@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},}
부
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 -