Location of Repository

On Solving The Capacity Assignment Problem Using Continuous Learning Automata

By B. John Oommen and T. Dale Roberts

Abstract

. The Capacity Assignment problem focuses on finding the best possible set of capacities for the links that satisfy the traffic requirements in a prioritized network while minimizing the cost. Apart from the traditional methods for solving this NP-Hard problem, one new method that uses Learning Automata (LA) strategies has been recently reported. This method uses discretized learning automata [1]. The present paper shows how the problem can be solved using continuous learning automata. The paper considers the realistic scenario when different classes of packets with different packet lengths and priorities are transmitted over the networks. After presenting the two well-known solutions to the problem (due to Marayuma and Tang [2], and Levi and Ersoy [3]) we introduce our new method that uses continuous LA, which is comparable to the discretized version, and is probably the fastest and most accurate scheme available. I. INTRODUCTION In this paper we study the Capacity Assig..

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.41.7132
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.scs.carleton.ca/~oo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.