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 r
A packet routing method based on a Hogg-Huberman strategy
β Scribed by Tatsushi Yamasaki; Toshimitsu Ushio
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 546 KB
- Volume
- 82
- Category
- Article
- ISSN
- 8756-6621
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
A simple strategy for approximating the sets of nonlinear equations underlying the coupled cluster (CC) methods is proposed. It consists of splitting the individual cluster amplitudes into two components -one of fixed value and the other determined from a set of modified CC equations. This strategy