related work
This commit is contained in:
@@ -390,3 +390,26 @@ This thesis extends their work in several ways:
|
|||||||
\item Fully reproducible experimental framework via Nix/NixOS/Clan
|
\item Fully reproducible experimental framework via Nix/NixOS/Clan
|
||||||
\end{itemize}
|
\end{itemize}
|
||||||
|
|
||||||
|
\subsection{UDP NAT and Firewall Puncturing in the Wild}
|
||||||
|
|
||||||
|
Halkes and Pouwelse~\cite{halkes_udp_2011} measure UDP hole punching
|
||||||
|
efficacy on a live P2P network using the Tribler BitTorrent client.
|
||||||
|
Their study finds that 79\% of peers are unreachable due to NAT or
|
||||||
|
firewall restrictions, yet 64\% reside behind configurations amenable
|
||||||
|
to hole punching. Among compatible peers, over 80\% of puncturing
|
||||||
|
attempts succeed, establishing hole punching as a practical NAT
|
||||||
|
traversal technique. Their timeout measurements further indicate that
|
||||||
|
keep-alive messages must be sent at least every 55 seconds to maintain
|
||||||
|
open NAT mappings.
|
||||||
|
|
||||||
|
These findings directly inform the evaluation criteria for this thesis.
|
||||||
|
All mesh VPNs tested rely on UDP hole punching for NAT traversal;
|
||||||
|
the 80\% success rate sets a baseline expectation, while the 55-second
|
||||||
|
timeout informs analysis of each implementation's keep-alive behavior
|
||||||
|
during source code review.
|
||||||
|
|
||||||
|
\subsection{An Overview of Packet Reordering in TCP}
|
||||||
|
TODO \cite{leung_overview_2007}
|
||||||
|
|
||||||
|
\subsection{Performance Evaluation of TCP over QUIC Tunnels}
|
||||||
|
TODO \cite{guo_implementation_2025}
|
||||||
@@ -1,667 +1,338 @@
|
|||||||
|
|
||||||
@article{kjorveziroski_full-mesh_2024,
|
@article{kjorveziroski_full-mesh_2024,
|
||||||
title = {Full-mesh {VPN} performance evaluation for a secure
|
title = {Full-mesh {VPN} performance evaluation for a secure edge-cloud continuum},
|
||||||
edge-cloud continuum},
|
volume = {54},
|
||||||
volume = {54},
|
rights = {© 2024 The Authors. Software: Practice and Experience published by John Wiley \& Sons Ltd.},
|
||||||
rights = {© 2024 The Authors. Software: Practice and Experience
|
issn = {1097-024X},
|
||||||
published by John Wiley \& Sons Ltd.},
|
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.3329},
|
||||||
issn = {1097-024X},
|
doi = {10.1002/spe.3329},
|
||||||
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.3329},
|
abstract = {The recent introduction of full-mesh virtual private network ({VPN}) solutions which offer near native performance, coupled with modern encryption algorithms and easy scalability as a result of a central control plane have a strong potential to enable the implementation of a seamless edge-cloud continuum. To test the performance of existing solutions in this domain, we present a framework consisted of both essential and optional features that full-mesh {VPN} solutions need to support before they can be used for interconnecting geographically dispersed compute nodes. We then apply this framework on existing offerings and select three {VPN} solutions for further tests: Headscale, Netbird, and {ZeroTier}. We evaluate their features in the context of establishing an underlay network on top of which a Kubernetes overlay network can be created. We test pod-to-pod {TCP} and {UDP} throughput as well as Kubernetes application programming interface ({API}) response times, in multiple scenarios, accounting for adverse network conditions such as packet loss or packet delay. Based on the obtained measurement results and through analysis of the underlying strengths and weaknesses of the individual implementations, we draw conclusions on the preferred {VPN} solution depending on the use-case at hand, striking a balance between usability and performance.},
|
||||||
doi = {10.1002/spe.3329},
|
pages = {1543--1564},
|
||||||
abstract = {The recent introduction of full-mesh virtual private
|
number = {8},
|
||||||
network ({VPN}) solutions which offer near native performance,
|
journaltitle = {Software: Practice and Experience},
|
||||||
coupled with modern encryption algorithms and easy scalability as a
|
author = {Kjorveziroski, Vojdan and Bernad, Cristina and Gilly, Katja and Filiposka, Sonja},
|
||||||
result of a central control plane have a strong potential to enable
|
urldate = {2024-09-19},
|
||||||
the implementation of a seamless edge-cloud continuum. To test the
|
date = {2024},
|
||||||
performance of existing solutions in this domain, we present a
|
langid = {english},
|
||||||
framework consisted of both essential and optional features that
|
keywords = {edge-cloud continuum, Kubernetes, orchestration, virtual private networks, Wireguard, {ZeroTier}},
|
||||||
full-mesh {VPN} solutions need to support before they can be used
|
file = {Attachment:/home/lhebendanz/Zotero/storage/BGJCY48V/Softw Pract Exp - 2024 - Kjorveziroski - Full‐mesh VPN performance evaluation for a secure edge‐cloud continuum.pdf:application/pdf},
|
||||||
for interconnecting geographically dispersed compute nodes. We then
|
|
||||||
apply this framework on existing offerings and select three {VPN}
|
|
||||||
solutions for further tests: Headscale, Netbird, and {ZeroTier}. We
|
|
||||||
evaluate their features in the context of establishing an underlay
|
|
||||||
network on top of which a Kubernetes overlay network can be
|
|
||||||
created. We test pod-to-pod {TCP} and {UDP} throughput as well as
|
|
||||||
Kubernetes application programming interface ({API}) response
|
|
||||||
times, in multiple scenarios, accounting for adverse network
|
|
||||||
conditions such as packet loss or packet delay. Based on the
|
|
||||||
obtained measurement results and through analysis of the underlying
|
|
||||||
strengths and weaknesses of the individual implementations, we draw
|
|
||||||
conclusions on the preferred {VPN} solution depending on the
|
|
||||||
use-case at hand, striking a balance between usability and performance.},
|
|
||||||
pages = {1543--1564},
|
|
||||||
number = {8},
|
|
||||||
journaltitle = {Software: Practice and Experience},
|
|
||||||
author = {Kjorveziroski, Vojdan and Bernad, Cristina and Gilly,
|
|
||||||
Katja and Filiposka, Sonja},
|
|
||||||
urldate = {2024-09-19},
|
|
||||||
date = {2024},
|
|
||||||
langid = {english},
|
|
||||||
keywords = {edge-cloud continuum, Kubernetes, orchestration,
|
|
||||||
virtual private networks, Wireguard, {ZeroTier}},
|
|
||||||
file = {Attachment:/home/lhebendanz/Zotero/storage/BGJCY48V/Softw
|
|
||||||
Pract Exp - 2024 - Kjorveziroski - Full‐mesh VPN performance
|
|
||||||
evaluation for a secure edge‐cloud continuum.pdf:application/pdf},
|
|
||||||
}
|
|
||||||
|
|
||||||
@inproceedings{hugerich_no-hop_2022,
|
|
||||||
location = {New York, {NY}, {USA}},
|
|
||||||
title = {No-hop: In-network Distributed Hash Tables},
|
|
||||||
isbn = {978-1-4503-9168-9},
|
|
||||||
url = {https://doi.org/10.1145/3493425.3502757},
|
|
||||||
doi = {10.1145/3493425.3502757},
|
|
||||||
series = {{ANCS} '21},
|
|
||||||
shorttitle = {No-hop},
|
|
||||||
abstract = {We make a case for a distributed hash table lookup in
|
|
||||||
the network data plane. We argue that the lookup time performance
|
|
||||||
of distributed hash tables can be further improved via an
|
|
||||||
in-network data plane implementation. To this end, we introduce
|
|
||||||
No-hop, an in-network distributed hash table implementation, which
|
|
||||||
leverages the data plane programmability at line rate gained from
|
|
||||||
P4. Our initial results of transporting distributed hash table
|
|
||||||
logic from hosts' user space to the fast path of switches in the
|
|
||||||
network data plane are promising. We show that No-hop improves the
|
|
||||||
performance of locating the responsible host and maintains the
|
|
||||||
properties of distributed hash tables while outperforming two baselines.},
|
|
||||||
pages = {80--87},
|
|
||||||
booktitle = {Proceedings of the Symposium on Architectures for
|
|
||||||
Networking and Communications Systems},
|
|
||||||
publisher = {Association for Computing Machinery},
|
|
||||||
author = {Hügerich, Lily and Shukla, Apoorv and Smaragdakis, Georgios},
|
|
||||||
urldate = {2024-09-23},
|
|
||||||
date = {2022-01},
|
|
||||||
file =
|
|
||||||
{Attachment:/home/lhebendanz/Zotero/storage/WCI9PCTE/inet_nohop_decen_hashtable.pdf:application/pdf},
|
|
||||||
}
|
|
||||||
|
|
||||||
@article{bakhshi_state_2017,
|
|
||||||
title = {State of the Art and Recent Research Advances in Software
|
|
||||||
Defined Networking},
|
|
||||||
volume = {2017},
|
|
||||||
rights = {Copyright © 2017 Taimur Bakhshi.},
|
|
||||||
issn = {1530-8677},
|
|
||||||
url = {https://onlinelibrary.wiley.com/doi/abs/10.1155/2017/7191647},
|
|
||||||
doi = {10.1155/2017/7191647},
|
|
||||||
abstract = {Emerging network services and subsequent growth in the
|
|
||||||
networking infrastructure have gained tremendous momentum in recent
|
|
||||||
years. Application performance requiring rapid real-time network
|
|
||||||
provisioning, optimized traffic management, and virtualization of
|
|
||||||
shared resources has induced the conceptualization and adoption of
|
|
||||||
new networking models. Software defined networking ({SDN}), one of
|
|
||||||
the predominant and relatively new networking paradigms, seeks to
|
|
||||||
simplify network management by decoupling network control logic
|
|
||||||
from the underlying hardware and introduces real-time network
|
|
||||||
programmability enabling innovation. The present work reviews the
|
|
||||||
state of the art in software defined networking providing a
|
|
||||||
historical perspective on complementary technologies in network
|
|
||||||
programmability and the inherent shortcomings which paved the way
|
|
||||||
for {SDN}. The {SDN} architecture is discussed along with popular
|
|
||||||
protocols, platforms, and existing simulation and debugging
|
|
||||||
solutions. Furthermore, a detailed analysis is presented around
|
|
||||||
recent {SDN} development and deployment avenues ranging from mobile
|
|
||||||
communications and data centers to campus networks and residential
|
|
||||||
environments. The review concludes by highlighting implementation
|
|
||||||
challenges and subsequent research directions being pursued in
|
|
||||||
academia and industry to address issues related to application
|
|
||||||
performance, control plane scalability and design, security, and
|
|
||||||
interdomain connectivity in the context of {SDN}.},
|
|
||||||
pages = {7191647},
|
|
||||||
number = {1},
|
|
||||||
journaltitle = {Wireless Communications and Mobile Computing},
|
|
||||||
author = {Bakhshi, Taimur},
|
|
||||||
urldate = {2024-09-23},
|
|
||||||
date = {2017},
|
|
||||||
langid = {english},
|
|
||||||
file =
|
|
||||||
{Attachment:/home/lhebendanz/Zotero/storage/TXFJ8DJB/Wireless
|
|
||||||
Communications and Mobile Computing - 2017 - Bakhshi - State of the
|
|
||||||
Art and Recent Research Advances in Software.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@online{noauthor_sci-hub_nodate,
|
@online{noauthor_sci-hub_nodate,
|
||||||
title = {Sci-Hub},
|
title = {Sci-Hub},
|
||||||
url = {https://sci-hub.usualwant.com/},
|
url = {https://sci-hub.usualwant.com/},
|
||||||
abstract = {Sci-Hub,{SciHub}: Contains the latest literature in
|
abstract = {Sci-Hub,{SciHub}: Contains the latest literature in 2024,world where everyone has free access to knowledge.},
|
||||||
2024,world where everyone has free access to knowledge.},
|
urldate = {2024-11-19},
|
||||||
urldate = {2024-11-19},
|
file = {Snapshot:/home/lhebendanz/Zotero/storage/Q6ZNWGBH/sci-hub.usualwant.com.html:text/html},
|
||||||
file =
|
|
||||||
{Snapshot:/home/lhebendanz/Zotero/storage/Q6ZNWGBH/sci-hub.usualwant.com.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{shukla_towards_2021,
|
@article{shukla_towards_2021,
|
||||||
title = {Towards software defined low maintenance structured
|
title = {Towards software defined low maintenance structured peer-to-peer overlays},
|
||||||
peer-to-peer overlays},
|
volume = {14},
|
||||||
volume = {14},
|
issn = {1936-6442, 1936-6450},
|
||||||
issn = {1936-6442, 1936-6450},
|
url = {https://link.springer.com/10.1007/s12083-021-01112-7},
|
||||||
url = {https://link.springer.com/10.1007/s12083-021-01112-7},
|
doi = {10.1007/s12083-021-01112-7},
|
||||||
doi = {10.1007/s12083-021-01112-7},
|
pages = {1242--1260},
|
||||||
pages = {1242--1260},
|
number = {3},
|
||||||
number = {3},
|
journaltitle = {Peer-to-Peer Netw. Appl.},
|
||||||
journaltitle = {Peer-to-Peer Netw. Appl.},
|
author = {Shukla, Nitin and Datta, Dipmalya and Pandey, Mayank and Srivastava, Shashank},
|
||||||
author = {Shukla, Nitin and Datta, Dipmalya and Pandey, Mayank and
|
urldate = {2024-11-19},
|
||||||
Srivastava, Shashank},
|
date = {2021-05},
|
||||||
urldate = {2024-11-19},
|
langid = {english},
|
||||||
date = {2021-05},
|
file = {PDF:/home/lhebendanz/Zotero/storage/GTPSJRYK/Shukla et al. - 2021 - Towards software defined low maintenance structured peer-to-peer overlays.pdf:application/pdf},
|
||||||
langid = {english},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/GTPSJRYK/Shukla et al.
|
|
||||||
- 2021 - Towards software defined low maintenance structured
|
|
||||||
peer-to-peer overlays.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{dolstra_nixos_2008,
|
@inproceedings{dolstra_nixos_2008,
|
||||||
location = {New York, {NY}, {USA}},
|
location = {New York, {NY}, {USA}},
|
||||||
title = {{NixOS}: a purely functional Linux distribution},
|
title = {{NixOS}: a purely functional Linux distribution},
|
||||||
isbn = {978-1-59593-919-7},
|
isbn = {978-1-59593-919-7},
|
||||||
url = {https://doi.org/10.1145/1411204.1411255},
|
url = {https://doi.org/10.1145/1411204.1411255},
|
||||||
doi = {10.1145/1411204.1411255},
|
doi = {10.1145/1411204.1411255},
|
||||||
series = {{ICFP} '08},
|
series = {{ICFP} '08},
|
||||||
shorttitle = {{NixOS}},
|
shorttitle = {{NixOS}},
|
||||||
abstract = {Existing package and system configuration management
|
abstract = {Existing package and system configuration management tools suffer from an imperative model, where system administration actions such as upgrading packages or changes to system configuration files are stateful: they destructively update the state of the system. This leads to many problems, such as the inability to roll back changes easily, to run multiple versions of a package side-by-side, to reproduce a configuration deterministically on another machine, or to reliably upgrade a system. In this paper we show that we can overcome these problems by moving to a purely functional system configuration model. This means that all static parts of a system (such as software packages, configuration files and system startup scripts) are built by pure functions and are immutable, stored in a way analogously to a heap in a purely function language. We have implemented this model in {NixOS}, a non-trivial Linux distribution that uses the Nix package manager to build the entire system configuration from a purely functional specification.},
|
||||||
tools suffer from an imperative model, where system administration
|
pages = {367--378},
|
||||||
actions such as upgrading packages or changes to system
|
booktitle = {Proceedings of the 13th {ACM} {SIGPLAN} international conference on Functional programming},
|
||||||
configuration files are stateful: they destructively update the
|
publisher = {Association for Computing Machinery},
|
||||||
state of the system. This leads to many problems, such as the
|
author = {Dolstra, Eelco and Löh, Andres},
|
||||||
inability to roll back changes easily, to run multiple versions of
|
urldate = {2024-11-24},
|
||||||
a package side-by-side, to reproduce a configuration
|
date = {2008-09-20},
|
||||||
deterministically on another machine, or to reliably upgrade a
|
file = {PDF:/home/lhebendanz/Zotero/storage/GGG3BB3V/Dolstra et al. - 2010 - NixOS A Purely Functional Linux Distribution.pdf:application/pdf},
|
||||||
system. In this paper we show that we can overcome these problems
|
|
||||||
by moving to a purely functional system configuration model. This
|
|
||||||
means that all static parts of a system (such as software packages,
|
|
||||||
configuration files and system startup scripts) are built by pure
|
|
||||||
functions and are immutable, stored in a way analogously to a heap
|
|
||||||
in a purely function language. We have implemented this model in
|
|
||||||
{NixOS}, a non-trivial Linux distribution that uses the Nix package
|
|
||||||
manager to build the entire system configuration from a purely
|
|
||||||
functional specification.},
|
|
||||||
pages = {367--378},
|
|
||||||
booktitle = {Proceedings of the 13th {ACM} {SIGPLAN} international
|
|
||||||
conference on Functional programming},
|
|
||||||
publisher = {Association for Computing Machinery},
|
|
||||||
author = {Dolstra, Eelco and Löh, Andres},
|
|
||||||
urldate = {2024-11-24},
|
|
||||||
date = {2008-09-20},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/GGG3BB3V/Dolstra et al.
|
|
||||||
- 2010 - NixOS A Purely Functional Linux Distribution.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{van_der_burg_disnix_2014,
|
@article{van_der_burg_disnix_2014,
|
||||||
title = {Disnix: A toolset for distributed deployment},
|
title = {Disnix: A toolset for distributed deployment},
|
||||||
volume = {79},
|
volume = {79},
|
||||||
issn = {0167-6423},
|
issn = {0167-6423},
|
||||||
url = {https://www.sciencedirect.com/science/article/pii/S0167642312000639},
|
url = {https://www.sciencedirect.com/science/article/pii/S0167642312000639},
|
||||||
doi = {10.1016/j.scico.2012.03.006},
|
doi = {10.1016/j.scico.2012.03.006},
|
||||||
series = {Experimental Software and Toolkits ({EST} 4): A special
|
series = {Experimental Software and Toolkits ({EST} 4): A special issue of the Workshop on Academic Software Development Tools and Techniques ({WASDeTT}-3 2010)},
|
||||||
issue of the Workshop on Academic Software Development Tools and
|
shorttitle = {Disnix},
|
||||||
Techniques ({WASDeTT}-3 2010)},
|
abstract = {The process of deploying a distributed system in a network of machines is often very complex, laborious and time-consuming, while it is hard to guarantee that the system will work as expected and that specific non-functional deployment requirements from the domain are supported. In this paper we describe the Disnix toolset, which provides system administrators or developers with automatic deployment of a distributed system in a network of machines from declarative specifications and offers properties such as complete dependencies, atomic upgrades and rollbacks to make this process efficient and reliable. Disnix has an extensible architecture, allowing the integration of custom modules to make the deployment more convenient and suitable for the domain in which the system is to be used. Disnix has been under development for almost four years and has been applied to several types of distributed systems, including an industrial case study.},
|
||||||
shorttitle = {Disnix},
|
pages = {52--69},
|
||||||
abstract = {The process of deploying a distributed system in a
|
journaltitle = {Science of Computer Programming},
|
||||||
network of machines is often very complex, laborious and
|
author = {van der Burg, Sander and Dolstra, Eelco},
|
||||||
time-consuming, while it is hard to guarantee that the system will
|
urldate = {2024-11-24},
|
||||||
work as expected and that specific non-functional deployment
|
date = {2014-01-01},
|
||||||
requirements from the domain are supported. In this paper we
|
keywords = {Distributed systems, Service-oriented systems, Software deployment},
|
||||||
describe the Disnix toolset, which provides system administrators
|
file = {PDF:/home/lhebendanz/Zotero/storage/XSWZ95UU/van der Burg and Dolstra - 2014 - Disnix A toolset for distributed deployment.pdf:application/pdf;ScienceDirect Snapshot:/home/lhebendanz/Zotero/storage/VHPTLVMW/S0167642312000639.html:text/html},
|
||||||
or developers with automatic deployment of a distributed system in
|
|
||||||
a network of machines from declarative specifications and offers
|
|
||||||
properties such as complete dependencies, atomic upgrades and
|
|
||||||
rollbacks to make this process efficient and reliable. Disnix has
|
|
||||||
an extensible architecture, allowing the integration of custom
|
|
||||||
modules to make the deployment more convenient and suitable for the
|
|
||||||
domain in which the system is to be used. Disnix has been under
|
|
||||||
development for almost four years and has been applied to several
|
|
||||||
types of distributed systems, including an industrial case study.},
|
|
||||||
pages = {52--69},
|
|
||||||
journaltitle = {Science of Computer Programming},
|
|
||||||
author = {van der Burg, Sander and Dolstra, Eelco},
|
|
||||||
urldate = {2024-11-24},
|
|
||||||
date = {2014-01-01},
|
|
||||||
keywords = {Distributed systems, Service-oriented systems, Software
|
|
||||||
deployment},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/XSWZ95UU/van der Burg
|
|
||||||
and Dolstra - 2014 - Disnix A toolset for distributed
|
|
||||||
deployment.pdf:application/pdf;ScienceDirect
|
|
||||||
Snapshot:/home/lhebendanz/Zotero/storage/VHPTLVMW/S0167642312000639.html:text/html},
|
|
||||||
}
|
|
||||||
|
|
||||||
@article{laddad_keep_2022,
|
|
||||||
title = {Keep {CALM} and {CRDT} On},
|
|
||||||
volume = {16},
|
|
||||||
issn = {2150-8097},
|
|
||||||
url = {https://doi.org/10.14778/3574245.3574268},
|
|
||||||
doi = {10.14778/3574245.3574268},
|
|
||||||
abstract = {Despite decades of research and practical experience,
|
|
||||||
developers have few tools for programming reliable distributed
|
|
||||||
applications without resorting to expensive coordination
|
|
||||||
techniques. Conflict-free replicated datatypes ({CRDTs}) are a
|
|
||||||
promising line of work that enable coordination-free replication
|
|
||||||
and offer certain eventual consistency guarantees in a relatively
|
|
||||||
simple object-oriented {API}. Yet {CRDT} guarantees extend only to
|
|
||||||
data updates; observations of {CRDT} state are unconstrained and
|
|
||||||
unsafe. We propose an agenda that embraces the simplicity of
|
|
||||||
{CRDTs}, but provides richer, more uniform guarantees. We extend
|
|
||||||
{CRDTs} with a query model that reasons about which queries are
|
|
||||||
safe without coordination by applying monotonicity results from the
|
|
||||||
{CALM} Theorem, and lay out a larger agenda for developing {CRDT}
|
|
||||||
data stores that let developers safely and efficiently interact
|
|
||||||
with replicated application state.},
|
|
||||||
pages = {856--863},
|
|
||||||
number = {4},
|
|
||||||
journaltitle = {Proc. {VLDB} Endow.},
|
|
||||||
author = {Laddad, Shadaj and Power, Conor and Milano, Mae and
|
|
||||||
Cheung, Alvin and Crooks, Natacha and Hellerstein, Joseph M.},
|
|
||||||
urldate = {2024-11-24},
|
|
||||||
date = {2022},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/SEGUKMKS/Laddad et al.
|
|
||||||
- 2022 - Keep CALM and CRDT On.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{dolstra_nix_2004,
|
@inproceedings{dolstra_nix_2004,
|
||||||
location = {{USA}},
|
location = {{USA}},
|
||||||
title = {Nix: A Safe and Policy-Free System for Software Deployment},
|
title = {Nix: A Safe and Policy-Free System for Software Deployment},
|
||||||
series = {{LISA} '04},
|
series = {{LISA} '04},
|
||||||
shorttitle = {Nix},
|
shorttitle = {Nix},
|
||||||
abstract = {Existing systems for software deployment are neither
|
abstract = {Existing systems for software deployment are neither safe nor sufficiently flexible. Primary safety issues are the inability to enforce reliable specification of component dependencies, and the lack of support for multiple versions or variants of a component. This renders deployment operations such as upgrading or deleting components dangerous and unpredictable. A deployment system must also be flexible (i.e., policy-free) enough to support both centralised and local package management, and to allow a variety of mechanisms for transferring components. In this paper we present Nix, a deployment system that addresses these issues through a simple technique of using cryptographic hashes to compute unique paths for component instances.},
|
||||||
safe nor sufficiently flexible. Primary safety issues are the
|
pages = {79--92},
|
||||||
inability to enforce reliable specification of component
|
booktitle = {Proceedings of the 18th {USENIX} conference on System administration},
|
||||||
dependencies, and the lack of support for multiple versions or
|
publisher = {{USENIX} Association},
|
||||||
variants of a component. This renders deployment operations such as
|
author = {Dolstra, Eelco and de Jonge, Merijn and Visser, Eelco},
|
||||||
upgrading or deleting components dangerous and unpredictable. A
|
urldate = {2024-11-25},
|
||||||
deployment system must also be flexible (i.e., policy-free) enough
|
date = {2004-11-19},
|
||||||
to support both centralised and local package management, and to
|
file = {PDF:/home/lhebendanz/Zotero/storage/FVVZ628U/Dolstra et al. - Nix A Safe and Policy-Free System for Software Deployment.pdf:application/pdf},
|
||||||
allow a variety of mechanisms for transferring components. In this
|
|
||||||
paper we present Nix, a deployment system that addresses these
|
|
||||||
issues through a simple technique of using cryptographic hashes to
|
|
||||||
compute unique paths for component instances.},
|
|
||||||
pages = {79--92},
|
|
||||||
booktitle = {Proceedings of the 18th {USENIX} conference on System
|
|
||||||
administration},
|
|
||||||
publisher = {{USENIX} Association},
|
|
||||||
author = {Dolstra, Eelco and de Jonge, Merijn and Visser, Eelco},
|
|
||||||
urldate = {2024-11-25},
|
|
||||||
date = {2004-11-19},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/FVVZ628U/Dolstra et al.
|
|
||||||
- Nix A Safe and Policy-Free System for Software
|
|
||||||
Deployment.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@online{noauthor_isps_nodate,
|
@online{noauthor_isps_nodate,
|
||||||
title = {{ISPs} - ethernodes.org - The Ethereum Network \& Node Explorer},
|
title = {{ISPs} - ethernodes.org - The Ethereum Network \& Node Explorer},
|
||||||
url = {https://ethernodes.org/networkType/Hosting},
|
url = {https://ethernodes.org/networkType/Hosting},
|
||||||
urldate = {2024-12-02},
|
urldate = {2024-12-02},
|
||||||
file = {ISPs - ethernodes.org - The Ethereum Network & Node
|
file = {ISPs - ethernodes.org - The Ethereum Network & Node Explorer:/home/lhebendanz/Zotero/storage/BH7E2FAL/Hosting.html:text/html},
|
||||||
Explorer:/home/lhebendanz/Zotero/storage/BH7E2FAL/Hosting.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{kern_lost_2023,
|
@article{kern_lost_2023,
|
||||||
title = {Lost in Simulation: Route Property in Mininet},
|
title = {Lost in Simulation: Route Property in Mininet},
|
||||||
url =
|
url = {https://www.net.in.tum.de/fileadmin/TUM/NET/NET-2023-06-1/NET-2023-06-1_03.pdf},
|
||||||
{https://www.net.in.tum.de/fileadmin/TUM/NET/NET-2023-06-1/NET-2023-06-1_03.pdf},
|
doi = {10.2313/NET-2023-06-1_03},
|
||||||
doi = {10.2313/NET-2023-06-1_03},
|
shorttitle = {Lost in Simulation},
|
||||||
shorttitle = {Lost in Simulation},
|
abstract = {The Mininet network emulator enables the comparison of speed, delay, jitter and packet loss across different topologies. It provides a Python {API} to instantiate almost arbitrary layouts of networks and connections with attributes like predetermined packet loss. We inspect linear and grid-like topologies and discover that both share similar performance characteristics.},
|
||||||
abstract = {The Mininet network emulator enables the comparison of
|
author = {Kern, Philipp},
|
||||||
speed, delay, jitter and packet loss across different topologies.
|
editora = {Architectures, Chair Of Network},
|
||||||
It provides a Python {API} to instantiate almost arbitrary layouts
|
editoratype = {collaborator},
|
||||||
of networks and connections with attributes like predetermined
|
urldate = {2025-01-07},
|
||||||
packet loss. We inspect linear and grid-like topologies and
|
date = {2023},
|
||||||
discover that both share similar performance characteristics.},
|
langid = {english},
|
||||||
author = {Kern, Philipp},
|
note = {Medium: {PDF}
|
||||||
editora = {Architectures, Chair Of Network},
|
Publisher: Chair of Network Architectures and Services, School of Computation, Information and Technology, Technical University of Munich},
|
||||||
editoratype = {collaborator},
|
file = {PDF:/home/lhebendanz/Zotero/storage/KSRTDLCA/Kern - 2023 - Lost in Simulation Route Property in Mininet.pdf:application/pdf},
|
||||||
urldate = {2025-01-07},
|
|
||||||
date = {2023},
|
|
||||||
langid = {english},
|
|
||||||
note = {Medium: {PDF}
|
|
||||||
Publisher: Chair of Network Architectures and Services, School of
|
|
||||||
Computation, Information and Technology, Technical University of Munich},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/KSRTDLCA/Kern - 2023 -
|
|
||||||
Lost in Simulation Route Property in Mininet.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{savolainen_modeling_2019,
|
@article{savolainen_modeling_2019,
|
||||||
title = {Modeling the interplay of information seeking and
|
title = {Modeling the interplay of information seeking and information sharing: A conceptual analysis},
|
||||||
information sharing: A conceptual analysis},
|
volume = {71},
|
||||||
volume = {71},
|
issn = {2050-3806},
|
||||||
issn = {2050-3806},
|
url = {https://www.emerald.com/insight/content/doi/10.1108/ajim-10-2018-0266/full/html},
|
||||||
url =
|
doi = {10.1108/AJIM-10-2018-0266},
|
||||||
{https://www.emerald.com/insight/content/doi/10.1108/ajim-10-2018-0266/full/html},
|
shorttitle = {Modeling the interplay of information seeking and information sharing},
|
||||||
doi = {10.1108/AJIM-10-2018-0266},
|
abstract = {The purpose of this paper is to contribute to the creation of a holistic picture of information behavior by examining the connections between information seeking and sharing.,Conceptual analysis is used to focus on the ways in which the researchers have modeled the interplay of information seeking and sharing. The study draws on conceptual analysis of 27 key studies examining the above issue, with a focus on the scrutiny of six major models for information behavior.,Researchers have employed three main approaches to model the relationships between information seeking and sharing. The indirect approach conceptualizes information seeking and sharing as discrete activities connected by an intermediating factor, for example, information need. The sequential approach assumes that information seeking precedes information sharing. From the viewpoint of the interactive approach, information seeking and sharing appear as mutually related activities shaping each other iteratively or in a cyclical manner. The interactive approach provides the most sophisticated research perspective on the relationships of information seeking and sharing and contributes to holistic understanding of human information behavior.,As the study focuses on information seeking and sharing, no attention is devoted to other activities constitutive of information behavior, for example, information use.,The study pioneers by providing an in-depth analysis of the connections of information seeking and information sharing.},
|
||||||
shorttitle = {Modeling the interplay of information seeking and
|
pages = {518--534},
|
||||||
information sharing},
|
number = {4},
|
||||||
abstract = {The purpose of this paper is to contribute to the
|
journaltitle = {Aslib Journal of Information Management},
|
||||||
creation of a holistic picture of information behavior by examining
|
author = {Savolainen, Reijo},
|
||||||
the connections between information seeking and sharing.,Conceptual
|
urldate = {2025-01-24},
|
||||||
analysis is used to focus on the ways in which the researchers have
|
date = {2019-06-18},
|
||||||
modeled the interplay of information seeking and sharing. The study
|
langid = {english},
|
||||||
draws on conceptual analysis of 27 key studies examining the above
|
note = {Publisher: Emerald Publishing Limited},
|
||||||
issue, with a focus on the scrutiny of six major models for
|
file = {Full Text:/home/lhebendanz/Zotero/storage/LK5QNLVT/Savolainen - 2019 - Modeling the interplay of information seeking and information sharing A conceptual analysis.pdf:application/pdf;Snapshot:/home/lhebendanz/Zotero/storage/JMW3VDFN/html.html:text/html},
|
||||||
information behavior.,Researchers have employed three main
|
|
||||||
approaches to model the relationships between information seeking
|
|
||||||
and sharing. The indirect approach conceptualizes information
|
|
||||||
seeking and sharing as discrete activities connected by an
|
|
||||||
intermediating factor, for example, information need. The
|
|
||||||
sequential approach assumes that information seeking precedes
|
|
||||||
information sharing. From the viewpoint of the interactive
|
|
||||||
approach, information seeking and sharing appear as mutually
|
|
||||||
related activities shaping each other iteratively or in a cyclical
|
|
||||||
manner. The interactive approach provides the most sophisticated
|
|
||||||
research perspective on the relationships of information seeking
|
|
||||||
and sharing and contributes to holistic understanding of human
|
|
||||||
information behavior.,As the study focuses on information seeking
|
|
||||||
and sharing, no attention is devoted to other activities
|
|
||||||
constitutive of information behavior, for example, information
|
|
||||||
use.,The study pioneers by providing an in-depth analysis of the
|
|
||||||
connections of information seeking and information sharing.},
|
|
||||||
pages = {518--534},
|
|
||||||
number = {4},
|
|
||||||
journaltitle = {Aslib Journal of Information Management},
|
|
||||||
author = {Savolainen, Reijo},
|
|
||||||
urldate = {2025-01-24},
|
|
||||||
date = {2019-06-18},
|
|
||||||
langid = {english},
|
|
||||||
note = {Publisher: Emerald Publishing Limited},
|
|
||||||
file = {Full
|
|
||||||
Text:/home/lhebendanz/Zotero/storage/LK5QNLVT/Savolainen - 2019 -
|
|
||||||
Modeling the interplay of information seeking and information
|
|
||||||
sharing A conceptual
|
|
||||||
analysis.pdf:application/pdf;Snapshot:/home/lhebendanz/Zotero/storage/JMW3VDFN/html.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@online{noauthor_web_nodate,
|
@online{noauthor_web_nodate,
|
||||||
title = {The Web of False Information: Rumors, Fake News, Hoaxes,
|
title = {The Web of False Information: Rumors, Fake News, Hoaxes, Clickbait, and Various Other Shenanigans: Journal of Data and Information Quality: Vol 11, No 3},
|
||||||
Clickbait, and Various Other Shenanigans: Journal of Data and
|
url = {https://dl.acm.org/doi/abs/10.1145/3309699},
|
||||||
Information Quality: Vol 11, No 3},
|
urldate = {2025-01-24},
|
||||||
url = {https://dl.acm.org/doi/abs/10.1145/3309699},
|
file = {PDF:/home/lhebendanz/Zotero/storage/95QKTBA7/The Web of False Information Rumors, Fake News, Hoaxes, Clickbait, and Various Other Shenanigans J.pdf:application/pdf;The Web of False Information\: Rumors, Fake News, Hoaxes, Clickbait, and Various Other Shenanigans\: Journal of Data and Information Quality\: Vol 11, No 3:/home/lhebendanz/Zotero/storage/7A2CZ7A6/3309699.html:text/html},
|
||||||
urldate = {2025-01-24},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/95QKTBA7/The Web of
|
|
||||||
False Information Rumors, Fake News, Hoaxes, Clickbait, and Various
|
|
||||||
Other Shenanigans J.pdf:application/pdf;The Web of False
|
|
||||||
Information\: Rumors, Fake News, Hoaxes, Clickbait, and Various
|
|
||||||
Other Shenanigans\: Journal of Data and Information Quality\: Vol
|
|
||||||
11, No 3:/home/lhebendanz/Zotero/storage/7A2CZ7A6/3309699.html:text/html},
|
|
||||||
}
|
|
||||||
|
|
||||||
@article{noauthor_systematic_2024,
|
|
||||||
title = {A Systematic Approach to Deal with Noisy Neighbour in
|
|
||||||
Cloud Infrastructure {\textbar} Request {PDF}},
|
|
||||||
url =
|
|
||||||
{https://www.researchgate.net/publication/303741535_A_Systematic_Approach_to_Deal_with_Noisy_Neighbour_in_Cloud_Infrastructure},
|
|
||||||
doi = {10.17485/ijst/2016/v9i19/89211},
|
|
||||||
abstract = {Request {PDF} {\textbar} A Systematic Approach to Deal
|
|
||||||
with Noisy Neighbour in Cloud Infrastructure {\textbar}
|
|
||||||
Background/Objectives: One of the major challenges of the
|
|
||||||
multitenant cloud model is performance unpredictability because of
|
|
||||||
resource contention.... {\textbar} Find, read and cite all the
|
|
||||||
research you need on {ResearchGate}},
|
|
||||||
journaltitle = {{ResearchGate}},
|
|
||||||
urldate = {2025-02-19},
|
|
||||||
date = {2024-10-22},
|
|
||||||
langid = {english},
|
|
||||||
file = {Full Text PDF:/home/lhebendanz/Zotero/storage/3HXVA58J/2024
|
|
||||||
- A Systematic Approach to Deal with Noisy Neighbour in Cloud
|
|
||||||
Infrastructure Request
|
|
||||||
PDF.pdf:application/pdf;Snapshot:/home/lhebendanz/Zotero/storage/8KU7F7XX/303741535_A_Systematic_Approach_to_Deal_with_Noisy_Neighbour_in_Cloud_Infrastructure.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@online{noauthor_netzdg_nodate,
|
@online{noauthor_netzdg_nodate,
|
||||||
title = {{NetzDG} - Gesetz zur Verbesserung der Rechtsdurchsetzung
|
title = {{NetzDG} - Gesetz zur Verbesserung der Rechtsdurchsetzung in sozialen Netzwerken},
|
||||||
in sozialen Netzwerken},
|
url = {https://www.gesetze-im-internet.de/netzdg/BJNR335210017.html},
|
||||||
url = {https://www.gesetze-im-internet.de/netzdg/BJNR335210017.html},
|
urldate = {2025-02-24},
|
||||||
urldate = {2025-02-24},
|
file = {NetzDG - Gesetz zur Verbesserung der Rechtsdurchsetzung in sozialen Netzwerken:/home/lhebendanz/Zotero/storage/VKPIEEDI/BJNR335210017.html:text/html},
|
||||||
file = {NetzDG - Gesetz zur Verbesserung der Rechtsdurchsetzung in
|
|
||||||
sozialen
|
|
||||||
Netzwerken:/home/lhebendanz/Zotero/storage/VKPIEEDI/BJNR335210017.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@online{noauthor_packet_2025,
|
@online{noauthor_paket_2025,
|
||||||
title = {Packet zum Gesetz über digitale Dienste {\textbar}
|
title = {Paket zum Gesetz über digitale Dienste {\textbar} Gestaltung der digitalen Zukunft Europas},
|
||||||
Gestaltung der digitalen Zukunft Europas},
|
url = {https://digital-strategy.ec.europa.eu/de/policies/digital-services-act-package},
|
||||||
url =
|
urldate = {2025-02-24},
|
||||||
{https://digital-strategy.ec.europa.eu/de/policies/digital-services-act-package},
|
date = {2025-02-21},
|
||||||
urldate = {2025-02-24},
|
langid = {german},
|
||||||
date = {2025-02-21},
|
file = {Snapshot:/home/lhebendanz/Zotero/storage/362VSA4E/digital-services-act-package.html:text/html},
|
||||||
langid = {german},
|
|
||||||
file =
|
|
||||||
{Snapshot:/home/lhebendanz/Zotero/storage/362VSA4E/digital-services-act-package.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{salmi_constructing_2003,
|
@article{salmi_constructing_2003,
|
||||||
title = {Constructing Knowledge Societies: New Challenges for
|
title = {Constructing Knowledge Societies: New Challenges for Tertiary Education},
|
||||||
Tertiary Education},
|
volume = {28},
|
||||||
volume = {28},
|
issn = {0379-7724, 1469-8358},
|
||||||
issn = {0379-7724, 1469-8358},
|
url = {https://www.tandfonline.com/doi/full/10.1080/0379772032000110125},
|
||||||
url = {https://www.tandfonline.com/doi/full/10.1080/0379772032000110125},
|
doi = {10.1080/0379772032000110125},
|
||||||
doi = {10.1080/0379772032000110125},
|
shorttitle = {Constructing Knowledge Societies},
|
||||||
shorttitle = {Constructing Knowledge Societies},
|
pages = {65--69},
|
||||||
pages = {65--69},
|
number = {1},
|
||||||
number = {1},
|
journaltitle = {Higher Education in Europe},
|
||||||
journaltitle = {Higher Education in Europe},
|
author = {Salmi, Jamil},
|
||||||
author = {Salmi, Jamil},
|
urldate = {2025-02-26},
|
||||||
urldate = {2025-02-26},
|
date = {2003-04},
|
||||||
date = {2003-04},
|
langid = {english},
|
||||||
langid = {english},
|
file = {PDF:/home/lhebendanz/Zotero/storage/M7TSQ6XA/Salmi - 2003 - Constructing Knowledge Societies New Challenges for Tertiary Education.pdf:application/pdf},
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/M7TSQ6XA/Salmi - 2003 -
|
|
||||||
Constructing Knowledge Societies New Challenges for Tertiary
|
|
||||||
Education.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{sahlberg_rethinking_2010,
|
@article{sahlberg_rethinking_2010,
|
||||||
title = {Rethinking accountability in a knowledge society},
|
title = {Rethinking accountability in a knowledge society},
|
||||||
volume = {11},
|
volume = {11},
|
||||||
rights = {http://www.springer.com/tdm},
|
rights = {http://www.springer.com/tdm},
|
||||||
issn = {1389-2843, 1573-1812},
|
issn = {1389-2843, 1573-1812},
|
||||||
url = {http://link.springer.com/10.1007/s10833-008-9098-2},
|
url = {http://link.springer.com/10.1007/s10833-008-9098-2},
|
||||||
doi = {10.1007/s10833-008-9098-2},
|
doi = {10.1007/s10833-008-9098-2},
|
||||||
abstract = {Competition between schools combined with test-based
|
abstract = {Competition between schools combined with test-based accountability to hold schools accountable for predetermined knowledge standards have become a common solution in educational change efforts to improve the performance of educational systems around the world. This is happening as family and community social capital declines in most parts of developed world. Increased competition and individualism are not necessarily beneficial to creating social capital in schools and their communities. This article argues that: (1) the evidence remains controversial that test-based accountability policies improve the quality and efficiency of public education; (2) the current practice of determining educational performance by using primarily standardized knowledge tests as the main means of accountability is not a necessary condition for much needed educational improvement; and (3) there is growing evidence that increased high-stakes testing is restricting students’ conceptual learning, engaging in creative action and understanding innovation, all of which are essential elements of contemporary schooling in a knowledge society. Finland is used as an example to suggest that educational change should rather contribute to increasing networking and social capital in schools and in their communities through building trust and strengthening collective responsibilities within and between schools. This would create better prospects of worthwhile lifelong learning in and out of schools. Based on this analysis, the article concludes that education policies should be directed at promoting more intelligent forms of accountability to meet external accountability demands and to encourage cooperation rather than competition among students, teachers and schools.},
|
||||||
accountability to hold schools accountable for predetermined
|
pages = {45--61},
|
||||||
knowledge standards have become a common solution in educational
|
number = {1},
|
||||||
change efforts to improve the performance of educational systems
|
journaltitle = {J Educ Change},
|
||||||
around the world. This is happening as family and community social
|
author = {Sahlberg, Pasi},
|
||||||
capital declines in most parts of developed world. Increased
|
urldate = {2025-02-26},
|
||||||
competition and individualism are not necessarily beneficial to
|
date = {2010-02},
|
||||||
creating social capital in schools and their communities. This
|
langid = {english},
|
||||||
article argues that: (1) the evidence remains controversial that
|
file = {PDF:/home/lhebendanz/Zotero/storage/Q7WXPVKN/Sahlberg - 2010 - Rethinking accountability in a knowledge society.pdf:application/pdf},
|
||||||
test-based accountability policies improve the quality and
|
|
||||||
efficiency of public education; (2) the current practice of
|
|
||||||
determining educational performance by using primarily standardized
|
|
||||||
knowledge tests as the main means of accountability is not a
|
|
||||||
necessary condition for much needed educational improvement; and
|
|
||||||
(3) there is growing evidence that increased high-stakes testing is
|
|
||||||
restricting students’ conceptual learning, engaging in creative
|
|
||||||
action and understanding innovation, all of which are essential
|
|
||||||
elements of contemporary schooling in a knowledge society. Finland
|
|
||||||
is used as an example to suggest that educational change should
|
|
||||||
rather contribute to increasing networking and social capital in
|
|
||||||
schools and in their communities through building trust and
|
|
||||||
strengthening collective responsibilities within and between
|
|
||||||
schools. This would create better prospects of worthwhile lifelong
|
|
||||||
learning in and out of schools. Based on this analysis, the article
|
|
||||||
concludes that education policies should be directed at promoting
|
|
||||||
more intelligent forms of accountability to meet external
|
|
||||||
accountability demands and to encourage cooperation rather than
|
|
||||||
competition among students, teachers and schools.},
|
|
||||||
pages = {45--61},
|
|
||||||
number = {1},
|
|
||||||
journaltitle = {J Educ Change},
|
|
||||||
author = {Sahlberg, Pasi},
|
|
||||||
urldate = {2025-02-26},
|
|
||||||
date = {2010-02},
|
|
||||||
langid = {english},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/Q7WXPVKN/Sahlberg -
|
|
||||||
2010 - Rethinking accountability in a knowledge society.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{vanderlind_effects_2017,
|
@article{vanderlind_effects_2017,
|
||||||
title = {Effects of Mental Health on Student Learning},
|
title = {Effects of Mental Health on Student Learning},
|
||||||
volume = {22},
|
volume = {22},
|
||||||
issn = {1087-0059},
|
issn = {1087-0059},
|
||||||
url = {https://eric.ed.gov/?id=EJ1154566},
|
url = {https://eric.ed.gov/?id=EJ1154566},
|
||||||
abstract = {Learning can be hindered by students' mental health.
|
abstract = {Learning can be hindered by students' mental health. Given the increased reports of mental health concerns among college students, it is imperative that we understand how best to provide supports to this population to help them learn and succeed. This is particularly significant given the body of research that demonstrates how mental illness may negatively affect student success and degree persistence. In order to best serve this growing population, there are possible supports that can be provided in the classroom embedded into current practices and learning opportunities for all students across the board. This article addresses the connections between learning and mental health, practical takeaways for practitioners, and directions for future research.},
|
||||||
Given the increased reports of mental health concerns among college
|
pages = {39--58},
|
||||||
students, it is imperative that we understand how best to provide
|
number = {2},
|
||||||
supports to this population to help them learn and succeed. This is
|
journaltitle = {Learning Assistance Review},
|
||||||
particularly significant given the body of research that
|
author = {{VanderLind}, Ren},
|
||||||
demonstrates how mental illness may negatively affect student
|
urldate = {2025-02-26},
|
||||||
success and degree persistence. In order to best serve this growing
|
date = {2017},
|
||||||
population, there are possible supports that can be provided in the
|
langid = {english},
|
||||||
classroom embedded into current practices and learning
|
note = {Publisher: National College Learning Center Association
|
||||||
opportunities for all students across the board. This article
|
{ERIC} Number: {EJ}1154566},
|
||||||
addresses the connections between learning and mental health,
|
keywords = {Academic Achievement, Anxiety, College Students, Correlation, Depression (Psychology), Gender Differences, Learning, Learning Theories, Mental Disorders, Mental Health, Metacognition, Personality Traits, Success},
|
||||||
practical takeaways for practitioners, and directions for future research.},
|
file = {Full Text PDF:/home/lhebendanz/Zotero/storage/SGNY7WPR/VanderLind - 2017 - Effects of Mental Health on Student Learning.pdf:application/pdf},
|
||||||
pages = {39--58},
|
|
||||||
number = {2},
|
|
||||||
journaltitle = {Learning Assistance Review},
|
|
||||||
author = {{VanderLind}, Ren},
|
|
||||||
urldate = {2025-02-26},
|
|
||||||
date = {2017},
|
|
||||||
langid = {english},
|
|
||||||
note = {Publisher: National College Learning Center Association
|
|
||||||
{ERIC} Number: {EJ}1154566},
|
|
||||||
keywords = {Academic Achievement, Anxiety, College Students,
|
|
||||||
Correlation, Depression (Psychology), Gender Differences, Learning,
|
|
||||||
Learning Theories, Mental Disorders, Mental Health, Metacognition,
|
|
||||||
Personality Traits, Success},
|
|
||||||
file = {Full Text
|
|
||||||
PDF:/home/lhebendanz/Zotero/storage/SGNY7WPR/VanderLind - 2017 -
|
|
||||||
Effects of Mental Health on Student Learning.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{sinsebox_supervision_2020,
|
@article{sinsebox_supervision_2020,
|
||||||
title = {Supervision and Evaluation Practices That Impact Teacher
|
title = {Supervision and Evaluation Practices That Impact Teacher Learning: A Case Study of Rural Teachers’ Perspectives},
|
||||||
Learning: A Case Study of Rural Teachers’ Perspectives},
|
url = {https://fisherpub.sjf.edu/education_etd/474},
|
||||||
url = {https://fisherpub.sjf.edu/education_etd/474},
|
shorttitle = {Supervision and Evaluation Practices That Impact Teacher Learning},
|
||||||
shorttitle = {Supervision and Evaluation Practices That Impact
|
journaltitle = {Education Doctoral},
|
||||||
Teacher Learning},
|
author = {Sinsebox, Jennifer},
|
||||||
journaltitle = {Education Doctoral},
|
date = {2020-12-01},
|
||||||
author = {Sinsebox, Jennifer},
|
file = {"Supervision and Evaluation Practices That Impact Teacher Learning\: A C" by Jennifer L. Sinsebox:/home/lhebendanz/Zotero/storage/HWJMQJ9Z/474.html:text/html},
|
||||||
date = {2020-12-01},
|
|
||||||
file = {"Supervision and Evaluation Practices That Impact Teacher
|
|
||||||
Learning\: A C" by Jennifer L.
|
|
||||||
Sinsebox:/home/lhebendanz/Zotero/storage/HWJMQJ9Z/474.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{halkes_udp_2011,
|
@inproceedings{halkes_udp_2011,
|
||||||
title = {{UDP} {NAT} and firewall puncturing in the wild},
|
title = {{UDP} {NAT} and firewall puncturing in the wild},
|
||||||
volume = {6641},
|
volume = {6641},
|
||||||
isbn = {978-3-642-20797-6},
|
isbn = {978-3-642-20797-6},
|
||||||
doi = {10.1007/978-3-642-20798-3_1},
|
doi = {10.1007/978-3-642-20798-3_1},
|
||||||
abstract = {Peer-to-Peer (P2P) networks work on the presumption
|
abstract = {Peer-to-Peer (P2P) networks work on the presumption that all nodes in the network are connectable. However, {NAT} boxes and
|
||||||
that all nodes in the network are connectable. However, {NAT} boxes and
|
firewalls prevent connections to many nodes on the Internet. For {UDP} based protocols, the {UDP} hole-punching technique has
|
||||||
firewalls prevent connections to many nodes on the Internet. For
|
been proposed to mitigate this problem.
|
||||||
{UDP} based protocols, the {UDP} hole-punching technique has
|
|
||||||
been proposed to mitigate this problem.
|
|
||||||
|
|
||||||
This paper presents a study of the efficacy of {UDP} hole
|
This paper presents a study of the efficacy of {UDP} hole punching on the Internet in the context of an actual P2P network.
|
||||||
punching on the Internet in the context of an actual P2P network.
|
To the best of our knowledge, no previous study has provided similar measurements. Our results show that {UDP} hole punching
|
||||||
To the best of our knowledge, no previous study has provided
|
is an effective method to increase the connectability of peers on the Internet: approximately 64\% of all peers are behind
|
||||||
similar measurements. Our results show that {UDP} hole punching
|
a {NAT} box or firewall which should allow hole punching to work, and more than 80\% of hole punching attempts between these
|
||||||
is an effective method to increase the connectability of peers on
|
peers succeed.},
|
||||||
the Internet: approximately 64\% of all peers are behind
|
pages = {1--12},
|
||||||
a {NAT} box or firewall which should allow hole punching to work,
|
author = {Halkes, Gertjan and Pouwelse, J.A.},
|
||||||
and more than 80\% of hole punching attempts between these
|
date = {2011-06-01},
|
||||||
peers succeed.},
|
file = {Full Text PDF:/home/lhebendanz/Zotero/storage/VUJQDDIG/Halkes and Pouwelse - 2011 - UDP NAT and firewall puncturing in the wild.pdf:application/pdf},
|
||||||
pages = {1--12},
|
|
||||||
author = {Halkes, Gertjan and Pouwelse, J.A.},
|
|
||||||
date = {2011-06-01},
|
|
||||||
file = {Full Text
|
|
||||||
PDF:/home/lhebendanz/Zotero/storage/VUJQDDIG/Halkes and Pouwelse -
|
|
||||||
2011 - UDP NAT and firewall puncturing in the wild.pdf:application/pdf},
|
|
||||||
}
|
|
||||||
|
|
||||||
@article{mehrab_new_2025,
|
|
||||||
title = {A New Approach to Peer-to-Peer {VPN} Connectivity:
|
|
||||||
Achieving Seamless Communication Without Firewalls},
|
|
||||||
shorttitle = {A New Approach to Peer-to-Peer {VPN} Connectivity},
|
|
||||||
abstract = {This study presents a novel approach to peer-to-peer
|
|
||||||
Virtual Private Network ({VPN}) connectivity that eliminates
|
|
||||||
traditional firewall dependencies. As remote work and distributed
|
|
||||||
systems become increasingly prevalent, the limitations of
|
|
||||||
conventional {VPN} architectures-including performance bottlenecks,
|
|
||||||
complex configurations, and centralized points of failure-have
|
|
||||||
become more apparent. The research evaluates {ZeroTier}, a modern
|
|
||||||
network virtualization solution, against established {VPN}
|
|
||||||
technologies (Wireguard, Tailscale, and {OpenVPN}) across a
|
|
||||||
simulated environment of 100 globally distributed virtual nodes
|
|
||||||
over a 30-day period. Results demonstrate {ZeroTier}'s superior
|
|
||||||
performance across key metrics: 57\% faster connection
|
|
||||||
establishment than Wireguard, 45\% lower latency compared to
|
|
||||||
traditional solutions, higher throughput (875 Mbps for P2P
|
|
||||||
connections), reduced resource utilization, and a 94.8\%
|
|
||||||
first-attempt connection success rate. {ZeroTier} successfully
|
|
||||||
established direct P2P connections in 85\% of cases, significantly
|
|
||||||
outperforming competitors. The study details {ZeroTier}'s "Virtual
|
|
||||||
Layer 2 Ethernet" architecture, which combines centralized
|
|
||||||
coordination with decentralized communication and employs
|
|
||||||
sophisticated {NAT} traversal techniques to enable direct
|
|
||||||
device-to-device connections without complex firewall
|
|
||||||
configurations. This approach creates a flat, software-defined
|
|
||||||
network that spans multiple physical locations while maintaining
|
|
||||||
enterprise-grade security through end-to-end encryption.},
|
|
||||||
author = {Mehrab, Abu},
|
|
||||||
date = {2025-04-11},
|
|
||||||
file = {Full Text
|
|
||||||
PDF:/home/lhebendanz/Zotero/storage/8T5JMBVF/Mehrab - 2025 - A New
|
|
||||||
Approach to Peer-to-Peer VPN Connectivity Achieving Seamless
|
|
||||||
Communication Without Firewalls.pdf:application/pdf},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{lackorzynski_comparative_2019,
|
@inproceedings{lackorzynski_comparative_2019,
|
||||||
title = {A Comparative Study on Virtual Private Networks for Future
|
title = {A Comparative Study on Virtual Private Networks for Future Industrial Communication Systems},
|
||||||
Industrial Communication Systems},
|
url = {https://ieeexplore.ieee.org/document/8758010},
|
||||||
url = {https://ieeexplore.ieee.org/document/8758010},
|
doi = {10.1109/WFCS.2019.8758010},
|
||||||
doi = {10.1109/WFCS.2019.8758010},
|
abstract = {The future industrial networks will not be created from scratch. Rather, they will grow from existing installations without displacing legacy components. The secure integration of these legacy machines and networks will become an important building block in order to realize the vision of Industry 4.0. Secure and high performance virtual private networks ({VPNs}) will be necessary for that purpose.Therefore, we investigated and compared various {VPN} solutions. Their performance was tested on multiple hardware platforms ranging from very resource constrained to very powerful. Non-functional aspects, relating around security, manageability and ease of use, were discussed in order to assess their suitability for future use cases.We arrive at clear recommendations on which software {VPN} solutions to choose for future industrial setups.},
|
||||||
abstract = {The future industrial networks will not be created from
|
eventtitle = {2019 15th {IEEE} International Workshop on Factory Communication Systems ({WFCS})},
|
||||||
scratch. Rather, they will grow from existing installations without
|
pages = {1--8},
|
||||||
displacing legacy components. The secure integration of these
|
booktitle = {2019 15th {IEEE} International Workshop on Factory Communication Systems ({WFCS})},
|
||||||
legacy machines and networks will become an important building
|
author = {Lackorzynski, Tim and Köpsell, Stefan and Strufe, Thorsten},
|
||||||
block in order to realize the vision of Industry 4.0. Secure and
|
urldate = {2026-02-11},
|
||||||
high performance virtual private networks ({VPNs}) will be
|
date = {2019-05},
|
||||||
necessary for that purpose.Therefore, we investigated and compared
|
keywords = {Encryption, Hardware, industrial {IoT}, industrial networks, Industry, Logic gates, network security, Production facilities, secure transport, Software, tunneling, Virtual private networks, {VPN}},
|
||||||
various {VPN} solutions. Their performance was tested on multiple
|
file = {PDF:/home/lhebendanz/Zotero/storage/6Q5SUJX5/Lackorzynski et al. - 2019 - A Comparative Study on Virtual Private Networks for Future Industrial Communication Systems.pdf:application/pdf;Snapshot:/home/lhebendanz/Zotero/storage/PXWNAC6D/8758010.html:text/html},
|
||||||
hardware platforms ranging from very resource constrained to very
|
|
||||||
powerful. Non-functional aspects, relating around security,
|
|
||||||
manageability and ease of use, were discussed in order to assess
|
|
||||||
their suitability for future use cases.We arrive at clear
|
|
||||||
recommendations on which software {VPN} solutions to choose for
|
|
||||||
future industrial setups.},
|
|
||||||
eventtitle = {2019 15th {IEEE} International Workshop on Factory
|
|
||||||
Communication Systems ({WFCS})},
|
|
||||||
pages = {1--8},
|
|
||||||
booktitle = {2019 15th {IEEE} International Workshop on Factory
|
|
||||||
Communication Systems ({WFCS})},
|
|
||||||
author = {Lackorzynski, Tim and Köpsell, Stefan and Strufe, Thorsten},
|
|
||||||
urldate = {2026-02-11},
|
|
||||||
date = {2019-05},
|
|
||||||
keywords = {Encryption, Hardware, industrial {IoT}, industrial
|
|
||||||
networks, Industry, Logic gates, network security, Production
|
|
||||||
facilities, secure transport, Software, tunneling, Virtual private
|
|
||||||
networks, {VPN}},
|
|
||||||
file = {PDF:/home/lhebendanz/Zotero/storage/DWSF7ERP/Lackorzynski
|
|
||||||
et al. - 2019 - A Comparative Study on Virtual Private Networks for
|
|
||||||
Future Industrial Communication
|
|
||||||
Systems.pdf:application/pdf;Snapshot:/home/lhebendanz/Zotero/storage/PXWNAC6D/8758010.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@online{noauthor_nat_2026,
|
@online{noauthor_nat_2026,
|
||||||
title = {{NAT} Traversal: How It Works},
|
title = {{NAT} Traversal: How It Works},
|
||||||
url = {https://dev.to/alakkadshaw/nat-traversal-how-it-works-4dnc},
|
url = {https://dev.to/alakkadshaw/nat-traversal-how-it-works-4dnc},
|
||||||
shorttitle = {{NAT} Traversal},
|
shorttitle = {{NAT} Traversal},
|
||||||
abstract = {{NAT} traversal is the set of techniques that solves
|
abstract = {{NAT} traversal is the set of techniques that solves this problem: discovering public addresses,...},
|
||||||
this problem: discovering public addresses,...},
|
titleaddon = {{DEV} Community},
|
||||||
titleaddon = {{DEV} Community},
|
urldate = {2026-02-11},
|
||||||
urldate = {2026-02-11},
|
date = {2026-01-30},
|
||||||
date = {2026-01-30},
|
langid = {english},
|
||||||
langid = {english},
|
file = {Snapshot:/home/lhebendanz/Zotero/storage/UHJQ84AV/nat-traversal-how-it-works-4dnc.html:text/html},
|
||||||
file =
|
|
||||||
{Snapshot:/home/lhebendanz/Zotero/storage/UHJQ84AV/nat-traversal-how-it-works-4dnc.html:text/html},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@software{krause_krausestjs-framework-benchmark_2026,
|
@software{krause_krausestjs-framework-benchmark_2026,
|
||||||
title = {krausest/js-framework-benchmark},
|
title = {krausest/js-framework-benchmark},
|
||||||
rights = {Apache-2.0},
|
rights = {Apache-2.0},
|
||||||
url = {https://github.com/krausest/js-framework-benchmark},
|
url = {https://github.com/krausest/js-framework-benchmark},
|
||||||
abstract = {A comparison of the performance of a few popular
|
abstract = {A comparison of the performance of a few popular javascript frameworks},
|
||||||
javascript frameworks},
|
author = {Krause, Stefan},
|
||||||
author = {Krause, Stefan},
|
urldate = {2026-02-11},
|
||||||
urldate = {2026-02-11},
|
date = {2026-02-11},
|
||||||
date = {2026-02-11},
|
note = {original-date: 2015-12-09T20:10:53Z},
|
||||||
note = {original-date: 2015-12-09T20:10:53Z},
|
}
|
||||||
|
|
||||||
|
@article{leung_overview_2007,
|
||||||
|
title = {An Overview of Packet Reordering in Transmission Control Protocol ({TCP}): Problems, Solutions, and Challenges},
|
||||||
|
volume = {18},
|
||||||
|
issn = {1558-2183},
|
||||||
|
url = {https://ieeexplore.ieee.org/document/4118693},
|
||||||
|
doi = {10.1109/TPDS.2007.1011},
|
||||||
|
shorttitle = {An Overview of Packet Reordering in Transmission Control Protocol ({TCP})},
|
||||||
|
abstract = {Transmission control protocol ({TCP}) is the most popular transport layer protocol for the Internet. Due to various reasons, such as multipath routing, route fluttering, and retransmissions, packets belonging to the same flow may arrive out of order at a destination. Such packet reordering violates the design principles of some traffic control mechanisms in {TCP} and, thus, poses performance problems. In this paper, we provide a comprehensive and in-depth survey on recent research on packet reordering in {TCP}. The causes and problems for packet reordering are discussed. Various representative algorithms are examined and compared by computer simulations. The ported program codes and simulation scripts are available for download. Some open questions are discussed to stimulate further research in this area},
|
||||||
|
pages = {522--535},
|
||||||
|
number = {4},
|
||||||
|
journaltitle = {{IEEE} Transactions on Parallel and Distributed Systems},
|
||||||
|
author = {Leung, Ka-cheong and Li, Victor O.k. and Yang, Daiqin},
|
||||||
|
urldate = {2026-02-16},
|
||||||
|
date = {2007-04},
|
||||||
|
keywords = {{ARPANET}, Communication system control, Computational modeling, Computer simulations of {TCP}, congestion control, flow control, Internet, {IP} networks, Out of order, packet reordering, Routing, Telecommunication network reliability, Traffic control, Transmission Control Protocol ({TCP})., Transport protocols},
|
||||||
|
file = {Snapshot:/home/lhebendanz/Zotero/storage/NEVVLVJL/4118693.html:text/html;Submitted Version:/home/lhebendanz/Zotero/storage/5SQILKLX/Leung et al. - 2007 - An Overview of Packet Reordering in Transmission Control Protocol (TCP) Problems, Solutions, and Ch.pdf:application/pdf},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{mcclellan_estimating_2013,
|
||||||
|
title = {Estimating Retransmission Timeouts in {IP}-Based Transport Protocols},
|
||||||
|
author = {{McClellan}, Stan and Peng, Wuxu},
|
||||||
|
date = {2013-04-01},
|
||||||
|
file = {Full Text PDF:/home/lhebendanz/Zotero/storage/9PZP9SVG/McClellan and Peng - 2013 - Estimating Retransmission Timeouts in IP-Based Transport Protocols.pdf:application/pdf},
|
||||||
|
}
|
||||||
|
|
||||||
|
@misc{guo_implementation_2025,
|
||||||
|
title = {Implementation and Performance Evaluation of {TCP} over {QUIC} Tunnels},
|
||||||
|
url = {http://arxiv.org/abs/2504.10054},
|
||||||
|
doi = {10.48550/arXiv.2504.10054},
|
||||||
|
abstract = {{QUIC}, a {UDP}-based transport protocol, addresses several limitations of {TCP} by offering built-in encryption, stream multiplexing, and improved loss recovery. To extend these benefits to legacy {TCP}-based applications, this paper explores the implementation and evaluation of a {TCP} over {QUIC} tunneling approach. A lightweight, stream-based tunnel is constructed using the Rust-based Quinn library, enabling {TCP} traffic to traverse {QUIC} connections transparently. Performance is evaluated under varying network conditions, including packet loss, high latency, and out-of-order delivery. Results indicate that {TCP} over {QUIC} maintains significantly higher throughput than native {TCP} in lossy or unstable environments, with up to a high improvement under 20{\textbackslash}\% packet loss. However, under ideal network conditions, tunneling introduces modest overhead due to encryption and user-space processing. These findings provide insights into the trade-offs of {TCP} over {QUIC} tunneling and its suitability for deployment in dynamic or impaired networks.},
|
||||||
|
number = {{arXiv}:2504.10054},
|
||||||
|
publisher = {{arXiv}},
|
||||||
|
author = {Guo, Xuanhong and Bao, Zekun and Chen, Ying},
|
||||||
|
urldate = {2026-02-16},
|
||||||
|
date = {2025-10-07},
|
||||||
|
eprinttype = {arxiv},
|
||||||
|
eprint = {2504.10054 [cs]},
|
||||||
|
keywords = {Computer Science - Networking and Internet Architecture},
|
||||||
|
file = {Preprint PDF:/home/lhebendanz/Zotero/storage/FXJSBRXL/Guo et al. - 2025 - Implementation and Performance Evaluation of TCP over QUIC Tunnels.pdf:application/pdf;Snapshot:/home/lhebendanz/Zotero/storage/LJ56UH99/2504.html:text/html},
|
||||||
|
}
|
||||||
|
|
||||||
|
@report{whitner_improved_2008,
|
||||||
|
title = {Improved Packet Reordering Metrics},
|
||||||
|
url = {https://datatracker.ietf.org/doc/rfc5236},
|
||||||
|
abstract = {This document presents two improved metrics for packet reordering, namely, Reorder Density ({RD}) and Reorder Buffer-occupancy Density ({RBD}). A threshold is used to clearly define when a packet is considered lost, to bound computational complexity at O(N), and to keep the memory requirement for evaluation independent of N, where N is the length of the packet sequence. {RD} is a comprehensive metric that captures the characteristics of reordering, while {RBD} evaluates the sequences from the point of view of recovery from reordering. These metrics are simple to compute yet comprehensive in their characterization of packet reordering. The measures are robust and orthogonal to packet loss and duplication. This memo provides information for the Internet community.},
|
||||||
|
number = {{RFC} 5236},
|
||||||
|
institution = {Internet Engineering Task Force},
|
||||||
|
type = {Request for Comments},
|
||||||
|
author = {Whitner, Rick and Banka, Tarun and Piratla, Nischal M. and Bare, Abhijit A. and Jayasumana, Professor Anura P.},
|
||||||
|
urldate = {2026-02-16},
|
||||||
|
date = {2008-06},
|
||||||
|
doi = {10.17487/RFC5236},
|
||||||
|
note = {Num Pages: 26},
|
||||||
|
file = {Full Text PDF:/home/lhebendanz/Zotero/storage/KM9D625Y/Whitner et al. - 2008 - Improved Packet Reordering Metrics.pdf:application/pdf},
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user