ADN: An Information-Centric Networking Architecture for the Internet of Things

Forwarding data by name has been assumed to be a necessary aspect of an information-centric redesign of the current Internet architecture that makes content access, dissemination, and storage more efficient. The Named Data Networking (NDN) and Content-Centric Networking (CCNx) architectures are the leading examples of such an approach. However, forwarding data by name incurs storage and communication complexities that are orders of magnitude larger than solutions based on forwarding data using addresses. Furthermore, the specific algorithms used in NDN and CCNx have been shown to have a number of limitations. The Addressable Data Networking (ADN) architecture is introduced as an alternative to NDN and CCNx. ADN is particularly attractive for large-scale deployments of the Internet of Things (IoT), because it requires far less storage and processing in relaying nodes than NDN. ADN allows things and data to be denoted by names, just like NDN and CCNx do. However, instead of replacing the waist of the Internet with named-data forwarding, ADN uses an address-based forwarding plane and introduces an information plane that seamlessly maps names to addresses without the involvement of end-user applications. Simulation results illustrate the order of magnitude savings in complexity that can be attained with ADN compared to NDN.Comment: 10 page

Contribution of α2\alpha^2-terms to the total interaction cross sections of relativistic elementary atoms with atoms of matter

It is shown that the corrections of $\alpha^2$ order to the total cross sections for interaction of elementary hydrogen-like atoms with target atoms, reported in the previously published paper [S.Mrowczynski, Phys.Rev. D36, 1520 (1987)], do not include some terms of the same order of magnitude. That results in a significant contribution of these corrections in particular cases. The full $\alpha^2$-corrections have been derived and it is shown that they are really small and could be omitted for most practical applications.Comment: 5 page

Limit theorems for weakly subcritical branching processes in random environment

For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the process may at the same time be subcritical and, conditioned on nonextinction, 'supercritical'. This so-called weakly subcritical case is considered in this paper. We study the asymptotic survival probability and the size of the population conditioned on non-extinction. Also a functional limit theorem is proven, which makes the conditional supercriticality manifest. A main tool is a new type of functional limit theorems for conditional random walks.Comment: 35 page