SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kau-82281"
 

Search: onr:"swepub:oai:DiVA.org:kau-82281" > End-to-end congesti...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Haile, Habtegebreil KassayeKarlstads universitet,Institutionen för matematik och datavetenskap (from 2013),Distributed Systems and Communications Research Group (DISCO) (author)

End-to-end congestion control approaches for high throughput and low delay in 4G/5G cellular networks

  • Article/chapterEnglish2021

Publisher, publication year, extent ...

  • Elsevier,2021
  • electronicrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kau-82281
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-82281URI
  • https://doi.org/10.1016/j.comnet.2020.107692DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • Cellular networks have evolved to support high peak bitrates with low loss rates as observed by the higherlayers. However, applications and services running over cellular networks are now facing other difficult congestion-related challenges, most notably a highly variable link capacity and bufferbloat. To overcome theseissues and improve performance of network traffic in 4G/5G cellular networks, a number of in-network and end-to-end solutions have been proposed. Fairness between interacting congestion control algorithms (CCAs) has played an important role in the type of CCAs considered for research and deployment. The placement of content closer to the user and the allocation of per-user queues in cellular networks has increased the likelihood of a cellular access bottleneck and reduced the extent of flow interaction between multiple users. This has resulted in renewed interest in end-to-end CCAs for cellular networks by opening up room for researchand exploration. In this work, we present end-to-end CCAs that target a high throughput and a low latency over highly variable network links, and classify them according to the way they address the congestion control. The work also discusses the deployability of the algorithms. In addition, we provide insights into possible future research directions, such as coping with a higher degree of variability, interaction of CCAs in as hared bottleneck, and avenues for synergized research, such as CCAs assisted by software defined networking and network function virtualization. We hope that this work will serve as a starting point for systematically navigating through the expanding number of cellular CCAs.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Grinnemo, Karl-Johan,1968-Karlstads universitet,Institutionen för matematik och datavetenskap (from 2013),Distributed Systems and Communications Research Group (DISCO)(Swepub:kau)karlgrin (author)
  • Ferlin, SimoneEricsson AB (author)
  • Hurtig, Per,1980-Karlstads universitet,Institutionen för matematik och datavetenskap (from 2013),Distributed Systems and Communications Research Group (DISCO)(Swepub:kau)perhurt (author)
  • Brunström, Anna,1967-Karlstads universitet,Institutionen för matematik och datavetenskap (from 2013),Distributed Systems and Communications Research Group (DISCO)(Swepub:kau)annabrun (author)
  • Karlstads universitetInstitutionen för matematik och datavetenskap (from 2013) (creator_code:org_t)

Related titles

  • In:Computer Networks: Elsevier186, s. 1-221389-12861872-7069

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view