du.sePublikationer
Ändra sökning
Avgränsa sökresultatet
1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Nordström, Ernst
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    A new MDP model for CAC of self-similar call traffic2005Ingår i: Knowledge Foundation Conference, Karlstad, 2005Konferensbidrag (Refereegranskat)
  • 2.
    Nordström, Ernst
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    An embedded link MDP model with application to call admission control2005Ingår i: Knowledge foundation conference, Borlänge, 2005Konferensbidrag (Refereegranskat)
  • 3.
    Nordström, Ernst
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    CAC and routing of self-similar call traffic based on Markov decision theory2003Ingår i: The KK conference, Visby, 2003Konferensbidrag (Övrigt vetenskapligt)
  • 4.
    Nordström, Ernst
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    Communication research at Dalarna University2005Ingår i: Second Swedish National Computer Networking Workshop, Karlstad, 2005Konferensbidrag (Refereegranskat)
  • 5.
    Nordström, Ernst
    et al.
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    Carlström, Jakob
    Communication networks: a new reward model for MDP state aggregation with application to CAC and routing2005Ingår i: European transactions on telecommunications, ISSN 1124-318X, E-ISSN 2161-3915, Vol. 16, nr 6, s. 495-508Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 6.
    Nordström, Ernst
    et al.
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    Dziong, Zbigniew
    CAC and routing for multi-service networks with blocked wide-band calls delayed, part I: exact link MDP framework2006Ingår i: European transactions on telecommunications, ISSN 1124-318X, E-ISSN 2161-3915, Vol. 17, nr 1, s. 21-36Artikel i tidskrift (Refereegranskat)
    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 (NB) with blocked calls cleared and a wide-band (WB) with blocked calls delayed. The objective function is formulated as reward maximisation with penalty for delay. The optimisation is subject to quality of service (QoS) constraints and, possibly, grade of service (GoS) constraints. A suboptimal solution is achieved by applying Markov decision process (MDP) theory together with a two-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. 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 exact 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 the least loaded routing (LLR).

  • 7.
    Nordström, Ernst
    et al.
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    Dziong, Zbigniew
    CAC and routing for multi-service networks with blocked wide-band calls delayed, Part II: approximative link MDP framework2007Ingår i: European transactions on telecommunications, ISSN 1124-318X, E-ISSN 2161-3915, Vol. 18, nr 1, s. 13-33Artikel i tidskrift (Refereegranskat)
    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).

1 - 7 av 7
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf