Ändra sökning
Länk till posten
Permanent länk

Direktlänk
Høiland-Jørgensen, TokeORCID iD iconorcid.org/0000-0001-5241-6815
Publikationer (10 of 14) Visa alla publikationer
Sundberg, S., Brunstrom, A., Ferlin-Reiter, S., Høiland-Jørgensen, T. & Brouer, J. D. (2022). Passive Monitoring of Network Latency at High Line Rates. In: : . Paper presented at 17th Swedish National Computer Networking Workshop (SNCNW 2022), KTH, Stockholm, June 16-17, 2022.
Öppna denna publikation i ny flik eller fönster >>Passive Monitoring of Network Latency at High Line Rates
Visa övriga...
2022 (Engelska)Konferensbidrag, Enbart muntlig presentation (Refereegranskat)
Abstract [en]

Network latency plays a crucial role for many applications and their perceived quality of experience. With an increasing focus on high network speeds and real time, interactive applications relying on reliable and low latency, the ability to effectively monitor latency is becoming more important than ever. While many available tools rely on active monitoring, this approach relies on traffic injection in the network, which can be a source of latency in itself and have a negative overall network performance impact. This paper presents evolved Passive Ping (ePPing), a tool that leverages eBPF to passively monitor latency of existing network traffic. Preliminary evaluation shows that ePPing delivers RTT reports more reliably and at a lower overhead than other state-of-the-art tools, such as PPing.

Nyckelord
passive monitoring, network latency, eBPF, XDP
Nationell ämneskategori
Data- och informationsvetenskap
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-98411 (URN)
Konferens
17th Swedish National Computer Networking Workshop (SNCNW 2022), KTH, Stockholm, June 16-17, 2022
Projekt
A Holistic AI-driven Networking and Processing Framework for Industrial IoT (AIDA)Building the next generation of programmable networking - Powered by Linux
Tillgänglig från: 2024-02-08 Skapad: 2024-02-08 Senast uppdaterad: 2024-03-11Bibliografiskt granskad
Dahlberg, R., Pulls, T., Vestin, J., Høiland-Jørgensen, T. & Kassler, A. (2019). Aggregation-Based Certificate Transparency Gossip. In: Stefan Rass; George Yee (Ed.), Proceedings of the The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France: . Paper presented at The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France. International Academy, Research and Industry Association (IARIA)
Öppna denna publikation i ny flik eller fönster >>Aggregation-Based Certificate Transparency Gossip
Visa övriga...
2019 (Engelska)Ingår i: Proceedings of the The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France / [ed] Stefan Rass; George Yee, International Academy, Research and Industry Association (IARIA), 2019Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Certificate Transparency (CT) requires that every certificate which is issued by a certificate authority must be publicly logged. While a CT log can be untrusted in theory, it relies on the assumption that every client observes and cryptographically verifies the same log. As such, some form of gossip mechanism is needed in practice. Despite CT being adopted by several major browser vendors, no gossip mechanism is widely deployed. We suggest an aggregation-based gossip mechanism that passively observes cryptographic material that CT logs emit in plain text, aggregating at packet processors (such as routers and switches) to periodically verify log consistency off-path. In other words, gossip is provided as-a-service by the network. Our proposal can be implemented for a variety of programmable packet processors at line-speed without aggregation distinguishers (throughput), and, based on 20 days of RIPE Atlas measurements that represent clients from 3500 autonomous systems, we show that significant protection against split-viewing CT logs can be achieved with a realistic threat model and an incremental deployment scenario.

Ort, förlag, år, upplaga, sidor
International Academy, Research and Industry Association (IARIA), 2019
Nyckelord
Certificate Transparency, Gossip, P4, XDP
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-77388 (URN)9781713800521 (ISBN)
Konferens
The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France
Projekt
HITS
Forskningsfinansiär
KK-stiftelsen, 4707
Tillgänglig från: 2020-03-31 Skapad: 2020-03-31 Senast uppdaterad: 2023-05-02Bibliografiskt granskad
Høiland-Jørgensen, T., Hurtig, P. & Brunström, A. (2019). PoliFi: Airtime Policy Enforcement for WiFi. In: IEEE Wireless Communications and Networking Conference, WCNC: . Paper presented at 2019 IEEE Wireless Communications and Networking Conference, WCNC 2019; Marrakesh; Morocco; 15 April 2019 through 19 April 2019 (pp. 1-6). IEEE, Article ID 8885440.
Öppna denna publikation i ny flik eller fönster >>PoliFi: Airtime Policy Enforcement for WiFi
2019 (Engelska)Ingår i: IEEE Wireless Communications and Networking Conference, WCNC, IEEE, 2019, s. 1-6, artikel-id 8885440Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

