• Round trip time – Delay from sender to receiver
and back.
• Delay variation – Variation of packets’ one-way
delays.
• Throughput – Amount of data that is transferred
in a certain period of time. Usually measured in
bits per second.
• Goodput – Effective, application-level throughput
without protocol overhead.
3.3 Application Level Optimization
With application level optimization, the application
layer is informed about current QoS metrics and has
the chance to adapt accordingly. This is not a novel
approach; adaptive codecs have been around for quite
a while.
The Adaptive Multi-Rate (AMR) audio codec,
which is widely used in GSM and UMTS, is a promi-
nent example. With AMR, different coding schemes
can be used depending on link quality measurements
performed on the receiver side (Ekudden et al., 1999).
If conditions are good, AMR strives for speech qual-
ity (high speech bandwidth, low error protection). If
conditions are bad, AMR strives for robustness (com-
promising on speech quality but boosting error cor-
rection and limiting bandwidth needs).
Another prominent example for existing
application-level optimization is adaptive bitrate
streaming (ABS) for video. ABS detects the user’s
current bandwidth and adjusts the quality of the
video stream accordingly. One current ABS imple-
mentation is HTTP Adaptive Streaming (HAS). With
HAS, segments of content (in the size of seconds) are
encoded with different quality levels and made avail-
able over HTTP. The receiving side can then choose
segments according to current bandwidth estimates.
An interesting view into how YouTube is handling
Quality of Experience for video can be found in
(Sieber et al., 2016). NADA (Network-Assisted
Dynamic Adaptation) (Zhu et al., 2013) also suggests
adaptive real-time media applications in which adapt
their video target rate and thus their sending rate
based on explicit or implicit congestion signals.
In difference to the solutions above, TriCePS fol-
lows a more general approach by allowing the type
of content being transported to change. This is sup-
ported by protocol switching and protocol parameter
optimization mechanisms. However, approaches and
solutions developed for by the other solutions such as
NADA’s delay estimations could generally be reused
in TriCePS as components.
3.4 Protocol Switching
Protocol switching or, more specifically, time-
independent communication protocol (re-)negotiation
and switching enables two things: first and foremost,
interoperability between a priori unknown end sys-
tems and second, further optimization of network us-
age through optimal protocol selection.
A recent, relevant work is Application-Layer Pro-
tocol Negotiation (ALPN), described in (Friedl et al.,
2014). ALPN is a TLS extension and allows for pro-
tocol negotiation within the TLS handshake. The
client sends a list of supported application protocols
with its TLS ClientHello message. The application
layer protocol to be used is then contained in the
server’s reply, the ServerHello message. For this, it
is assumed that the server supports a number of pro-
tocols that are ordered by preference. A process sim-
ilar to APLN will be implemented in TriCePS for
protocol negotiation. The Session Initiation Protocol
(SIP) with its Session Description Protocol (SDP) can
be seen as another example for protocol negotiation
(Rosenberg et al., 2002).
Finally, for a protocol repository an approach sim-
ilar to software repositories will be used which man-
age and store applications and software packages that
can be downloaded and installed on digital devices.
Various software application or packet managers exist
for specific operating systems (like Linux, Windows,
macOS, Android) or programming languages (such as
Maven for Java, PyPI for Python, CTAN for LaTeX).
3.5 Protocol Parameter Optimization
The parameter optimization for transmission proto-
cols has a long history for TCP retransmission time
out estimation (Paxson et al., 2011) based on heuristic
formulas. (Balandina et al., 2013; Betzler et al., 2016)
present the heuristic adaptation of the two CoAP pa-
rameters used for controlling the back-off mecha-
nism retransmission timeout (RTO) and retransmis-
sion counter. Additionally the problem of miss-
ing ACKs for NON(-confirmable) messages leading
to sparse RTT measurements is solved by artificial
generated CON messages (“weak RTTs”). A new
so-called Organic Network Control-based systematic
learning approach is presented in (Kodama et al.,
2008). The situation for a sending entity in the CPS
is modelled as a competition between species in a
harsh environment with the Lotka-Volterra competi-
tion model. The population of the species is mapped
onto the TCP window size dependent on the received
ACKs. Especially this work has high relevance for
this project because its results were validated by a
IoTBDS 2019 - 4th International Conference on Internet of Things, Big Data and Security
244