|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06)
Simulative Analysis of Access Selection Algorithms for Multi-Access Networks
Buffalo, New York
June 26-June 29
ISBN: 0-7695-2593-8
| ASCII Text | x | ||
| D?nio Mariz, Igor Canan?, Djamel Sadok, G?bor Fodor, "Simulative Analysis of Access Selection Algorithms for Multi-Access Networks," 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 219-227, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/WOWMOM.2006.102, author = {D?nio Mariz and Igor Canan? and Djamel Sadok and G?bor Fodor}, title = {Simulative Analysis of Access Selection Algorithms for Multi-Access Networks}, journal ={2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)}, volume = {0}, year = {2006}, isbn = {0-7695-2593-8}, pages = {219-227}, doi = {http://doi.ieeecomputersociety.org/10.1109/WOWMOM.2006.102}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) TI - Simulative Analysis of Access Selection Algorithms for Multi-Access Networks SN - 0-7695-2593-8 SP219 EP227 A1 - D?nio Mariz, A1 - Igor Canan?, A1 - Djamel Sadok, A1 - G?bor Fodor, PY - 2006 KW - null VL - 0 JA - 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) ER - | |||
It is expected that future wireless systems will consist of several distinct radio access technologies (including WCDMA/HSDPA, GSM/EDGE/GPRS, WLAN and others) forming a multi-access system that offers advanced voice and multimedia services. Previous works have shown that the combined capacity region of such systems depend on the service allocation policy that assigns user sessions to the available subsystems. The currently available service allocation policies typically operate off-line implying that the actual service mix is assumed to be known prior to the service allocation taking place. In this paper we consider the on-line problem according to which sessions arrive one after the other and no assumptions on the service mix can be made. We adopt four on-line bin-packing algorithms to the multi-access environment and study their performance by means of simulation in terms of the class-wise blocking probability and throughput. We find that the algorithm termed LessVoice provides the best performance in terms of the blocking probabilities and imposes the least slow down for elastic sessions.
Citation:
D?nio Mariz, Igor Canan?, Djamel Sadok, G?bor Fodor, "Simulative Analysis of Access Selection Algorithms for Multi-Access Networks," wowmom, pp.219-227, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.