As WiFi grows ever more popular, airtime contention becomes an increasing problem. One way to alleviate this is through network policy enforcement. Unfortunately, WiFi lacks protocol support for configuring policies for its usage, and since network-wide coordination cannot generally be ensured, enforcing policy is challenging. However, as we have shown in previous work, an access point can influence the behaviour of connected devices by changing its scheduling of transmission opportunities, which can be used to achieve airtime fairness. In this work, we show that this mechanism can be extended to successfully enforce airtime usage policies in WiFi networks. We implement this as an extension our previous airtime fairness work, and present PoliFi, the resulting policy enforcement system. Our evaluation shows that PoliFi makes it possible to express a range of useful policies. These include prioritisation of specific devices; balancing groups of devices for sharing between different logical networks or network slices; and limiting groups of devices to implement guest networks or other low-priority services. We also show how these can be used to improve the performance of a real-world DASH video streaming application.

Ort, förlag, år, upplaga, sidor
IEEE, 2019
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-69641 (URN)10.1109/WCNC.2019.8885440 (DOI)000519086300020 ()9781538676462 (ISBN)
Konferens
2019 IEEE Wireless Communications and Networking Conference, WCNC 2019; Marrakesh; Morocco; 15 April 2019 through 19 April 2019
Tillgänglig från: 2018-10-16 Skapad: 2018-10-16 Senast uppdaterad: 2020-04-23Bibliografiskt granskad
Grazia, C. A., Patriciello, N., Høiland-Jørgensen, T., Klapez, M., Casoni, M. & Mangues-Bafalluy, J. (2018). Adapting TCP Small Queues for IEEE 802.11 Networks. In: 2018 IEEE 29Th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC): . Paper presented at 29th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). Bologna, Italy. 9-12 september, 2018.. IEEE
Öppna denna publikation i ny flik eller fönster >>Adapting TCP Small Queues for IEEE 802.11 Networks
Visa övriga...
2018 (Engelska)Ingår i: 2018 IEEE 29Th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), IEEE, 2018Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

In recent years, the Linux kernel has adopted an algorithm calledTCP Small Queues (TSQ) for reducing queueing latency by controlling buffering in the networking stack.This solution consists of a back-pressure mechanism that limitsthe number of TCP segments within the sender TCP/IP stack, waitingfor packets to actually be transmitted onto the wire beforeenqueueing further segments.Unfortunately, TSQ prevents the frameaggregation mechanism in the IEEE 802.11n/ac standards from achieving itsmaximum aggregation, because not enough packets are available in the queue to buildaggregates from, which severely limits achievable throughput over wirelesslinks.This paper demonstrates this limitation of TSQ in wireless networks and proposesControlled TSQ (CoTSQ), a solution that improves TSQ so that it controls the amountof data buffered while allowing the IEEE 802.11n/ac aggregation logic to fullyexploit the available channel and achieve high throughput. Results on a real testbed show that CoTSQ leadsto a doubling of throughput on 802.11n and up to an order of magnitudeimprovement in 802.11ac networks, with a negligible latency increase.

Ort, förlag, år, upplaga, sidor
IEEE, 2018
Serie
IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications workshops, ISSN 2166-9589, E-ISSN 2166-9570
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-68631 (URN)10.1109/PIMRC.2018.8581048 (DOI)000457761900215 ()978-1-5386-6009-6 (ISBN)978-1-5386-6010-2 (ISBN)
Konferens
29th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). Bologna, Italy. 9-12 september, 2018.
Tillgänglig från: 2018-07-30 Skapad: 2018-07-30 Senast uppdaterad: 2019-07-17Bibliografiskt granskad
Høiland-Jørgensen, T. (2018). Analyzing the Latency of Sparse Flows in the FQ-CoDel Queue Management Algorithm. IEEE Communications Letters, 22(11), 2266-2269
Öppna denna publikation i ny flik eller fönster >>Analyzing the Latency of Sparse Flows in the FQ-CoDel Queue Management Algorithm
2018 (Engelska)Ingår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 22, nr 11, s. 2266-2269Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

The FQ-CoDel queue management algorithm was recently published as an IETF RFC.It achieves low latency especially for low-volume (or sparse) traffic flowscompeting with bulk flows. However, the exact conditions for when a particularflow is considered to be sparse has not been well-explored.

In this work, we analyse the performance characteristics of the sparse flowoptimisation of FQ-CoDel, formulating the constraints that flows must satisfy tobe considered sparse in a given scenario. We also formulate expressions for theexpected queueing latency for sparse flows.

Then, using a numerical example, we show that for a given link and a given typeof sparse flows (VoIP traffic), the number of sparse flows that a givenbottleneck can service with low sparse flow latency is only dependent on thenumber of backlogged bulk flows at the bottleneck. Furthermore, as long as themaximum number of sparse flows is not exceeded, all sparse flows can expect avery low queueing latency through the bottleneck.

Ort, förlag, år, upplaga, sidor
IEEE, 2018
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-69414 (URN)10.1109/LCOMM.2018.2871457 (DOI)000449977700022 ()
Tillgänglig från: 2018-09-27 Skapad: 2018-09-27 Senast uppdaterad: 2018-11-29Bibliografiskt granskad
Høiland-Jørgensen, T. (2018). Bufferbloat and Beyond: Removing Performance Barriers in Real-World Networks. (Doctoral dissertation). Karlstad: Karlstads universitet
Öppna denna publikation i ny flik eller fönster >>Bufferbloat and Beyond: Removing Performance Barriers in Real-World Networks
2018 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The topic of this thesis is the performance of computer networks. While network performance has generally improved with time, over the last several years we have seen examples of performance barriers limiting network performance. In this work we explore such performance barriers and look for solutions.

The problem of excess persistent queueing latency, known as bufferbloat, serves as our starting point; we examine its prevalence in the public internet, and evaluate solutions for better queue management, and explore how to improve on existing solutions to make them easier to deploy.

Since an increasing number of clients access the internet through WiFi networks, examining WiFi performance is a natural next step. Here we also look at bufferbloat, as well as the so-called performance anomaly, where stations with poor signal strengths can severely impact the performance of the whole network. We present solutions for both of these issues, and additionally design a mechanism for assigning policies for distributing airtime between devices on a WiFi network. We also analyse the “TCP Small Queues” latency minimisation technique implemented in the Linux TCP stack and optimise its performance over WiFi networks.

Finally, we explore how high-speed network processing can be enabled in software, by looking at the eXpress Data Path framework that has been gradually implemented in the Linux kernel as a way to enable high-performance programmable packet processing directly in the operating system’s networking stack.

A special focus of this work has been to ensure that the results are carried forward to the implementation stage, which is achieved by releasing implementations as open source software. This includes parts that have been accepted into the Linux kernel, as well as a separate open source measurement tool, called Flent, which is used to perform most of the experiments presented in this thesis, and also used widely in the bufferbloat community.

Abstract [en]

The topic of this thesis is the performance of computer networks in general, and the internet in particular. While network performance has generally improved with time, over the last several years we have seen examples of performance barriers limiting network performance. In this work we explore such performance barriers and look for solutions.

Our exploration takes us through three areas where performance barriers are found: The bufferbloat phenomenon of excessive queueing latency, the performance anomaly in WiFi networks and related airtime resource sharing problems, and the problem of implementing high-speed programmable packet processing in an operating system. In each of these areas we present solutions that significantly advance the state of the art.

The work in this thesis spans all three aspects of the field of computing, namely mathematics, engineering and science. We perform mathematical analysis of algorithms, engineer solutions to the problems we explore, and perform scientific studies of the network itself. All our solutions are implemented as open source software, including both contributions to the upstream Linux kernel, as well as the Flent test tool, developed to support the measurements performed in the rest of the thesis.

Ort, förlag, år, upplaga, sidor
Karlstad: Karlstads universitet, 2018
Serie
Karlstad University Studies, ISSN 1403-8099 ; 2018:42
Nyckelord
Bufferbloat, AQM, WiFi, XDP, TSQ, Flent, network measurement, performance evaluation, fairness, queueing, programmable packet processing
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-69416 (URN)978-91-7063-878-7 (ISBN)978-91-7063-973-9 (ISBN)
Disputation
2018-11-23, 21A342, Eva Erikssonsalen, Karlstad, 09:15 (Engelska)
Opponent
Handledare
Projekt
HITS, 4707
Forskningsfinansiär
KK-stiftelsen
Anmärkning

Paper 6 was published as manuscript in the thesis.

The revised fulltext is identical to the original version with the exception that printing errors have been removed.

