Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 248) Show all publications
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
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)
Available from: 2018-10-05 Created: 2018-10-05 Last updated: 2018-10-18Bibliographically 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
Afzal, Z., Garcia, J., Lindskog, S. & Brunström, A. (2018). Slice Distance: An Insert-Only Levenshtein Distance with a Focus on Security Applications. In: Proceedings of NTMS 2018 Conference and Workshop: . Paper presented at 9th IFIP International Conference on New Technologies, Mobility and Security, 26-28 February 2018, Paris, France (pp. 1-5). New York: IEEE
Open this publication in new window or tab >>Slice Distance: An Insert-Only Levenshtein Distance with a Focus on Security Applications
2018 (English)In: Proceedings of NTMS 2018 Conference and Workshop, New York: IEEE, 2018, p. 1-5Conference paper, Published paper (Refereed)
Abstract [en]

Levenshtein distance is well known for its use in comparing two strings for similarity. However, the set of considered edit operations used when comparing can be reduced in a number of situations. In such cases, the application of the generic Levenshtein distance can result in degraded detection and computational performance. Other metrics in the literature enable limiting the considered edit operations to a smaller subset. However, the possibility where a difference can only result from deleted bytes is not yet explored. To this end, we propose an insert-only variation of the Levenshtein distance to enable comparison of two strings for the case in which differences occur only because of missing bytes. The proposed distance metric is named slice distance and is formally presented and its computational complexity is discussed. We also provide a discussion of the potential security applications of the slice distance.

Place, publisher, year, edition, pages
New York: IEEE, 2018
Keywords
Measurement, Pattern matching, Time complexity, Transforms, Security, DNA
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-67012 (URN)10.1109/NTMS.2018.8328718 (DOI)978-1-5386-3662-6 (ISBN)978-1-5386-3663-3 (ISBN)
Conference
9th IFIP International Conference on New Technologies, Mobility and Security, 26-28 February 2018, Paris, France
Funder
Knowledge Foundation, 4707
Available from: 2018-04-17 Created: 2018-04-17 Last updated: 2018-09-07Bibliographically approved
Atxutegi, E., Liberal, F., Grinnemo, K.-J., Brunström, A. & Arvidsson, Å. (2018). TCP Performance over Current Cellular Access: A Comprehensive Analysis. In: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms and Tools (pp. 371-400). Springer
Open this publication in new window or tab >>TCP Performance over Current Cellular Access: A Comprehensive Analysis
Show others...
2018 (English)In: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms and Tools, Springer, 2018, p. 371-400Chapter in book (Refereed)
Abstract [en]

Mobile internet usage has significantly raised over the last decade and it is expected to grow to almost 4 billion users by 2020. Even after the great effort dedicated to the improvement of the performance, there still exist unresolved questions and problems regarding the interaction between TCP and mobile broadband technologies such as LTE. This chapter collects the behavior of distinct TCP implementation under various network conditions in different LTE deployments including to which extent the performance of TCP is capable of adapting to the rapid variability of mobile networks under different network loads, with distinct flow types, during start-up phase and in mobile scenarios at different speeds. Loss-based algorithms tend to completely fill the queue, creating huge standing queues and inducing packet losses both under stillness and mobility circumstances. On the other side delay-based variants are capable of limiting the standing queue size and decreasing the amount of packets that are dropped in the eNodeB, but they are not able under some circumstances to reach the maximum capacity. Similarly, under mobility in which the radio conditions are more challenging for TCP, the loss-based TCP implementations offer better throughput and are able to better utilize available resources than the delay-based variants do. Finally, CUBIC under highly variable circumstances usually enters congestion avoidance phase prematurely, provoking a slower and longer start-up phase due to the use of Hybrid Slow-Start mechanism. Therefore, CUBIC is unable to efficiently utilize radio resources during shorter transmission sessions.

Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science
Keywords
TCP adaptability, LTE, flow size, Slow-Start, mobility
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-64631 (URN)10.1007/978-3-319-90415-3_14 (DOI)978-3-319-90414-6 (ISBN)
Projects
COST-IC1304
Funder
EU, Horizon 2020, IC1304
Available from: 2017-10-09 Created: 2017-10-09 Last updated: 2018-06-25Bibliographically approved
Oljira, D. B., Grinnemo, K.-J., Taheri, J. & Brunström, A. (2017). A Model for QoS-Aware VNF Placement and Provisioning. In: 2017 IEEE Conference On Network Function Virtualization And Software Defined Networks (Nfv-Sdn): (pp. 46-52). New York: IEEE
Open this publication in new window or tab >>A Model for QoS-Aware VNF Placement and Provisioning
2017 (English)In: 2017 IEEE Conference On Network Function Virtualization And Software Defined Networks (Nfv-Sdn), New York: IEEE, 2017, p. 46-52Chapter in book (Other academic)
Abstract [en]

Network Function Virtualization (NFV) is a promising solution for telecom operators and service providers to improve business agility, by enabling a fast deployment of new services, and by making it possible for them to cope with the increasing traffic volume and service demand. NFV enables virtualization of network functions that can be deployed as virtual machines on general purpose server hardware in cloud environments, effectively reducing deployment and operational costs. To benefit from the advantages of NFV, virtual network functions (VNFs) need to be provisioned with sufficient resources and perform without impacting network quality of service (QoS). To this end, this paper proposes a model for VNFs placement and provisioning optimization while guaranteeing the latency requirements of the service chains. Our goal is to optimize resource utilization in order to reduce cost satisfying the QoS such as end-to-end latency. We extend a related VNFs placement optimization with a fine-grained latency model including virtualization overhead. The model is evaluated with a simulated network and it provides placement solutions ensuring the required QoS guarantees.

Place, publisher, year, edition, pages
New York: IEEE, 2017
Series
2017 IEEE CONFERENCE ON NETWORK FUNCTION VIRTUALIZATION AND SOFTWARE DEFINED NETWORKS (NFV-SDN)
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-66885 (URN)000426936400007 ()978-1-5386-3285-7 (ISBN)
Available from: 2018-03-29 Created: 2018-03-29 Last updated: 2018-06-26Bibliographically approved
Hurtig, P., Alfredsson, S., Brunström, A., Evensen, K., Grinnemo, K.-J., Fosselie Hansen, A. & Rozensztrauch, T. (2017). A NEAT Approach to Mobile Communication. In: MobiArch ’17 Proceedings of the Workshop on Mobility in the Evolving Internet Architecture: . Paper presented at The ACM SIGCOMM 2017 Workshop on Mobility in the Evolving Internet Architecture (MobiArch 2017), Los Angeles, CA, USA, August 21-25, 2017 (pp. 7-12). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>A NEAT Approach to Mobile Communication
Show others...
2017 (English)In: MobiArch ’17 Proceedings of the Workshop on Mobility in the Evolving Internet Architecture, Association for Computing Machinery (ACM), 2017, p. 7-12Conference paper, Published paper (Refereed)
Abstract [en]

The demands for mobile communication is ever increasing. Mobile applications are increasing both in numbers and in heterogeneity of their requirements, and an increasingly diverse set of mobile technologies are employed. This creates an urgent need for optimizing end-to-end services based on application requirements, conditions in the network and available transport solutions; something which is very hard to achieve with today's Internet architecture. In this paper, we introduce the NEAT transport architecture as a solution to this problem. NEAT is designed to offer a flexible and evolvable transport system, where applications communicate their transport-service requirements to the NEAT system in a generic, transport-protocol independent way. The best transport option is then configured at run time based on application requirements, network conditions, and available transport options. Through a set of real life mobile use case experiments, we demonstrate how applications with different properties and requirements could employ the NEAT system in multi-access environments, showing significant performance benefits as a result.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2017
Keywords
NEAT, transport selection, heterogeneity, multiple paths, policies, TCP, MPTCP, cellular, WLAN, LTE, 3G
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-48467 (URN)10.1145/3097620.3097622 (DOI)978-1-4503-5059-4 (ISBN)
Conference
The ACM SIGCOMM 2017 Workshop on Mobility in the Evolving Internet Architecture (MobiArch 2017), Los Angeles, CA, USA, August 21-25, 2017
Projects
A New, Evolutive API and Transport-Layer Architecture for the Internet (NEAT)
Funder
EU, Horizon 2020, 644334
Available from: 2017-05-04 Created: 2017-05-04 Last updated: 2018-10-12Bibliographically approved
Santos, R., Bozakov, Z., Mangiante, S., Brunström, A. & Kassler, A. (2017). A NEAT framework for application-awareness in SDN environments. In: 2017 IFIP Networking Conference (IFIP Networking) and Workshops: . Paper presented at 16th International IFIP TC6 Networking Conference, Networking 2017, Stockholm, June 12-15, 2017. IEEE
Open this publication in new window or tab >>A NEAT framework for application-awareness in SDN environments
Show others...
2017 (English)In: 2017 IFIP Networking Conference (IFIP Networking) and Workshops, IEEE, 2017Conference paper, Published paper (Refereed)
Abstract [en]

