Endre søk
Begrens søket
1234567 51 - 100 of 938
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • 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.
  • 51.
    Alaqra, Alaa
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Tinkering the Wicked Problem of Privacy: Design Challenges and Opportunities for Crypto-based Services2020Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Data privacy has been growing in importance in recent years, especially with the constant increase of online activity. Consequently, researchers study, design, and develop solutions aimed at enhancing users' data privacy. The wicked problem of data privacy is a dynamic challenge that defies straightforward solutions. Since there are many factors involved in data privacy, such as technological, legal, and human aspects, we can only aim at mitigating rather than solving this wicked problem.

    Our aim was to explore challenges and opportunities with a focus on human aspects for designing usable crypto-based privacy-enhancing technologies (PETs). Mainly, there were three PETs in the cloud context included in our studies: malleable signatures, secret sharing, and homomorphic encryption. Based on the three PETs, services were developed within European research projects that were the scope of our user studies. We followed a user-centered design approach by using empirical qualitative and quantitative means for collecting study data. Our results and tinkering conveyed (i) analysis of different categories of user's perspectives, mental models, and trade-offs, (ii) user requirements for PET services, and (iii) user interface design guidelines for PET services. In our contributions, we highlight considerations and guidelines for supporting the design of future solutions.

  • 52.
    Alaqra, Alaa
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Fischer-Hübner, Simone
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Framner, Erik
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Enhancing Privacy Controls for Patients via a Selective Authentic Electronic Health Record Exchange Service: Qualitative Study of Perspectives by Medical Professionals and Patients2018Inngår i: Journal of Medical Internet Research, ISSN 1438-8871, E-ISSN 1438-8871, Vol. 20, nr 12, artikkel-id e10954Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Background: Patients' privacy is regarded as essential for the patient-doctor relationship. One example of a privacy-enhancing technology for user-controlled data minimization on content level is a redactable signature. It enables users to redact personal information from signed documents while preserving the validity of the signature, and thus the authenticity of the document. In this study, we present end users' evaluations of a Cloud-based selective authentic electronic health record (EHR) exchange service (SAE-service) in an electronic health use case. In the use case scenario, patients were given control to redact specified information fields in their EHR, which were signed by their doctors with a redactable signature and transferred to them into a Cloud platform. They can then selectively disclose the remaining information in the EHR, which still bears the valid digital signature, to third parties of their choice. Objective: This study aimed to explore the perceptions, attitudes, and mental models concerning the SAE-service of 2 user roles: signers (medical professionals) and redactors (patients with different technical knowledge) in Germany and Sweden. Another objective was to elicit usability requirements for this service based on the analysis of our investigation. Methods: We chose empirical qualitative methods to address our research objective. Designs of mock-ups for the service were used as part of our user-centered design approach in our studies with test participants from Germany and Sweden. A total of 13 individual walk-throughs or interviews were conducted with medical staff to investigate the EHR signers' perspectives. Moreover, 5 group walk-throughs in focus groups sessions with (N=32) prospective patients with different technical knowledge to investigate redactor's perspective of EHR data redaction control were used. Results: We found that our study participants had correct mental models with regard to the redaction process. Users with some technical models lacked trust in the validity of the doctor's signature on the redacted documents. Main results to be considered are the requirements concerning the accountability of the patients' redactions and the design of redaction templates for guidance and control. Conclusions: For the SAE-service to be means for enhancing patient control and privacy, the diverse usability and trust factors of different user groups should be considered.

  • 53.
    Alaqra, Ala(a)
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Fischer-Hübner, Simone
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Groß, Thomas
    Newcastle University, UK.
    Lorünser, Thomas
    Austrian Institute of Technology, Austria.
    Slamanig, Daniel
    Graz University of Technology, Austria.
    Signatures for Privacy, Trust and Accountability in the Cloud: Applications and Requirements2015Inngår i: 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 Papers / [ed] David Aspinall, Jan Camenisch, Marit Hansen, Simone Fischer-Hübner, Charles Raab, Springer Publishing Company, 2015, Vol. 476, s. 79-96Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper summarises the results of a workshop at the IFIP Summer School 2015 introducing the EU Horizon 2020 project PRISMACLOUD, that is, Privacy and Security Maintaining Services in the Cloud. The contributions of this summary are three-fold. Firstly, it provides an overview to the PRISMACLOUD cryptographic tools and use-case scenarios that were presented as part of this workshop. Secondly, it distills the discussion results of parallel focus groups. Thirdly, it summarises a ``Deep Dive on Crypto'' session that offered technical information on the new tools. Overall, the workshop aimed at outlining application scenarios and eliciting end-user requirements for PRISMACLOUD.

  • 54.
    Alaqra, Alaa
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Fischer-Hübner, Simone
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Pettersson, John
    Karlstads universitet, Fakulteten för humaniora och samhällsvetenskap (from 2013), Centrum för HumanIT (from 2013).
    Wästlund, Erik
    Karlstads universitet, Fakulteten för humaniora och samhällsvetenskap (from 2013), Centrum för tjänsteforskning (from 2013).
    Stakeholders’ Perspectives on Malleable Signatures in a Cloud-based eHealth Scenario2016Inngår i: Proceedings of the International Symposium on Human Aspects of Information Security & Assurance / [ed] Nathan Clarke & Steven Furnell, 2016, s. 220-230Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper, we discuss end user requirements that we elicited for the use of malleable signatures in a Cloud-based eHealth scenario. The concept of a malleable signature, which is a privacy enhancing cryptographic scheme that enables the redaction of personal information from signed documents while preserving the validity of the signature, might be counter- intuitive to end users as its functionality does not correspond to the one of a traditional signature scheme. A qualitative study via a series of semi-structured interviews and focus groups has been conducted to understand stakeholders’ opinions and concerns in regards to the possible applications of malleable signatures in the eHealth area, where a medical record is first digitally signed by a doctor and later redacted by the patient in the cloud. Results from this study yielded user requirements such as the need for suitable metaphors and guidelines, usable templates, and clear redaction policies. 

  • 55.
    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.

  • 56.
    Alay, Özgü
    et al.
    Simula Research Laboratory, Norway.
    Lutu, Andra
    Simula Research Laboratory, Norway.
    Peón-Quirós, Miguel
    IMDEA Networks Institute, Spain.
    Mancuso, Vincenzo
    IMDEA Networks Institute, Spain.
    Hirsch, Thomas
    Celerway Communications, Norway.
    Evensen, Kristian
    Celerway Communications, Norway.
    Hansen, Audun
    Celerway Communications, 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
    IMDEA Networks Institute, Spain and Politecnico di Torino, Italy.
    Experience: An open platform for experimentation with commercial mobile broadband networks2017Inngår i: MobiCom '17 Proceedings of the 23rd Annual International Conference on Mobile Computing and Networking, New York: Association for Computing Machinery (ACM), 2017, s. 70-78Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Open experimentation with operational Mobile Broadband (MBB) networks in the wild is currently a fundamental requirement of the research community in its endeavor to address the need of innovative solutions for mobile communications. Even more, there is a strong need for objective data about stability and performance of MBB (e.g., 3G/4G) networks, and for tools that rigorously and scientifically assess their status. In this paper, we introduce the MONROE measurement platform: an open access and flexible hardware-based platform for measurements and custom experimentation on operational MBB networks. The MONROE platform enables accurate, realistic and meaningful assessment of the performance and reliability of 11 MBB networks in Europe. We report on our experience designing, implementing and testing the solution we propose for the platform. We detail the challenges we overcame while building and testing the MONROE testbed and argue our design and implementation choices accordingly. We describe and exemplify the capabilities of the platform and the wide variety of experiments that external users already perform using the system

  • 57.
    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, 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.

  • 58.
    Aldaz, J. M.
    et al.
    Univ Autonoma Madrid, ICMAT, E-28049 Madrid, Spain.;Univ Autonoma Madrid, Dept Matemat, E-28049 Madrid, Spain..
    Barza, Sorina
    Karlstads universitet, Fakulteten för teknik- och naturvetenskap, Avdelningen för matematik.
    Fujii, M.
    Osaka Kyoiku Univ, Dept Math, Kashiwara, Osaka 5828582, Japan..
    Moslehian, Mohammad Sal
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Advances in Operator Cauchy-Schwarz Inequalities and their Reverses2015Inngår i: Annals of Functional Analysis, ISSN 2008-8752, E-ISSN 2008-8752, Vol. 6, nr 3, s. 275-295Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The Cauchy-Schwarz (C-S) inequality is one of the most famous inequalities in mathematics. In this survey article, we first give a brief history of the inequality. Afterward, we present the C-S inequality for inner product spaces. Focusing on operator inequalities, we then review some significant recent developments of the C-S inequality and its reverses for Hilbert space operators and elements of Hilbert C*-modules. In particular, we pay special attention to an operator Wielandt inequality.

  • 59.
    Alfredsson, Stefan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    A Case Study of Recent Mifare Classic Field Deployments From an (In-)Security Perspective2013Inngår i: Proceedings of the 21st International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2013), Split, Croatia: FESB, University of Split , 2013Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Mifare Classic is a very popular near-field communication technology that provides a shared-key, access-controlled, storage. Although the authentication protocol of Mifare Classic is compromised since half a decade, systems are still being deployed based on this technology, e.g. for access control systems and for public transport ticketing. By using commodity hardware, such as NFC enabled smartphones, by passing the security measures in some cases only require the installation and operation of a smartphone app. To this end, we present case studies of a number of recent Mifare Classic systems deployed during the last year, to serve as an illustration of practical security problems and to raise awareness thereof among NFC technology buyers and system implementors.

  • 60.
    Alfredsson, Stefan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Del Giudice, Giacomo
    Politecnico di Bari, Italy.
    Garcia, Johan
    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.
    De Cicco, Luca
    Ecole superieure d'Electricite, France; Politecnico di Bari, Italy.
    Mascolo, Saverio
    Politecnico di Bari, Italy.
    Impact of TCP Congestion Control on Bufferbloat in Cellular Networks2013Inngår i: Proceedings of the 14th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM 2013) / [ed] Angelos Lazaris, Balaji Rengarajan, IEEE Press, 2013Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. One important network scenario where bufferbloat may occur is cellular networks.

    This paper investigates the interaction between TCP congestion control and buffering in cellular networks. Extensive measurements have been performed in commercial 3G, 3.5G and 4G cellular networks, with a mix of long and short TCP flows using the CUBIC, NewReno and Westwood+ congestion control algorithms. The results show that the completion times of short flows increase significantly when concurrent long flow traffic is introduced. This is caused by increased buffer occupancy from the long flows. In addition, for 3G and 3.5G the completion times are shown to depend significantly on the congestion control algorithms used for the background flows, with CUBIC leading to significantly larger completion times.

  • 61.
    Alfredsson, Stefan
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Del Giudice, Giacomo
    Politecnico di Bari, Italy.
    Garcia, Johan
    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.
    De Cicco, Luca
    Ecole superieure d'Electricite, France; Politecnico di Bari, Italy.
    Mascolo, Saverio
    Politecnico di Bari, Italy.
    Observations of Bufferbloat in Swedish Cellular Networks2013Inngår i: Proceedings of the 9th Swedish National Computer Networking Workshop (SNCNW 2013) / [ed] Bengt Ahlgren, 2013Konferansepaper (Fagfellevurdert)
  • 62.
    Al-Grety, Sheima
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Tid och klockan i läromedel: En läromedelsanalys med fokus på de matematiska förmågorna och representationsformer2019Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    The purpose of the study was to analyse time and clock and its progression in textbooks, for grades 4–6. The study also aimed, based on tasks linked to clock and time, to analyse which representation forms and mathematical competencies are trained in the selected textbooks. To studying as well as analysing different mathematics teaching textbooks, a document and textbook analysis was used to build up the approach for the study.

    The results of the study showed that in the selected teaching materials, a mixture of the forms of representation, however, often lacked a concrete model. Concrete model existed in a few single tasks. The study's results also show that students are given the opportunity to practice the five mathematical skills but to varying extents. Communication and reasoning ability are the skills that are least trained in teaching materials.

    The conclusion that can be drawn is that the role of teachers in the use of teaching materials in mathematics is of great im-portance because certain abilities are highlighted more in the workbook. The use of different representations might help the student to get good knowledge about time and the clock. Another conclusion is that the reasoning ability and communication skills need to be lifted more, so that students can learn to reason and communicate with each other.

  • 63.
    Ali, Nour
    et al.
    Brunel University, London, UK.
    Baker, Sean
    University of Limerick, Ireland.
    O’Crowley, Ross
    Red Orkid Limited, Dublin, Ireland.
    Herold, Sebastian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Buckley, Jim
    University of Limerick, Ireland.
    Architecture consistency: State of the practice, challenges and requirements2018Inngår i: Journal of Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 23, nr 1, s. 224-258Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Architecture Consistency (AC) aims to align implemented systems with their intended architectures. Several AC approaches and tools have been proposed and empirically evaluated, suggesting favourable results. In this paper, we empirically examine the state of practice with respect to Architecture Consistency, through interviews with nineteen experienced software engineers. Our goal is to identify 1) any practises that the companies these architects work for, currently undertake to achieve AC; 2) any barriers to undertaking explicit AC approaches in these companies; 3) software development situations where practitioners perceive AC approaches would be useful, and 4) AC tool needs, as perceived by practitioners. We also assess current commercial AC tool offerings in terms of these perceived needs. The study reveals that many practitioners apply informal AC approaches as there are barriers for adopting more formal and explicit approaches. These barriers are: 1) Difficulty in quantifying architectural inconsistency effects, and thus justifying the allocation of resources to fix them to senior management, 2) The near invisibility of architectural inconsistency to customers, 3) Practitioners’ reluctance towards fixing architectural inconsistencies, and 4) Practitioners perception that huge effort is required to map the system to the architecture when using more formal AC approaches and tools. Practitioners still believe that AC would be useful in supporting several of the software development activities such as auditing, evolution and ensuring quality attributes. After reviewing several commercial tools, we posit that AC tool vendors need to work on their ability to support analysis of systems made up of different technologies, that AC tools need to enhance their capabilities with respect to artefacts such as services and meta-data, and to focus more on non-maintainability architectural concerns.

  • 64.
    Ali, Nour
    et al.
    Brunel University, London, UK.
    Baker, Sean
    University of Limerick, Ireland.
    O'Crowley, Ross
    Red Orkid Limited, Dublin, Ireland.
    Herold, Sebastian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Buckley, Jim
    University of Limerick, Ireland.
    Architecture consistency: State of the practice, challenges and requirements (vol 23, pg 224, 2018)2018Inngår i: Journal of Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 23, nr 3, s. 1868-1869Artikkel i tidsskrift (Fagfellevurdert)
  • 65.
    Alizadeh, 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 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).
    Reconfiguration of Service Function Chains: Trade-off between Optimality and Effort2019Inngår i: Proceedings of the 30th European conference on operational research, Euro 2019, 23-26 June, Dublin, Ireland., 2019Konferansepaper (Fagfellevurdert)
  • 66.
    Alizadeh Noghani, Kyoomars
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Service Migration in Virtualized Data Centers2020Doktoravhandling, med artikler (Annet vitenskapelig)
    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.

  • 67.
    Alizadeh Noghani, Kyoomars
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Towards Seamless Live Migration in SDN-Based Data Centers2018Licentiatavhandling, med artikler (Annet vitenskapelig)
    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.

  • 68.
    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).
    Ghazzai, Hakim
    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).
    A Generic Framework for Task Offloading in mmWave MEC Backhaul Networks2018Inngår i: 2018 IEEE Global Communications Conference (GLOBECOM), IEEE, 2018, s. 1-7Konferansepaper (Fagfellevurdert)
    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.

  • 69.
    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).
    Hernandez Benet, Cristian
    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).
    Marotta, Antonio
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Jestin, Patrick
    Ericsson AB, Sweden.
    Srivastava, Vivek V.
    Ericsson AB, Sweden.
    Automating Ethernet VPN deployment in SDN-based Data Centers2017Inngår i: 2017 Fourth International Conference on Software Defined Systems (SDS)., IEEE, 2017, s. 61-66Konferansepaper (Fagfellevurdert)
    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.

  • 70.
    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).
    Hernandez Benet, Cristian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    SDN helps volume in Big Data2018Inngår i: Big Data and Software Defined Networks / [ed] Javid Taheri, London: IET Digital Library, 2018, 1, s. 185-206Kapittel i bok, del av antologi (Fagfellevurdert)
    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.

  • 71.
    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.

  • 72.
    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).
    Sankar Gopannan, Prem
    Ericsson, USA.
    EVPN/SDN Assisted Live VM Migration between Geo-Distributed Data Centers2018Inngår i: 4th IEEE Conference on Network Softwarization (NetSoft), IEEE, 2018, s. 105-113Konferansepaper (Fagfellevurdert)
    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.

  • 73.
    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).
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    On the Cost-Optimality Trade-off for Service Function Chain Reconfiguration2019Konferansepaper (Fagfellevurdert)
    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.

  • 74.
    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).
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Öhlen, Peter
    Ericsson AB.
    Curescu, Calin
    Ericsson AB.
    On the Cost-Optimality Trade-off for Fast Service Function Chain ReconfigurationManuskript (preprint) (Annet vitenskapelig)
    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.

  • 75.
    Aljinovic, Andrea Aglic
    et al.
    University of Zagreb, Croatia.
    Peric, Ivan
    University of Zagreb, Croatia.
    Persson, Lars-Erik
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Josip Pecaric- and his life in mathematics and politics2019Inngår i: Mathematical Inequalities & Applications, ISSN 1331-4343, E-ISSN 1848-9966, Vol. 22, nr 4, s. 1067-1080Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 76.
    Alm, Anton
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Internet of Things mesh network: Using the Thread networking protocol2019Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    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.

  • 77.
    Almani, T.
    et al.
    Austin, USA.
    Kumar, Kundan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (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 medium2019Inngår i: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 78, nr 8, s. 2682-2699Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 78.
    Almani, T.
    et al.
    Saudi Arabian Oil Company (Aramco), Saudi Arabia.
    Manea, A.
    Saudi Arabian Oil Company (Aramco), Saudi Arabia.
    Kumar, Kundan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (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 media2019Inngår i: Computational Geosciences, ISSN 1420-0597, E-ISSN 1573-1499Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 79.
    Almqvist, Ylva
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    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 poäng / 15 hpOppgave
    Abstract [sv]

    I den här studien vill jag belysa hur lärare beskriver prevention och intervention, alltså deras förebyggande och ingripande agerande när det gäller undervisningen av elever som presterar lågt i matematik. Det är en kvalitativ studie som bygger på en serie gruppintervjuer av lärare i grundskolan. Det finns fortfarande en traditionellt kompensatoriskt syn på eleverna hos matematiklärarna och de är ofta av uppfattningen att det behövs specialpedagogik för att alla ska få ett godkänt betyg i matematik. I och med fortbildning, främst genom matematiklyftet, har inställningen till att klara av att inkludera elever som presterar lågt i matematik på ett bra sätt dock ökat. Arbetet i skolorna pågår för att förbättra matematikundervisningen men man ser sällan en övergripande gemensam plan från skolans eller lärarnas sida. Det arbete lärarna bedriver preventivt för att kunna inkludera de elever som presterar lågt har en positiv effekt på alla elever. Mycket av förändringen ligger i att lärare och elever talar mer matematik och inte följer läroboken lika slaviskt som tidigare.

  • 80.
    Alsharoa, A.
    et al.
    University of Central Florida.
    Ghazzai, Hakim
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (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 relays2018Inngår i: 2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018 - Proceedings, IEEE, 2018, s. 1-6Konferansepaper (Fagfellevurdert)
    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.

  • 81. Amend, Markus
    et al.
    Bogenfeld, Eckard
    Cvjetkovic, Milan
    Rakocevic, Veselin
    Pieska, Marcus
    Kassler, Andreas
    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).
    Brunstrom, Anna
    A Framework for Multiaccess Support for Unreliable Internet Traffic Using Multipath DCCP2019Inngår i: Proceedings of the 44th IEEE Conference on Local Computer Networks (LCN), October 14-17, 2019, Osnabrück, Germany, IEEE Communications Society, 2019Konferansepaper (Fagfellevurdert)
  • 82.
    Anderson, Collin
    et al.
    University of Pennsylvania, USA.
    Winter, Philipp
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    -, Roya
    Global Network Interference Detection over the RIPE Atlas Network2014Konferansepaper (Fagfellevurdert)
    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.

  • 83.
    Andersson, Jan-Olof
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Offloading INTCollector Events with P42019Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    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.

  • 84.
    Andersson, Jan-Olof
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Larsson, Samuel
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Tobias, Sjöholm
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Implementation of the NEAT Policy Manager2019Rapport (Fagfellevurdert)
    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.

  • 85.
    Andersson, Kerstin
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Exact Probability Distribution versus Entropy2014Inngår i: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 16, nr 10, s. 5198-5210Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 86.
    Andersson, Kerstin
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    The electronic spectrum of C602020Inngår i: Chemical Physics Letters, ISSN 0009-2614, E-ISSN 1873-4448, Vol. 739, s. 1-5, artikkel-id 136976Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Using the CASSCF/CASPT2 methodology the electronic transitions HOMO → LUMO, HOMO → LUMO+1, HOMO-1 → LUMO and HOMO-2 → LUMO are determined for C60.Comparison to experiment suggests an accuracy better than 0.3 eV. Some illustrative examples are (with experimental data within parentheses) the first excited state, 3T2g, at 1.54 eV (1.60 eV), the two lowest-lying 1T1u states (for spin- and symmetry-allowed transitions) at 3.09 eV (3.08 eV) and 3.19 eV (3.30 eV) and the lowest singlet excited states (1Gg, 1T1g, 1T2g , 1Hg) at [1.84, 1.95] eV (1.90 eV with mainly 1Gg and 1T1g and minor 1T2g character).

  • 87.
    Andersson, Martina
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    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 poäng / 30 hpOppgave
    Abstract [sv]

    I den svenska skolan ses läroboken som ett centralt läromedel i ämnet matematik. I många klassrum råder ett individuellt och tyst arbete i läroboken under just matematiklektionerna. Den tysta räkningen är en stor del av undervisningen samtidigt som forskning talar för att matematikundervisningen bör planeras med variation och kommunikation med eleverna. Eleverna bör i tidig ålder mötas av en undervisning där de får möjlighet att förstå sambandet mellan matematik och vardagen.Den undervisande läraren har en central roll i att välja det läromedel som ter sig bäst lämpad för undervisningssituation och de undervisande individerna. Läraren bör även arbeta utifrån varje individs förmåga och på ett sätt som gör att eleverna känner nyfikenhet det vill säga en nyfikenhet som bidrar till ökad inre motivation.Syftet med studien var att få lärarnas perspektiv på läroböckernas utformning. Då läroboken är ett ofta förekommande läromedel i matematikämnet så fanns en nyfikenhet kring hur väl läroboken faktiskt lever upp till lärarnas behov.Metoden som användes var både kvalitativ och kvantitativ. En enkät skickades ut till lärare som undervisar i matematik i årskurs 1-3. Förhoppningen var att få in ett stort antal svar genom att skapa en enkät med kryssfrågor som inte skulle behöva ta särskilt lång tid att svara på. Tyvärr blev antalet respondenter lågt vilket medförde en problematik kring att söka svar på forskningsfrågorna. Detta medförde att ett fördjupat frågeformulär skapades. Enkäten och frågeformulärets svar har tillsammans stått som grund till analysen och resultatet.Resultatet visade att lärare som undervisar i ämnet matematik i årskurs 1-3 till stor del använder sig av en lärobok. Stor del av lärarna anser att läroboken i sig var ett motiverande arbetsmaterial för eleverna och att många yngre elever tycker om att arbeta i sin lärobok. Resultatet visade fortsättningsvis att det råder delade meningar kring huruvida läroboken i sig ger bra möjligheter till att nivåanpassa undervisningen samt hur väl den stämmer överens med deras egen tolkning av de kunskapskraven för elever i slutet av årskurs 3. Samtliga lärare ser sin egen undervisning som varierad och att det kommunikativa i ämnet är viktigt. Resultatet visade även att lärare som arbetar utan lärobok inte ser fördelar med läroboken mer än att den kan vara till hjälp för det egna planerandet av undervisningen.Slutsatsen är att läroboken är ett viktigt läromedel, inte minst som ett stöd i den egna planeringen. Lärare som undervisar i årskurs 1-3 tycker själva att de har en varierad matematikundervisning och motiverade elever. Lärarna är överens om att det är viktigt att förankra matematiken i vardagen då den ständigt finns runt omkring oss.

  • 88.
    Andriash, A. V.
    et al.
    All Russia Res Inst Automat VNIIA, Moscow, Russia.
    Bobylev, Alexander V.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    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 fields2013Inngår i: PROBLEMS OF ATOMIC SCIENCE AND TECHNOLOGY, ISSN 1562-6016, nr 4, s. 233-237Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 89.
    Angulo, Julio
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för informatik och projektledning. Karlstads universitet, Fakulteten för humaniora och samhällsvetenskap (from 2013), Centrum för HumanIT.
    Berthold, Stefan
    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.
    Elkhiyaoui, Kaoutar
    EURECOM.
    Fernandez Gago, M. Carmen
    University of Málaga.
    Fischer-Hübner, Simone
    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.
    David, Nunez
    University of Málaga.
    Pulls, Tobias
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap. Karlstad University.
    Reuben, Jenni
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap. Karlstad University.
    Van Rompay, Cédric
    EURECOM.
    Santana de Oliveira, Anderson
    SAP Labs.
    Önen, Melek
    EURECOM.
    D:D-5.3 User-Centric Transparency Tools V22015Rapport (Fagfellevurdert)
  • 90.
    Antonsson, Linda
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (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 poäng / 30 hpOppgave
    Abstract [sv]

    Digitala verktyg får en allt mer utbredd plats både i vår vardag som i skolan. Enligt skolverket används dock digitala verktyg sällan för att utveckla matematikundervisningen. Med hjälp av en enkätstudie undersöktes på vilket sätt lärare integrerar digitala verktyg i matematikundervisningen och om lärarens upplevda kunskap påverkar integreringen på något sätt. Med hjälp av ramverket TPACK analyserades resultaten ifrån de 97 respondenter som deltog. Detta visade att lärare som upplever goda kunskaper tenderar att variera sin undervisning med hjälp av digitala verktyg mer än de lärare som uppskattade sina kunskaper som otillräckliga. De vanligaste användnings-områdena för digitala verktyg inom matematiken är således färdighetsträning, genomgångar och visualisering. Studien antyder att det krävs utbildning i hur digitala verktyg kan användas i under-visningen för att kunna integrera digitala verktyg på ett gynnsamt sätt.

  • 91.
    Anttila, Pontus
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Mot effektiv identifiering och insamling avbrutna länkar med hjälp av en spindel2018Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [sv]

    I dagsläget har uppdragsgivaren ingen automatiserad metod för att samla in brutna länkar på deras hemsida, utan detta sker manuellt eller inte alls.

    Detta projekt har resulterat i en praktisk produkt som idag kan appliceras på uppdragsgivarens hemsida. Produktens mål är att automatisera arbetet med att hitta och samla in brutna länkar på hemsidan. Genom att på ett effektivt sätt samla in alla eventuellt brutna länkar, och placera dem i en separat lista så kan en administratör enkelt exportera listan och sedan åtgärda de brutna länkar som hittats.

    Uppdragsgivaren kommer att ha nytta av denna produkt då en hemsida utan brutna länkar höjer hemsidans kvalité, samtidigt som den ger besökare en bättre upplevelse.

  • 92.
    Anwar, Adnan
    et al.
    UNSW, Canberra, ACT 2600, Australia..
    Mahmood, A. N.
    La Trobe Univ, Bundoora, Vic 3086, Australia..
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (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 Noise2017Inngår i: IEEE Transactions on Smart Grid, ISSN 1949-3053, E-ISSN 1949-3061, Vol. 8, nr 3, s. 1446-1459Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 93. Arcozzi, N
    et al.
    Barza, Sorina
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Garcia-Domingo, J.L.
    Soria, J.
    Hardys inequalities for monotone functions on partly ordered measure spaces2006Inngår i: Proc. Roy. Soc. Edingburgh Sect. A, 136 (2006), no.5Artikkel i tidsskrift (Fagfellevurdert)
  • 94.
    Artale Harris, Pietro
    et al.
    Università di Roma La Sapienza.
    Cirillo, Emilio N.M
    Università di Roma La Sapienza.
    Muntean, Adrian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap. Eindhoven University of Technology.
    Weak solutions to Allen-Cahn-like equations modelling consolidation of porous media2017Inngår i: IMA Journal of Applied Mathematics, ISSN 0272-4960, E-ISSN 1464-3634, Vol. 82, nr 1, s. 224-250Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 95.
    Arvidsson, Andreas
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Andreasson, Anders
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Distributed computing for the public transit domain2013Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
  • 96.
    Arvidsson, Jonas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Utvärdering av containerbaserad virtualisering för telekomsignalering2018Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    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.

  • 97.
    Arvidsson, Åke
    et al.
    Kristianstad University, Kristianstad, Sweden..
    Grinnemo, Karl-Johan
    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, 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 performance enhancing proxies2019Inngår i: 2019 International Conference on Software, Telecommunications and Computer Networks (SoftCOM), IEEE, 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).

  • 98. Aspinall, David
    et al.
    Camenisch, JanHansen, MaritFischer-Hübner, SimoneKarlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (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/Antologi (Fagfellevurdert)
  • 99.
    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.

  • 100.
    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 / [ed] Ivan Ganchev, R. D. van der Mei, Hans van den Berg, Cham: 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.

1234567 51 - 100 of 938
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • 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