Simulative Analysis of Access Selection Algorithms for Multi-Access Networks
Authors:
- D. MarizDMD. Mariz
- I. CananeaICI. Cananea
- D. SadokDSD. Sadok
- G. FodorGFG. Fodor
- 21 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Multiservice allocation for multiaccess wireless systemsIEEE Transactions on Wireless Communications, 2005
- Multi-constraint dynamic access selection in always best connected networks2005
- Erlang Capacity of Multiaccess Systems With Service-Based Access SelectionIEEE Communications Letters, 2004
- Providing quality of service in always best connected networksIEEE Communications Magazine, 2003
- Performance evaluation of common radio resource management (CRRM)2003
- Always best connectedIEEE Wireless Communications, 2003
- New Bounds for Variable-Sized Online Bin PackingSIAM Journal on Computing, 2003
- Capacity of multi-service cellular networks with transmission-rate control2002
- On the online bin packing problemJournal of the ACM, 2002
- Bounded Space On-Line Bin Packing: Best Is Better than FirstAlgorithmica, 2001