Continuous Learning Automata Solutions to the Capacity Assignment Problem

@article{Oommen2000ContinuousLA,
  title={Continuous Learning Automata Solutions to the Capacity Assignment Problem},
  author={B. John Oommen and T. Dale Roberts},
  journal={IEEE Trans. Computers},
  year={2000},
  volume={49},
  pages={608-620}
}
The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most approaches consider a single class of packets flowing through the network, but in reality, different classes of packets with different packet lengths and priorities are transmitted over the networks. In this paper we assume that the traffic consists of different classes of packets with different… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 68 extracted citations

Recent Trends in Applied Artificial Intelligence

Lecture Notes in Computer Science • 2013
View 9 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Discrete Link Capacity Assignment in Prioritized Computer Networks: Two Approaches

A. Levi, C. Ersoy
Proceedings of the Ninth International Symposium on Computer and Information Services, November 7- • 1994

Prentice-Hall

D. Bertsekas, R. Gallager, Data Networks Second Edition
New Jersey, • 1992
View 2 Excerpts

37

B. J. Oommen, D.C.Y. Ma, Deterministic Learning Automata Solutions to the EquiPartitionin Problem, IEEE Trans. Comput., Vol
pp 2-14, Jan. • 1988
View 1 Excerpt

Designing Data Networks

Ellis, L Robert
1986

Springer-Verlag

S. Lakshmivarahan, Learning Algorithms Theory, Applications
New York, • 1981
View 1 Excerpt

Communication Nets: Stochastic Message Flow and Delay

L. Kleinrock
McGraw-Hill Book Co., Inc., New York, • 1964
View 1 Excerpt

Similar Papers

Loading similar papers…