✦ LIBER ✦

A packet routing method based on game theory

✍ Scribed by Katsunori Yamaoka; Yoshinori Sakai

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 150 KB
Volume: 81
Category: Article
ISSN: 8756-6621
DOI: 10.1002/(sici)1520-6424(199808)81:8<89::aid-ecja10>3.0.co;2-x

No coin nor oath required. For personal study only.

✦ Synopsis

The size of public telecommunication networks and computer networks is becoming quite large, and various new control features and services are being offered so that a large amount of control is needed and enormous amounts of data must be handled. Thus there is a need to utilize the limited network resources efficiently and effectively.

In this paper, we propose a distributed control method based on game theory, in which the performance of the whole network is levelled without regard to the quality of communication, and each element of the network has a basically independent function. It is shown by computer simulation that the packet loss rate caused by timeout can be decreased.

📜 SIMILAR VOLUMES

A packet routing method based on a Hogg-

A packet routing method based on a Hogg-Huberman strategy

✍ Tatsushi Yamasaki; Toshimitsu Ushio 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 546 KB

PROPOSAL OF A PACKET SWITCH BASED ON PUR

PROPOSAL OF A PACKET SWITCH BASED ON PURELY RANDOM ROUTING

✍ ANDREA BORELLA; FRANCO CHIARALUCE 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

A new self-routing packet switching fabric architecture is presented, which avoids the use of electronic logic. This can be obtained by adopting a random routing procedure which can be simply implemented on available photonic devices. The results achieved for a 16 x 16 switching fabric demonstrate t

Sharper analysis of packet routing on a

Sharper analysis of packet routing on a butterfly

✍ Arvind Krishna; Bruce Hajek; Andrea Pietracaprina 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 995 KB

A packet routing method for complex netw

A packet routing method for complex networks by a stochastic neural network

✍ Takayuki Kimura; Hiroyuki Nakajima; Tohru Ikeguchi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 615 KB

We propose a new algorithm for controling packet routing by a neural network. First, we show that the conventional method for a packet routing control using a neural network is not so effective when it is applied to a network with irregular topology. To overcome this problem, we propose a modified m

A neural network method for minimum dela

A neural network method for minimum delay routing in packet-switched networks

✍ G Feng; C Douligers 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 147 KB

In this paper, a neural networks (NNs) based two-phase routing algorithm is proposed. The aim of the ®rst phase is to ®nd a set of alternative routes for each commodity, while the traf®c of each commodity is optimally distributed on the alternative routes in the second phase. Our ®nal goal is to rou

A packet routing strategy using neural n

A packet routing strategy using neural networks on scale-free networks

✍ Yuki Naganuma; Akito Igarashi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 379 KB

We propose a dynamic packet routing strategy by using neural networks on scale-free networks. In this strategy, in order to determine the nodes to which the packets should be transmitted, we use path lengths to the destinations of the packets, and adjust the connection weights of the neural networks