๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Communication network optimization

โœ Scribed by VM Grout; PW Sanders

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
656 KB
Volume
11
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Topological optimization models for comm
Topological optimization models for communication network with multiple reliability goals
โœ Baoding Liu; K. Iwamura ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 563 KB

Network reliability models for determining optimal network topology have been presented and solved by many researchers. This paper presents some new types of topological optimization model for communication network with multiple reliability goals. A stochastic simulation-based ~enetic algorithm is a

Optimal Communication Algorithms in Dist
Optimal Communication Algorithms in Distributed Loop Networks
โœ R.K. Das; B.P. Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.

An improved ant colony optimization for
An improved ant colony optimization for the communication network routing problem
โœ Dongming Zhao; Liang Luo; Kai Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 308 KB

Ant colony optimization (ACO) is a population-based meta-heuristic for combinatorial optimization problems such as the communication network routing problem (CNRP). This paper proposes an improved ant colony optimization (IACO) technique, which adapts a new strategy to update the increased pheromone