Implementation issues of a multi-class flow control algorithm

Author

Kumar, Lakshmana N. ; Douligeris, Christos ; Develekos, George

Author_Institution

Dept. of Electr. & Comput. Eng., Miami Univ., Coral Gables, FL, USA

fYear

1993

fDate

4-7 Apr 1993

Firstpage

0.833333333333333

Abstract

Various implementations that could support the optimal flow control algorithms using the Pareto optimal criterion are explored. The performance of the Pareto algorithms for flow control is analyzed. Simulation results suggest that the convergence is better when the observation windows are maintained at the node level and are packet count based. The window size has to be sufficiently long. The relaxation techniques are useful with the right choice of relaxation factors. The greedy algorithms which use estimation techniques to achieve complete decentralizability are found to be very appealing

Keywords

convergence of numerical methods; estimation theory; optimal control; packet switching; queueing theory; telecommunication control; Pareto algorithms; Pareto optimal criterion; convergence; estimation techniques; game theory; greedy algorithms; multi-class flow control algorithm; observation windows; optimal flow control algorithms; packet count; queueing model; relaxation factors; relaxation techniques; window size; Analytical models; Convergence; Equations; Game theory; Greedy algorithms; Iterative algorithms; Nash equilibrium; Optimal control; Telecommunication control; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon '93, Proceedings., IEEE

Conference_Location

Charlotte, NC

Print_ISBN

0-7803-1257-0

Type

conf

DOI

10.1109/SECON.1993.465683

Filename

465683