A framework for efficient bandwidth management in broadband wireless access systems
Notice bibliographique
Résumé
Broadband Wireless Access Systems (BWASs) such as High Speed Downlink Packet Access (HSDPA) and the Worldwide Interoperability for Microwave Access (WiMAX), pose a myriad of new opportunities for leveraging the support of a wide range of “content-rich” mobile multimedia services with diverse Quality of Service (QoS) requirements. This is due to the remarkably high bandwidth that is supported by these systems, which was previously only available to wireline connections. Despite the support for such high bandwidth, satisfying the diverse QoS of users while maximizing the revenues of network operators is still one of the major issues in these systems. Bandwidth management, therefore, will play a decisive role in the success of such wireless access systems. Without efficient bandwidth management, network operators may not be able to meet the growing demand of users for multimedia services, and may consequently suffer great revenue loss. Bandwidth management in BWASs is, however, a challenging problem due to many issues that need to be taken into consideration. Examples of such issues include the diverse QoS requirements of the services that BWASs support, the varying channel quality conditions of mobile users, and hence the varying amount of resources that are needed to guarantee certain QoS levels during the lifetime of user connections, the utilization of shared channels for data delivery instead of dedicated ones and network congestion. In this thesis, we address the problem of bandwidth management in BWASs and propose efficient economic-based solutions in order to deal with these issues at different bandwidth management levels, and hence enhance the QoS support in these systems. Specifically, we propose a bandwidth management framework for BWASs. The framework is designed to support multiple classes of traffic with different users having different QoS requirements, maximize the throughput of BWASs, support inter- and intra-class fairness, prevent network congestion and maximize the network operator's revenues. The framework consists of three related components, namely packet scheduling, bandwidth provisioning and Call Admission Control-based dynamic pricing. By efficiently managing the wireless bandwidth prior to users' admission (i.e., pre-admission bandwidth management) and during the users' connections (i.e., post-admission bandwidth management), these schemes are shown to achieve the design goals of our framework. Keywords: BWASs, bandwidth management, packet scheduling, bandwidth provisioning, Call Admission Control, dynamic pricing, revenues and fairness.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».