Communication networks
a new reward model for MDP state aggregation with application to CAC and routing
Document identifier: oai:dalea.du.se:1818
Access full text here:
10.1002/ett.1007Keyword: Natural Sciences,
Computer and Information Sciences,
Naturvetenskap,
Data- och informationsvetenskap,
CAC,
MDPPublication year: 2005Relevant Sustainable Development Goals (SDGs):
The SDG label(s) above have been assigned by OSDG.aiAbstract: An optimal solution of the call admission control and routing problem in multi-service loss networks, in terms of average reward per time unit, is possible by modeling the network behavior as a Markov decision process (MDP). However, even after applying the standard link independence assumption, the solution of the corresponding set of link problems may involve considerable numerical computation. In this paper, we study an approximate MDP framework on the link level, where vector-valued MDP states are mapped into a set of aggregate scalar MDP states corresponding to link occupancies. In particular, we propose a new model of the expected reward for admitting a call on the network. Compared to Krishnan's and Hübner's method [11], our reward model more accurately reflects the bandwidth occupancy by different call categories. The exact and approximate link MDP frameworks are compared by simulations, and the results show that the proposed link reward model significantly improves the performance of Krishnan's and Hübner's method.
Authors
Ernst Nordström
Högskolan Dalarna; Datateknik
Other publications
>>
Jakob Carlström
Other publications
>>
Record metadata
Click to view metadata
header:
identifier: oai:dalea.du.se:1818
datestamp: 2021-04-15T13:27:04Z
setSpec: SwePub-du
metadata:
mods:
@attributes:
version: 3.7
recordInfo:
recordContentSource: du
recordCreationDate: 2006-02-28
identifier:
http://urn.kb.se/resolve?urn=urn:nbn:se:du-1818
10.1002/ett.1007
titleInfo:
@attributes:
lang: eng
title: Communication networks
subTitle: a new reward model for MDP state aggregation with application to CAC and routing
abstract: An optimal solution of the call admission control and routing problem in multi-service loss networks in terms of average reward per time unit is possible by modeling the network behavior as a Markov decision process (MDP). However even after applying the standard link independence assumption the solution of the corresponding set of link problems may involve considerable numerical computation. In this paper we study an approximate MDP framework on the link level where vector-valued MDP states are mapped into a set of aggregate scalar MDP states corresponding to link occupancies. In particular we propose a new model of the expected reward for admitting a call on the network. Compared to Krishnan's and Hübner's method 11 our reward model more accurately reflects the bandwidth occupancy by different call categories. The exact and approximate link MDP frameworks are compared by simulations and the results show that the proposed link reward model significantly improves the performance of Krishnan's and Hübner's method.
subject:
@attributes:
lang: eng
authority: uka.se
topic:
Natural Sciences
Computer and Information Sciences
@attributes:
lang: swe
authority: uka.se
topic:
Naturvetenskap
Data- och informationsvetenskap
@attributes:
lang: eng
topic: CAC
@attributes:
lang: eng
topic: MDP
language:
languageTerm: eng
genre:
publication/journal-article
ref
note:
Published
2
name:
@attributes:
type: personal
authority: du
namePart:
Nordström
Ernst
role:
roleTerm: aut
affiliation:
Högskolan Dalarna
Datateknik
nameIdentifier: eno
@attributes:
type: personal
namePart:
Carlström
Jakob
role:
roleTerm: aut
originInfo:
dateIssued: 2005
relatedItem:
@attributes:
type: host
titleInfo:
title: European transactions on telecommunications
identifier:
1124-318X
2161-3915
part:
detail:
@attributes:
type: volume
number: 16
@attributes:
type: issue
number: 6
extent:
start: 495
end: 508
physicalDescription:
form: print
typeOfResource: text