Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 263) Show all publications
Hurtig, P., Grinnemo, K.-J., Brunström, A., Ferlin, S., Alay, Ö. & Kuhn, N. (2019). Low-Latency Scheduling in MPTCP. IEEE/ACM Transactions on Networking, 1, 302-315, Article ID 8584135.
Open this publication in new window or tab >>Low-Latency Scheduling in MPTCP
Show others...
2019 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 1, p. 302-315, article id 8584135Article in journal (Refereed) Published
Abstract [en]

The demand for mobile communication is continuously increasing, and mobile devices are now the communication device of choice for many people. To guarantee connectivity and performance, mobile devices are typically equipped with multiple interfaces. To this end, exploiting multiple available interfaces is also a crucial aspect of the upcoming 5G standard for reducing costs, easing network management, and providing a good user experience. Multi-path protocols, such as multi-path TCP (MPTCP), can be used to provide performance optimization through load-balancing and resilience to coverage drops and link failures, however, they do not automatically guarantee better performance. For instance, low-latency communication has been proven hard to achieve when a device has network interfaces with asymmetric capacity and delay (e.g., LTE and WLAN). For multi-path communication, the data scheduler is vital to provide low latency, since it decides over which network interface to send individual data segments. In this paper, we focus on the MPTCP scheduler with the goal of providing a good user experience for latency-sensitive applications when interface quality is asymmetric. After an initial assessment of existing scheduling algorithms, we present two novel scheduling techniques: the block estimation (BLEST) scheduler and the shortest transmission time first (STTF) scheduler. BLEST and STTF are compared with existing schedulers in both emulated and real-world environments and are shown to reduce web object transmission times with up to 51% and provide 45% faster communication for interactive applications, compared with MPTCP's default scheduler.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
asymmetric paths., low-latency, MPTCP, scheduling, Transport protocols, Mobile telecommunication systems, Scheduling algorithms, Wireless telecommunication systems, asymmetric paths, Interactive applications, Low latency, Low-latency communication, Performance optimizations, Real world environments, 5G mobile communication systems
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-71263 (URN)10.1109/TNET.2018.2884791 (DOI)000458851600022 ()2-s2.0-85058877698 (Scopus ID)
Available from: 2019-02-21 Created: 2019-02-21 Last updated: 2019-03-14Bibliographically approved
Garcia, J. & Brunström, A. (2018). Clustering-based separation of media transfers in DPI-classified cellular video and VoIP traffic. In: 2018 IEEE Wireless Communications and Networking Conference (WCNC): . Paper presented at 2018 IEEE Wireless Communications and Networking Conference (WCNC), 15-18 April 2018, Barcelona, Spain.. IEEE
Open this publication in new window or tab >>Clustering-based separation of media transfers in DPI-classified cellular video and VoIP traffic
2018 (English)In: 2018 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Identifying VoIP and video traffic is often useful in the context of managing a cellular network, and to perform such traffic classification deep packet inspection (DPI) approaches are often used. Commercial DPI classifiers do not necessarily differentiate between, for example, YouTube traffic that arises from browsing inside the YouTube app, and traffic arising from the actual viewing of a YouTube video. Here we apply unsupervised clustering methods on such cellular DPI-labeled VoIP and video traffic to identify the characteristic behavior of the two sub-groups of media-transfer and non media-transfer flows. The analysis is based on a measurement campaign performed inside the core network of a commercial cellular operator, collecting data for more than two billion packets in 40+ million flows. A specially instrumented commercial DPI appliance allows the simultaneous collection of per packet information in addition to the DPI classification output. We show that the majority of flows falls into clusters that are easily identifiable as belonging to one of the traffic sub-groups, and that a surprising majority of DPIlabeled VoIP and video traffic is non-media related.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Wireless Communications and Networking Conference. Proceedings, ISSN 1525-3511, E-ISSN 1558-2612
Keywords
Media, YouTube, Clustering algorithms, Cryptography, Downlink, Engines, Uplink
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-67798 (URN)10.1109/WCNC.2018.8377027 (DOI)000435542400081 ()978-1-5386-1734-2 (ISBN)978-1-5386-1735-9 (ISBN)
Conference
2018 IEEE Wireless Communications and Networking Conference (WCNC), 15-18 April 2018, Barcelona, Spain.
Projects
HITS
Available from: 2018-06-19 Created: 2018-06-19 Last updated: 2019-01-11Bibliographically approved
Abrahamsson, H., Ben Abdesslem, F., Ahlgren, B., Brunström, A., Marsh, I. & Bjorkman, M. (2018). Connected Vehicles in Cellular Networks: Multi-access versus Single-access Performance. In: 2018 NETWORK TRAFFIC MEASUREMENT AND ANALYSIS CONFERENCE (TMA): . Paper presented at 2nd Network Traffic Measurement and Analysis Conference (TMA)Vienna, Austria JUN 26-29, 2018.
Open this publication in new window or tab >>Connected Vehicles in Cellular Networks: Multi-access versus Single-access Performance
Show others...
2018 (English)In: 2018 NETWORK TRAFFIC MEASUREMENT AND ANALYSIS CONFERENCE (TMA), 2018Conference paper, Published paper (Refereed)
Abstract [en]

Connected vehicles can make roads traffic safer and more efficient, but require the mobile networks to handle time-critical applications. Using the MONROE mobile broadband measurement testbed we conduct a multi-access measurement study on buses. The objective is to understand what network performance connected vehicles can expect in today's mobile networks, in terms of transaction times and availability. The goal is also to understand to what extent access to several operators in parallel can improve communication performance. In our measurement experiments we repeatedly transfer warning messages from moving buses to a stationary server. We triplicate the messages and always perform three transactions in parallel over three different cellular operators. This creates a dataset with which we can compare the operators in an objective way and with which we can study the potential for multi-access. In this paper we use the triple-access dataset to evaluate single-access selection strategies, where one operator is chosen for each transaction. We show that if we have access to three operators and for each transaction choose the operator with best access technology and best signal quality then we can significantly improve availability and transaction times compared to the individual operators. The median transaction time improves with 6% compared to the best single operator and with 61% compared to the worst single operator. The 90-percentile transaction time improves with 23% compared to the best single operator and with 65% compared to the worst single operator.

National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-71054 (URN)000454696100027 ()2-s2.0-85057241219 (Scopus ID)
Conference
2nd Network Traffic Measurement and Analysis Conference (TMA)Vienna, Austria JUN 26-29, 2018
Available from: 2019-02-14 Created: 2019-02-14 Last updated: 2019-02-21Bibliographically approved
Mandalari, A. M., Lutu, A., Custura, A., Khatouni, A. S., Alay, Ö., Bajpai,, V., . . . Fairhust, G. (2018). Experience: Implications of Roaming in Europe. In: Proceedings of the 24th Annual International Conference on Mobile Computing and Networking: . Paper presented at The 24th Annual International Conference on Mobile Computing and Networking, October 29 - November 02, New Dehli, India (pp. 179-189). New York, USA: ACM Publications
Open this publication in new window or tab >>Experience: Implications of Roaming in Europe
Show others...
2018 (English)In: Proceedings of the 24th Annual International Conference on Mobile Computing and Networking, New York, USA: ACM Publications, 2018, p. 179-189Conference paper (Refereed)
Abstract [en]

"Roam like Home" is the initiative of the European Commission (EC) to end the levy of extra charges when roaming within the European region. As a result, people are able to use data services more freely across Europe. However, the implications roaming solutions have on performance have not been carefully examined. This paper provides an in-depth characterization of the implications of international data roaming within Europe. We build a unique roaming measurement platform using 16 different mobile networks deployed in six countries across Europe. Using this platform, we measure different aspects of international roaming in 3G and 4G networks, including mobile network configuration, performance characteristics, and content discrimination. We find that operators adopt common approaches to implementing roaming, resulting in additional latency penalties of ∼60 ms or more, depending on geographical distance. Considering content accessibility, roaming poses additional constraints that leads to only minimal deviations when accessing content in the original country. However, geographical restrictions in the visited country make the picture more complicated and less intuitive.

Place, publisher, year, edition, pages
New York, USA: ACM Publications, 2018
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-71543 (URN)10.1145/3241539.3241577 (DOI)
Conference
The 24th Annual International Conference on Mobile Computing and Networking, October 29 - November 02, New Dehli, India
Available from: 2019-03-18 Created: 2019-03-18 Last updated: 2019-03-18
Ahlgren, B., Hurtig, P., Abrahamsson, H., Grinnemo, K.-J. & Brunström, A. (2018). ICN Congestion Control for Wireless Links. In: IEEE (Ed.), IEEE WCNC 2018 Conference Proceedings: . Paper presented at IEEE Wireless Communications and Networking Conference (WCNC) 2018, Barcelona, Spain, April 16-18 2018. New York: IEEE
Open this publication in new window or tab >>ICN Congestion Control for Wireless Links
Show others...
2018 (English)In: IEEE WCNC 2018 Conference Proceedings / [ed] IEEE, New York: IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Information-centric networking (ICN) with its design around named-based forwarding and in-network caching holds great promises to become a key architecture for the future Internet. Still, despite its attractiveness, there are many open questions that need to be answered before wireless ICN becomes a reality, not least about its congestion control: Many of the proposed hop-by-hop congestion control schemes assume a fixed and known link capacity, something that rarely – if ever – holds true for wireless links. As a first step, this paper demonstrates that although these congestion control schemes are able to fairly well utilise the available wireless link capacity, they greatly fail to keep the link delay down. In fact, they essentially offer the same link delay as in the case with no hop-by-hop, only end- to-end, congestion control. Secondly, the paper shows that by complementing these congestion control schemes with an easy- to-implement, packet-train link estimator, we reduce the link delay to a level significantly lower than what is obtained with only end-to-end congestion control, while still being able to keep the link utilisation at a high level. 

