Please use this identifier to cite or link to this item:
https://hdl.handle.net/11000/31411
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gozalvez, Javier | - |
dc.contributor.author | Lucas-Estañ, M. Carmen | - |
dc.contributor.author | Sanchez-Soriano, Joaquin | - |
dc.contributor.other | Departamentos de la UMH::Ingeniería de Comunicaciones | es_ES |
dc.date.accessioned | 2024-02-09T16:41:02Z | - |
dc.date.available | 2024-02-09T16:41:02Z | - |
dc.date.created | 2007-10 | - |
dc.identifier.citation | 2007 4th International Symposium on Wireless Communication Systems | es_ES |
dc.identifier.uri | https://hdl.handle.net/11000/31411 | - |
dc.description.abstract | The implementation of multi-channel assignment policies can improve a mobile’s network performance by increasing the user throughput and reducing transmission delays. However, to define efficient distribution policies, the varying service demands and the search for user QoS fairness should be considered under multimedia traffic scenarios. In this context, this paper proposes and evaluates novel bankruptcy and utility-based multi-channel distribution schemes aimed at maximising the resource’s efficiency and guaranteeing user QoS fairness. | es_ES |
dc.format | application/pdf | es_ES |
dc.format.extent | 5 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | IEEE | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject.classification | Elecrónica | es_ES |
dc.subject.other | CDU::6 - Ciencias aplicadas::62 - Ingeniería. Tecnología | es_ES |
dc.title | User QoS-based Multi-Channel Assignment Schemes under Multimedia Traffic Conditions | es_ES |
dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
dc.relation.publisherversion | https://doi.org/10.1109/ISWCS.2007.4392312 | es_ES |
View/Open:
ISWCS2007_Resource_UMH.pdf
1,54 MB
Adobe PDF
Share: