Transition (computer science)

Last updated
The aim of a transition is to provide a seamless, consistent quality, e.g., QoS in a communication system. Transition en-03.png
The aim of a transition is to provide a seamless, consistent quality, e.g., QoS in a communication system.

Transition refers to a computer science paradigm in the context of communication systems which describes the change of communication mechanisms, i.e., functions of a communication system, in particular, service and protocol components. In a transition, communication mechanisms within a system are replaced by functionally comparable mechanisms with the aim to ensure the highest possible quality, e.g., as captured by the quality of service.

Contents

Transitions and the subsequent adaptation of communication systems enable the optimization of g conditions. Transition en-05.png
Transitions and the subsequent adaptation of communication systems enable the optimization of g conditions.

Transitions enable communication systems to adapt to changing conditions during runtime. This change in conditions can, for example, be a rapid increase in the load on a certain service that may be caused, e.g., by large gatherings of people with mobile devices. A transition often impacts multiple mechanisms at different communication layers of a layered architecture.

Mechanisms are given as conceptual elements of a networked communication system and are linked to specific functional units, for example, as a service or protocol component. In some cases, a mechanism can also comprise an entire protocol. For example on the transmission layer, LTE can be regarded as such a mechanism. Following this definition, there exist numerous communication mechanisms that are partly equivalent in their basic functionality, such as Wi-Fi, Bluetooth and Zigbee for local wireless networks and UMTS and LTE for broadband wireless connections. For example, LTE and Wi-Fi have equivalent basic functionality, but they are technologically significantly different in their design and operation. Mechanisms affected by transitions are often components of a protocol or service. For example, in case of video streaming/transmission, the use of different video data encoding can be carried out depending on the available data transmission rate. These changes are controlled and implemented by transitions; A research example is a context-aware video adaptation service to support mobile video applications. [1] Through analyzing the current processes in a communication system, it is possible to determine which transitions need to be executed at which communication layer in order to meet the quality requirements. In order for communication systems to adapt to the respective framework conditions, architectural approaches of self-organizing, adaptive systems can be used, such as the MAPE cycle [2] (Monitor-Analyze-Plan-Execute). This central concept of Autonomic Computing can be used to determine the state of the communication system, to analyze the monitoring data and to plan and execute the necessary transition(s). A central goal is that users do not consciously perceive a transition while running applications and that the functionality of the used services is perceived as smooth and fluid.

Recent research

The study of new and fundamental design methods, models and techniques that enable automated, coordinated and cross-layer transitions between functionally similar mechanisms within a communication system is the main goal of a collaborative research center funded by the German research foundation (DFG). The DFG collaborative research center 1053 MAKI - Multi-mechanism Adaptation for the future Internet - focuses on research questions in the following areas: (i) Fundamental research on transition methods, (ii) Techniques for adapting transition-capable communication systems on the basis of achieved and targeted quality, and (iii) specific and exemplary transitions in communication systems as regarded from different technical perspectives.

A formalization of the concept of transitions that captures the features and relations within a communication system to express and optimize the decision making process that is associated with such a system is given in. [3] The associated building blocks comprise (i) Dynamic Software Product Lines, (ii) Markov Decision Processes and (iii) Utility Design. While Dynamic Software Product Lines provide a method to concisely capture a large configuration space and to specify run time variability of adaptive systems, Markov Decision Processes provide a mathematical tool to define and plan transitions between available communication mechanisms. Finally, utility functions quantify the performance of individual configurations of the transition-based communication system and provide the means to optimize the performance in such a system.

Applications of the idea of transitions have found their way to wireless sensor networks [4] and mobile networks, [5] distributed reactive programming, [6] [7] WiFi firmware modification, [8] planning of autonomic computing systems, [9] analysis of CDNs, [10] flexible extensions of the ISO OSI stack, [11] 5G mmWave vehicular communications, [12] [13] the analysis of MapReduce-like parallel systems, [14] scheduling of Multipath TCP, [15] adaptivity for beam training in 802.11ad, [16] operator placement in dynamic user environments, [17] DASH video player analysis, [18] adaptive bitrate streaming [19] and complex event processing on mobile devices. [20]