Place, publisher, year, edition, pages
New York: IEEE, 2018
Keywords
icn, information centric networks, congestion control, wireless communication, wireless networks
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-65420 (URN)10.1109/WCNC.2018.8377396 (DOI)000435542402117 ()
Conference
IEEE Wireless Communications and Networking Conference (WCNC) 2018, Barcelona, Spain, April 16-18 2018
Projects
Research Environment for Advancing Low Latency Internet (READY)
Funder
Knowledge Foundation
Available from: 2017-12-17 Created: 2017-12-17 Last updated: 2018-10-18Bibliographically approved
Oljira, D. B., Grinnemo, K.-J., Taheri, J. & Brunström, A. (2018). MDTCP: Towards a Practical Multipath Transport Protocol for Telco Cloud Datacenters. In: 9th International Conference on the Network of the Future (NOF): . Paper presented at 9th International Conference on the Network of the Future (NOF)19-21 nov 2018 (pp. 9-16). IEEE
Open this publication in new window or tab >>MDTCP: Towards a Practical Multipath Transport Protocol for Telco Cloud Datacenters
2018 (English)In: 9th International Conference on the Network of the Future (NOF), IEEE, 2018, p. 9-16Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Network congestion, MPTCP, ECN, TCP, 5G, Telco cloud, NFV, latency, cloud, datacenter
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-67241 (URN)10.1109/NOF.2018.8598129 (DOI)000458801700002 ()978-1-5386-8503-7 (ISBN)
Conference
9th International Conference on the Network of the Future (NOF)19-21 nov 2018
Projects
HITS
Available from: 2018-04-30 Created: 2018-04-30 Last updated: 2019-03-14Bibliographically approved
Nguyen, V.-G., Grinnemo, K.-J., Taheri, J. & Brunström, A. (2018). On Load Balancing for a Virtual and Distributed MME in the 5G Core. In: 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC): . Paper presented at 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC).
Open this publication in new window or tab >>On Load Balancing for a Virtual and Distributed MME in the 5G Core
2018 (English)In: 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 2018Conference paper (Refereed)
Abstract [en]

In this paper, we aim at tackling the scalability problem of the Mobility Management Entity (MME), which plays a crucial role of handling control plane traffic in the current 4G Evolved Packet Core as well as the next generation mobile core, 5G. One of the solutions to this problem is to virtualize the MME by applying Network Function Virtualization principles and then deploy it as a cluster of multiple virtual MME instances (vMMEs) with a front-end load balancer. Although several designs have been proposed, most of them assume the use of simple algorithms such as random and round-robin to balance the incoming traffic without any performance assessment. To this end, we implemented a weighted round robin algorithm which takes into account the heterogeneity of resources such as the capacity of vMMEs. We compare this algorithm with a random and a round-robin algorithm under two different system settings. Experimental results suggest that carefully selected load balancing algorithms can significantly reduce the control plane latency as compared to simple random or round-robin schemes.

Keywords
5G, MME, Load Balancing, Scalability, Open5GCore
National Category
Computer Sciences Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-67242 (URN)10.1109/PIMRC.2018.8580693 (DOI)000457761900011 ()978-1-5386-6010-2 (ISBN)978-1-5386-6009-6 (ISBN)
Conference
2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2018-04-30 Created: 2018-04-30 Last updated: 2019-02-21
Atxutegi, E., Liberal, F., Haile, H. K., Grinnemo, K.-J., Brunström, A. & Arvidsson, Å. (2018). On the use of TCP BBR in cellular networks. IEEE Communications Magazine (3), 172-179
Open this publication in new window or tab >>On the use of TCP BBR in cellular networks
Show others...
2018 (English)In: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, no 3, p. 172-179Article in journal (Refereed) Published
Abstract [en]

TCP BBR (Bottleneck Bandwidth and Round-trip propagation time) is a new TCP variant developed at Google, and which, as of this year, is fully deployed in Googles internal WANs and used by services such as Google.com and YouTube. In contrast to other commonly used TCP variants, TCP BBR is not loss-based but model-based: It builds a model of the network path between communicating nodes in terms of bottleneck bandwidth and minimum round-trip delay and tries to operate at the point where all available bandwidth is used and the round-trip delay is at minimum. Although, TCP BBR has indeed resulted in lower latency and a more efficient usage of bandwidth in fixed networks, its performance over cellular networks is less clear. This paper studies TCP BBR in live mobile networks and through emulations, and compares its performance with TCP NewReno and TCP CUBIC, two of the most commonly used TCP variants. The results from these studies suggest that in most cases TCP BBR outperforms both TCP NewReno and TCP CUBIC, however, not so when the available bandwidth is scarce. In these cases, TCP BBR provides longer file completion times than any of the other two studied TCP variants. Moreover, competing TCP BBR flows do not share the available bandwidth in a fair way, something which, for example, shows up when shorter TCP BBR flows struggle to get its fair share from longer ones. 

