Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 57) Show all publications
Yedugundla, K., Hurtig, P. & Brunström, A. (2019). Handling Packet Losses in Cloud-Based Application Traffic. In: Proceedings of the 9th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER: . Paper presented at 9th International Conference on Cloud Computing and Services Science, CLOSER 2019 2-4 May, Heraklion, Greece (pp. 111-119). SciTePress
Open this publication in new window or tab >>Handling Packet Losses in Cloud-Based Application Traffic
2019 (English)In: Proceedings of the 9th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER, SciTePress, 2019, p. 111-119Conference paper, Published paper (Refereed)
Abstract [en]

Internet traffic is comprised of data flows from various applications with unique traffic characteristics. For many cloud applications, end-to-end latency is a primary factor affecting the perceived user experience. As packet losses cause delays in the communication they impact user experience, making efficient handling of packet losses an important function of transport layer protocols. Multipath TCP (MPTCP) is a modification to TCP that enables simultaneous use of several paths for a TCP flow. MPTCP is known to improve throughput. However, the performance of MPTCP is not optimal when handling certain loss scenarios. Efficient packet loss recovery is thus important to achieve desirable flow completion times for interactive cloud-based applications. In this paper we evaluate the performance of MPTCP in handling tail losses using traffic traces from various cloud-based applications. Tail losses, losses that occur at the end of a flow or traffic burst, are particularly challenging from a latency perspective as they are difficult to detect and recover in a timely manner. Tail losses in TCP are handled by using a tail loss probe (TLP) mechanism which was adapted to MPTCP from TCP. We investigate the performance of TLP in MPTCP, comparing the standard implementation to a recently proposed, less conservative approach. Our experimental results show that a less conservative implementation of TLP performs significantly better than the standard implementation in handling tail losses, reducing the average burst completion time of cloud based applications when tail loss occurs by up to 50% in certain cases.

Place, publisher, year, edition, pages
SciTePress, 2019
Keywords
Multipath TCP, Cloud Applications, Latency, Loss Recovery, Performance Evaluation, Measurements.
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-70749 (URN)10.5220/0007723801110119 (DOI)2-s2.0-85067484825 (Scopus ID)978-989-758-365-0 (ISBN)
Conference
9th International Conference on Cloud Computing and Services Science, CLOSER 2019 2-4 May, Heraklion, Greece
Available from: 2019-02-20 Created: 2019-02-20 Last updated: 2019-07-10Bibliographically approved
Ahlgren, B., Grinnemo, K.-J., Arahamsson, H., Brunström, A. & Hurtig, P. (2019). Latency-aware Multipath Scheduling inInformation-centric Networks. In: Proceedings of the Fifteenth Swedish National Computer Networking Workshop (SNCNW), Luleå, Sweden. 4-5 June 2019.: . Paper presented at The Fifteenth Swedish National Computer Networking Workshop (SNCNW), Luleå, Sweden. 4-5 June 2019..
Open this publication in new window or tab >>Latency-aware Multipath Scheduling inInformation-centric Networks
Show others...
2019 (English)In: Proceedings of the Fifteenth Swedish National Computer Networking Workshop (SNCNW), Luleå, Sweden. 4-5 June 2019., 2019Conference paper, Published paper (Refereed)
Abstract [en]

We present the latency-aware multipath schedulerZQTRTT that takes advantage of the multipath opportunities ininformation-centric networking. The goal of the scheduler is touse the (single) lowest latency path for transaction-oriented flows,and use multiple paths for bulk data flows. A new estimatorcalled zero queue time ratio is used for scheduling over multiplepaths. The objective is to distribute the flow over the paths sothat the zero queue time ratio is equal on the paths, that is,so that each path is ‘pushed’ equally hard by the flow withoutcreating unwanted queueing. We make an initial evaluation usingsimulation that shows that the scheduler meets our objectives.

National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-72439 (URN)
Conference
The Fifteenth Swedish National Computer Networking Workshop (SNCNW), Luleå, Sweden. 4-5 June 2019.
Projects
READY, 4545
Funder
Knowledge Foundation
Available from: 2019-06-12 Created: 2019-06-12 Last updated: 2019-06-24Bibliographically approved
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
Haile, H. K., Hurtig, P., Grinnemo, K.-J. & Brunström, A. (2019). Rate Change Detection in Stationary Cellular Nodes. In: Proceedings of the Fifteenth Swedish National Computer NetworkingWorkshop (SNCNW), Luleå, Sweden. 4-5 June: . Paper presented at The Fifteenth Swedish National Computer NetworkingWorkshop (SNCNW), Luleå, Sweden. 4-5 June.
Open this publication in new window or tab >>Rate Change Detection in Stationary Cellular Nodes
2019 (English)In: Proceedings of the Fifteenth Swedish National Computer NetworkingWorkshop (SNCNW), Luleå, Sweden. 4-5 June, 2019Conference paper, Published paper (Refereed)
Abstract [en]

