du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • 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
CAC and routing for multi-service networks with blocked wide-band calls delayed, Part II: approximative link MDP framework
Dalarna University, School of Technology and Business Studies, Computer Engineering.
2007 (English)In: European transactions on telecommunications, ISSN 1124-318X, E-ISSN 2161-3915, Vol. 18, no 1, p. 13-33Article in journal (Refereed) Published
Abstract [en]

In this paper, we study the call admission control (CAC) and routing issue in multi-service networks. Two categories of calls are considered: a narrow-band with blocked calls cleared and a wide-band with blocked calls delayed. The optimisation is subject to several quality of service (QoS) constraints, either on the packet or call level. The objective function is formulated as reward maximisation with penalty for delay. A suboptimal solution is achieved by applying Markov decision process (MDP) theory together with a three-level approximation. First, the network is decomposed into a set of links assumed to have independent Markov and reward processes respectively. Second, the dimensions of the link Markov and reward processes are reduced by aggregation of the call classes into call categories. Third, by applying decomposition of the link Markov process, the link MDP tasks are simplified considerably. The CAC and routing policy is computed by the policy iteration algorithm from MDP theory. The numerical results show that the proposed CAC and routing method, based on the approximate link MDP framework, is able to find an efficient trade-off between reward loss and average call set-up delay, outperforming conventional methods such as least loaded routing (LLR).

Place, publisher, year, edition, pages
2007. Vol. 18, no 1, p. 13-33
Keywords [en]
Call admission control and routing of delayed calls (approximative MDP model)
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:du-1817DOI: 10.1002/ett.1088OAI: oai:dalea.du.se:1817DiVA, id: diva2:519614
Available from: 2006-02-28 Created: 2006-02-28 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Nordström, Ernst
By organisation
Computer Engineering
In the same journal
European transactions on telecommunications
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 519 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • 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