Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.15182

Dynamic Constraint-based Influence Framework and its Application in Stochastic Modeling of Load Balancing

Ehsan Siavashi·Mahshid Rahnamay-Naeini
View original source ↗Read source document ↗Export metadata ↓

Abstract

Components connected over a network influence each other and interact in various ways. Examples of such systems are networks of computing nodes, which the nodes interact by exchanging workload, for instance, for load balancing purposes. In this paper, we first study the Influence Model, a networked Markov chain framework, for modeling network interactions and discuss two key limitations of this model, which cause it to fall short in modeling constraint-based and dynamic interactions in networks. Next, we propose the Dynamic and Constraint-based Influence Model (DCIM) to alleviate the limitations. The DCIM extends the application of the Influence Model to more general network interaction scenarios. In this paper, the proposed DCIM is successfully applied to stochastic modeling of load balancing in networks of computing nodes allowing for prediction of the load distribution in the system, which is a novel application for the Influence Model. The DCIM is further used to identify the optimum workload distribution policy for load balancing in networked computing systems.

Explore related subjects

math.NAcs.NAcs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ehsan Siavashi, Mahshid Rahnamay-Naeini. 2020-06-26. Dynamic Constraint-based Influence Framework and its Application in Stochastic Modeling of Load Balancing. https://arxiv.org/abs/2006.15182

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