相关论文: Metastability in Loss Networks with Dynamic Altern…

We study metastability and nucleation for the Blume-Capel model: a ferromagnetic nearest neighbour two-dimensional lattice system with spin variables taking values in -1,0,+1. We consider large but finite volume, small fixed magnetic field…

Phase transition from a free-flow phase to a jammed phase is an important feature of traffic networks. We study this transition in the case of a simple square lattice network for different values of data posting rate $(\rho)$ by introducing…

Discontinuous quantum phase transitions and the associated metastability play central roles in diverse areas of physics ranging from ferromagnetism to false vacuum decay in the early universe. Using strongly-interacting ultracold atoms in…

The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings, computing the well known Erlang…

This paper deals with the detection and prediction of losses due to cyber attacks waged on vital networks. The accumulation of losses to a network during a series of attacks is modeled by a 2-dimensional monotone random walk process as…

Previous work on ad hoc network capacity has focused primarily on source-destination throughput requirements for different models and transmission scenarios, with an emphasis on delay tolerant applications. In such problems, network…

We introduce a variant of the asymmetric random average process with continuous state variables where the maximal transport is restricted by a cutoff. For periodic boundary conditions, we show the existence of a phase transition between a…

In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer,…

This article studies stochastic relative phase stability, i.e., stochastic phase-cohesiveness, of discrete-time phase-coupled oscillators. Stochastic phase-cohesiveness in two types of networks is studied. First, we consider oscillators…

We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…

We consider the Conflict Resolution Problem in the context of a multiple-access system in which several stations can transmit their messages simultaneously to the channel. We assume that there are n stations and that at most k<= n stations…

Biological information processing is often carried out by complex networks of interconnected dynamical units. A basic question about such networks is that of reliability: if the same signal is presented many times with the network in…

The generic feature of traffic in a network of flowing electronic data packets is a phase transition from a stationary free-flow phase to a continuously growing congested non-stationary phase. In the most simple network of directed oriented…

Multi-connectivity (MCo) is considered to be a key strategy for enabling reliable transmissions and enhanced data rates in fifth-generation mobile networks, as it provides multiple links from source to destination. In this work, we quantify…

We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the…

We study optimal distributed first-order optimization algorithms when the network (i.e., communication constraints between the agents) changes with time. This problem is motivated by scenarios where agents experience network malfunctions.…

We consider Mobile Ad-hoc Network (MANET) with transmitters located according to a Poisson point in the Euclidean plane, slotted Aloha Medium Access (MAC) protocol and the so-called outage scenario, where a successful transmission requires…

Many routing and flow optimization problems in wired networks can be solved efficiently using minimum cost flow formulations. However, this approach does not extend to wireless multi-hop networks, where the assumptions of fixed link…

Retransmissions represent a primary failure recovery mechanism on all layers of communication network architecture. Similarly, fair sharing, e.g. processor sharing (PS), is a widely accepted approach to resource allocation among multiple…

We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…