IMPLEMENTATION OF A DECENTRALIZED PARETO-OPTIMAL ALGORITHM

Citation
Ln. Kumar et al., IMPLEMENTATION OF A DECENTRALIZED PARETO-OPTIMAL ALGORITHM, Computer communications, 17(8), 1994, pp. 600-610
Citations number
11
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Software Graphycs Programming
Journal title
ISSN journal
01403664
Volume
17
Issue
8
Year of publication
1994
Pages
600 - 610
Database
ISI
SICI code
0140-3664(1994)17:8<600:IOADPA>2.0.ZU;2-D
Abstract
iterative flow control algorithms to achieve a Pareto optimal point ha ve been proposed in the telecommunications literature. In this paper, we present several relaxation and estimation techniques to improve the performance of the algorithms. We also explore several possible imple mentations that extend support to the proposed analytical models. Simu lations of these possible implementations are carried out, and the per formance of the flow control algorithms studied. The proposed implemen tations for the Pareto algorithms achieve optimization of the product of powers of individual user classes. The effect of additional factors like the length of the observation cycle, the structure of the observ ation cycle, and the relaxation factors are also studied. The simulati on results suggest that better convergence is achieved when the observ ation windows are maintained at the node level and are packet count ba sed. The window size has to be sufficiently long. The relaxation techn iques are useful with the right choice of relaxation factors. The gree dy algorithms using estimation techniques to achieve complete decentra lizability are very appealing.