Tillgänglig från: 2018-10-26 Skapad: 2018-09-27 Senast uppdaterad: 2020-06-09Bibliografiskt granskad
Høiland-Jørgensen, T., Täht, D. & Morton, J. (2018). Piece of CAKE: A Comprehensive Queue Management Solution for Home Gateways. In: 2018 IEEE INTERNATIONAL SYMPOSIUM ON LOCAL AND METROPOLITAN AREA NETWORKS (LANMAN): . Paper presented at 24th IEEE International Symposium on Local and Metropolitan Area Networks (IEEE LANMAN) (pp. 37-42). IEEE
Öppna denna publikation i ny flik eller fönster >>Piece of CAKE: A Comprehensive Queue Management Solution for Home Gateways
2018 (Engelska)Ingår i: 2018 IEEE INTERNATIONAL SYMPOSIUM ON LOCAL AND METROPOLITAN AREA NETWORKS (LANMAN), IEEE, 2018, s. 37-42Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The last several years has seen a renewed interest in smart queue management tocurb excessive network queueing delay, as people have realised the prevalence of bufferbloat in real networks.

However, for an effective deployment at today's last mile connections, animproved queueing algorithm is not enough in itself, as often the bottleneckqueue is situated in legacy systems that cannot be upgraded. In addition,features such as per-user fairness and the ability to de-prioritise backgroundtraffic are often desirable in a home gateway.

In this paper we present Common Applications Kept Enhanced (CAKE), a comprehensive network queue management system designed specifically for homeInternet gateways. CAKE packs several compelling features into an integratedsolution, thus easing deployment. These features include: bandwidth shaping withoverhead compensation for various link layers; reasonable DiffServ handling;improved flow hashing with both per-flow and per-host queueing fairness; andfiltering of TCP ACKs.

Our evaluation shows that these features offer compelling advantages, andthat CAKE has the potential to significantly improve performance of last-mileinternet connections.

Ort, förlag, år, upplaga, sidor
IEEE, 2018
Serie
IEEE Workshop on Local and Metropolitan Area Networks, E-ISSN 1944-0375
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-68630 (URN)000447699400007 ()
Konferens
24th IEEE International Symposium on Local and Metropolitan Area Networks (IEEE LANMAN)
Tillgänglig från: 2018-07-30 Skapad: 2018-07-30 Senast uppdaterad: 2019-11-14Bibliografiskt granskad
Høiland-Jørgensen, T., Brouer, J. D., Borkmann, D., Fastabend, J., Herbert, T., Ahern, D. & Miller, D. (2018). The eXpress Data Path: Fast Programmable Packet Processing in the Operating System Kernel. In: CoNEXT '18 Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies: . Paper presented at CoNEXT '18: International Conference on emerging Networking EXperiments and Technologies (pp. 54-66). Association for Computing Machinery (ACM)
Öppna denna publikation i ny flik eller fönster >>The eXpress Data Path: Fast Programmable Packet Processing in the Operating System Kernel
Visa övriga...
2018 (Engelska)Ingår i: CoNEXT '18 Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies, Association for Computing Machinery (ACM), 2018, s. 54-66Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Programmable packet processing is increasingly implemented using kernel bypass  techniques, where a userspace application takes complete control of the  networking hardware to avoid expensive context switches between kernel and  userspace. However, as the operating system is bypassed, so are its  application isolation and security mechanisms; and well-tested configuration,  deployment and management tools cease to function.  To overcome this limitation, we present the design of a novel approach to  programmable packet processing, called the eXpress Data Path (XDP). In XDP,  the operating system kernel itself provides a safe execution environment for  custom packet processing applications, executed in device driver context. XDP  is part of the mainline Linux kernel and provides a fully integrated solution  working in concert with the kernel's networking stack. Applications are  written in higher level languages such as C and compiled into custom byte code  which the kernel statically analyses for safety, and translates into native  instructions.  We show that XDP achieves single-core packet processing performance as high as  24 million packets per second, and illustrate the flexibility of the  programming model through three example use cases: layer-3 routing, inline  DDoS protection and layer-4 load balancing.

Ort, förlag, år, upplaga, sidor
Association for Computing Machinery (ACM), 2018
Nyckelord
XDP, BPF, Programmable Networking, DPDK
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:kau:diva-69639 (URN)10.1145/3281411.3281443 (DOI)000455383800006 ()978-1-4503-6080-7 (ISBN)
Konferens
CoNEXT '18: International Conference on emerging Networking EXperiments and Technologies
Tillgänglig från: 2018-10-16 Skapad: 2018-10-16 Senast uppdaterad: 2019-11-09Bibliografiskt granskad
Høiland-Jørgensen, T., Kazior, M., Täht, D., Hurtig, P. & Brunström, A. (2017). Ending the Anomaly: Achieving Low Latency and Airtime Fairness in WiFi. In: Proceedings of the 2017 USENIX Annual Technical Conference (USENIX ATC ’17): . Paper presented at 2017 USENIX Annual Technical Conference (USENIX ATC 17). July 12–14, 2017, Santa Clara, CA, USA (pp. 139-151). USENIX - The Advanced Computing Systems Association
Öppna denna publikation i ny flik eller fönster >>Ending the Anomaly: Achieving Low Latency and Airtime Fairness in WiFi
Visa övriga...
2017 (Engelska)Ingår i: Proceedings of the 2017 USENIX Annual Technical Conference (USENIX ATC ’17), USENIX - The Advanced Computing Systems Association, 2017, s. 139-151Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

