Transition (computer science)

from Wikipedia, the free encyclopedia
The goal of the transition is a seamless, constant quality or quality of service in a communication system

Transition refers to an IT paradigm in the context of communication systems that the transition between mechanisms, i.e. H. Functions of a communication system, in particular service and protocol components , describes. During a transition, context-dependent, functionally comparable mechanisms within a communication system are merged into one another. The aim is to ensure the highest possible quality or service quality that is as constant as possible .

Idea and functional principle

The transition and the subsequent adaptation of the communication system make it possible to optimize quality despite changing framework conditions

Through the transition, communication systems should be able to adapt to changed framework conditions during operation. This change can be, for example, a rapid increase in the load on a service that is e.g. B. can be caused by an accumulation (and concentration) of people with mobile devices. A transition often affects different mechanisms on different technical levels of a layer architecture . Mechanisms are understood as conceptual elements of a networked communication system and are linked to certain functional units, especially as a service and protocol component. In extreme cases, a mechanism can also be an entire protocol. At the transmission level, for example , LTE would be such a mechanism. There are numerous mechanisms and some of them are equivalent in their basic functionality, e.g. B. on the one hand Wi-Fi , Bluetooth and ZigBee for local wireless networks and on the other hand UMTS and LTE for broadband wireless connections. For example, LTE and WIFI have equivalent basic functionality, but are technologically different in their structure. Mechanisms affected by transitions are often part of a protocol or service. For example, in the case of video data transmission, different video data encodings can be used depending on the available data transmission rate. These transitions are controlled and implemented by transitions; an example from research is a context-aware video customization service to support mobile video applications. These existing, diverse structures are used through transition. By analyzing the current processes in the communication system, it can be determined which transitions should ideally be carried out on which level in order to meet the current requirements with regard to the required quality. In order to adapt communication systems to the respective framework conditions, architectural approaches of self-organizing, adaptive systems are available such as B. the MAPE cycle (Monitor-Analyze-Plan-Execute). With this central concept of autonomic computing , the status of the communication system is determined, the monitoring data is analyzed and the necessary transition is planned and executed. A central goal is that users do not consciously perceive the transition (s) in the running application and that the functionality of the services used is perceived as smooth and fluid.

Current research

Research into new construction methods, models and processes that enable automated, coordinated and cross-layer transitions between functionally similar mechanisms within a communication system is the main goal of a DFG Collaborative Research Center 1053 MAKI - Multi-Mechanism Adaptation for the Future Internet. Central questions are researched in the focal points: the (i) methodological foundations of the transitions, the (ii) procedures for adapting communication systems capable of transition based on the desired and achieved quality, and the (iii) concrete transitions from different perspectives on a communication system.

A formalization of the concept of transition, which records the characteristics and relationships within a communication system in order to map and optimize the decision-making process associated with such a system, is contained in. The associated building blocks include (i) dynamic software product lines , (ii) Markov decision-making processes and (iii) utility design . While dynamic software product lines offer a method for the concise recording of a large configuration space and for specifying the run-time variability of adaptive systems, Markov decision-making processes provide a mathematical tool to define and plan transitions between available communication mechanisms. Finally, utility functions quantify the performance of each configuration of the transition-based communication system and provide the means to optimize the performance of such a system.

Applications of the idea of ​​transition have found their way into wireless sensor networks and mobile networks, distributed reactive programming , WiFi firmware modification, planning of autonomous computer systems, analysis of CDNs , flexible expansions of the ISO- OSI stack, 5G high-frequency vehicle communication, analysis of MapReduce- like parallel systems, planning of multipath TCP , adaptivity for beam training in 802.11ad , operator placement in dynamic user environments, DASH video player analysis, adaptive bitrate streaming and complex event processing on mobile devices.

Web links