An increasing number of cellular congestion controlalgorithms (CCAs) are relying on measurements of the deliveryrate observed at the receiver. Accordingly, early detection ofchanges in the receiver’s rate would improve the performanceof such algorithms. Rate measurements over short time intervalscould allow fast detection of change in the rate observed bythe upper layers of a cellular receiver. However, upper layerrate measurements for cellular receivers over a short time scaleproduce unreliable results due to the effect of underlying lowerlayer mechanisms. In this paper, we introduce a rate estimationapproach that reduces the variability observed in short timescale receiver rate measurements and allows faster rate changedetection.

Keywords
Cellular, rate, estimation, Kalman
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-72438 (URN)
Conference
The Fifteenth Swedish National Computer NetworkingWorkshop (SNCNW), Luleå, Sweden. 4-5 June
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2019-06-12 Created: 2019-06-12 Last updated: 2019-06-24Bibliographically approved
Haile, H. K., Hurtig, P. & Grinnemo, K.-J. (2019). Rate Measurement Over Short Time Scales inStationary Cellular Receivers. In: Proceedings of the 3rd Workshop on Mobile Network Measurement (MNM 2019), Paris, France, June 2019: . Paper presented at The 3rd Workshop on Mobile Network Measurement (MNM 2019), Paris, France, June 2019.
Open this publication in new window or tab >>Rate Measurement Over Short Time Scales inStationary Cellular Receivers
2019 (English)In: Proceedings of the 3rd Workshop on Mobile Network Measurement (MNM 2019), Paris, France, June 2019, 2019Conference paper, Published paper (Refereed)
Abstract [en]

An increasing number of cellular congestion controlalgorithms (CCAs) are relying on measurements of the deliveryrate observed at the receiver. Accordingly, early detection ofchanges in the receiver’s rate would improve the performanceof such algorithms. Rate measurements over short time intervalscould allow fast detection of change in the rate observed bythe upper layers of a cellular receiver. However, for cellularreceivers, upper-layer rate measurements over short time scalesproduce unreliable results due to the effect of underlying lowerlayer mechanisms such as scheduling and retransmissions. In thispaper, we introduce a rate estimation approach that reduces thevariability observed in short time scale receiver rate measurementsand allows faster rate change detection. We also integratean adaptive mechanism to improve online measurements overdifferent time scales.

Keywords
Cellular, Rate, Estimation, Kalman, Filter
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-73005 (URN)
Conference
The 3rd Workshop on Mobile Network Measurement (MNM 2019), Paris, France, June 2019
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2019-06-25 Created: 2019-06-25 Last updated: 2019-07-08Bibliographically approved
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
Hurtig, P., Haile, H. K., Grinnemo, K.-J., Brunström, A., Atxutegi, E., Liberal, F. & Arvidsson, Å. (2018). Impact of TCP BBR on CUBIC Traffic: A mixed workload evaluation. In: Proceedings of the 30th International Teletraffic Congress, ITC 2018: . Paper presented at 30th International Teletraffic Congress, ITC 2018, 4 September 2018 through 7 September 2018 (pp. 218-226). IEEE
Open this publication in new window or tab >>Impact of TCP BBR on CUBIC Traffic: A mixed workload evaluation
Show others...
2018 (English)In: Proceedings of the 30th International Teletraffic Congress, ITC 2018, IEEE, 2018, p. 218-226Conference paper, Published paper (Refereed)
Abstract [en]

