Related papers: Flow-level models for multipath routing
We study a model for flocking given by a $n$-particle system under which each particle jumps forward by a random amount, independently sampled from a given distribution $\theta$, with rate given by a non-increasing function $w$ of its…
In an earlier paper, a randomized load balancing model was studied in a heavy traffic asymptotic regime where the load balancing stream is thin compared to the total arrival stream. It was shown that the limit is given by a system of…
There is a growing cross-disciplinary effort in the broad domain of optimization and learning with streams of data, applied to settings where traditional batch optimization techniques cannot produce solutions at time scales that match the…
In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the…
This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…
We study cluster assignment in homogeneous diffusive multi-agent networks. Given the number of clusters and agents within each cluster, we design the network graph ensuring the system will converge to the prescribed cluster configuration.…
A common problem in science networks and private wide area networks (WANs) is that of achieving predictable data transfers of multiple concurrent flows by maintaining specific pacing rates for each. We address this problem by developing a…
In previous papers we developed a deterministic fluid approximation for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature as the X model. The system uses the…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
Data flow analysis and optimization is considered for homogeneous rectangular mesh networks. We propose a flow matrix equation which allows a closed-form characterization of the nature of the minimal time solution, speedup and a simple…
The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…
Network flows often exhibit a hierarchical tree-like structure that can be attributed to the minimisation of dissipation. The common feature of such systems is a single source and multiple sinks (or vice versa). In contrast, here we study…
Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth for cluster computing applications. However, state of the art distributed multi-pathing protocols such as Equal Cost Multipath…
Part I of this paper formulated a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. A diffusion…
A system of interacting multiclass finite-state jump processes is analyzed. The model under consideration consists of a block-structured network with dynamically changing multi-colors nodes. The interaction is local and described through…
In this paper we consider a wide class of discrete diffusion load balancing algorithms. The problem is defined as follows. We are given an interconnection network and a number of load items, which are arbitrarily distributed among the nodes…
The dynamics of randomly crosslinked liquids is addressed via a Rouse- and a Zimm-type model with crosslink statistics taken either from bond percolation or Erdoes-Renyi random graphs. While the Rouse-type model isolates the effects of the…
We analyze the dynamics of multi-agent collective behavior models and their control theoretical properties. We first derive a large population limit to parabolic diffusive equations. We also show that the non-local transport equations…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
How finite-sized material lines stretch in chaotic (mono-scale) and turbulent (multi-scale) flows remains a central but unresolved problem that governs mixing, transport and reaction. We show elongation is controlled by a finite-sampling…