Individual evidence

  1. ^ S. Wilk, D. Stohr, and W. Effelsberg. 2016. A Content-Aware Video Adaptation Service to Support Mobile Video. ACM Trans. Multimedia Comput. Commun. Appl. 12, 5s, Article 82 (November 2016)
  2. ^ JO Kephart and DM Chess. The vision of autonomic computing. IEEE Computer, 1, pp. 41-50, 2003.
  3. ^ B. Alt, M. Weckesser et al .: Transitions: A Protocol-Independent View of the Future Internet . In: Proceedings of the IEEE . tape 107 , no. 4 , 2019, ISSN  0018-9219 , p. 835–846 , doi : 10.1109 / JPROC.2019.2895964 ( ieee.org [accessed May 22, 2019]).
  4. ↑ Roland Kluge, Michael Stein, David Giessing, Andy Schürr, Max Mühlhäuser: cMoflon: Model-Driven Generation of Embedded C Code for Wireless Sensor Networks . In: Modeling Foundations and Applications (=  Lecture Notes in Computer Science ). Springer International Publishing, 2017, ISBN 978-3-319-61482-3 , pp. 109–125 , doi : 10.1007 / 978-3-319-61482-3_7 ( springer.com [accessed May 22, 2019]).
  5. ↑ N. Richerzhagen, B. Richerzhagen, R. Hark, D. Stingl, R. Steinmetz: Limiting the Footprint of Monitoring in Dynamic Scenarios through Multi-Dimensional Offloading . In: 2016 25th International Conference on Computer Communication and Networks (ICCCN) . 2016, p. 1-9 , doi : 10.1109 / ICCCN.2016.7568539 ( ieee.org [accessed May 22, 2019]).
  6. ↑ Ragnar Mogk, Lars Baumgärtner, Guido Salvaneschi, Bernd Freisleben, Mira Mezini: Fault-tolerant Distributed Reactive Programming . In: 32nd European Conference on Object-Oriented Programming (ECOOP 2018) (=  Leibniz International Proceedings in Informatics (LIPIcs) ). tape 109 . Schloss Dagstuhl – Leibniz Center for Computer Science, Dagstuhl, Germany 2018, ISBN 978-3-95977-079-8 , p. 1: 1–1: 26 , doi : 10.4230 / LIPIcs.ECOOP.2018.1 ( dagstuhl.de [accessed on May 22, 2019]).
  7. ↑ A. Margara, G. Salvaneschi: On the Semantics of Distributed Reactive Programming: The Cost of consistency . In: IEEE Transactions on Software Engineering . tape 44 , no. 7 , 2018, ISSN  0098-5589 , p. 689–711 , doi : 10.1109 / TSE.2018.2833109 ( ieee.org [accessed May 22, 2019]).
  8. ↑ Matthias Schulz, Daniel Wegemer, Matthias Hollick: The Nexmon firmware analysis and modification framework: Empowering researchers to enhance Wi-Fi devices . In: Computer Communications . tape 129 , September 1, 2018, ISSN  0140-3664 , p. 269–285 , doi : 10.1016 / j.comcom.2018.05.015 ( sciencedirect.com [accessed May 22, 2019]).
  9. ↑ M. pan Mueller, C. Krupitzer, M. Weckesser, C. Becker: A Dynamic Software Product Line Approach for Adaptation Planning in autonomic computing system . In: 2017 IEEE International Conference on Autonomic Computing (ICAC) . 2017, p. 247-254 , doi : 10.1109 / ICAC.2017.18 ( ieee.org [accessed May 22, 2019]).
  10. ↑ Jeremiah Blendin, Fabrice Bendfeldt, Ingmar Poese, Boris Koldehofe, and Oliver Hohlfeld. 2018. Dissecting Apple's Meta-CDN during an iOS Update. In Proceedings of the Internet Measurement Conference 2018 (IMC '18). ACM
  11. ↑ J. Heuschkel, L. Wang, E. Fleckstein, M. Ofenloch, M. Blöcher: VirtualStack: Flexible Cross-layer Optimization via Network Protocol Virtualization . In: 2018 IEEE 43rd Conference on Local Computer Networks (LCN) . October 2018, p. 519-526 , doi : 10.1109 / LCN.2018.8638106 ( ieee.org [accessed May 22, 2019]).
  12. ^ A. Asadi, S. Müller, GH Sim, A. Klein, M. Hollick: FML: Fast Machine Learning for 5G mmWave Vehicular Communications . In: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications . 2018, p. 1961–1969 , doi : 10.1109 / INFOCOM.2018.8485876 ( ieee.org [accessed May 22, 2019]).
  13. ^ GH Sim, S. Klos, A. Asadi, A. Klein, M. Hollick: An Online Context-Aware Machine Learning Algorithm for 5G mmWave Vehicular Communications . In: IEEE / ACM Transactions on Networking . tape 26 , no. 6 , December 2018, ISSN  1063-6692 , p. 2487-2500 , doi : 10.1109 / TNET.2018.2869244 ( ieee.org [accessed May 22, 2019]).
  14. ↑ WR KhudaBukhsh, A. Rizk, A. Frömmgen, H. Koeppl: Optimizing stochastic scheduling in fork-join queuing models: Bounds and applications . In: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications . 2017, p. 1-9 , doi : 10.1109 / INFOCOM.2017.8057013 ( ieee.org [accessed May 22, 2019]).
  15. ↑ Alexander Frömmgen, Amr Rizk, Tobias Erbshäußer, Max Weller, Boris Koldehofe: A Programming Model for Application-defined Multipath TCP Scheduling . In: Proceedings of the 18th ACM / IFIP / USENIX Middleware Conference (=  Middleware '17 ). ACM, New York, NY, USA 2017, ISBN 978-1-4503-4720-4 , pp. 134–146 , doi : 10.1145 / 3135974.3135979 ( acm.org [accessed May 22, 2019]).
  16. ^ Joan Palacios, Daniel Steinmetzer, Adrian Loch, Matthias Hollick, Joerg Widmer: Adaptive Codebook Optimization for Beam Training on Off-the-Shelf IEEE 802.11Ad Devices . In: Proceedings of the 24th Annual International Conference on Mobile Computing and Networking (=  MobiCom '18 ). ACM, New York, NY, USA 2018, ISBN 978-1-4503-5903-0 , pp. 241-255 , doi : 10.1145 / 3241539.3241576 ( acm.org [accessed May 22, 2019]).
  17. ↑ Manisha Luthra, Boris Koldehofe, Pascal Weisenburger, Guido Salvaneschi, Raheel Arif: TCEP: Adapting to Dynamic User Environments by Enabling Transitions Between Operator Placement Mechanisms . In: Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems (=  DEBS '18 ). ACM, New York, NY, USA 2018, ISBN 978-1-4503-5782-1 , pp. 136–147 , doi : 10.1145 / 3210284.3210292 ( acm.org [accessed May 22, 2019]).
  18. ↑ Denny Stohr, Alexander Frömmgen, Amr Rizk, Michael Zink, Ralf Steinmetz: Where Are the Sweet Spots ?: A Systematic Approach to Reproducible DASH Player Comparisons . In: Proceedings of the 25th ACM International Conference on Multimedia (=  MM '17 ). ACM, New York, NY, USA 2017, ISBN 978-1-4503-4906-2 , pp. 1113–1121 , doi : 10.1145 / 3123266.3123426 ( acm.org [accessed May 22, 2019]).
  19. ↑ Rizk, Amr; Koeppl, Heinz; Steinmetz, Ralf; Ballard, Trevor; Alt, Bastian (2019-01-17). "CBA: Contextual Quality Adaptation for Adaptive Bitrate Video Streaming (Extended Version)"
  20. ↑ Pablo Graubner, Christoph Thelen, Michael Körber, Artur Sterz, Guido Salvaneschi: Multimodal Complex Event Processing on Mobile Devices . In: Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems (=  DEBS '18 ). ACM, New York, NY, USA 2018, ISBN 978-1-4503-5782-1 , pp. 112–123 , doi : 10.1145 / 3210284.3210289 ( acm.org [accessed May 22, 2019]).