Software-Defined Networking (SDN) has led to a paradigm shift in the way how networks are managed and operated. In SDN environments the data plane forwarding rules are managed by logically centralized controllers operating on global view of the network. Today, SDN controllers typically posses little insight about the requirements of the applications executed on the end-hosts. Consequently, they rely on heuristics to implement traffic engineering or QoS support. In this work, we propose a framework for application-awareness in SDN environments where the end-hosts provide a generic interface for the SDN controllers to interact with. As a result, SDN controllers may enhance the end-host’s view of the attached network and deploy policies into the edge of the network. Further, controllers may obtain information about the specific requirements of the deployed applications. Our demonstration extends the OpenDaylight SDN controller to enable it to interact with end-hosts running a novel networking stack called NEAT. We demonstrate a scenario in which the controller distributes policies and path information to manage bulk and low-latency flows. 

Place, publisher, year, edition, pages
IEEE, 2017
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-64539 (URN)10.23919/IFIPNetworking.2017.8264887 (DOI)000425452000064 ()978-3-901882-94-4 (ISBN)
Conference
16th International IFIP TC6 Networking Conference, Networking 2017, Stockholm, June 12-15, 2017
Projects
NEAT
Funder
EU, Horizon 2020
Note

Demo paper

Available from: 2017-10-13 Created: 2017-10-13 Last updated: 2018-09-05
Bozakov, Z., Mangiante, S., Hernandez Benet, C., Brunström, A., Santos, R., Kassler, A. & Buckley, D. (2017). A NEAT framework for enhanced end-host integration in SDN environments. In: 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN): . Paper presented at 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN). 6-8 Nov. 2017, Berlin, Germany. IEEE
Open this publication in new window or tab >>A NEAT framework for enhanced end-host integration in SDN environments
Show others...
2017 (English)In: 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, 2017Conference paper, Published paper (Refereed)
Abstract [en]

SDN aims to facilitate the management of increasingly complex, dynamic network environments and optimize the use of the resources available therein with minimal operator intervention. To this end, SDN controllers maintain a global view of the network topology and its state. However, the extraction of information about network flows and other network metrics remains a non-trivial challenge. Network applications exhibit a wide range of properties, posing diverse, often conflicting, demands towards the network. As these requirements are typically not known, controllers must rely on error-prone heuristics to extract them. In this work, we develop a framework which allows applications deployed in an SDN environment to explicitly express their requirements to the network. Conversely, it allows network controllers to deploy policies on end-hosts and to supply applications with information about network paths, salient servers and other relevant metrics. The proposed approach opens the door for fine grained, application-aware resource optimization strategies in SDNs

Place, publisher, year, edition, pages
IEEE, 2017
Keywords
computer network management, optimisation, quality of service, resource allocation, software defined networking, telecommunication traffic
National Category
Computer Sciences Computer Engineering Telecommunications Communication Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-65783 (URN)10.1109/NFV-SDN.2017.8169828 (DOI)978-1-5386-3285-7 (ISBN)
Conference
2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN). 6-8 Nov. 2017, Berlin, Germany
Available from: 2018-01-22 Created: 2018-01-22 Last updated: 2018-07-05Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-7311-9334

Search in DiVA

Show all publications