An on-line access selection algorithm for ABC networks supporting elastic services
2008 (English)In: Wireless Communications and Networking Conference, 2008. WCNC 2008. IEEE, New York: IEEE conference proceedings, 2008, 2033-2038 p.Conference paper (Refereed)
The problem of access selection (AS) for multi-access networks has for long been addressed by both the standardization and research communities. As a result, a number of papers have proposed efficient AS algorithms that can take into account radio resource efficiency, overall capacity and quality of service (QoS) requirements in a multi-service environment. However, only a few works have developed on-line AS algorithms that do not require a priori knowledge of the traffic mix when delay sensitive (e.g. voice) and best effort (data) applications are supported. In this work, we present an online AS algorithm that performs well in a multiaccess network supporting two service classes and specifically takes into account the elastic nature of data applications. We model AS as a binpacking problem and realize that the problem is NP-complete. Therefore, we develop a heuristic algorithm called LessDamage that calculates a damage parameter and uses it as a metric for the allocation strategy. Simulation results show that LessDamage performs better in terms of blocking probability and elastic data throughput than available online binpacking heuristics, independently of the number of the available access technologies.
Place, publisher, year, edition, pages
New York: IEEE conference proceedings, 2008. 2033-2038 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-203077DOI: 10.1109/WCNC.2008.361ISI: 000259411101091OAI: oai:DiVA.org:kth-203077DiVA: diva2:1081776
Wireless Communications and Networking Conference, WCNC 2008.
ScopusID: 51649129104. QC 201703152017-03-152017-03-152017-03-15Bibliographically approved