Logo
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • English 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
View Item 
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Institutional repository
All of DSpace
  • Communities & Collections
  • By Issue Date
  • Authors
  • Titles
  • Subjects

Dynamic RAT Selection and Pricing for Efficient Traffic Allocation in 5G HetNets

Thumbnail
Author
Passas V., Miliotis V., Makris N., Korakis T.
Date
2019
Language
en
DOI
10.1109/ICC.2019.8761831
Keyword
Benchmarking
Costs
Heterogeneous networks
Quality control
Quality of service
Rats
Traffic congestion
Access technology
Capacity utilization
Distributed dynamics
Dynamic RAT selections
Load distributions
Qualityof-service requirement (QoS)
Radio access technologies
Traffic allocation
5G mobile communication systems
Institute of Electrical and Electronics Engineers Inc.
Metadata display
Abstract
In this paper, we focus on 5G heterogeneous networks, considering the existence of multiple Distributed Units (DUs) that can provide access to end users implementing several access technologies, managed by a Central Unit (CU) responsible for the allocation of network resources. Based on a distributed dynamic pricing scheme, that gives to User Equipment (UE) the ability to select the appropriate Radio Access Technology (RAT) depending on its sensitivity to congestion, we investigate a scheme of greater granularity, where UEs are able to allocate each of their traffic classes to the appropriate RAT, exploiting their multi-homing features. As UEs are sequentially polled to request for network resources, we develop a centrally controlled proportionally fair ranking as a benchmark policy. We then propose a dynamic polling policy that presents close performance to the benchmark policy, while maintaining a distributed nature. We evaluate our framework for a variety of traffic classes in terms of Quality of Service (QoS) requirements, and we provide results on capacity utilization and load distribution over available RATs, as well as access price variations. © 2019 IEEE.
URI
http://hdl.handle.net/11615/77966
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]
htmlmap 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister (MyDspace)
Help Contact
DepositionAboutHelpContact Us
Choose LanguageAll of DSpace
EnglishΕλληνικά
htmlmap