Place, publisher, year, edition, pages
New York, USA: Institute of Electrical and Electronics Engineers (IEEE), 2018
Keywords
tcp, bbr, cubic, newreno, 4g, lte, mobile, congestion control, Bandwidth, Mobile telecommunication systems, Wireless networks, Available bandwidth, Bottleneck bandwidth, Cellular network, Fixed networks, Model-based OPC, Network condition, Network paths, Round trip delay, Transmission control protocol
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-65339 (URN)10.1109/MCOM.2018.1700725 (DOI)2-s2.0-85044079664 (Scopus ID)
Projects
COST-IC1304
Funder
EU, Horizon 2020, IC1304
Available from: 2017-12-09 Created: 2017-12-09 Last updated: 2018-06-04Bibliographically approved
Mancuso, V., Alfredsson, S., Rajiullah, M., Brunström, A. & Hirsch, T. (2018). Results from running an experiment as a service platform for mobile broadband networks in Europe. Computer Communications
Open this publication in new window or tab >>Results from running an experiment as a service platform for mobile broadband networks in Europe
Show others...
2018 (English)In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703XArticle in journal (Refereed) Epub ahead of print
Abstract [en]

In this article we present a selection from a vast range of experiments run with MONROE, our open experiment as a service (EaaS) platform for measurements and experimentation in Mobile Broadband Networks. We show that the platform can be used to benchmark network performance in a repeatable and controlled manner thanks to the collection of a rich set of geotagged metadata and the execution of discretionary user experiments. Indeed, with the sheer amount of data collected from 12 commercial mobile operators across Europe, MONROE offers an unprecedented opportunity to monitor, analyze and ultimately improve the status of current and future mobile broadband networks. Besides, we show how flexibly the platform allows combining metadata and experimental data series during the experiments or by means of post-processing, and show results produced by our own experiments as well as comment on results obtained by external research groups and developers that have been granted access to our platform.

Place, publisher, year, edition, pages
Elsevier, 2018
Keywords
Mobile broadband, EaaS, Measurements, Network experimentation, Large testbed, Metadata, Performance analysis, Repeatability and reproducibility
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-69491 (URN)10.1016/j.comcom.2018.09.004 (DOI)000453619200010 ()
Available from: 2018-10-05 Created: 2018-10-05 Last updated: 2019-02-07Bibliographically approved
Nguyen, V.-G., Brunström, A., Grinnemo, K.-J. & Taheri, J. (2018). SDN helps velocity in Big Data (1ed.). In: Javid Taheri (Ed.), Big Data and Software Defined Networks: (pp. 207-228). London: The Institution of Engineering and Technology
Open this publication in new window or tab >>SDN helps velocity in Big Data
2018 (English)In: Big Data and Software Defined Networks / [ed] Javid Taheri, London: The Institution of Engineering and Technology , 2018, 1, p. 207-228Chapter in book (Refereed)
Abstract [en]

Currently, improving the performance of Big Data in general and velocity in particular is challenging due to the inefficiency of current network management, and the lack of coordination between the application layer and the network layer to achieve better scheduling decisions, which can improve the Big Data velocity performance. In this chapter, we discuss the role of recently emerged software defined networking (SDN) technology in helping the velocity dimension of Big Data. We start the chapter by providing a brief introduction of Big Data velocity and its characteristics and different modes of Big Data processing, followed by a brief explanation of how SDN can overcome the challenges of Big Data velocity. In the second part of the chapter, we describe in detail some proposed solutions which have applied SDN to improve Big Data performance in term of shortened processing time in different Big Data processing frameworks ranging from batch-oriented, MapReduce-based frameworks to real-time and stream-processing frameworks such as Spark and Storm. Finally, we conclude the chapter with a discussion of some open issues.

Place, publisher, year, edition, pages
London: The Institution of Engineering and Technology, 2018 Edition: 1
Keywords
Big Data; telecommunication scheduling; parallel processing; software defined networking
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-67213 (URN)10.1049/PBPC015E_ch10 (DOI)978-1-78561-304-3 (ISBN)978-1-78561-305-0 (ISBN)
Available from: 2018-04-27 Created: 2018-04-27 Last updated: 2018-06-25Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-7311-9334

Search in DiVA

Show all publications