An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks

Authors:
Berverly A. Sanders
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 3
Cited 3

A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius

Journal of the ACM (JACM) - The MIT Press scientific computation series
Asynchronous Iterative Methods for Multiprocessors

Journal of the ACM (JACM)
Decentralized resource allocation algorithms with applications to flow control of communication networks

Decentralized resource allocation algorithms with applications to flow control of communication networks

An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks

IEEE Transactions on Computers
Making greed work in networks: a game-theoretic analysis of switch service disciplines

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Making greed work in networks: a game-theoretic analysis of switch service disciplines

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	14.98

Visualization

Abstract

An asynchronous, distributed algorithm is presented that determines the optimal transmission rate allocation in computer networks with virtual circuit routing. The flow control problem is formulated as a gradient hill-climbing algorithm. It is distributed, since the entry node for each virtual circuit iteratively computes the rate allocation for that virtual circuit. The entry node communicates with the associated user during each interaction and obtains information about the rest of the network by sending control packets along the virtual circuit. It is shown that all of the necessary information to solve the optimization problem can be obtained in this fashion and that the algorithm will converge, even though there is no synchronization between nodes and some computations are made with outdated information.