By Topic

Call admission control and routing in integrated services networks using reinforcement learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. Marbach ; MIT, Cambridge, MA, USA ; O. Mihatsch ; J. N. Tsitsiklis

In integrated services communication networks, an important problem is to exercise call admission control and routing so as to optimally use the network resources. This problem is naturally formulated as a dynamic programming problem, which, however, is too complex to be solved exactly. We use methods of reinforcement learning, together with a decomposition approach, to find call admission control and routing policies. We compare the performance of our policies with a commonly used heuristic policy

Published in:

Decision and Control, 1998. Proceedings of the 37th IEEE Conference on  (Volume:1 )

Date of Conference: