SearcharxivSearch

arXiv subjects

Janos Farkas

Publications and source records attributed to Janos Farkas.

5 recordsLinked to original sources

Compensating the Packet Delay Variation for 6G Integrated with IEEE Time-Sensitive Networking

6G is deemed as a key technology to support emerging applications with stringent requirements for highly dependable and timecritical communication. In this paper, we investigate 6G networks integrated with TSN and how to compensate for wireless stochastic behavior which involves a large intrinsic packet delay variation. We evaluate a 6G solution to reduce packet delay variation that is based on de-jittering. For this, we propose to use virtual timeslots for providing the required time-awareness. We discuss the benefits of the proposed solution while evaluating the impact of the timeslot size on the number of schedulable TSN streams.

cs.NI

Towards Deterministic Communications in 6G Networks: State of the Art, Open Challenges and the Way Forward

Over the last decade, society and industries are undergoing rapid digitization that is expected to lead to the evolution of the cyber-physical continuum. End-to-end deterministic communications infrastructure is the essential glue that will bridge the digital and physical worlds of the continuum. We describe the state of the art and open challenges with respect to contemporary deterministic communications and compute technologies: 3GPP 5G, IEEE Time-Sensitive Networking, IETF DetNet, OPC UA as well as edge computing. While these technologies represent significant technological advancements towards networking Cyber-Physical Systems (CPS), we argue in this paper that they rather represent a first generation of systems which are still limited in different dimensions. In contrast, realizing future deterministic communication systems requires, firstly, seamless convergence between these technologies and, secondly, scalability to support heterogeneous (time-varying requirements) arising from diverse CPS applications. In addition, future deterministic communication networks will have to provide such characteristics end-to-end, which for CPS refers to the entire communication and computation loop, from sensors to actuators. In this paper, we discuss the state of the art regarding the main challenges towards these goals: predictability, end-to-end technology integration, end-to-end security, and scalable vertical application interfacing. We then present our vision regarding viable approaches and technological enablers to overcome these four central challenges. Key approaches to leverage in that regard are 6G system evolutions, wireless friendly integration of 6G into TSN and DetNet, novel end-to-end security approaches, efficient edge-cloud integrations, data-driven approaches for stochastic characterization and prediction, as well as leveraging digital twins towards system awareness.

cs.NI

The significance of using the Newcomb-Benford law as a test of nuclear half-life calculations

Half-life number sequences collected from nuclear data charts are found to obey the Newcomb-Benford law. Based on this fact, it has been suggested recently, that this law should be used to test the quality of nuclear decay models. In this paper we briefly recall how, when and why the Newcomb-Benford law can be observed in a set of numbers with a given probability distribution. We investigate the special case of nuclear half-lives, and show that the law provides no additional clue in understanding decay half-lives. Thus, it can play no significant role in testing nuclear decay theories.

math-ph

Approximating the Euclidean circle in the square grid using neighbourhood sequences

Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the classical neighbourhood relations on digital grids, we get circles that greatly differ from the Euclidean circle. In this paper we examine different methods of approximating the Euclidean circle in the square grid, considering the possible motivations as well. We compare the perimeter-, area-, curve- and noncompactness-based approximations and examine their realization using neighbourhood sequences. We also provide a table which summarizes our results, and can be used when developing applications that support neighbourhood sequences.

math.MG

Cellular automata for the spreading of technologies in socio-economic systems

We introduce an agent-based model for the spreading of technological developments in socio-economic systems where the technology is mainly used for the collaboration/interaction of agents. Agents use products of different technologies to collaborate with each other which induce costs proportional to the difference of technological levels. Additional costs arise when technologies of different providers are used. Agents can adopt technologies and providers of their interacting partners in order to reduce their costs leading to microscopic rearrangements of the system. Analytical calculations and computer simulations revealed that starting from a random configuration of different technological levels a complex time evolution emerges where the spreading of advanced technologies and the overall technological progress of the system are determined by the amount of advantages more advanced technologies provide, and by the structure of the social environment of agents. We show that agents tend to form clusters of identical technological level with a power law size distribution. When technological progress arises, the spreading of technologies in the system can be described by extreme order statistics.

physics.soc-ph