Endre søk
Begrens søket
123 1 - 50 of 114
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Abbas, Muhammad Tahir
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Eklund, Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Impact of Tunable Parameters in NB-IoT Stack onthe Energy Consumption2019Inngår i: Proceedings of Fifteenth Swedish National Computer Networking Workshop (SNCNW), 2019Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper studies the impact of tunable parametersin the NB-IoT stack on the energy consumption of a user equipment(UE), e.g., a wireless sensor. NB-IoT is designed to enablemassive machine-type communications for UE while providing abattery lifetime of up to 10 years. To save battery power, most oftime the UE is in dormant state and unreachable. Still, duringthe CONNECTED and IDLE state, correct tuning of criticalparameters, like Discontinuous reception (DRX), and extendedDiscontinuous reception (eDRX), respectively, are essential to savebattery power. Moreover, the DRX and eDRX actions relate tovarious parameters which are needed to be tuned in order toachieve a required UE battery lifetime. The objective of thispaper is to observe the influence of an appropriate tuning ofthese parameters to reduce the risk of an early battery drainage

  • 2.
    Ahlgren, Bengt
    et al.
    RISE SICS.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Arahamsson, Henrik
    RISE SICS.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Hurtig, Per
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Latency-aware Multipath Scheduling inInformation-centric Networks2019Inngår i: Proceedings of the Fifteenth Swedish National Computer Networking Workshop (SNCNW), Luleå, Sweden. 4-5 June 2019., 2019Konferansepaper (Fagfellevurdert)
    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.

  • 3.
    Ahlgren, Bengt
    et al.
    RISE SICS.
    Hurtig, Per
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Abrahamsson, Henrik
    RISE SICS.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Are MIRCC and Rate-based Congestion Control in ICN READY for Variable Link Capacity?2017Konferansepaper (Annet vitenskapelig)
    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. 

  • 4.
    Ahlgren, Bengt
    et al.
    RISE SICS.
    Hurtig, Per
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Abrahamsson, Henrik
    RISE SICS.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    ICN Congestion Control for Wireless Links2018Inngår i: IEEE WCNC 2018 Conference Proceedings / [ed] IEEE, New York: IEEE, 2018Konferansepaper (Fagfellevurdert)
    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. 

  • 5.
    Alay, Özgü
    et al.
    Simula Research Laboratory, Norway.
    Lutu, Andra
    Simula Research Laboratory, Norway.
    García, Rafael
    IMDEA Networks Institute, Spain.
    Peón Quirós, Miguel
    IMDEA Networks Institute, Spain.
    Mancuso, Vincenzo
    IMDEA Networks Institute, Spain.
    Hirsch, Thomas
    Celerway AS, Norway.
    Dely, Tobias
    Celerway AS, Norway.
    Werme, Jonas
    Celerway AS, Norway.
    Evensen, Kristian
    Celerway AS, Norway.
    Hansen, Audun
    Celerway AS, Norway.
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Karlsson, Jonas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Safari Khatouni, Ali
    Politecnico di Torino.
    Mellia, Marco
    Politecnico di Torino.
    Ajmone Marsan, Marco
    Politecnico di Torino.
    Monno, Roberto
    Nextworks, Italy.
    Lønsethagen, Håkon
    Telenor R&D, Norway.
    MONROE, a distributed platform to measure and assess mobile broadband networks: demo2016Inngår i: Proceedings of the Tenth ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation, and Characterization, New York, NY, USA: Association for Computing Machinery (ACM), 2016, s. 85-86Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This demo presents the MONROE distributed platform and how it can be used to implement measurement and assessment experiments with operational mobile broadband networks (MBBs). MONROE provides registered experimenters with open access to hundreds of nodes, distributed over several European countries and equipped with multiple MBB connections, and a backend system that collects the measurement results. Experiments are scheduled through a user-friendly web client, with no need to directly access the nodes. The platform further embeds tools for real-time traffic flow analysis and a powerful visualization tool.

  • 6.
    Alay, Özgü
    et al.
    Simula Research Laboratory, Norway.
    Lutu, Andra
    Simula Research Laboratory, Norway.
    Rafael, García
    IMDEA Networks Institute, Spain.
    Peón Quirós, Miguel
    IMDEA Networks Institute, Spain.
    Mancuso, Vincenzo
    IMDEA Networks Institute, Spain.
    Hirsch, Thomas
    Celerway AS, Norway.
    Tobias, Dély
    Celerway AS, Norway.
    Werme, Jonas
    Celerway AS, Norway.
    Evensen, Kristian
    Celerway AS, Norway.
    Fosselie Hansen, Audun
    Celerway AS, Norway.
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Karlsson, Jonas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Safari Khatouni, Ali
    Politecnico di Torino, Italy.
    Mellia, Marco
    Politecnico di Torino, Italy.
    Ajmone Marsan, Marco
    Politecnico di Torino & IMDEA Networks, Italy.
    Monno, Roberto
    Nextworks, Italy.
    Lønsethagen, Håkon
    Telenor R&D, Norway.
    Measuring and Assessing Mobile Broadband Networks with MONROE2016Inngår i: 2016 IEEE International Symposium on a World of Wireless, Mobile, and Multimedia Networks (WoWMoM), Red Hook: IEEE conference proceedings, 2016Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Mobile broadband (MBB) networks underpin numerous vital operations of the society and are arguably becoming the most important piece of the communications infrastructure. In this demo paper, our goal is to showcase the potential of a novel multi-homed MBB platform for measuring, monitoring and assessing the performance of MBB services in an objective manner. Our platform, MONROE, is composed of hundreds of nodes scattered over four European countries and a backend system that collects the measurement results. Through a user-friendly web client, the experimenters can schedule and deploy their experiments. The platform further embeds traffic analysis tools for real-time traffic flow analysis and a powerful visualization tool.

  • 7.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    SDN Enhanced Ethernet VPN for Data Center Interconnect2017Inngår i: 2017 IEEE 6th International Conference on Cloud Networking (CloudNet) / [ed] Maga, D, IEEE, 2017, s. 77-82Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Ethernet Virtual Private Network (EVPN) is an emerging technology that addresses the networking challenges presented by geo-distributed Data Centers (DCs). One of the major advantages of EVPN over legacy layer 2 VPN solutions is providing All-Active (A-A) mode of operation so that the traffic can truly be multi-homed on Provider Edge (PE) routers. However, A-A mode of operation introduces new challenges. In the case where the Customer Edge (CE) router is multi-homed to one or more PE routers, it is necessary that only one of the PE routers should forward Broadcast, Unknown unicast, and Multicast (BUM) traffic into the DC. The PE router that assumes the primary role for forwarding BUM traffic to the CE device is called the Designated Forwarder (DF). The proposed solution to select the DF in the EVPN standard is based on a distributed algorithm which has a number of drawbacks such as unfairness and intermittent behavior. In this paper, we introduce a Software-Defined Networking (SDN) based architecture for EVPN support, where the SDN controller interacts with EVPN control plane. We demonstrate how our solution mitigates existing problems for DF selection which leads to improved EVPN performance.

  • 8.
    Arvidsson, Åke
    et al.
    Kristianstad University, Kristianstad, Sweden..
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Chen, Eric
    Kristianstad University, Kristianstad, Sweden..
    Qinghua, Wang
    Kristianstad University, Kristianstad, Sweden..
    Brunström, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Web Metrics for the Next Generation PerformanceEnhancing ProxiesA°2019Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The fast growth of Internet traffic, the growingimportance of cellular accesses and the escalating competitionbetween content providers and network operators result in agrowing interest in improving network performance and userexperience. In terms of network transport, different solutionsranging from tuning TCP to installing middleboxes are applied.It turns out, however, that the practical results sometimes aredisappointing and we believe that poor testing is one of thereasons for this. Indeed, many cases in the literature limittesting to the simple and rare use case of a single file download,while common and complex use cases like web browsing oftenare ignored or modelled only by considering smaller files. Tofacilitate better testing, we present a set of metrics by whichthe complexity around web pages can be characterised andthe potential for different optimisations can be estimated. Wealso derive numerical values of these metrics for a small set ofpopular web pages and study similarities and differences betweenpages with the same kind of content (newspapers, e-commerceand video) and between pages designed for the same platform(computer and smartphone).

  • 9.
    Asplund, Katarina
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Brunstrom, Anna
    Karlstads universitet, Institutionen för informationsteknologi.
    Garcia, Johan
    Karlstads universitet, Institutionen för informationsteknologi.
    Schneyer, Sean
    Karlstads universitet, Institutionen för informationsteknologi.
    Grinnemo, Karl-Johan
    Karlstads universitet, Institutionen för informationsteknologi.
    PRTP: A Partially Reliable Transport Protocol for Multimedia Applications: Background, Information and Analysis1999Rapport (Annet vitenskapelig)
  • 10.
    Atxutegi, Eneko
    et al.
    University of the Basque Country, Spain.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Izurza, Andoni
    University of the Basque Country, Spain.
    Arvidsson, Åke
    Kristianstad University, Sweden.
    Liberal, Fidel
    University of the Basque Country, Spain.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    On the move with TCP in current and future mobile networks2017Inngår i: Proceedings of the 2017 8th International Conference on the Network of the Future (NOF). / [ed] T. Mahmoodi, S. Secci, A. Cianfrani, F. Idzikowski, New York, USA: IEEE, 2017, s. 66-72Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Mobile wireless networks constitute an indispensable part of the global Internet, and with TCP the dominating transport protocol on the Internet, it is vital that TCP works equally well over these networks as over wired ones. This paper identifies the performance dependencies by analyzing the responsiveness of TCP NewReno and TCP CUBIC when subject to bandwidth variations related to movements in different directions. The presented evaluation complements previous studies on 4G mobile networks in two important ways: It primarily focuses on the behavior of the TCP congestion control in medium- to high-velocity mobility scenarios, and it not only considers the current 4G mobile networks, but also low latency configurations that move towards the overall potential delays in 5G networks. The paper suggests that while both CUBIC and NewReno give similar goodput in scenarios where the radio channel continuously degrades, CUBIC gives a significantly better goodput in scenarios where the radio channel quality continuously increases. This is due to CUBIC probing more aggressively for additional bandwidth. Important for the design of 5G networks, the obtained results also demonstrate that very low latencies are capable of equalizing the goodput performance of different congestion control algorithms. Only in low latency scenarios that combine both large fluctuations of available bandwidths and a mobility pattern in which the radio channel quality continuously increases can some performance differences be noticed.

  • 11.
    Atxutegi, Eneko
    et al.
    University of the Basque Country.
    Liberal, Fidel
    University of the Basque Country.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Arvidsson, Åke
    Kristianstad University.
    TCP Performance over Current Cellular Access: A Comprehensive Analysis2018Inngår i: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms and Tools, Springer, 2018, s. 371-400Kapittel i bok, del av antologi (Fagfellevurdert)
    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.

  • 12.
    Atxutegi, Eneko
    et al.
    University of the Basque Country.
    Liberal, Fidel
    University of the Basque Country.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Arvidsson, Åke
    Kristianstad University.
    Robert, Remi
    Ericsson AB.
    TCP behaviour in LTE: impact of flow start-up and mobility2016Inngår i: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP, IEEE, 2016, s. 73-80Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Nowadays, more than two billion people uses the mobile internet, and it is expected to rise to almost 4 billion by 2020. Still, there is a gap in the understanding of how TCP and its many variants work over LTE. To this end, this paper evaluates the extent to which five common TCP variants, CUBIC, NewReno, Westwood+, Illinois, and CAIA Delay Gradient (CDG), are able to utilise available radio resources under hard conditions, such as during start-up and in mobile scenarios at different speeds. The paper suggests that CUBIC, due to its Hybrid Slow- Start mechanism, enters congestion avoidance prematurely, and thus experiences a prolonged start-up phase, and is unable to efficiently utilise radio resources during shorter transmission sessions. Still, CUBIC, Illinois and NewReno, i.e., the loss-based TCP implementations, offer better throughput, and are able to better utilise available resources during mobility than Westwood+ and CDG – the delay-based variants do. 

  • 13.
    Atxutegi, Eneko
    et al.
    University of the Basque Country, Spain.
    Liberal, Fidel
    University of the Basque Country, Spain.
    Haile, Habtegebreil Kassaye
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Arvidsson, Åke
    Kristianstad University, Sweden.
    On the use of TCP BBR in cellular networks2018Inngår i: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, nr 3, s. 172-179Artikkel i tidsskrift (Fagfellevurdert)
    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. 

  • 14.
    Beckman, Claes
    et al.
    KTH, Center for Wireless Systems.
    Garcia, Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    On the Impact of Velocity on the Train-to-Earth MIMO Propagation Channel: Statistical Observations and Qualitative Analysis2017Inngår i: 2017 IEEE International Symposium on Antennas and Propagation & USNC/URSI National Radio Science Meeting, IEEE, 2017, s. 1865-1866Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We provide measured data collected from 97 trains completing over 7000 journeys in Sweden showing that the throughput over LTE is impacted by train velocity. In order to explain these observations we assume that the underlying causes can be found in the implementation of the MIMO system into LTE Rel. 8 and the diffuse scattering of signals from ground reflections.

  • 15.
    Bergman, Andreas
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Pieskä, Marcus
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Westlinder, Simon
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Rust, Josefine
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Socket Intents Extended for SCTP: Extended Version of Socket Intents to Use the Transport Protocol SCTP2016Rapport (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    This report covers a project in the course Computer Engineering Project, DVAE08, at Karlstad University. The aim of the project was to modify an already existing solution for selecting the most fitting path for known traffic online, with a proactive approach instead of a reactive, called Socket Intents. The purpose of the modified version is to make the previous solution compatible with the transport protocol SCTP. This solution consists of three new implemented components; a header parser, a sniffer, and a query manager. The header parser and sniffer receive packets from the traffic and send them to one another. The query manager handles queries from the policies to the sniffer, as well as the response. Together, these components will gather information about the state of the network, and select the most fitting path that fulfill application needs. The results achieved from the modification are good work for the SCTP one-to-one type. 

  • 16.
    Bozakov, Zdravko
    et al.
    Dell EMC.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Damjanovic, Dragana
    Mozilla.
    Riktor Evensen, Kristian
    Celerway.
    Fairhurst, Gorry
    University of Aberdeen, UK..
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Jones, Tom
    University of Aberdeen, UK..
    Mangiante, Simone
    Dell EMC.
    Papastergiou, Giorgos
    Simula.
    Ros, David
    Simula.
    Tüxen, Michael
    FH Münster, Germany.
    Welzl, Michael
    University of Oslo, Norway.
    Deliverable D2.1 - First Version of Low-Level Core Transport System2016Rapport (Fagfellevurdert)
    Abstract [en]

    This document presents the first version of the low-level Core Transport System in NEAT, to be used for development of a reference implementation of the NEAT System. The design of this core transport system takes into consideration the Transport Services and the API defined in Task 1.3 and in close coordination with the overall architecture (Task 1.2). To realise the basic Transport Services provided by the API, a set of low-level transport functionalities has to be provided by the NEAT core transport system. These functionalities take the formof several building blocks, or NEAT Components, each representing an associated implementation activity. Some of the components are needed to ensure the basic operation of the NEAT System—e.g., a NEAT Flow Endpoint, a callback-based NEAT API Framework, the NEAT Logic and the functionality to Connect to a name. Some other components are needed to ensure connectivity usingMiddlebox Traversal techniques (e.g., TURN), discovery of path support for different transport protocols using Happy Eyeballs mechanisms, offering end-to end Security (e.g., (D)TLS over transport), gather statistics for the users or system administrators, and the ability to apply different policies in order to influence the decision-making process of the transport system. This document describes each of these building blocks and related design choices.

  • 17.
    Bozakov, Zdravko
    et al.
    Dell EMC, Ireland.
    Mangiante, Simone
    Dell EMC, Ireland.
    Hernandez Benet, Cristian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013). Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Santos, Ricardo
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Buckley, Donagh
    Dell EMC, Ireland.
    A NEAT framework for enhanced end-host integration in SDN environments2017Inngår i: 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, 2017Konferansepaper (Fagfellevurdert)
    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

  • 18.
    Budzisz, Lukasz
    et al.
    Signal Theory and Communication Dept., Universitat Politechnìca de Catalunya.
    Ferrus, Ramon
    Signal Theory and Communication Dept., Universitat Politechnìca de Catalunya.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    An Analytical Estimation of the Failover Time in SCTP Multihoming Scenarios2007Inngår i: IEEE Wireless Communications and Networking Conference, IEEE , 2007, s. 3929-3934Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The motivation behind this paper is a need to have a more accurate estimation of the failover time in SCTP. The traditional one, commonly used in the literature, is based on the sum of the consecutive retransmission timeouts. This is not always appropriate, especially when using the SCTP multihoming feature as a basis for achieving transport layer mobility in wireless networking scenarios, where the transition time between available paths becomes a key aspect for the optimisation. Two new factors are introduced into the proposed estimation formula to reflect the influence of the network parameters and the behaviour of the most common protocol implementations. For the proposed model, we perform a best-worst case analysis, and then illustrate it with an example of a detailed estimation. Finally, we perform simulations comparing our proposal with the traditional estimation in a typical transport layer mobility scenario including long thin networks.

  • 19.
    Budzisz, Lukasz
    et al.
    Department of Signal Theory and Communications (TSC), Universitat Politecnica de Catalunya.
    Ferrús, Ramon
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Fracchia, Roberta
    Motorola Labs – Paris, France.
    Galante, Giulio
    Istituto Superiore Mario Boella.
    Casadewall, Ferran
    Department of Signal Theory and Communications (TSC), Universitat Politecnica de Catalunya.
    Towards transport-layer mobility: Evolution of SCTP multihoming2008Inngår i: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 31, nr 5, s. 980-998Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Recently, growing availability of emerging wireless technologies has pushed the demand to integrate different wireless-network technologies such as: wireless local-area networks, cellular networks, and personal and short-range networks. The inter-working of heterogeneous radio access networks poses many technical challenges, with mobility management being one of the most important. In this paper we survey the existing proposals and show that transport-layer mobility is a viable candidate for implementing seamless handover in heterogeneous wireless access networks. Since the mobile Stream Control Transmission Protocol (mSCTP) is at the core of most relevant transport-layer mobility schemes being currently studied, we identify the key scenarios where the protocol can effectively leverage the multihoming feature to enhance handover support. Moreover, to provide the reader with a complete overview of the mSCTP's application area, we also survey the situations where the use of mSCTP-based schemes is not possible or has some limitations. Then, in one of the identified key scenarios, we investigate several challenging open issues related to path management and path-transition optimization by considering bandwidth-estimation schemes and link-layer support. Finally, we consider introducing concurrent multipath transfer (CMT) into mSCTP-based mobility schemes, as a future research direction.

  • 20.
    Budzisz, Łukasz
    et al.
    Technische Universität Berlin, Berlin, Germany.
    Garcia, Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Ferrús, Ramon
    Universitat Politècnica de Catalunya, Barcelona, Spain.
    A taxonomy and survey of SCTP research2012Inngår i: ACM Computing Surveys, ISSN 0360-0300, E-ISSN 1557-7341, Vol. 44, nr 4, s. -36, artikkel-id 18Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The Stream Control Transmission Protocol (SCTP) is a relatively recent general-purpose transport layer protocol for IP networks that has been introduced as a complement to the well-established TCP and UDP transport protocols. Although initially conceived for the transport of PSTN signaling messages over IP networks, the introduction of key features in SCTP, such as multihoming and multistreaming, has spurred considerable research interest surrounding SCTP and its applicability to different networking scenarios. This article aims to provide a detailed survey of one of these new features—multihoming—which, as it is shown, is the subject of evaluation in more than half of all published SCTP-related articles. To this end, the article first summarizes and organizes SCTP-related research conducted so far by developing a four-dimensional taxonomy reflecting the (1) protocol feature examined, (2) application area, (3) network environment, and (4) study approach. Over 430 SCTP-related publications have been analyzed and classified according to the proposed taxonomy. As a result, a clear perspective on this research area in the decade since the first protocol standardization in 2000 is given, covering both current and future research trends. On continuation, a detailed survey of the SCTP multihoming feature is provided, examining possible applications of multihoming, such as robustness, handover support, and loadsharing.

  • 21.
    Cardellini, Valeria
    et al.
    University of Rome Tor Vergata, Rome, Italy.
    Galinac Grbac, Tihana
    Facylty of Engineering, University or Rijeka, Rijeka, Croatia .
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kathiravelu, Pradeeban
    INESC-ID Lisboa, Instituto Superior Técnico, Universidade de Lisboa, Portugal.
    Lo Presti, Francesco
    University or Rome tor Vergata, Rome, Italy.
    Marotta, Antonio
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Nardelli, Matteo
    University of Rome Tor Vergata, Rome, Italy.
    Luís, Veiga
    INESC-ID Lisboa/Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal.
    Integrating SDN and NFV with QoS-Aware Service Composition Cardellini2018Inngår i: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms, and Tools / [ed] Ivan Ganchev, Robert D. van der Mei and J.L. van den Berg, Cham, Switzerland: Springer, 2018, 1, s. 212-240Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    Traditional networks are transformed to enable full integrationof heterogeneous hardware and software functions, that are configuredat runtime, with minimal time to market, and are provided to theirend users on “as a service” principle. Therefore, a countless number ofpossibilities for further innovation and exploitation opens up. NetworkFunction Virtualization (NFV) and Software-Defined Networking (SDN)are two key enablers for such a new flexible, scalable, and service-orientednetwork architecture. This chapter provides an overview of QoS-awarestrategies that can be used over the levels of the network abstractionaiming to fully exploit the new network opportunities. Specifically, wepresent three use cases of integrating SDN and NFV with QoS-awareservice composition, ranging from the energy efficient placement of virtualnetwork functions inside modern data centers, to the deployment ofdata stream processing applications using SDN to control the networkpaths, to exploiting SDN for context-aware service compositions.

  • 22.
    Cheng, Jun
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Telco Distributed DC with Transport Protocol Enhancement for 5G Mobile Networks: A Survey2017Rapport (Annet vitenskapelig)
    Abstract [en]

    Distributed data center hosts telco virtual network functions, mixing workloads that require data transport through transport protocols with either low end-to-end latency or large bandwidth for high throughput, e.g., from tough requirements in 5G use cases. A trend is the use relatively inexpensive, off-the-shelf switches in data center networks, where the dominated transport traffic is TCP traffic. Today’s TCP protocol will not be able to meet such requirements. The transport protocol evolution is driven by transport performance (latency and throughput) and robust enhancements in data centers, which include new transport protocols and protocol extensions such as DCTCP, MPTCP and QUIC protocols and lead to intensive standardization works and contributions to 3GPP and IETF.

    By implementing ECN based congestion control instead of the packet-loss based TCP AIMD congestion control algorithm, DCTCP not only solves the latency issue in TCP congestion control caused by the switch buffer bloating but also achieves an improved performance on the packet loss and throughput. The DCTCP can also co-exist with normal TCP by applying a modern coupled queue management algorithm in the switches of DC networks, which fulfills IETF L4S architecture. MPTCP is an extension to TCP, which can be implemented in DC’s Fat tree architecture to improve transport throughput and shorten the latency by mitigating the bandwidth issue caused by TCP connection collision within the data center. The QUIC is a reliable and multiplexed transport protocol over UDP transport, which includes many of the latest transport improvements and innovation, which can be used to improve the transport performance on streaming media delivery.

    The Clos topology is a commonly used network topology in a distributed data center. In the Clos architecture, an over-provisioned fabric cannot handle full wire-speed traffic, thus there is a need to have a mechanism to handle overload situations, e.g., by scaling out the fabric. However, this will introduce more end-to-end latency in those cases the switch buffer is bloated, and will cause transport flow congestion.

    In this survey paper, DCTCP, MPTCP and QUIC are discussed as solutions for transport performance enhancement for 5G mobile networks to avoid the transport flow congestion caused by the switch buffer bloating from overloaded switch queue in data centers. 

  • 23.
    Cheng, Jun
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kovács, Benedek
    Ericsson AB.
    Darula, Marian
    Ericsson AB.
    Proposal for IEC GOOSE transport in 5G networks2018Rapport (Annet vitenskapelig)
    Abstract [en]

    Smart grid control systems have special latency and performance requirements on the underlying communication network. In 3GPP, such requirements are typically served by the so-called Critical Machine Type Communication (C-MTC) network slice. Generic Object Oriented Substation Events (GOOSE, IEC 61850-8.1) is a protocol used in power substation automation. GOOSE is a layer 2 protocol that operates via multicast over Ethernet which allows Intelligent Electronic Devices (IEDs) to exchange data horizontally between the bays within substation and between the substations, especially for interlocking, measurement and tripping signals. 3GPP 5th generation of mobile networks (5G) will support a variety of services, including Massive Machine-Type Communications (M-MTC) and Ultra-Reliable Low Latency Communications (URLLC) differentiated by the latency and reliability requirements. GOOSE is used by C-MTC in smart grid power substations, which can be a part of URLLC in 5G IoT networks.

    Experiments so far proposed to tunnel GOOSE messages in 4G Evolved Packet Core (EPC) bearers, in an IP tunnel. In this paper, we will motivate the idea of transporting GOOSE over user plane by tunneling via Ethernet over Generic Routing Encapsulation (EoGRE) and 3GPP Non-IP Data Delivery (NIDD), which will follow 3GPP standardization on 5G Standalone (SA), where the transfer latency and reliability will be governed by 5G URLLC. For 5G Non-Standalone (NSA) networks, GOOSE communication involves 5G to Long Term Evolution (LTE) interworking, LTE protocol adaptation from GTP-U/UDP to GRE on S1-U has been realized and deployed in LTE networks. In addition, to reach the right performance level, we propose a GOOSE Gateway (GW) including a 5G Modem to create unicast GOOSE messages to be transmitted over 5G networks. A congestion control algorithm, e.g. Explicit Congestion Notification (ECN), is required in the data link layer (congestion control is supposed to be solved by multicasting in the original Virtual Local Area Network (VLAN) setup). In 3GPP Release 15 standardization, ECN is proposed to be implemented by Low Latency, Low Loss, Scalable Throughput (L4S) congestion control in 5G-NodeB, 5G User Equipment (UE) and other entity. GOOSE messages could share the same ECN congestion control mechanism.

    The main contributions from this paper are: (1) Analyzed and compared GOOSE over Ethernet and GOOSE over IP. (2) Introduced a new logic to optimize GOOSE traffic on EPC user plane via non-IP Packet Data Network (PDN) data type in the 5G network. (3) Suggested to implement GOOSE GW to aggregate and unicasting GOOSE messages effectively between the substations, and to add congestion control by using ECN mechanism in 5G-NodeB and by implementing the pushback/reaction point in GOOSE GW. 

  • 24.
    Cho, Daewoong
    et al.
    Univ. of Sydney, Sydney, NSW, Australia.
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Zomaya, Albert Y
    School of Information Technologies, University of Sydney.
    Wang, Lizhe
    China Univ. of Geosci., China.
    Virtual Network Function Placement: Towards Minimizing Network Latency and Lead Time2017Inngår i: 2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom), Piscataway: IEEE, 2017, s. 90-97Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Network Function Virtualization (NFV) is an emerging network architecture to increase flexibility and agility within operator's networks by placing virtualized services on demand in Cloud data centers (CDCs). One of the main challenges for the NFV environment is how to minimize network latency in the rapidly changing network environments. Although many researchers have already studied in the field of Virtual Machine (VM) migration and Virtual Network Function (VNF) placement for efficient resource management in CDCs, VNF migration problem for low network latency among VNFs has not been studied yet to the best of our knowledge. To address this issue in this article, we i) formulate the VNF migration problem and ii) develop a novel VNF migration algorithm called VNF Real-time Migration (VNF-RM) for lower network latency in dynamically changing resource availability. As a result of experiments, the effectiveness of our algorithm is demonstrated by reducing network latency by up to 70.90% after latency-aware VNF migrations.

  • 25. Christoforidis, Christos
    et al.
    Ivarsson, Niklas
    Johansson, Henrik
    Nilsson, Jonas
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    SCTPTrace: An Extension of TCPTrace for SCTP2016Rapport (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    When it comes to analyzing TCP data and extracting the information in such a way that it becomes viewable, there are a couple of tools that can be used. One of them is TCPTrace. TCPTrace is used to analyze special dump files created from programs such as tcpdump, snoop and WinDump. TCPTrace became published for a broader public in the late 1996 by Shawn Ostermann. Since then functionalities, changes and fixes have been implemented for example the extension to create graphs and trace UDP packets. From the dump files a trace will be done, and depending on the input from the user, TCPTrace can present this information in a number of ways such as plain text, trace files and graphs, depending on the amount of information the user is looking for. The extensive information traced will be viewed and divided for each connection found. For each connection, information such as retransmits, throughput, round trip times, bytes and packets sent and received etc. can be presented.

    This project came to be, since there has been a desire to see a tool for SCTP that provides the same functionalities as TCPTrace. The project, called SCTPTrace, aimed to implement as much of the previous TCP functionalities as possible for the SCTP protocol. 

  • 26.
    Eklund, Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Efficient Scheduling to Reduce Latency for Signaling Traffic using CMT-SCTP2016Inngår i: 27th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), September 4-7, Valencia, Spain, IEEE Communications Society, 2016Konferansepaper (Fagfellevurdert)
    Abstract [en]

    To mitigate delay spikes during transmission of bursty signaling traffic, concurrent multipath transmission (CMT) over several paths in parallel could be an option. Still, unordered delivery is a well known problem when concurrently transmitting data over asymmetric network paths, leading to extra delay due to Head-of-Line Blocking (HoLB). The Stream Control Transmission Protocol (SCTP), designed as a carrier for signaling traffic over IP, is currently being extended with support for CMT (CMT-SCTP). To reduce the impact of HoLB, SCTP has support for transmission of separate data flows, called SCTP streams. In this paper, we address sender scheduling to optimize latency for signaling traffic using CMT-SCTP. We present dynamic stream-aware (DS) scheduling, which utilizes the SCTP stream concept, and continuously considers the current network status as well as the data load to make scheduling decisions. We implement a DS scheduler and compare it against some existing schedulers. Our investigation suggests that DS scheduling could significantly reduce latency compared to dynamic path scheduling that does not consider streams. Moreover, we show that naive round-robin scheduling may provide low latency over symmetric network paths, but may transmit data on non-beneficial asymmetric network paths leading to increased latency. Finally, our results show that a static stream based approach, found beneficial for bulk traffic, is not appropriate for bursty signaling traffic. 

  • 27.
    Eklund, Johan
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Implications of using a Large Initial Congestion Window to Improve mSCTP Handover Delay2012Inngår i: MOBILITY 2012 : The Second International Conference on Mobile Services, Resources, and Users / [ed] Josef Noll, University of Oslo & Movation, Norway, Alessandro Bazzi, CNR - IEIIT, Italy, IARIA , 2012, , s. 6s. 116-121Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The currently rather heterogeneous wireless landscape makes handover between different network technologies, so-called vertical handover, a key to a continued success for wireless Internet access. Recently, an extension to the Stream Control Transmission Protocol (SCTP) – the Dynamic Address Reconfiguration (DAR) extension – was standardized by IETF. This extension enables the use of SCTP for vertical handover. Still, the way vertical handover works in SCTP with DAR makes it less suitable for real-time traffic. Particularly, it takes a significant amount of time for the traffic to ramp up to full speed on the handover target path. In this paper, we study the implications of an increased initial congestion window for real-time traffic on the handover target path when competing traffic is present. The results clearly show that an increased initial congestion window could significantly reduce the transfer delay for real-time traffic, provided the fair share of the available capacity on the handover target path is sufficiently higher than the send rate required by the real-time flow. Additionally, we notice that this performance gain comes without penalizing the competing traffic.

  • 28.
    Eklund, Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    On the Impact of Data Scheduling to Reduce Latency for Telephony Signaling Traffic using CMT-SCTP2015Inngår i: The 11th Swedish National Computer Networking Workshop (SNCNW), Karlstad, Sweden, May 28-29, 2015., 2015Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    SCTP is a transport protocol targeted for telephony signaling traffic. Although SCTP from its inception supported multihoming, it has until now not supported concurrent mul- tipath transfer. However, this is about to change: Currently a standard for concurrent multipath transfer is underway. Since it is unclear whether concurrent multipath transfer could reduce transmission latency, this paper evaluates two algorithms for scheduling signaling traffic for transmission. We find that the mechanisms may provide good performance and to some extent enables for service differentiation. Still, the results indicate that unpredictable traffic require dynamic scheduling.

  • 29.
    Fairhurst, Gorry
    et al.
    University of Aberdeen, UK..
    Jones, Tom
    University of Aberdeen, UK..
    Bozakov, Zdravko
    Dell EMC, Ireland.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Damjanovic, Dragana
    Mozilla.
    Eckert, Toerless
    CISCO.
    Evensen, Kristian Riktor
    Celerway.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Fosselie Hansen, Audun
    Celerway.
    Khademi, Naeem
    University of Oslo, Norway.
    Mangiante, Simon
    Dell EMC.
    McManus, Patrick
    Mozilla.
    Papastergiou, Giorgos
    Simula.
    Ros, David
    Simula.
    Tüxen, Michael
    FH Münster, Germany.
    Vyncke, Eric
    CISCO.
    Welzl, Michael
    University of Oslo, Norway.
    Deliverable D1.1 - NEAT Architecture2016Rapport (Fagfellevurdert)
    Abstract [en]

    Ossification of the Internet transport-layer architecture is a significant barrier to innovation of the Internet. Such innovation is desirable for many reasons. Current applications often need to implement their own mechanisms to receive the transport service they need, but many do not have the breadth of adapting to all possible network characteristics. An updated transport architecture can do much to make the Internet more flexible and extensible. New ground-breaking services often require different or updated transport protocols, could benefit from better signalling between application and network, or desire a more flexible choice of which network path is used for which traffic. This document therefore proposes a new transport architecture. Such architecture lowers the barrier to service innovation by proposing a “transport system”, the NEAT System, that can leverage the rich set of available transport protocols. It paves the way for an architectural change of the Internet where new transport-layer services can seamlessly be integrated and quickly made available, minimising deployment difficulties, and allowing Internet innovators to take advantage of them wherever possible. The document provides a survey of the state-of-the-art to identify the architectural obstacles to, and opportunities for, evolution of the transport layer. It also details a set of general requirements for a new transport architecture. This new architecture is motivated by a set of use-cases, followed by a description of the NEAT architecture for a transport system, designed to permit applications to select appropriate transports based on their needs and the available transport services.

  • 30. Fida, Mah-Rukh
    et al.
    Kousias, Konstantinos
    Lutu, Andra
    Rajiullah, Mohammad
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Alay, Ozgu
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Argyriou, Antonios
    FLEX-MONROE: A unified platform for experiments under controlled and operational LTE settings2017Inngår i: WiNTECH 2017 Proceedings of the 11th Workshop on Wireless Network Testbeds, Experimental evaluation & CHaracterization, ACM Digital Library, 2017, s. 1-8Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents FLEX-MONROE, a unique platform that facilitates achieving a thorough understanding of LTE networks, one that captures the status of current operational MBB networks and that also enables LTE performance improvements by allowing experimentation in an environment with controllable LTE parameters. Using this platform, we propose to investigate how variations in the LTE network parameters influence the network characteristics, which, in turn, translate to application performance metrics that represent the end-user experience. We argue that the FLEX-MONROE platform is crucial to understand, validate and ultimately improve how current operational MBB networks perform, towards providing guidelines for designing future 5G architectures. Furthermore, understanding the effects of low-level tweaks in network parameters in the LTE infrastructure on the application performance is critical to provide guidelines on how to improve the application performance in the current but also future MBB networks

  • 31.
    Fida, Mah-Rukh
    et al.
    University of Edinburgh, UK.
    Kousias, Konstantinos
    Simula Research Laboratory, Norway.
    Lutu, Andra
    Simula Research Laboratory, Norway.
    Rajiullah, Mohammad
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Alay, Özgü
    Simula Research Laboratory, Norway.
    Brunström, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Argyriou, Antonios
    University of Thessaly, Greece.
    Demo: experimentation in controlled and operational LTE settings with FLEX-MONROE2017Inngår i: Proceedings of the 11th Workshop on Wireless Network Testbeds, Experimental evaluation & Characterization WiNTECH '17, ACM Digital Library, 2017, s. 93-94Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This demo paper presents FLEX-MONROE, a platform that facilitates better understanding of current LTE Mobile Broadband(MBB) networks and enables performance improvementsby allowing experimentation with controllable LTE parameters. The platform enables investigating impact oflow-level network parameter tweaks in LTE infrastructure onthe application performance. We argue that FLEX-MONROEis crucial to provide guidelines on improving application performance both in the current and future MBB networks

  • 32.
    Fischer, Anja
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT.
    Blacher, Zak
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT.
    An Ontological Approach to SIP DoS Detection2010Independent thesis Basic level (degree of Bachelor), 15 poäng / 22,5 hpOppgave
    Abstract [en]

    Traditional public switched telephone networks (PSTN) are replaced more and more by VoIP services these days.  Although it is good for saving costs, the disadvantage of this development is that VoIP networks are less secure than the traditional  way of transmitting voice. Because VoIP networks are being deployed in open environments and rely on other network  services, the VoIP service itself becomes vulnerable to potential attacks against its infrastructure or other services  it relies on.

    This thesis will present a discussion of security issues of the Session Initiation Protocol (SIP), the signalling protocol for  VoIP services. The main focus is on active attacks against the protocol that aim to reduce the service's availability -- so called  Denial of Service (DoS) attacks.

    Existing countermeasures and detection schemes do not adequately differentiate between DoS attacks. However, the differentiation  is important with respect to performance loss, as various protection schemes involve more computationally intensive processes.

    Based on that discussion, this thesis attempts to provide an ontological approach to describing, and eventually preventing attacks from  having their intended effects.

  • 33.
    Garcia, Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Delay metrics and delay characteristics: A study of four Swedish HSDPA+ and LTE networks2015Inngår i: 2015 European Conference on Networks and Communications (EuCNC), IEEE conference proceedings, 2015, s. 234-238Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Network delays and user perceived latencies are of major importance in many applications in cellular networks. Delays can be measured with multiple approaches and at different protocol layers. This work involves a detailed examination of several delay metrics from a network, transport, and application perspective. The study explores base delay as well as latency under load, capturing also the effect of buffering. The examination is based on a comprehensive active measurement campaign performed in the networks of four Swedish operators. The results show that the delay captured by different metrics can vary significantly, with delay captured from the TCP three-way-handshake and adaptive ping measurements giving the most consistent results for base network delay in our measurements. As expected, when background traffic is introduced measured delay increases by an order of magnitude due to buffering in the network, highlighting the importance of also capturing latency under load when describing network performance. Finally, using an analytic model of flow completion time, we show that well-selected network measurements can provide a good prediction of higher layer delay performance.

  • 34.
    Garcia, Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Alfredsson, Stefan
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Examining cellular access systems on trains: Measurements and change detection2017Inngår i: Proceedings of the 1st Network Traffic Measurement and Analysis Conference, New York: IEEE, 2017, s. 1-6Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Abstract:Access to reliable high-quality communication services on trains is important for today's mobile users. Train-mounted aggregation routers that provide WiFi access to train passengers and bundle external communication over multiple cellular modems/links is an efficient way of providing such services. Still, the characteristics of such systems have received limited attention in the literature. In this paper we examine the communication characteristics of such systems based on a large data set gathered over six months from an operational Swedish railway system. We characterize the conditions in terms of usage load, train velocity profiles, and observed throughput and delay as well as the relation between these parameters. Furthermore, we examine the data from an anomaly detection perspective. Based on a changepoint detection method, we examine how the collected metrics varies over the six months. Being able to detect shifts in the metrics over time can help detect anomalous changes in the hardware or environment, and also further helps explain the factors affecting the observed behaviors.

  • 35.
    Garcia, Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Examining TCP Short Flow Performance in Cellular Networks Through Active and Passive Measurements2015Inngår i: AllThingsCellular '15 Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges / [ed] David Choffnes and Kobus Van der Merwe, Association for Computing Machinery (ACM), 2015, s. 7-12Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this study we examine the conditions in a current cellular network by examining data passively collected in the core of a cellular operator during a 24-hour period. More than 2 billion traffic measurement data points from over 500,000 cellular users are analyzed. The analysis characterizes the Time-of-Day (ToD) variations for traffic intensity and session length and serves as a complement to the active measurements also performed. A comprehensive active measurement campaign was completed in the HSDPA+ and LTE networks of the four major Swedish operators. We collect around 50,000 data points from stationary cellular modems and analyze the ToD variation pattern for underlying network layer metrics such as delay and throughput. In conjunction with the time-varying session size distribution obtained from the passive measurements, we then analyze the ToD impact on TCP flows of varying sizes. The ToD effects are examined using time series analysis with Lomb-Scargle periodograms and differential Bayesian Information Criterion to allow comparison of the relative impact of the network ToD effects. The results show that ToD effects are predominantly impacting longer-running flows, and although short flows are also impacted they are mostly constrained by other issues such as protocol efficiency.

  • 36.
    Garcia, Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Beckman, Claes
    Center for Wireless Systems, KTH.
    Train Velocity and Data Throughput: A Large Scale LTE Cellular Measurements Study2017Inngår i: Proceedings of the 2017 IEEE 86th Vehicular Technology Conference (VTC Fall), New York: IEEE, 2017, s. 1-6Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Train-mounted aggregation routers that provide WiFi access to train passengers and bundle external communication over multiple cellular modems/links is an efficient way of providing communication services on trains. However, the characteristics of such systems have received limited attention in the literature. In this paper we address this gap by examining the communication characteristics of such systems based on a large data set gathered over six months from an operational Swedish railway system. We focus our examination on the relationship between per link throughput and train velocity. Using Levenberg- Marquardt non-linear regression a noticeable critical point is observed for an RS-SINR of around 12 dB. At this point the impact of increased train velocity on per link throughput changes from being negative to becoming positive. Using a machine learning approach we also explore the relative importance of several observed metrics in relation to per link throughput.

  • 37.
    Grill, Andreas
    et al.
    Karlstads universitet, Fakulteten för teknik- och naturvetenskap.
    Englund, Robin
    Karlstads universitet, Fakulteten för teknik- och naturvetenskap.
    Analysis of Fix‐point Aspects for Wireless Infrastructure Systems2009Independent thesis Basic level (university diploma), 15 poäng / 22,5 hpOppgave
    Abstract [en]

    A large amount of today’s telecommunication consists of mobile and short distance wireless applications, where the effect of the channel is unknown and changing over time, and thus needs to be described statistically. Therefore the received signal can not be accurately predicted and has to be estimated. Since telecom systems are implemented in real-time, the hardware in the receiver for estimating the sent signal can for example be based on a DSP where the statistic calculations are performed. A fixed-point DSP with a limited number of bits and a fixed binary point causes larger quantization errors compared to floating point operations with higher accuracy.

    The focus on this thesis has been to build a library of functions for handling fixed-point data. A class that can handle the most common arithmetic operations and a least squares solver for fixed-point have been implemented in MATLAB code.

    The MATLAB Fixed-Point Toolbox could have been used to solve this task, but in order to have full control of the algorithms and the fixed-point handling an independent library was created.

    The conclusion of the simulation made in this thesis is that the least squares result are depending more on the number of integer bits then the number of fractional bits.

  • 38.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT.
    A Study of Partially Reliable Transport Protocols for Soft Real-Time Applications2002Rapport (Annet vitenskapelig)
    Abstract [en]

    The profileration of multimedia applications, such as streaming video, teleconferencing,and interactive gaming has created a tremendous challenge for the traditional transportprotocols of the Internet – UDP and TCP. Specifically, many multimedia applicationsare examples of soft real-time applications. They have often relatively stringent requirementsin terms of delay and delay jitter, but typically tolerate a limited packet loss rate.In recognition of the transport service requirements of soft real-time applications,this thesis studies the feasibility of using retransmission based, partially reliable transportprotocols for these applications. The thesis studies ways of designing retransmissionbased, partially reliable transport protocols that are congestion aware and TCP compatible.Furthermore, the transport protocols should provide a service that, in terms ofperformance metrics such as throughput, delay, and delay jitter, are suitable for soft realtimeapplications. The thesis work comprises the design, analysis, and evaluation oftwo retransmission based, partially reliable transport protocols: PRTP and PRTP-ECN.Extensive simulations have been carried out on PRTP as well as PRTP-ECN. These simulationshave in part been complemented by some theoretical analysis. The results ofthe simulations and the analysis suggest that substantial reductions in delay jitter andimprovements in throughput can indeed be obtained with both PRTP and PRTP-ECN ascompared to TCP. While PRTP reacted too slowly to congestion to be TCP-friendly andaltogether fair, PRTP-ECN was found to be both TCP-friendly and reasonably fair.The thesis work also comprises an extensive survey on retransmission based, partiallyreliable transport protocols. Based on this survey, we have proposed a taxonomyfor these protocols. The taxonomy considers two dimensions of retransmission based,partially reliable transport protocols: the transport service, and the error control scheme.

  • 39.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    A Study of Partially Reliable Transport Protocols for Soft Real-Time Applications2002Licentiatavhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    The profileration of multimedia applications, such as streaming video, teleconferencing, and interactive gaming has created a tremendous challenge for the traditional transport protocols of the Internet – UDP and TCP. Specifically, many multimedia applications are examples of soft real-time applications. They have often relatively stringent require- ments in terms of delay and delay jitter, but typically tolerate a limited packet loss rate.

    In recognition of the transport service requirements of soft real-time applications, this thesis studies the feasibility of using retransmission based, partially reliable trans- port protocols for these applications. The thesis studies ways of designing retransmis- sion based, partially reliable transport protocols that are congestion aware and TCP com- patible. Furthermore, the transport protocols should provide a service that, in terms of performance metrics such as throughput, delay, and delay jitter, are suitable for soft real- time applications. The thesis work comprises the design, analysis, and evaluation of two retransmission based, partially reliable transport protocols: PRTP and PRTP-ECN. Extensive simulations have been carried out on PRTP as well as PRTP-ECN. These sim- ulations have in part been complemented by some theoretical analysis. The results of the simulations and the analysis suggest that substantial reductions in delay jitter and improvements in throughput can indeed be obtained with both PRTP and PRTP-ECN as compared to TCP. While PRTP reacted too slowly to congestion to be TCP-friendly and altogether fair, PRTP-ECN was found to be both TCP-friendly and reasonably fair.

    The thesis work also comprises an extensive survey on retransmission based, par- tially reliable transport protocols. Based on this survey, we have proposed a taxonomy for these protocols. The taxonomy considers two dimensions of retransmission based, partially reliable transport protocols: the transport service, and the error control scheme. 

  • 40.
    Grinnemo, Karl-Johan
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT.
    Taxonomy and Survey of Retransmission Based Partially Reliable Transport Protocols2002Rapport (Annet vitenskapelig)
    Abstract [en]

    The mismatch between the services offered by the two standard transport protocols inthe Internet, TCP and UDP, and the services required by distributed multimedia applicationshas led to the development of a large number of partially reliable transportprotocols. That is, protocols which in terms of reliability places themselves betweenTCP and UDP. This paper presents a taxonomy for retransmission based, partially reliabletransport protocols, i.e., the subclass of partially reliable transport protocols thatperforms error recovery through retransmissions. The taxonomy comprises two classificationschemes: one that classifies retransmission based, partially reliable transportprotocols with respect to the reliability service they offer and one that classifies themwith respect to their error control scheme. The objective of our taxonomy is fourfold:to introduce a unified terminology; to provide a framework in which retransmissionbased, partially reliable transport protocols can be examined, compared, and contrasted;to make explicit the error control schemes used by these protocols; and, finally, to gainnew insights into these protocols and thereby suggest avenues for future research. Basedon our taxonomy, a survey was made of existing retransmission based, partially reliabletransport protocols. The survey shows how protocols are categorized according to ourtaxonomy, and exemplifies the majority of reliability services and error control schemesdetailed in our taxonomy.

  • 41.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Bozakov, Zdravko
    Dell EMC.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Isabel Bueno, María
    Damjanovic, Dragana
    Mozilla.
    Rikter Evensen, Kristian
    Celerway.
    Fairhurst, Gorry
    University of Aberdeen, UK..
    Hansen, Audun
    Celerway.
    Hayes, David
    University of Oslo, Norway.
    Hurtig, Per
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Khademi, Naeem
    University of Oslo, Norway.
    Mangiante, Simone
    Dell EMC.
    Mohideen, Althaff
    University of Aberdeen, UK..
    Rajiullah, Mohammad
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Ros, David
    Simula.
    Rüngeler, Irene
    FH Münster, Germany.
    Santos, Ricardo
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Secchi, Raffaello
    University of Aberdeen, UK..
    Christian Tangenes, Tor
    Tüxen, Micheal
    FH Münster, Germany.
    Weinrank, Felix
    FH Münster, Germany.
    Welzl, Michael
    University of Oslo, Norway.
    Deliverable D3.1 - Initial Report on the Extended Transport System2017Rapport (Fagfellevurdert)
    Abstract [en]

    The NEAT System offers an enhanced API for applications that disentangles them from the actual transport protocol being used. The system also enables applications to communicate their service requirements to the transport system in a generic, transport-protocol independent way. Moreover, the architecture of the NEAT System promotes the evolution of new transport services. Work Package 3 (WP3) enhances and extends the core parts of the NEAT Transport. Efforts have been devoted to developing transport-protocol mechanisms that enable a wider spectrum of NEAT Transport Services, and that assist the NEAT System in facilitating several of the commercial use cases. Work has also started on the development of optimal transport-selection mechanisms; mechanisms that enable for the NEAT System to make optimal transport selections on the basis of application requirements and network measurements. Lastly, another research activity has been initiated on how to use SDN to signal application requirements to routers, switches, and similar network elements. This document provides an initial report on all these WP3 activities—both on completed and on near-termplanned work.

  • 42.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Bozakov, Zdravko
    Dell EMC.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Isabel Sanchez Bueno, Maria
    Dreibholz, Thomas
    Simula.
    Rikter Evensen, Kristian
    Celerway.
    Fairhurst, Gorry
    University of Aberdeen, UK..
    Fosselie Hansen, Audun
    Celerway.
    Hayes, David
    University of Oslo, Norway.
    Hurtig, Per
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Rajiullah, Mohammad
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Jones, Tom
    University of Aberdeen, UK..
    Ros, David
    Simula.
    Rozensztrauch, Tomasz
    Celerway.
    Tüxen, Michael
    FH Münster, Germany.
    Vyncke, Eric
    CISCO.
    Deliverable D3.3 - Extended Transport System and Transparent Support of Non-NEAT Applications2017Rapport (Fagfellevurdert)
    Abstract [en]

    This deliverable summarises and concludes our work in Work Package 3 (WP3) to extend the transport services provided by the NEAT System developed in Work Package 2, and to enable non-NEAT applications to harness the transport services offered by NEAT. We have demonstrated how a policy- and information-based selection of transport protocol by NEAT could provide a more efficient transport service for web applications. The information on which NEAT makes its transport selection decisions resides in the Characteristics Information Base (CIB). The CIB is populated by various CIB sources, and in WP3 we have designed, implemented, and evaluated various CIB sources, including meta data from mobile broadband networks, passive measurements, IPv6 Provisioning Domain protocols and the Happy Eyeballs mechanism, which caches the outcome of its connection attempts. A key property of NEAT is that it not only “vertically” decouples applications from transport protocols, but also “horizontally”. Particularly, it enables applications to harness information about resource availability and policies from Software Defined Networking (SDN) controllers in managed networks, without these applications actually being SDN-aware. To extend the use of NEAT to non-NEAT applications, we have implemented a BSDcompatible sockets API on top of NEAT and a NEAT proxy that intercepts and replaces standard TCP connections with NEAT flows, i.e., with the transport solutions deemed most appropriate by NEAT.We have also proposed a way for non-NEAT applications to make use of NEAT through the deployment of NEAT-enabled virtual appliances in SDN-controlled networks: connections from these applications are routed via an SDN-controlled proxy that terminates the original connection and replaces it with a NEAT-selected connection.

  • 43.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Brunstrom, Anna
    Karlstads universitet, Institutionen för informationsteknologi.
    A Survey of TCP-Friendly Congestion Control Mechanisms for Multimedia Traffic2003Rapport (Annet vitenskapelig)
    Abstract [en]

    The stability and performance of the Internet to date have in a large part been due tothe congestion control mechanism employed by TCP. However, while the TCP congestioncontrol is appropriate for traditional applications such as bulk data transfer, it hasbeen found less than ideal for multimedia applications. In particular, audio and videostreaming applications have difficulties managing the rate halving performed by TCP inresponse to congestion. To this end, the majority of multimedia applications use eithera congestion control scheme which reacts less drastic to congestion and therefore oftenis more aggressive than TCP, or, worse yet, no congestion control whatsoever. Sincethe Internet community strongly fears that a rapid deployment of multimedia applicationswhich do not behave in a fair and TCP-friendly manner could endanger the currentstability and performance of the Internet, a broad spectrum of TCP-friendly congestioncontrol schemes have been proposed. In this report, a survey over contemporary proposalsof TCP-friendly congestion control mechanisms for multimedia traffic in the Internetis presented. A classification scheme is outlined which shows how the majority of theproposed congestion control schemes emanate from a relatively small number of designprinciples. Furthermore, we illustrate how these design principles have been applied ina selection of congestion control scheme proposals and actual transport protocols.

  • 44.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    On the Use of CMT-SCTP to Improve the Startup Behavior of PSTN Signaling Traffic2013Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    There is currently work going on at IETF to standardize concurrent multipath transfer, i.e., simultaneous transfer of data over several network paths, for SCTP. This paper studies whether or not SCTP extended with concurrent multipath transfer (CMT-SCTP) could provide a faster startup behavior than standard SCTP. The paper complements previous work on CMT-SCTP, and extends it to PSTN signaling traffic. The paper suggests that CMT-SCTP could give a faster startup behavior over symmetrical paths, i.e., paths with similar bandwidths and round-trip times, but that its behavior is sensitive to differences in round-trip time between the paths. The paper also indicates that signaling traffic properties such as message size and burstiness contribute marginally to the startup behavior of CMT-SCTP. 

  • 45.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013).
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    On the Use of MPTCP to Reduce Latency for Cloud Applications2014Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    As mobile cloud usage has become more and more prevalent, with more people depending on the cloud for both their work and their leisure, cloud-to-end-user latency have risen to become a key issue. One oft-forgotten way to cost effectively improve the quality of experience is to simultaneously make use of the several network interfaces, e.g., WiFi and 3G/4G interfaces, available on most of todays mobile devices including smartphones and tablets; that is, to employ multihoming. This paper provides an initial evaluation of the latency characteristics of the multipath extensions to TCP, Multipath TCP (MPTCP), that are currently being standardized by IETF. In particular, the paper considers the possible reductions in latency that could be obtained by using MPTCP and multiple network paths between a cloud service and a mobile end user. Traffic from three cloud applications are studied, Netflix, Google Maps, and Google Docs, representing typical high-, mid-, and low- intensity cloud-to-end-user traffic. The result suggests that significant latency reductions are indeed possible, however, primarily for high- intensity video traffic such as Netflix. 

  • 46.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Brunstrom, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Some Observations on the Performance of SCTP-controlled Failovers in M3UA-based SIGTRAN Networks2004Inngår i: Proceedings of the Second Swedish National Computer Networking Workshop: SNCNW2004, Karlstad, 2004Konferansepaper (Fagfellevurdert)
    Abstract [en]

    With Voice over IP (VoIP) emerging as a viable alternative totraditional circuit-switched telephony, it is vital that the twoare able to intercommunicate. To this end, the IETF SignalingTransport (SIGTRAN) group has devised an architecture forseamless transportation of SS7 signaling traffic between aVoIP network and a traditional telecom network. However,at present, it is unclear if the SIGTRAN architecture will,in reality, meet the SS7 requirements, especially the stringentavailability requirements.The SCTP transport protocol is one of the core componentsof the SIGTRAN architecture, and its failover mechanism isone of the most important of the availability mechanisms ofSIGTRAN. Currently, we are studying the performance ofSCTP-controlled failovers, and although this study is not yetcompleted some observations have been made on propertiesof the SCTP failover mechanism which could impede on itsperformance. This paper reports on these observations, andexplains their causes.

  • 47.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Brunstrom, Anna
    Karlstads universitet, Institutionen för informationsteknologi.
    Garcia, Johan
    Karlstads universitet, Institutionen för informationsteknologi.
    A Taxonomy and Survey of Retransmission Based Partially Reliable Transport Protocols2002Rapport (Annet vitenskapelig)
    Abstract [en]

    The mismatch between the services offered by the two standard transport protocols inthe Internet, TCP and UDP, and the services required by distributed multimedia applicationshas led to the development of a large number of partially reliable transportprotocols. That is, protocols which in terms of reliability places themselves betweenTCP and UDP. This paper presents a taxonomy for retransmission based, partially reliabletransport protocols, i.e., the subclass of partially reliable transport protocols thatperforms error recovery through retransmissions. The taxonomy comprises two classificationschemes: one that classifies retransmission based, partially reliable transportprotocols with respect to the reliability service they offer and one that classifies themwith respect to their error control scheme. The objective of our taxonomy is fourfold:to introduce a unified terminology; to provide a framework in which retransmissionbased, partially reliable transport protocols can be examined, compared, and contrasted;to make explicit the error control schemes used by these protocols; and, finally, to gainnew insights into these protocols and thereby suggest avenues for future research. Basedon our taxonomy, a survey was made of existing retransmission based, partially reliabletransport protocols. The survey shows how protocols are categorized according to ourtaxonomy, and exemplifies the majority of reliability services and error control schemesdetailed in our taxonomy.

  • 48.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Brunström, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    A First Study on Using MPTCP to Reduce Latency for Cloud Based Mobile Applications2015Inngår i: 2015 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC), IEEE, 2015, s. 64-69Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Currently, Multipath TCP (MPTCP) – a modifica- tion to standard TCP that enables the concurrent use of several network paths in a single TCP connection – is being standardized by IETF. This paper provides a comprehensive evaluation of the use of MPTCP to reduce latency and thus improve the quality of experience or QoE for cloud-based applications. In particular, the paper considers the possible reductions in latency that could be obtained by using MPTCP and multiple network paths between a cloud service and a mobile end user. To obtain an appreciation of the expected latency performance for different types of cloud traffic, three applications are studied, Netflix, Google Maps, and Google Docs, representing typical applications generating high-, mid-, and low-intensity traffic. The results suggest that MPTCP could provide significant latency reductions for cloud applications, especially for applications such as Netflix and Google Maps. Moreover, the results suggest that MPTCP offers a reduced latency despite a few percent packet loss, and in spite of limited differences in the round-trip times of the network paths in an MPTCP connection. Still, larger differences in the round-trip times seem to significantly increase the application latency, especially for Netflix, Google Maps, and similar applications. Thus, to become an even better alternative to these applications, this paper suggests that the MPTCP packet scheduling policy should be changed: Apart from the round-trip times of the network paths in a connection, it should also consider the difference in round-trip time between the network paths.

  • 49.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Institutionen för informationsteknologi.
    Brunström, Anna
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    A Simulation Based Performance Evaluation of PRTP2002Rapport (Annet vitenskapelig)
    Abstract [en]

    PRTP is proposed to address the need of a transport service that is more suitable forapplications with soft real-time requirements, e.g., video broadcasting. It is an extensionfor partial reliability to TCP. The main idea behind PRTP is to exploit the fact thatmany soft real-time applications tolerate a limited amount of packet loss. In particular,PRTP enables an application to trade some of the reliability offered by TCP for improvedthroughput and interarrival jitter. This paper describes the design of PRTP andgives a detailed description of a simulation based performance evaluation. The performanceevaluation involved the performance of PRTP compared to TCP in long- as wellas in short-lived connections and showed that PRTP probably would give significantimprovements in performance, both in terms of throughput and interarrival jitter, for awide range of applications. The performance evaluation also suggested that PRTP is notTCP-friendly and altogether fair against competing flows and thus is not suitable for usein an environment where the main reason for packet loss is congestion, e.g., in a fixedInternet environment. We believe, however, that PRTP could be a viable alternative forwireless applications in error prone environments.

  • 50.
    Grinnemo, Karl-Johan
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT.
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    A Survey of TCP-Friendly Congestion Control Mechanisms for Multimedia Traffic2003Rapport (Annet vitenskapelig)
    Abstract [en]

    The stability and performance of the Internet to date have in a large part been due tothe congestion control mechanism employed by TCP. However, while the TCP congestioncontrol is appropriate for traditional applications such as bulk data transfer, it hasbeen found less than ideal for multimedia applications. In particular, audio and videostreaming applications have difficulties managing the rate halving performed by TCP inresponse to congestion. To this end, the majority of multimedia applications use eithera congestion control scheme which reacts less drastic to congestion and therefore oftenis more aggressive than TCP, or, worse yet, no congestion control whatsoever. Sincethe Internet community strongly fears that a rapid deployment of multimedia applicationswhich do not behave in a fair and TCP-friendly manner could endanger the currentstability and performance of the Internet, a broad spectrum of TCP-friendly congestioncontrol schemes have been proposed. In this report, a survey over contemporary proposalsof TCP-friendly congestion control mechanisms for multimedia traffic in the Internetis presented. A classification scheme is outlined which shows how the majority of theproposed congestion control schemes emanate from a relatively small number of designprinciples. Furthermore, we illustrate how these design principles have been applied ina selection of congestion control scheme proposals and actual transport protocols.

123 1 - 50 of 114
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf