?
Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks
Journal of Network and Computer Applications. 2014. No. 41. P. 217–227.
Network coding is a paradigm in data transport that allows a network node to code information flows before forwarding them. While it has been theoretically proven that network coding saves bandwidth and increases throughput of multicast communication, it does not directly consider the quality of service (QoS) requirements of multicast routing. In this paper, we study the problem of establishing minimum-cost, multiple multicast sessions over coded packet networks to meet the statistical QoS target considering boundedend-to-end statistical delay and jitter from source to each destination. For this purpose, we first propose a path-based formulation for the problem and prove that this problem is NP-hard. Then, in order to obtain an exact solution, we present an effective and efficient decomposition approach in which the problem is decomposed in to master problem and subproblems, and the solution is built up successively by feasible path generation.Computational results on random networks show that the proposed method provides an efficient way for solving the problem, even for relatively large networks.
Language:
English
Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.
In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...
Added: July 21, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026
Гущина В. А., / Series chemrxiv-2023-vpzhz-v2 "ChemRxiv". 2023.
All-inorganic perovskite CsPbBr3 and Cs4PbBr6 nanoparticles are being intensively studied due to their unique properties and wide range of applications; however, however, the nature of their optical properties is not yet fully understood due to the difficulty of synthesis of singlephase nanoparticles. In this article we describe the features of the synthesis of single-phase particles ...
Added: May 14, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Zlotnik Alexander, / Series arXiv "math". 2026. No. 2602.03481v1.
We deal with the global in time weak solutions to the 1D compressible Navier-Stokes system of equations for large discontinuous initial data and nonhomogeneous boundary conditions of three standard types. We prove the Lipschitz-type continuous dependence of the solution $(\eta,u,\theta)$, in a norm slightly stronger than $L^{2,\infty}(Q)\times L^2(Q)\times L^2(Q)$, on the initial data $(\eta^0,u^0,e^0)$ in a ...
Added: April 18, 2026
Medvedev V., / Series arXiv "math". 2026.
We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a ...
Added: April 3, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Kolesnikov A., / Series arXiv "math". 2025.
We study Blaschke--Santal{ó}-type inequalities for N>=2 sets (functions) and a special class of cost functions. In particular, we prove new results about reduction of the maximization problem for the Blaschke--Santal{ó}-type functional to homogeneous case (functional inequalities on the sphere) and extend the symmetrization argument to the case of N>2 sets.
We also discuss links to the ...
Added: February 13, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Gaianov N., Parusnikova A., / Cornell University. Серия math "arxiv.org". 2025.
An algebraic q-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this sufficient condition for constructing a formal expansion of a solution to a certain q-difference analogue of the fifth Painlevé equation ...
Added: December 25, 2025
Springer, 2025.
This two-volume set, CCIS 2392 and CCIS 2393, constitutes the refereed proceedings of the 4th International Conference on Smart Technologies, Systems and Applications, SmartTech-IC 2024, held in Quito, Ecuador, during December 2–4, 2024.
The 68 full papers presented in these proceedings were carefully reviewed and selected from 168 submissions. They were categorized under the following topical ...
Added: September 11, 2025
United States of America: IGI Global, 2022.
Emerging technologies in education are dramatically reshaping the way we teach, learn, and create meaning—both formally and informally. The use of emerging technologies within educational contexts requires new methodological approaches to teaching, learning, and educational research. This leads educational technology developers, researchers, and practitioners to engage in the creation of diverse digital learning tools that ...
Added: December 22, 2021
Воронцова Е. А., Gasnikov A., Dvurechensky P. et al., Computational Mathematics and Mathematical Physics 2021 Vol. 61 No. 2 P. 297–328
The resource allocation problem in computer networks with a large number of links is considered. The links are used by consumers (users), whose number can also be very large. For the dual problem, numerical optimization methods are proposed, such as the fast gradient method, the stochastic projected subgradient method, the ellipsoid method, and the random ...
Added: October 29, 2021
M.: ISC RAS, 2020.
The book presents proceedings of the XXIII International Scientific Conference "Distributed computer and communication networks: control, computation, communications (DCCN-2020)" ...
Added: October 31, 2020
Springer, 2019.
This volume contains a collection of revised selected full-text papers presented at the 22nd International Conference on Distributed Computer and Communication Networks (DCCN 2019), held in Moscow, Russia, September 23–27, 2019.
DCCN 2019 is an IEEE (Region 8 + Russia Section) technically cosponsored international conference. It is a continuation of traditional international conferences of the DCCN ...
Added: December 23, 2019
Krouk E., Sergeev A., Afanasev M., , in: Intelligent Decision Technologies 2019Vol. 2.: Springer, 2019. P. 89–99.
Recently, low message delay becomes more and more important. It allows the implementation of new applications and services interacting in almost real time that was impossible before. A requirement of low message delay now is a part of many communication standards such as 5G and recommendation papers of future standards such as Tactile Internet proposed by ITU-T. In ...
Added: October 29, 2019
Komarov M. M., Glukhoded E., , in: ICICM '18 Proceedings of the 8th International Conference on Information Communication and Management.: NY: ACM, 2018. P. 32–38.
Wireless Networks are being developed rapidly during the last two decades. Since that time, science and technologies have been modernized from slow GPRS networks to the networks of fourth generation, which are allowed to transfer the data wirelessly at the high speed and relatively low latency. However, the technological progress has not being stopped after ...
Added: October 18, 2018
Ivanov A., Khorov E., Kuznetsov E. et al., , in: Proceedings of IEEE Wireless Communications and Networking Conference 2018.: [б.и.], 2018. P. 1–6.
tbd ...
Added: October 14, 2018