Change search
Refine search result
1234567 51 - 100 of 884
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 51.
    Ali, Nour
    et al.
    Brunel University, London, UK.
    Baker, Sean
    University of Limerick, Ireland.
    O'Crowley, Ross
    Red Orkid Limited, Dublin, Ireland.
    Herold, Sebastian
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Buckley, Jim
    University of Limerick, Ireland.
    Architecture consistency: State of the practice, challenges and requirements (vol 23, pg 224, 2018)2018In: Journal of Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 23, no 3, p. 1868-1869Article in journal (Refereed)
  • 52.
    Alizadeh Noghani, Kyoomars
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Service Migration in Virtualized Data Centers2020Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Modern virtualized Data Centers (DCs) require efficient management techniques to guarantee high quality services while reducing their economical cost. The ability to live migrate virtual instances, e.g., Virtual Machines (VMs), both inside and among DCs is a key operation for the majority of DC management tasks that brings significant flexibility into the DC infrastructure. However, live migration introduces new challenges as it ought to be fast and seamless while at the same time imposing a minimum overhead on the network. In this thesis, we study the networking problems of live service migration in modern DCs when services are deployed in virtualized environments, e.g., VMs and containers. In particular, this thesis has the following main objectives: (1) improving the live VM migration in Software-Defined Network (SDN) enabled DCs by addressing networking challenges of live VM migration, and (2) investigating the trade-off between the reconfiguration cost and optimality of the Service Function Chains (SFCs) placement after the reconfiguration has been applied when SFCs are composed of stateful Virtual Network Functions (VNFs).

    To achieve the first objective, in this thesis, we use distinctive characteristics of SDN architectures such as their centralized control over the network to accelerate the network convergence time and address suboptimal routing problem. Consequently, we enhance the quality of intra- and inter-DC live migrations. Furthermore, we develop an SDN-based framework to improve the inter-DC live VM migration by automating the deployment, improving the management, enhancing the performance, and increasing the scalability of interconnections among DCs.

    To accomplish the second objective, we investigate the overhead of dynamic reconfiguration of stateful VNFs. Dynamic reconfiguration of VNFs is frequently required in various circumstances, and live migration of VNFs is an integral part of this operation. By mathematically formulating the reconfiguration costs of stateful VNFs and developing a multi-objective heuristic solution, we explore the trade-off between the reconfiguration cost required to improve a given placement and the degree of optimality achieved after the reconfiguration is performed. Results show that the cost of performing the reconfiguration operations required to realize an optimal VNF placement might hamper the gain that could be achieved.

  • 53.
    Alizadeh Noghani, Kyoomars
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Towards Seamless Live Migration in SDN-Based Data Centers2018Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    Live migration of Virtual Machines (VMs) has significantly improved the flexibility of modern Data Centers (DCs). Ideally, live migration ought to be seamless which in turn raises challenges on how to minimize service disruption and avoid performance degradation. To address these challenges, a comprehensive support from the underlying network is required. However, legacy DC networks fall short to help as they take a reactive approach to live migration procedure. Moreover, the complexity and inflexibility of legacy DC networks make it difficult to deploy, manage, and improve network technologies that DC providers may need to use for migration.

    In this thesis, we explore the application of Software Defined Networking (SDN) paradigm for making live VM migration more seamless. Exploiting the characteristics of SDN such as its centralized view on network states, we contribute to the body of knowledge by enhancing the quality of intra- and inter-DC live migration. Firstly, for intra-DC migration, we provide an SDN-based solution which minimizes the service disruption by employing OpenFlow-based resiliency mechanisms to prepare a DC network for migration proactively. Secondly, we improve the inter-DC live migration by accelerating the network convergence through announcing the migration in the control plane using MP-BGP protocol. Further, our proposed framework resolves the sub-optimal routing problem by conducting the gateway functionality at the SDN controller. Finally, with the ultimate goal of improving the inter-DC migration, we develop an SDN-based framework which automates the deployment, improves the management, enhances the performance, and increases the scalability of interconnections among DCs.

  • 54.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Ghazzai, Hakim
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    A Generic Framework for Task Offloading in mmWave MEC Backhaul Networks2018In: 2018 IEEE Global Communications Conference (GLOBECOM), IEEE, 2018, p. 1-7Conference paper (Refereed)
    Abstract [en]

    With the emergence of millimeter-Wave (mmWave) communication technology, the capacity of mobile backhaul networks can be significantly increased. On the other hand, Mobile Edge Computing (MEC) provides an appropriate infrastructure to offload latency-sensitive tasks. However, the amount of resources in MEC servers is typically limited. Therefore, it is important to intelligently manage the MEC task offloading by optimizing the backhaul bandwidth and edge server resource allocation in order to decrease the overall latency of the offloaded tasks. This paper investigates the task allocation problem in MEC environment, where the mmWave technology is used in the backhaul network. We formulate a Mixed Integer NonLinear Programming (MINLP) problem with the goal to minimize the total task serving time. Its objective is to determine an optimized network topology, identify which server is used to process a given offloaded task, find the path of each user task, and determine the allocated bandwidth to each task on mmWave backhaul links. Because the problem is difficult to solve, we develop a two-step approach. First, a Mixed Integer Linear Program (MILP) determining the network topology and the routing paths is optimally solved. Then, the fractions of bandwidth allocated to each user task are optimized by solving a quasi-convex problem. Numerical results illustrate the obtained topology and routing paths for selected scenarios and show that optimizing the bandwidth allocation significantly improves the total serving time, particularly for bandwidth-intensive tasks.

  • 55.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Hernandez Benet, Cristian
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Marotta, Antonio
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Jestin, Patrick
    Ericsson AB, Sweden.
    Srivastava, Vivek V.
    Ericsson AB, Sweden.
    Automating Ethernet VPN deployment in SDN-based Data Centers2017In: 2017 Fourth International Conference on Software Defined Systems (SDS)., IEEE, 2017, p. 61-66Conference paper (Refereed)
    Abstract [en]

    Layer 2 Virtual Private Network (L2VPN) is widely deployed in both service provider networks and enterprises. However, legacy L2VPN solutions have scalability limitations in the context of Data Center (DC) interconnection and networking which require new approaches that address the requirements of service providers for virtual private cloud services. Recently, Ethernet VPN (EVPN) has been proposed to address many of those concerns and vendors started to deploy EVPN based solutions in DC edge routers. However, manual configuration leads to a time-consuming, error-prone configuration and high operational costs. Automating the EVPN deployment from cloud platforms such as OpenStack enhances both the deployment and flexibility of EVPN Instances (EVIs). This paper proposes a Software Defined Network (SDN) based framework that automates the EVPN deployment and management inside SDN-based DCs using OpenStack and OpenDaylight (ODL). We implemented and extended several modules inside ODL controller to manage and interact with EVIs and an interface to OpenStack that allows the deployment and configuration of EVIs. We conclude with scalability analysis of our solution.

  • 56.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Hernandez Benet, Cristian
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Taheri, Javid
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    SDN helps volume in Big Data2018In: Big Data and Software Defined Networks / [ed] Javid Taheri, London: IET Digital Library, 2018, 1, p. 185-206Chapter in book (Refereed)
    Abstract [en]

    Both Big Data and SDN are described in detail in previous chapters. This chapter investigates how SDN architecture can leverage its unique features to mitigate the challenges of Big Data volume. Accordingly, first, we provide an overview of Big Data volume, its effects on the underlying network, and mention some potential SDN solutions to address the corresponding challenges. Second, we elaborate more on the network-monitoring, traffic-engineering, and fault-tolerant mechanisms which we believe they may help to address the challenges of Big Data volume. Finally, this chapter is concluded with some open issues.

  • 57.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    SDN Enhanced Ethernet VPN for Data Center Interconnect2017In: 2017 IEEE 6th International Conference on Cloud Networking (CloudNet) / [ed] Maga, D, IEEE, 2017, p. 77-82Conference paper (Refereed)
    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.

  • 58.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Sankar Gopannan, Prem
    Ericsson, USA.
    EVPN/SDN Assisted Live VM Migration between Geo-Distributed Data Centers2018In: 4th IEEE Conference on Network Softwarization (NetSoft), IEEE, 2018, p. 105-113Conference paper (Refereed)
    Abstract [en]

    Live Virtual Machine (VM) migration has significantly improved the flexibility of modern Data Centers (DC). However, seamless live migration of a VM between geo-distributed DCs faces several challenges due to difficulties in preserving the network configuration after the migration paired with a large network convergence time. Although SDN-based approaches can speed up network convergence time, these techniques have two limitations. First, they typically react to the new topology by installing new flow rules once the migration is finished. Second, because the WAN is typically not under SDN control, they result in sub-optimal routing thus severely degrading the network performance once the VM is attached at the new location.

    In this paper, we identify networking challenges for VM migration across geo-distributed DCs. Based on those observations, we design a novel long-haul VM migration scheme that overcomes those limitations. First, instead of reactively restoring connectivity after the migration, our SDN-based approach proactively restores flows across the WAN towards the new location with the help of EVPN and VXLAN overlay technologies. Second, the SDN controller accelerates the network convergence by announcing the migration to other controllers using MP-BGP control plane messages. Finally, the SDN controller resolves the sub-optimal routing problem that arises as a result of migration implementing a distributed anycast gateway. We implement our approach as extensions to the OpenDaylight controller. Our evaluation shows that our approach outperforms existing approaches in reducing the downtime by 400 ms and increasing the application performance up to 12 times.

  • 59.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Taheri, Javid
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    On the Cost-Optimality Trade-off for Service Function Chain Reconfiguration2019Conference paper (Refereed)
    Abstract [en]

    Optimal placement of Virtual Network Functions (VNFs) in virtualized data centers enhances the overall performance of Service Function Chains (SFCs) and decreases the operational costs for mobile network operators. Maintaining an optimal placement of VNFs under changing load requires a dynamic reconfiguration that includes adding or removing VNF instances, changing the resource allocation of VNFs, and re-routing corresponding service flows. However, such reconfiguration may lead to notable service disruptions and impose additional overhead on the VNF infrastructure, especially when reconfiguration entails state or VNF migration. On the other hand, not changing the existing placement may lead to high operational costs. In this paper, we investigate the trade-off between the reconfiguration of SFCs and the optimality of the resulting placement and service flow (re)routing. We model different reconfiguration costs related to the migration of stateful VNFs and solve a joint optimization problem that aims to minimize both the total cost of the VNF placement and the reconfiguration cost necessary for repairing a suboptimal placement. Numerical results show that a small number of reconfiguration operations can significantly reduce the operational cost of the VNF infrastructure; however, too much reconfiguration may not pay off should heavy costs be involved.

  • 60.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Taheri, Javid
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Öhlen, Peter
    Ericsson AB.
    Curescu, Calin
    Ericsson AB.
    On the Cost-Optimality Trade-off for Fast Service Function Chain ReconfigurationManuscript (preprint) (Other academic)
    Abstract [en]

    Optimal placement of Virtual Network Functions (VNFs) in data centers enhances the overall performance of Service Function Chains (SFCs) and decreases the operational costs for mobile network operators. In order to cope with changes in demands, VNF instances may be added or removed dynamically, resource allocations may be adjusted, and servers may be consolidated. To maintain an optimal placement of SFC under changing conditions, dynamic reconfiguration is required including the migration of VNFs and the re-routing of service flows. However, such reconfiguration may lead to notable service disruptions and can be exacerbated when reconfiguration entails state or VNF migration, both imposing additional overhead on the VNF infrastructure. On the other hand, not changing the placement may lead to a suboptimal operation, servers and links may become congested or underutilized, leading to high operational costs. In this paper, we investigate the trade-off between the reconfiguration of SFCs and the optimality of the resulting placement and service flow routing. We model reconfiguration costs related to the migration of stateful VNFs and solve a joint optimization problem that aims to minimize both the total cost of the new placement and the reconfiguration cost necessary to achieve it. We also develop a fast multi-objective genetic algorithm that finds near-optimal solutions for online decisions. Our numerical evaluations show that a small number of reconfiguration operations can significantly reduce the operational cost of the VNF infrastructure. In contrast, too much reconfiguration may not pay off due to high costs. We believe that our work is an important tool that helps network provider to plan a good reconfiguration strategy for their service chains.

  • 61.
    Aljinovic, Andrea Aglic
    et al.
    University of Zagreb, Croatia.
    Peric, Ivan
    University of Zagreb, Croatia.
    Persson, Lars-Erik
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Josip Pecaric- and his life in mathematics and politics2019In: Mathematical Inequalities & Applications, ISSN 1331-4343, E-ISSN 1848-9966, Vol. 22, no 4, p. 1067-1080Article in journal (Refereed)
    Abstract [en]

    It is impossible in limited number of pages to give a fair picture of such a remarkable man, great mathematician and human being as Josip Pecaric. Our intention is instead to complement the picture of him in various ways. We hope that our paper will give also someflavor of Josip as family man, fighter, supervisor,international authority, author (also in other subjects than mathematics), fan of the Croatian football team, and not only as his obvious role as our King of Inequalities.

  • 62.
    Alm, Anton
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Internet of Things mesh network: Using the Thread networking protocol2019Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis summarizes my project in setting up a Thread network. The idea of this project was presented by the company ÅF in Karlstad, Sweden. ÅF wishes to upgrade their current demonstrator for IoT. The current demonstrator includes Azure Cloud component, Raspberry Pi, Bluetooth and Arduino components. The upgrade includes implementing Thread technology together with Thread verified hardware from Nordic semiconductor and the Raspberry Pi Foundation.

    Thread is an IoT mesh networking protocol that was released year 2014. Compared to Bluetooth it offers IP communication (including IPv6) combined with higher reliability, performance and security. The process of installing, compiling and configuring the Thread network is explained.

    The result is an operational thread network that has sensor devices sending data to an HTTP web server, where the data is stored and monitored. Though, there are many improvements and functions that can be implemented to make this demonstrator more appealing.

  • 63.
    Almani, T.
    et al.
    Austin, USA.
    Kumar, Kundan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). University of Bergen, Norway.
    Singh, G.
    Austin, USA.
    Wheeler, M. F.
    Austin, USA.
    Stability of multirate explicit coupling of geomechanics with flow in a poroelastic medium2019In: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 78, no 8, p. 2682-2699Article in journal (Refereed)
    Abstract [en]

    We consider single rate and multirate explicit schemes for the Biot system modeling coupled flow and geomechanics in a poro-elastic medium. These schemes are widely used in practice that follows a sequential procedure in which the flow and mechanics problems are fully decoupled. In such a scheme, the flow problem is solved first with time-lagging the displacement term followed by the mechanics solve. The multirate explicit coupling scheme exploits the different time scales for the mechanics and flow problems by taking multiple finer time steps for flow within one coarse mechanics time step. We provide fully discrete schemes for both the single and multirate approaches that use Backward Euler time discretization and mixed spaces for flow and conformal Galerkin for mechanics. We perform a rigorous stability analysis and derive the conditions on reservoir parameters and the number of finer flow solves to ensure stability for both schemes. Furthermore, we investigate the computational time savings for explicit coupling schemes against iterative coupling schemes.

  • 64.
    Almani, T.
    et al.
    Saudi Arabian Oil Company (Aramco), Saudi Arabia.
    Manea, A.
    Saudi Arabian Oil Company (Aramco), Saudi Arabia.
    Kumar, Kundan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). University of Bergen, Norway.
    Dogru, A. H.
    Saudi Arabian Oil Company (Aramco), Saudi Arabia; MIT, USA.
    Convergence of the undrained split iterative scheme for coupling flow with geomechanics in heterogeneous poroelastic media2019In: Computational Geosciences, ISSN 1420-0597, E-ISSN 1573-1499Article in journal (Refereed)
    Abstract [en]

    Recently, an accurate coupling between subsurface flow and reservoir geomechanics has received more attention in both academia and industry. This stems from the fact that incorporating a geomechanics model into upstream flow simulation is critical for accurately predicting wellbore instabilities and hydraulic fracturing processes. One of the recently introduced iterative coupling algorithms to couple flow with geomechanics is the undrained split iterative coupling algorithm as reported by Kumar et al. (2016) and Mikelic and Wheeler (Comput. Geosci. 17: 455–461 2013). The convergence of this scheme is established in Mikelic and Wheeler (Comput. Geosci. 17:455–461 2013) for the single rate iterative coupling algorithm and in Kumar et al. (2016) for the multirate iterative coupling algorithm, in which the flow takes multiple finer time steps within one coarse mechanics time step. All previously established results study the convergence of the scheme in homogeneous poroelastic media. In this work, following the approach in Almani et al. (2017), we extend these results to the case of heterogeneous poroelastic media, in which each grid cell is associated with its own set of flow and mechanics parameters for both the single rate and multirate schemes. Second, following the approach in Almani et al. (Comput. Geosci. 21:1157–1172 2017), we establish a priori error estimates for the single rate case of the scheme in homogeneous poroelastic media. To the best of our knowledge, this is the first rigorous and complete mathematical analysis of the undrained split iterative coupling scheme in heterogeneous poroelastic media.

  • 65.
    Almqvist, Ylva
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Kan en lärare hinna med alla elever i dagens matematikundervisning?: En intervjustudie av hur lärare beskriver undervisningen av elever som presterar lågt i matematik.2017Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    In this study I want to illustrate how teachers describe their preventions and interventions when teaching students with low achievement in mathematics. This is a qualitative study based on a series of group interviews of teachers in the Swedish compulsory school. Mathematics teachers still hold a traditional compensatory perspective on students with low achievement thus placing the responsibility for learning with the students. The general opinion is that special pedagogics is necessary to enable support enough to help students with low achievement in mathematics to reach a passing grade. Thanks to further training, primarily through “Matematiklyftet”, the view on the possibility to include low achieving students in the classroom in a good way is more positive. There is an ongoing work in schools to improve the mathematics teaching, but one cannot see a complete or common plan for the schools neither from the school administration nor the teachers. The preventive measures made to include the low achieving students does have a positive effect for all students. Much of the implemented changes have its origin in talking mathematics in the classroom and not following the textbook as slavishly as previously done.

  • 66.
    Alsharoa, A.
    et al.
    University of Central Florida.
    Ghazzai, Hakim
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Yuksel, M.
    University of Central Florida.
    Kadri, A.
    Qatar Mobility Innovations Center (QMIC), Qatar University.
    Kamal, A. E.
    Iowa State University (ISU), Ames.
    Trajectory optimization for multiple UAVs acting as wireless relays2018In: 2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018 - Proceedings, IEEE, 2018, p. 1-6Conference paper (Refereed)
    Abstract [en]

    This paper proposes a novel wireless relay selection scheme involving multiple mobile Unmanned Aerial Vehicles (UAVs) to support communicating ground users. The goal is to optimize the transmit power levels and trajectories of the relaying UAVs in order to maximize the data rate transmission of the ground users which are suffering from the absence of direct link. Assuming that each UAV is initially characterized by a predefined trajectory for a primary task, we propose to modify it whenever it is needed and the energy and trajectory boundaries constraints allow. We propose to solve this problem using an iterative two steps solution; first, a Mixed Integer Linear Programming (MILP) problem is formulated to optimally determine the users- UAVs associations and the UAVs' corresponding transmit power levels. In the second step, an efficient algorithm based on a recursive shrink-and-realign process is proposed to optimize the UAV trajectories. The performance of the proposed method shows advantages in terms of average throughput compared to the predefined trajectories solution.

  • 67.
    Anderson, Collin
    et al.
    University of Pennsylvania, USA.
    Winter, Philipp
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    -, Roya
    Global Network Interference Detection over the RIPE Atlas Network2014Conference paper (Refereed)
    Abstract [en]

    Existing censorship measurement platforms frequentlysuffer from poor adoption, insufficient geographic coverage, and scalability problems. In order to outline ananalytical framework and data collection needs for futureubiquitous measurements initiatives, we build on top ofthe existent and widely-deployed RIPE Atlas platform.In particular, we propose methods for monitoring thereachability of vital services through an algorithm thatbalances timeliness, diversity, and cost. We then use Atlas to investigate blocking events in Turkey and Russia.Our measurements identify under-examined forms of interference and provide evidence of cooperation betweena well-known blogging platform and government authorities for purposes of blocking hosted content.

  • 68.
    Andersson, Jan-Olof
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Offloading INTCollector Events with P42019Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In-Band Network Telemetry (INT) is a new technique in the area of Software-defined networking (SDN) for monitoring SDN enabled networks. INT monitoring provides fine-grained INT data with less load on the control plane since monitoring is done directly at the data plane. The collected INT data is added as packet headers "In-band" at each INT device along the flow path. The INT data is later composed into telemetry packets which are sent to a collector that is responsible for processing the INT data. The collector of the INT data needs to have good performance since there is a large amount of data that has to be processed quickly. INTCollector, a high performance collector of INT data, is a response to this challenge. The performance of INTCollector is optimized by implementing critical parts in eXpress Data Path (XDP), enabling fast packet processing. INTCollector is, moreover, able to reduce processing of INT data and the need for storage space since it employs a strategy where only important INT data is collected, decided by an internal event detection mechanism.The event detection mechanism in INTCollector can however be offloaded to the INT device itself, with possible perfomance benefits for the collector. Programming Protocol-Independent Packet Processors (P4) opens up this possibility by providing a language for programming network devices. This thesis presents an implementation of INT in P4 with offloaded event detection. We use a programmable P4 testbed to perform an experimental evaluation, which reveal that offloading does indeed benefit INTCollector in terms of performance. Offloading also comes with the advantage of  allowing parameters of the event detection logic at the data plane to be accessible to the control plane.

  • 69.
    Andersson, Jan-Olof
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Larsson, Samuel
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Tobias, Sjöholm
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Implementation of the NEAT Policy Manager2019Report (Refereed)
    Abstract [en]

    The NEAT system was developed in 2017 to increase flexibility in the choice of network transport protocol being used. One of the most important components of the NEAT system is the Policy Manager (PM), which determines what protocol is to be utilized by the application. The PM is written in Python while the rest of the NEAT system is C-based, so a natural evolution of the PM is to perform a functional translation of it to C. While the main goal was solely to develop a fully functional C-based PM, the difference in programming languages in the end also brought a performance increase of 28 times compared with the Python-based PM. There are still a few improvements left to do in the PM, but it is already a notable improvement for the NEAT system as a whole.

  • 70.
    Andersson, Kerstin
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Exact Probability Distribution versus Entropy2014In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 16, no 10, p. 5198-5210Article in journal (Refereed)
    Abstract [en]

    The problem addressed concerns the determination of the average numberof successive attempts of guessing a word of a certain length consisting of letters withgiven probabilities of occurrence. Both first- and second-order approximations to a naturallanguage are considered. The guessing strategy used is guessing words in decreasing orderof probability. When word and alphabet sizes are large, approximations are necessary inorder to estimate the number of guesses. Several kinds of approximations are discusseddemonstrating moderate requirements regarding both memory and central processing unit(CPU) time. When considering realistic sizes of alphabets and words (100), the numberof guesses can be estimated within minutes with reasonable accuracy (a few percent) andmay therefore constitute an alternative to, e.g., various entropy expressions. For manyprobability distributions, the density of the logarithm of probability products is close to anormal distribution. For those cases, it is possible to derive an analytical expression for theaverage number of guesses. The proportion of guesses needed on average compared to thetotal number decreases almost exponentially with the word length. The leading term in anasymptotic expansion can be used to estimate the number of guesses for large word lengths.Comparisons with analytical lower bounds and entropy expressions are also provided.

  • 71.
    Andersson, Martina
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Hur väl uppfyller läroboken lärarnas behov i undervisningen?How well does the textbook fulfill teh teachers´ needs in the teaching?: En studie kring lärarnas syn på läroboken i matematikA study of the teachers´ view on the textbook in mathematics2016Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In the Swedish school the textbook is seen as a central teaching material in mathematics. In many classrooms individual, silent work in the textbook is particularly common during mathematics lessons. Silent work is often a large part of the lesson, although research shows that the teaching of mathematics should include variation and communication and that the pupils should at an early age be given the opportunity to understand the relation between mathematics and daily life.The teacher has a central role in choosing which teaching material are best suited for each teaching situation and each individual pupil. The teacher is also supposed to adapt instruction to individual's ability in a way that enhances the pupil´s curiosity, thus contributing to an increased inner motivation.The aim of this study was to get teachers' perspective on textbooks. In school mathematic the textbook is a common teaching material and because of that there were a questions about how well the textbook actually lives up to the teachers' needs.The chosen method was both qualitative and quantitative. A survey was sent out to mathematics teachers in grade 1-3. A simple survey with a reduced number of predetermined answers was supposed to attract many teachers to answer them. Unfortunately there was low participation among the respondents, which made it difficult to answer the research questions. As a complement a more in-depth survey was sent out to only a few respondents. The two different surveys were coordinated in the analysis.The result showed that teachers in mathematics in year 1-3 often use a textbook. A big part of them believe the textbook is a motivating factor for the pupils, and that younger pupils like to work with their textbook. The results also showed that there is a difference of opinion as to whether or not the textbook itself gives good opportunities to adaptive instruction, as well as concerning. How well it is aligned with their own understanding of the required knowledge goals for class 3. All teachers see their own teaching as varied and that the communicative aspect of the subject is important. The results also showed that the teachers that work without textbooks don't see any advantages with it, except as a help for their own planning.The conclusion is that the textbook is an important teaching material, not least as a support in one's own planning.Teachers in class 1-3 believe themselves to have a varied mathematics pedagogy and also that they have motivated pupils. The teachers agree on the importance to anchor mathematics in daily life since it is always there, around us.

  • 72.
    Andriash, A. V.
    et al.
    All Russia Res Inst Automat VNIIA, Moscow, Russia.
    Bobylev, Alexander V.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Brantov, A. V.
    All Russia Res Inst Automat VNIIA, Moscow, Russia.;RAS, PN Lebedev Phys Inst, Moscow 117901, Russia.
    Bychenkov, V. Yu.
    All Russia Res Inst Automat VNIIA, Moscow, Russia.;RAS, PN Lebedev Phys Inst, Moscow 117901, Russia.
    Karpov, S. A.
    All Russia Res Inst Automat VNIIA, Moscow, Russia.
    Potapenko, I. F.
    RAS, MV Keldysh Appl Math Inst, Moscow 117901, Russia.
    Stochastic simulation of the nonlinear kinetic equation with high-frequency electromagnetic fields2013In: PROBLEMS OF ATOMIC SCIENCE AND TECHNOLOGY, ISSN 1562-6016, no 4, p. 233-237Article in journal (Refereed)
    Abstract [en]

    A general approach to Monte Carlo methods for Coulomb collisions is proposed. Its key idea is an approximation of Landau-Fokker-Planck (LFP) equations by Boltzmann equations of quasi-Maxwellian kind. High-frequency fields are included into consideration and comparison with the well-known results are given.

  • 73.
    Angulo, Julio
    et al.
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Information Systems and Project Management. Karlstad University, Faculty of Arts and Social Sciences (starting 2013), Centre for HumanIT.
    Berthold, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
    Elkhiyaoui, Kaoutar
    EURECOM.
    Fernandez Gago, M. Carmen
    University of Málaga.
    Fischer-Hübner, Simone
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
    David, Nunez
    University of Málaga.
    Pulls, Tobias
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. Karlstad University.
    Reuben, Jenni
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. Karlstad University.
    Van Rompay, Cédric
    EURECOM.
    Santana de Oliveira, Anderson
    SAP Labs.
    Önen, Melek
    EURECOM.
    D:D-5.3 User-Centric Transparency Tools V22015Report (Refereed)
  • 74.
    Antonsson, Linda
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Digitala verktyg i matematiken: En enkätstudie om hur lärare integrerar digitala verktyg i matematikundervisningen2017Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Digital tools are getting increasingly widespread in our everyday lives as well as in school. How-ever, according to the national agency for education in Sweden, digital tools are rarely used to develop the mathematics education. With a survey, I investigated how teachers integrate digital tools in mathematics education and if the teachers’ perceived knowledge affects the integration in some way. With help from the TPACK framework I analyzed the results from 97 respondents. The results showed that teachers who experience good knowledge tend to vary their teaching using digital tools more than teachers who appreciated their skills as inadequate. The most common area of use for digital tools in mathematics is skills training, class review and visual-ization. The study suggests that there is a need for education in how to use digital tools in the education in order to be able to integrate digital tools in a favorable manner.

  • 75.
    Anttila, Pontus
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Mot effektiv identifiering och insamling avbrutna länkar med hjälp av en spindel2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Today, the customer has no automated method for finding and collecting broken links on their website. This is done manually or not at all.

    This project has resulted in a practical product, that can be applied to the customer’s website. The aim of the product is to ease the work when collecting and maintaining broken links on the website. This will be achieved by gathering all broken links effectively, and place them in a separate list that at will can be exported by an administrator who will then fix these broken links.

    The quality of the customer’s website will be higher, as all broken links will be easier to find and remove. This will ultimately give visitors a better experience.

  • 76.
    Anwar, Adnan
    et al.
    UNSW, Canberra, ACT 2600, Australia..
    Mahmood, A. N.
    La Trobe Univ, Bundoora, Vic 3086, Australia..
    Taheri, Javid
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Tari, Zahir
    RMIT Univ, Distributed Syst, Melbourne, Vic 3001, Australia..
    Zomaya, Albert Y.
    Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia..
    HPC-Based Intelligent Volt/VAr Control of Unbalanced Distribution Smart Grid in the Presence of Noise2017In: IEEE Transactions on Smart Grid, ISSN 1949-3053, E-ISSN 1949-3061, Vol. 8, no 3, p. 1446-1459Article in journal (Refereed)
    Abstract [en]

    The performance of Volt/VAr optimization has been significantly improved due to the integration of measurement data obtained from the advanced metering infrastructure of a smart grid. However, most of the existing works lack: 1) realistic unbalanced multi-phase distribution system modeling; 2) scalability of the Volt/VAr algorithm for larger test system; and 3) ability to handle gross errors and noise in data processing. In this paper, we consider realistic distribution system models that include unbalanced loadings and multi-phased feeders and the presence of gross errors such as communication errors and device malfunction, as well as random noise. At the core of the optimization process is an intelligent particle swarm optimization-based technique that is parallelized using high performance computing technique to solve Volt/VAr-based power loss minimization problem. Extensive experiments covering the different aspects of the proposed framework show significant improvement over existing Volt/VAr approaches in terms of both the accuracy and scalability on IEEE 123 node and a larger IEEE 8500 node benchmark test systems.

  • 77. Arcozzi, N
    et al.
    Barza, Sorina
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Garcia-Domingo, J.L.
    Soria, J.
    Hardys inequalities for monotone functions on partly ordered measure spaces2006In: Proc. Roy. Soc. Edingburgh Sect. A, 136 (2006), no.5Article in journal (Refereed)
  • 78.
    Artale Harris, Pietro
    et al.
    Università di Roma La Sapienza.
    Cirillo, Emilio N.M
    Università di Roma La Sapienza.
    Muntean, Adrian
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. Eindhoven University of Technology.
    Weak solutions to Allen-Cahn-like equations modelling consolidation of porous media2017In: IMA Journal of Applied Mathematics, ISSN 0272-4960, E-ISSN 1464-3634, Vol. 82, no 1, p. 224-250Article in journal (Refereed)
    Abstract [en]

    We study the weak solvability of a system of coupled Allen–Cahn-like equations resembling cross-diffusion which arises as a model for the consolidation of saturated porous media. Besides using energy-like estimates, we cast the special structure of the system in the framework of the Leray–Schauder fixed-point principle and ensure in this way the local existence of strong solutions to a regularized version of our system. Furthermore, weak convergence techniques ensure the existence of weak solutions to the original consolidation problem. The uniqueness of global-in-time solutions is guaranteed in a particular case. Moreover, we use a finite difference scheme to show the negativity of the vector of solutions.

  • 79.
    Arvidsson, Andreas
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Andreasson, Anders
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Distributed computing for the public transit domain2013Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
  • 80.
    Arvidsson, Jonas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Utvärdering av containerbaserad virtualisering för telekomsignalering2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    New and innovative technologies to improve the techniques that are already being used are constantly developing. This project was about evaluating if containers could be something for the IT company Tieto to use on their products in telecommunications. Container are portable, standalone, executable lightweight packages of software that also contains all it needs to run the software. Containers are a very hot topic right now and are a fast-growing technology. Tieto wanted an investigation of the technology and it would be carried out with certain requirements where the main requirement was to have a working and executable protocol stack in a container environment. In the investigation, a proof of concept was developed, proof of concept is a realization of a certain method or idea in order to demonstrate its feasibility. The proof of concept led to Tieto wanting additional experiments carried out on containers. The experiments investigated if equal performance could be achieved with containers compared to the method with virtual machine used by Tieto today. The experiment observed a small performance reduction of efficiency, but it also showed benefits such as higher flexibility. Further development of the container method could provide a just as good and equitable solution. The project can therefore be seen as successful whereas the proof of concept developed, and experiments carried out both points to that this new technology will be part of Tieto's product development in the future.

  • 81.
    Arvidsson, Åke
    et al.
    Kristianstad University, Kristianstad, Sweden..
    Grinnemo, Karl-Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Chen, Eric
    Kristianstad University, Kristianstad, Sweden..
    Qinghua, Wang
    Kristianstad University, Kristianstad, Sweden..
    Brunström, Anna
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT. Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Web metrics for the next generation performance enhancing proxies2019In: 2019 International Conference on Software, Telecommunications and Computer Networks (SoftCOM), IEEE, 2019Conference paper (Refereed)
    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).

  • 82. Aspinall, David
    et al.
    Camenisch, JanHansen, MaritFischer-Hübner, SimoneKarlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).Raab, Charles
    Privacy and Identity Management – Time for a Revolution?: 10th IFIP WG 9.2, 9.5, 9.6/11.7, 11.4, 11.6/SIG 9.2.2 International Summer School, Edinburgh, UK, August 16-21, 2015, Revised Selected Papers2016Collection (editor) (Refereed)
  • 83.
    Atxutegi, Eneko
    et al.
    University of the Basque Country, Spain.
    Grinnemo, Karl-Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (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
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    On the move with TCP in current and future mobile networks2017In: 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, p. 66-72Conference paper (Refereed)
    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.

  • 84.
    Atxutegi, Eneko
    et al.
    University of the Basque Country.
    Liberal, Fidel
    University of the Basque Country.
    Grinnemo, Karl-Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT. Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Arvidsson, Åke
    Kristianstad University.
    TCP Performance over Current Cellular Access: A Comprehensive Analysis2018In: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms and Tools / [ed] Ivan Ganchev, R. D. van der Mei, Hans van den Berg, Cham: Springer, 2018, p. 371-400Chapter in book (Refereed)
    Abstract [en]

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

  • 85.
    Atxutegi, Eneko
    et al.
    University of the Basque Country.
    Liberal, Fidel
    University of the Basque Country.
    Grinnemo, Karl-Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Arvidsson, Åke
    Kristianstad University.
    Robert, Remi
    Ericsson AB.
    TCP behaviour in LTE: impact of flow start-up and mobility2016In: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP, IEEE, 2016, p. 73-80Conference paper (Refereed)
    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. 

  • 86.
    Atxutegi, Eneko
    et al.
    University of the Basque Country, Spain.
    Liberal, Fidel
    University of the Basque Country, Spain.
    Haile, Habtegebreil Kassaye
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Grinnemo, Karl-Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Arvidsson, Åke
    Kristianstad University, Sweden.
    On the use of TCP BBR in cellular networks2018In: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, no 3, p. 172-179Article in journal (Refereed)
    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. 

  • 87.
    Axelsson, Kajsa
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    "I slutet av varje dag förstår alla elever matematiken": En kvalitativ studie om matematiklärares syn på barn i behov av särskilt stöd i Kenya2014Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The purpose of the study was to find out how teachers in a school in Kenya conducted the education of mathematics in standard 4-6. The focus was how the teachers worked with children in need of special support in mathematics.To find out the purpose a case study was made with two interviews and seven observations with four teachers on a rural school in Kenya. The following issues were: Which standards were there in the classrooms during lessons in mathematics in Kenya? How did the teachers express the view of children in need of special support? The main conclusion was that different teachers teaching in mathematics looked the same.The teacher was standing in front of the blackboard where the teaching occurred and the pupils were sitting lined up in their benches. The teaching of the pupils was about repetition and imitates the teacher and mostly filling the gap that the teacher made them say. Pupils in need of special support got their help through extra lessons and homework but the teachers thought that it was hard to help every child when there was only one teacher in the classroom.

  • 88.
    Baba, Srinath
    et al.
    Champlain College.
    Granath, Håkan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Quaternionic modular forms and exceptional sets of hypergeometric functions2015In: International Journal of Number Theory, ISSN 1793-0421, Vol. 11, no 2, p. 631-643Article in journal (Refereed)
    Abstract [en]

    We determine the exceptional sets of hypergeometric functions corresponding to the(2, 4, 6) triangle group by relating them to values of certain quaternionic modular formsat CM points. We prove a result on the number fields generated by exceptional values, and by using modular polynomials we explicitly compute some examples.

  • 89.
    Bajpai, Vaibhav
    et al.
    Technical University of Munich, Germany.
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Feldmann, Anja
    Max Planck Society, Germany.
    Kellerer, Wolfgang
    Technical University of Munich, Germany.
    Pras, Aiko
    University of Twente, Netherlands .
    Schulzrinne, Henning
    Columbia University, USA.
    Smaragdakis, Georgios
    Technical University of Berlin, Germany.
    Waehlisch, Matthias
    Free University of Berlin, Germany.
    Wehrle, Klaus
    RWTH Aachen University, Germany .
    The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research2019In: Computer communication review, ISSN 0146-4833, E-ISSN 1943-5819, Vol. 49, no 1, p. 24-30Article in journal (Other academic)
    Abstract [en]

    Reproducibility is one of the key characteristics of good science, but hard to achieve for experimental disciplines like Internet measurements and networked systems. This guide provides advice to researchers, particularly those new to the field, on designing experiments so that their work is more likely to be reproducible and to serve as a foundation for follow-on work by others.

  • 90.
    Barros, B M
    et al.
    University of São Paulo.
    Iwaya, L H
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Simplício, M A
    Carvalho, T C M B
    Méhes, A
    Ericsson Research.
    Näslund, M
    Ericsson Research.
    Classifying Security Threats in Cloud Networking2015In: Proceedings of the 5th International Conference on Cloud Computing and Services Science / [ed] Markus Helfert, Donald Ferguson and Víctor Méndez Muñoz, SciTePress , 2015, p. 214-220Conference paper (Refereed)
    Abstract [en]

    A central component of managing risks in cloud computing is to understand the nature of security threats. The relevance of security concerns are evidenced by the efforts from both the academic community and technological organizations such as NIST, ENISA and CSA, to investigate security threats and vulnerabilities related to cloud systems. Provisioning secure virtual networks (SVNs) in a multi-tenant environment is a fundamental aspect to ensure trust in public cloud systems and to encourage their adoption. However, comparing existing SVN-oriented solutions is a difficult task due to the lack of studies summarizing the main concerns of network virtualization and providing a comprehensive list of threats those solutions should cover. To address this issue, this paper presents a threat classification for cloud networking, describing threat categories and attack scenarios that should be taken into account when designing, comparing, or categorizing solutions. The classification is based o n the CSA threat report, building upon studies and surveys from the specialized literature to extend the CSA list of threats and to allow a more detailed analysis of cloud network virtualization issues.

  • 91.
    Barza, Sorina
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    A remarkable description of a constant of Muckenhoupt type in a case of multidimensional integral inequalities1997In: A remarkable description of a constant of Muckenhoupt type in a cse of multidimensional integral inequalities / [ed] Anna Klisinka, Lars-Erik Persson, Luleå: Luleå tekniska universitet, 1997Conference paper (Other academic)
  • 92.
    Barza, Sorina
    et al.
    Karlstad University, Faculty of Technology and Science, Department of Mathematics.
    Lind, Martin
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    A new variational characterization of Sobolev spaces2015In: Journal of Geometric Analysis, ISSN 1050-6926, E-ISSN 1559-002X, Vol. 25, no 4, p. 2185-2195Article in journal (Refereed)
    Abstract [en]

    We obtain a new variational characterization of the Sobolev space $W_p^1(\Omega)$ (where $\Omega\subseteq\R^n$ and $p>n$). This is a generalization of a classical result of F. Riesz. We also consider some related results.

  • 93.
    Barza, Sorina
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Marcoci, Anca N.
    Department of Mathematics and Computer Science, Technical University of Civil Engineering Bucharest, Romania.
    Marcoci, Liviu G.
    Department of Mathematics and Computer Science, Technical University of Civil Engineering Bucharest, Romania.
    Factorizations of Weighted Hardy Inequalities2018In: Bulletin of the Brazilian Mathematical Society, ISSN 1678-7544, E-ISSN 1678-7714, Vol. 49, no 4, p. 915-932Article in journal (Refereed)
    Abstract [en]

    We present factorizations of weighted Lebesgue, Cesàro and Copson spaces, for weights satisfying the conditions which assure the boundedness of the Hardy’s integral operator between weighted Lebesgue spaces. Our results enhance, among other, the best known forms of weighted Hardy inequalities.

  • 94.
    Barza, Sorina
    et al.
    Karlstad University, Faculty of Technology and Science, Department of Mathematics. Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Marcoci, Anca Nicoleta
    Technical University of Civil Engineering Bucharest, Department of Mathematics and Computer Science, Bucharest, Romania.
    Marcoci, Liviu Gabriel
    Technical University of Civil Engineering Bucharest, Department of Mathematics and Computer Science, Bucharest, Romania.
    Persson, Lars-Erik
    Luleå University of Technology, Department of Mathematics.
    Optimal estimates in Lorentz spaces of sequences with an increasing weight2013In: Proceedings of the Romanian Academy. Series A Mathematics, Physics, Technical Sciences, Information Science, ISSN 1454-9069, Vol. 14, no 1, p. 20-27Article in journal (Refereed)
  • 95.
    Barza, Sorina
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Pecaric, Josep
    Persson, Lars-Erik
    Carlson type inequalities1998In: Journal of inequalities and applications (Print), ISSN 1025-5834, E-ISSN 1029-242X, Vol. 2, no 2, p. 121-135Article in journal (Refereed)
  • 96.
    Barza, Sorina
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Persson, Lars-Erik
    Luleå tekniska universitet.
    Some new sharp limit Hardy-type  inequalities via convexity2014In: Journal of inequalities and applications (Print), ISSN 1025-5834, E-ISSN 1029-242X, no 6Article in journal (Refereed)
    Abstract [en]

    Some new limit cases of Hardy-type inequalities are proved, discussed and compared. In particular, some new refinements of Bennett’s inequalities are proved. Each of these refined inequalities contain two constants, and both constants are in fact sharp. The technique in the proofs is new and based on some convexity arguments of independent interest.

  • 97.
    Barza, Sorina
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Silvestre, Pilar
    Department of Mathematics and Systems Analysis, Aalto University, Finland.
    Functions of bounded second p-variation2014In: Revista Matemática Complutense, ISSN 1139-1138, E-ISSN 1988-2807, Vol. 27, p. 69-91Article in journal (Refereed)
    Abstract [en]

    The generalized functionals of Merentes type generate a scale of spaces connecting the class of functions of bounded second p -variation with the Sobolev space of functions with p-integrable second derivative. We prove some limiting relations for these functionals as well as sharp estimates in terms of the fractional modulus of order 2−1/p . These results extend the results in Lind (Math Inequal Appl 16:2139, 2013) for functions of bounded variation but are not consequence of the last.

  • 98. Bauschert, Thomas
    et al.
    D’Andreagiovanni, Fabio
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Wang, Chenghao
    A matheuristic for green and robust 5G virtual network function placement2019In: Applications of Evolutionary Computation / [ed] Paul Kaufmann, Pedro A. Castillo, Cham: Springer, 2019, p. 430-438Conference paper (Refereed)
    Abstract [en]

    We investigate the problem of optimally placing virtual network functions in 5G-based virtualized infrastructures according to a green paradigm that pursues energy-efficiency. This optimization problem can be modelled as an articulated 0-1 Linear Program based on a flow model. Since the problem can prove hard to be solved by a state-of-the-art optimization software, even for instances of moderate size, we propose a new fast matheuristic for its solution. Preliminary computational tests on a set of realistic instances return encouraging results, showing that our algorithm can find better solutions in considerably less time than a state-of-the-art solver.

  • 99.
    Beckerle, Matthias
    et al.
    Technische Universität Darmstadt,, Germany.
    Martucci, Leonardo
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Formal Definitions for Usable Access Control Rule Sets: From Goals to Metrics2013In: Proceedings of the Ninth Symposium on Usable Privacy and Security, Association for Computing Machinery (ACM), 2013, p. 2:1-2:11Conference paper (Refereed)
    Abstract [en]

    Access control policies describe high level requirements for access control systems. Access control rule sets ideally trans-late these policies into a coherent and manageable collectionof Allow/Deny rules. Designing rule sets that reflect desired policies is a difficult and time-consuming task. The result is that rule sets are difficult to understand and manage. The goal of this paper is to provide means for obtaining usable access control rule sets, which we define as rule sets that (i) reflect the access control policy and (ii) are easy to understand and manage. In this paper, we formally define the challenges that users face when generating usable access control rule sets and provide formal tools to handle them more easily. We started our research with a pilot study in which specialists were interviewed. The objective was to list usability challenges regarding the management of access control rule sets and verify how those challenges were handled by specialists. The results of the pilot study were compared and combined with results from related work and refined into six novel, formally defined metrics that are used to measure the security and usability aspects of access control rule sets. We validated our findings with two user studies, which demonstrate that our metrics help users generate statistically significant better rule sets.

  • 100.
    Beckman, Claes
    et al.
    KTH, Center for Wireless Systems.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    On the Impact of Velocity on the Train-to-Earth MIMO Propagation Channel: Statistical Observations and Qualitative Analysis2017In: 2017 IEEE International Symposium on Antennas and Propagation & USNC/URSI National Radio Science Meeting, IEEE, 2017, p. 1865-1866Conference paper (Refereed)
    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.

1234567 51 - 100 of 884
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf