Chatty ROADMs: Streaming Telemetry with Open Source Software and Open Hardware
Authors
Kundrát, J.; Kubernát, V.; Pecka, T.; Havliš, O.; Šlapák, M.; Jedlinský, J.; Vojtěch, J.
Year
2021
Published
2021 European Conference on Optical Communication (ECOC). IEEE (Institute of Electrical and Electronics Engineers), 2021. ISBN 9781665411509.
Type
Proceedings paper
Departments
Annotation
An interactive demo presents live, real-time optical performance monitoring of the optical spectrum from an Open Optical Line System. Built with open source software, open hardware, and using standard YANG tooling, we achieve a sub-GHz resolution and a sub-second refresh rate over the C-band.
Opening up ROADMs: streaming telemetry [Invited]
Authors
Kundrát, J.; Vaško, M.; Krejčí, R.; Kubernát, V.; Pecka, T.; Havliš, O.; Šlapák, M.; Jedlinský, J.; Vojtěch, J.
Year
2021
Published
Journal of Optical Communications and Networking. 2021, 2021(13), E81-E93. ISSN 1943-0620.
Type
Article
Departments
Annotation
We present an implementation of streaming telemetry of optical metrics within open hardware reconfigurable add/drop multiplexers (ROADMs). Our key achievements are sub-second updates of high-resolution spectrum scans, and we demonstrate a sustained telemetry stream of the full C-band with a sub-GHz resolution. The telemetry streaming is implemented over a standard, Internet Engineering Task Force (IETF)-defined protocol (YANG Push) in collaboration with an open-source YANG software stack and device-specific code. As the telemetry collector, we used a common time series database (TSDB) along with a visualization dashboard. We also extended the Open Network Operating System (ONOS) software-defined network (SDN) controller to act as a telemetry receiver.
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination
Authors
Year
2020
Published
Proceedings of the Prague Stringology Conference 2020. Praha: Czech Technical University in Prague, 2020. p. 11-22. ISBN 978-80-01-06749-9.
Type
Proceedings paper
Departments
Annotation
Regular tree languages can be accepted and described by finite tree automata and regular tree expressions, respectively.
We describe a new algorithm that converts a finite tree automaton to an equivalent regular tree expression.
Our algorithm is analogous to the well-known state elimination method of the conversion of a string finite automaton to an equivalent string regular expression.
We define a generalised finite tree automaton, the transitions of which read the sets of trees described by regular tree expressions.
Our algorithm eliminates states of the generalised finite tree automaton, which is analogous to the elimination of states in converting the string finite automaton.
Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
Authors
Year
2020
Published
Proceedings of the Prague Stringology Conference 2020. Praha: Czech Technical University in Prague, 2020. p. 61-73. ISBN 978-80-01-06749-9.
Type
Proceedings paper
Departments
Annotation
We define a tree pattern border array as a property of linearised trees analogous to border arrays from the string domain. We use it to define a new forward tree pattern matching algorithm for ordered trees, which finds all occurrences of a single given linearised tree pattern in a linearised input tree. As with the classical Morris-Pratt algorithm, the tree pattern border array is used to determine shift lengths in the matching phase of the tree pattern matching algorithm.
We compare the new algorithm with the best performing previously existing algorithms based on backward linearised tree pattern matching algorithms, (non-)linearised tree pattern matching algorithms using finite tree automata or stringpath matchers. We show that the presented algorithm outperforms these for single tree pattern matching.
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression
Authors
Year
2018
Published
7th Symposium on Languages, Applications and Technologies (SLATE 2018). Saarbrücken: Dagstuhl Publishing,, 2018. p. 6:1-6:12. ISSN 2190-6807. ISBN 978-3-95977-072-9.
Type
Proceedings paper
Departments
Annotation
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by a finite tree automaton as a standard model of computation. It was proved that the class of regular tree languages is a proper subclass of tree languages those linear notations can be accepted by deterministic string pushdown automata. In this paper, we present a new algorithm for transforming regular tree expressions to equivalent real-time height-deterministic pushdown automata that accept the trees in their postfix notation.