Related Research Articles

Swarm intelligence (SI) is the collective behavior of decentralized, self-organized systems, natural or artificial. The concept is employed in work on artificial intelligence. The expression was introduced by Gerardo Beni and Jing Wang in 1989, in the context of cellular robotic systems.

A Byzantine fault is a condition of a computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, in order to avoid catastrophic failure of the system, the system's actors must agree on a concerted strategy, but some of these actors are unreliable.

Clock synchronization is a topic in computer science and engineering that aims to coordinate otherwise independent clocks. Even when initially set accurately, real clocks will differ after some amount of time due to clock drift, caused by clocks counting time at slightly different rates. There are several problems that occur as a result of clock rate differences and several solutions, some being more acceptable than others in certain contexts.

In computer networking, a heterogeneous network is a network connecting computers and other devices where the operating systems and protocols have significant differences. For example, local area networks (LANs) that connect Microsoft Windows and Linux based personal computers with Apple Macintosh computers are heterogeneous.

In computer networking, linear network coding is a program in which intermediate nodes transmit data from source nodes to sink nodes by means of linear combinations.

M. Dale Skeen is an American computer scientist. He specializes in designing and implementing large-scale computing systems, distributed computing and database management systems.

DREAM is an ad hoc location-based routing protocol. DREAM stands for Distance Routing Effect Algorithm for Mobility.

<span class="mw-page-title-main">Ian F. Akyildiz</span> President and CTO of the Truva Inc

Ian F. Akyildiz received his BS, MS, and PhD degrees in Electrical and Computer Engineering from the University of Erlangen-Nürnberg, Germany, in 1978, 1981 and 1984, respectively. Currently, he is the President and CTO of the Truva Inc. since March 1989. He retired from the School of Electrical and Computer Engineering (ECE) at Georgia Tech in 2021 after almost 35 years service as Ken Byers Chair Professor in Telecommunications and Chair of the Telecom group.

A gossip protocol or epidemic protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread. Some distributed systems use peer-to-peer gossip to ensure that data is disseminated to all members of a group. Some ad-hoc networks have no central registry and the only way to spread common data is to rely on each member to pass it along to their neighbors.

Hari Balakrishnan is the Fujitsu Professor of Computer Science and Artificial Intelligence in the Department of Electrical Engineering and Computer Science at MIT, and the Co-founder and CTO at Cambridge Mobile Telematics.

Participatory sensing is the concept of communities contributing sensory information to form a body of knowledge.

Software-defined networking (SDN) technology is an approach to network management that enables dynamic, programmatically efficient network configuration in order to improve network performance and monitoring, in a manner more akin to cloud computing than to traditional network management. SDN is meant to address the static architecture of traditional networks and may be employed to centralize network intelligence in one network component by disassociating the forwarding process of network packets from the routing process. The control plane consists of one or more controllers, which are considered the brain of the SDN network, where the whole intelligence is incorporated. However, centralization has certain drawbacks related to security, scalability and elasticity.

Subhash Suri is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.

Ramesh Govindan is an Indian-American professor of computer science. He is the Northrop Grumman Chair in Engineering and Professor of Computer Science and Electrical Engineering at the University of Southern California.

Associativity-based routing is a mobile routing protocol invented for wireless ad hoc networks, also known as mobile ad hoc networks (MANETs) and wireless mesh networks. ABR was invented in 1993, filed for a U.S. patent in 1996, and granted the patent in 1999. ABR was invented by Chai Keong Toh while doing his Ph.D. at Cambridge University.

Ralf Steinmetz is a German computer scientist and electrical engineer. He is professor of multimedia communication at the Technische Universität Darmstadt.

<span class="mw-page-title-main">Zygmunt Haas</span> American professor emeritus of electrical and computer engineering

Zygmunt J. Haas is a professor and distinguished chair in computer science, University of Texas at Dallas (UTD) also the professor emeritus in electrical and computer engineering, Cornell University. His research interests include ad hoc networks, wireless networks, sensor networks, and zone routing protocols.

<span class="mw-page-title-main">Matthias Grossglauser</span> Swiss communication engineer

Matthias Grossglauser is a Swiss communication engineer. He is a professor of computer science at EPFL and co-director of the Information and Network Dynamics Laboratory (INDY) at EPFL's School of Computer and Communication Sciences School of Basic Sciences.

<span class="mw-page-title-main">Saverio Mascolo</span> Italian information engineer

Saverio Mascolo is an Italian information engineer, academic and researcher. He is the former Head of the Department of Electrical Engineering and Information Science and the professor of Automatic Control at Department of Ingegneria Elettrica e dell'Informazione (DEI) at Politecnico di Bari, Italy.

Can Emre Koksal is an electrical engineer, computer scientist, academic, and entrepreneur. He is the Founder and CEO of Datanchor, and a professor of Electrical and Computer Engineering at Ohio State University.

References

  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 autonomous computing. IEEE Computer, 1, pp. 41-50, 2003.
  3. ↑ Alt, Bastian; Weckesser, Markus; et al. (2019). "Transitions: A Protocol-Independent View of the Future Internet". Proceedings of the IEEE. 107 (4): 835–846. doi:10.1109/JPROC.2019.2895964. ISSN   0018-9219. S2CID   86852058.
  4. ↑ Kluge, Roland; Stein, Michael; Giessing, David; Schürr, Andy; Mühlhäuser, Max (2017). Anjorin, Anthony; Espinoza, Huáscar (eds.). "cMoflon: Model-Driven Generation of Embedded C Code for Wireless Sensor Networks". Modelling Foundations and Applications. Lecture Notes in Computer Science. Springer International Publishing. 10376: 109–125. doi:10.1007/978-3-319-61482-3_7. ISBN   9783319614823.
  5. ↑ Richerzhagen, N.; Richerzhagen, B.; Hark, R.; Stingl, D.; Steinmetz, R. (2016). "Limiting the Footprint of Monitoring in Dynamic Scenarios through Multi-Dimensional Offloading". 2016 25th International Conference on Computer Communication and Networks (ICCCN). pp. 1–9. doi:10.1109/ICCCN.2016.7568539. ISBN   978-1-5090-2279-3. S2CID   15754246.
  6. ↑ Mogk, Ragnar; Baumgärtner, Lars; Salvaneschi, Guido; Freisleben, Bernd; Mezini, Mira (2018). "Fault-tolerant Distributed Reactive Programming". Schloss Dagstuhl - Leibniz-Zentrum für Informatik GMBH, Wadern/Saarbruecken, Germany. Leibniz International Proceedings in Informatics (LIPIcs). 109: 1:1–1:26. doi:10.4230/lipics.ecoop.2018.1. ISBN   9783959770798.
  7. ↑ Margara, A.; Salvaneschi, G. (2018). "On the Semantics of Distributed Reactive Programming: The Cost of Consistency". IEEE Transactions on Software Engineering. 44 (7): 689–711. doi:10.1109/TSE.2018.2833109. hdl:11311/1059154. ISSN   0098-5589. S2CID   49867276.
  8. ↑ Schulz, Matthias; Wegemer, Daniel; Hollick, Matthias (2018-09-01). "The Nexmon firmware analysis and modification framework: Empowering researchers to enhance Wi-Fi devices". Computer Communications. 129: 269–285. doi:10.1016/j.comcom.2018.05.015. ISSN   0140-3664. S2CID   52825311.
  9. ↑ Pfannemueller, M.; Krupitzer, C.; Weckesser, M.; Becker, C. (2017). "A Dynamic Software Product Line Approach for Adaptation Planning in Autonomic Computing Systems". 2017 IEEE International Conference on Autonomic Computing (ICAC). pp. 247–254. doi:10.1109/ICAC.2017.18. ISBN   978-1-5386-1762-5. S2CID   20100894.
  10. ↑ Jeremias 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. ↑ Heuschkel, J.; Wang, L.; Fleckstein, E.; Ofenloch, M.; Blöcher, M.; Crowcroft, J.; Mühlhäuser, M. (2018). "VirtualStack: Flexible Cross-layer Optimization via Network Protocol Virtualization". 2018 IEEE 43rd Conference on Local Computer Networks (LCN). pp. 519–526. doi:10.1109/LCN.2018.8638106. ISBN   978-1-5386-4413-3. S2CID   61805288.
  12. ↑ Asadi, A.; Müller, S.; Sim, G. H.; Klein, A.; Hollick, M. (2018). "FML: Fast Machine Learning for 5G mmWave Vehicular Communications". IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. pp. 1961–1969. doi:10.1109/INFOCOM.2018.8485876. ISBN   978-1-5386-4128-6. S2CID   52966369.
  13. ↑ Sim, G. H.; Klos, S.; Asadi, A.; Klein, A.; Hollick, M. (2018). "An Online Context-Aware Machine Learning Algorithm for 5G mmWave Vehicular Communications". IEEE/ACM Transactions on Networking. 26 (6): 2487–2500. doi:10.1109/TNET.2018.2869244. ISSN   1063-6692. S2CID   56594979.
  14. ↑ KhudaBukhsh, W. R.; Rizk, A.; Frömmgen, A.; Koeppl, H. (2017). "Optimizing stochastic scheduling in fork-join queueing models: Bounds and applications". IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. pp. 1–9. arXiv: 1612.05486 . doi:10.1109/INFOCOM.2017.8057013. ISBN   978-1-5090-5336-0. S2CID   16247069.
  15. ↑ Frömmgen, Alexander; Rizk, Amr; Erbshäußer, Tobias; Weller, Max; Koldehofe, Boris; Buchmann, Alejandro; Steinmetz, Ralf (2017). "A programming model for application-defined multipath TCP scheduling". Proceedings of the 18th ACM/IFIP/USENIX Middleware Conference. Middleware '17. New York, NY, USA: ACM. pp. 134–146. doi:10.1145/3135974.3135979. ISBN   9781450347204. S2CID   35419356.
  16. ↑ Palacios, Joan; Steinmetzer, Daniel; Loch, Adrian; Hollick, Matthias; Widmer, Joerg (2018). "Adaptive Codebook Optimization for Beam Training on Off-the-Shelf IEEE 802.11ad Devices". Proceedings of the 24th Annual International Conference on Mobile Computing and Networking. MobiCom '18. New York, NY, USA: ACM. pp. 241–255. doi:10.1145/3241539.3241576. ISBN   9781450359030. S2CID   52978545.
  17. ↑ Luthra, Manisha; Koldehofe, Boris; Weisenburger, Pascal; Salvaneschi, Guido; Arif, Raheel (2018). "TCEP" (PDF). Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems (PDF). New York, New York, USA: ACM Press. pp. 136–147. doi:10.1145/3210284.3210292. ISBN   9781450357821. S2CID   49337957.
  18. ↑ Stohr, Denny; Frömmgen, Alexander; Rizk, Amr; Zink, Michael; Steinmetz, Ralf; Effelsberg, Wolfgang (2017). "Where are the Sweet Spots?". Proceedings of the 25th ACM international conference on Multimedia. MM '17. New York, NY, USA: ACM. pp. 1113–1121. doi:10.1145/3123266.3123426. ISBN   9781450349062. S2CID   2217682.
  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)". arXiv: 1901.05712 [cs.MM].
  20. ↑ Graubner, Pablo; Thelen, Christoph; Körber, Michael; Sterz, Artur; Salvaneschi, Guido; Mezini, Mira; Seeger, Bernhard; Freisleben, Bernd (2018). "Multimodal Complex Event Processing on Mobile Devices". Proceedings of the 12th ACM International Conference on Distributed and Event-based Systems. DEBS '18. New York, NY, USA: ACM. pp. 112–123. doi:10.1145/3210284.3210289. ISBN   9781450357821. S2CID   49330557.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.