A recently proposed congestion control algorithm (CCA) called BBR (Bottleneck Bandwidth and Round-trip propagation time) has shown a lot of promise in avoiding some of the problems that have plagued loss-based CCAs. Nevertheless, deployment of a new alternative algorithm requires a thorough evaluation of the effect of the proposed alternative on established transport protocols like TCP CUBIC. Furthermore, evaluations that consider the heterogeneity of Internet traffic sizes would provide a useful insight into the deployability of an algorithm that introduces sweeping changes across multiple algorithm components. Yet, most evaluations of BBR's impact and competitive fairness have focused on the steady-state performance of large flows. This work expands on previous studies of BBR by evaluating BBR's impact when the traffic consists of flows of different sizes. Our experiments show that under certain circumstances BBR's startup phase can result in a significant reduction of the throughput of competing large CUBIC flows and the utilization of the bottleneck link. In addition, the steady-state operation of BBR can have negative impact on the performance of bursty flows using loss-based CCAs over bottlenecks with buffer sizes as high as two times the bandwidth-delay product. 

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
BBR, Congestion Control, CUBIC, Startup, Steady state, TCP, Bandwidth, Congestion control (communication), Reactor startup, Traffic congestion, Alternative algorithms, Bandwidth delay product, Bottleneck bandwidth, Steady state performance, Steady-state operation, Workload evaluation, Transmission control protocol
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-70575 (URN)10.1109/ITC30.2018.00040 (DOI)2-s2.0-85057239137 (Scopus ID)9780988304550 (ISBN)
Conference
30th International Teletraffic Congress, ITC 2018, 4 September 2018 through 7 September 2018
Available from: 2018-12-20 Created: 2018-12-20 Last updated: 2019-06-13Bibliographically 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-11-15Bibliographically approved
Weinrank, F., Grinnemo, K.-J., Bozakov, Z., Brunström, A., Dreibholz, T., Fairhurst, G., . . . Tüxen, M. (2017). A NEAT Way to Browse the Web. In: Applied Networking Research Workshop (ANRW) 2017, Prague, Czech Republic, July 15, 2017.: . Paper presented at Applied Networking Research Workshop (ANRW) 2017. Thomas Dreibholz
Open this publication in new window or tab >>A NEAT Way to Browse the Web
Show others...
2017 (English)In: Applied Networking Research Workshop (ANRW) 2017, Prague, Czech Republic, July 15, 2017., Thomas Dreibholz , 2017Conference paper, Published paper (Refereed)
Abstract [en]

There is a growing concern that the Internet transport layer has become ossified in the face of emerging novel applications, and that further evolution has become very difficult. The NEAT system is a novel and evolvable transport system that decouples applications from the underlying transport layer and network services. In so doing, it facilitates dynamic transport selection. This demo shows how the NEAT system is able to dynamically select the most appropriate transport solution for the Mozilla Firefox web browser.

Place, publisher, year, edition, pages
Thomas Dreibholz, 2017
Keywords
NEAT, ossification, transport selection, transport service, SCTP, TCP
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-55398 (URN)10.1145/3106328.3106335 (DOI)
Conference
Applied Networking Research Workshop (ANRW) 2017
Projects
A New, Evolutive API and Transport-Layer Architecture for the Internet (NEAT)
Funder
EU, Horizon 2020, 644334
Available from: 2017-06-26 Created: 2017-06-26 Last updated: 2019-06-17Bibliographically approved
Ahlgren, B., Hurtig, P., Abrahamsson, H., Grinnemo, K.-J. & Brunström, A. (2017). Are MIRCC and Rate-based Congestion Control in ICN READY for Variable Link Capacity?. In: : . Paper presented at The 13th Swedish National Computer Networking Workshop (SNCNW 2017), Halmstad University, May 29-30. Halmstad: Högskolan i Halmstad
Open this publication in new window or tab >>Are MIRCC and Rate-based Congestion Control in ICN READY for Variable Link Capacity?
Show others...
2017 (English)Conference paper (Other academic)
Abstract [en]

Information-centric networking (ICN) has been introduced as a potential future networking architecture. ICN promises an architecture that makes information independent from lo- cation, application, storage, and transportation. Still, it is not without challenges. Notably, there are several outstanding issues regarding congestion control: Since ICN is more or less oblivious to the location of information, it opens up for a single application flow to have several sources, something which blurs the notion of transport flows, and makes it very difficult to employ traditional end-to-end congestion control schemes in these networks. Instead, ICN networks often make use of hop-by-hop congestion control schemes. How- ever, these schemes are also tainted with problems, e.g., several of the proposed ICN congestion controls assume fixed link capacities that are known beforehand. Since this seldom is the case, this paper evaluates the consequences in terms of latency, throughput, and link usage, variable link capacities have on a hop-by-hop congestion control scheme, such as the one employed by the Multipath-aware ICN Rate-based Congestion Control (MIRCC). The evaluation was carried out in the OMNeT++ simulator, and demonstrates how seemingly small variations in link capacity significantly deterio- rate both latency and throughput, and often result in inefficient network link usage. 

Place, publisher, year, edition, pages
Halmstad: Högskolan i Halmstad, 2017
Keywords
ICN, congestion control, hop-by-hop, MIRCC, link capacity
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-48539 (URN)
Conference
The 13th Swedish National Computer Networking Workshop (SNCNW 2017), Halmstad University, May 29-30
Projects
Research Environment for Advancing Low Latency Internet (READY)
Funder
Knowledge Foundation
Available from: 2017-05-10 Created: 2017-05-10 Last updated: 2018-06-04Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-8731-2482

Search in DiVA

Show all publications