With more devices connected, delays and jitter at the WiFi hop become more prevalent, and correct functioning during network congestion becomes more important. However, two important performance issues prevent modern WiFi from reaching its potential: increased latency under load caused by excessive queueing (i.e. bufferbloat) and the 802.11 performance anomaly.

To remedy these issues, we present a novel two-part solution. We design a new queueing scheme that eliminates bufferbloat in the wireless setting. Leveraging this queueing scheme, we then design an airtime fairness scheduler that operates at the access point and doesn't require any changes to clients.

We evaluate our solution using both a theoretical model and experiments in a testbed environment, formulating a suitable analytical model in the process. We show that our solution achieves an order of magnitude reduction in latency under load, large improvements in multi-station throughput, and nearly perfect airtime fairness for both TCP and downstream UDP traffic. Further experiments with application traffic confirm that the solution provides significant performance gains for real-world traffic.We develop a production quality implementation of our solution in the Linux kernel, the platform powering most access points outside of the managed enterprise setting. The implementation has been accepted into the mainline kernel distribution, making it available for deployment on billions of devices running Linux today.

Ort, förlag, år, upplaga, sidor
USENIX - The Advanced Computing Systems Association, 2017
Serie
2017 Usenix Annual Technical Conference (Usenix Atc '17)
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-47000 (URN)000428763500011 ()978-1-931971-38-6 (ISBN)
Konferens
2017 USENIX Annual Technical Conference (USENIX ATC 17). July 12–14, 2017, Santa Clara, CA, USA
Tillgänglig från: 2016-11-01 Skapad: 2016-11-01 Senast uppdaterad: 2018-11-13Bibliografiskt granskad
Høiland-Jørgensen, T., Grazia, C. A., Hurtig, P. & Brunström, A. (2017). Flent: The FLExible Network Tester. In: VALUETOOLS 2017: Proceedings of 11th EAI International Conference on Performance Evaluation Methodologies and Tools. Paper presented at VALUETOOLS 2017, December 5–7, 2017, Venice, Italy (pp. 1-6). New York, NY: Association for Computing Machinery (ACM), Article ID 271973.
Öppna denna publikation i ny flik eller fönster >>Flent: The FLExible Network Tester
2017 (Engelska)Ingår i: VALUETOOLS 2017: Proceedings of 11th EAI International Conference on Performance Evaluation Methodologies and Tools, New York, NY: Association for Computing Machinery (ACM), 2017, s. 1-6, artikel-id 271973Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Running network performance experiments on real systems is essential for a complete understanding of protocols and systems connected to the internet. However, the process of running experiments can be tedious and error-prone. In particular, ensuring reproducibility across different systems is difficult, and comparing different test runs from an experiment can be non-trivial.In this paper, we present a tool, called Flent, designed to make experimental evaluations of networks more reliable and easier to perform. Flent works by composing well-known benchmarking tools to, e.g., run tests consisting of several bulk data flows combined with simultaneous latency measurements. Tests are specified in source code, and several common tests are included with the tool. In addition, Flent contains features to automate test runs, collect relevant metadata and interactively plot and explore datasets.We showcase Flent's capabilities by performing a set of experiments evaluating the new BBR congestion control algorithm, using Flent's capabilities to reproduce experiments both in a controlled testbed and across the public internet. Our evaluation reveals several interesting features of BBR's performance.

Ort, förlag, år, upplaga, sidor
New York, NY: Association for Computing Machinery (ACM), 2017
Nyckelord
Network experimentation, Network performance analysis, Network measurement, Measurement tools
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-64766 (URN)10.1145/3150928.3150957 (DOI)978-1-4503-6346-4 (ISBN)
Konferens
VALUETOOLS 2017, December 5–7, 2017, Venice, Italy
Tillgänglig från: 2017-10-23 Skapad: 2017-10-23 Senast uppdaterad: 2019-11-09Bibliografiskt granskad
Organisationer
Identifikatorer
ORCID-id: ORCID iD iconorcid.org/0000-0001-5241-6815

Sök vidare i DiVA

Visa alla publikationer