uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Reinforcement learning for admission control and routing
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2000 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

When a user requests. a connection to another user or a computer in a communications network, a routing algorithm selects a path for transferring the resulting data stream. If all suitable paths are busy, the user request cannot beserved, and is blocked. A routing algorithm that minimizes this blocking probability results in satisfied users, and maximizes the network operator's revenue. In some cases, it may even be advantageous to block a request from one user, to make it possible to serve other users better. This thesis presents improved and partially new algorithms, based on reinforcement learning, which optimize the way a network is shared.

A main contribution of the thesis is the development of algorithms thatadapt to arrivals of user requests that are correlated over time. These methodsare shown to increase network utilization in cases where the request arrivalprocesses are statistically self-similar. Another main contribution is gainscheduled routing, which reduces the computational cost associated withmaking routing decisions. The thesis also demonstrates how to integrate theconcept of max-min fairness into reinforcement learning routing.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis , 2000. , x, 152 p.
Series
DoCS, ISSN 0283-0574 ; 116
Keyword [en]
routing, admission control, reinforcement learning, Markov decision processes, temporal-difference learning, policy iteration, gain scheduling, neural networks, self-similarity, asynchronous transfer mode, max-min fairness
National Category
Computer and Information Science
Research subject
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-710ISBN: 91-628-4100-9 (print)OAI: oai:DiVA.org:uu-710DiVA: diva2:168726
Public defence
2000-05-19, lecture hall, Centre for Mathematics and Information Technology, Uppsala University, Uppsala, 10:15
Available from: 2000-04-28 Created: 2000-04-28 Last updated: 2011-02-18Bibliographically approved

Open Access in DiVA

No full text

By organisation
Division of Computer SystemsComputer Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 820 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf