41,394 research outputs found
Concave Switching in Single and Multihop Networks
Switched queueing networks model wireless networks, input queued switches and
numerous other networked communications systems. For single-hop networks, we
consider a {()-switch policy} which combines the MaxWeight policies
with bandwidth sharing networks -- a further well studied model of Internet
congestion. We prove the maximum stability property for this class of
randomized policies. Thus these policies have the same first order behavior as
the MaxWeight policies. However, for multihop networks some of these
generalized polices address a number of critical weakness of the
MaxWeight/BackPressure policies.
For multihop networks with fixed routing, we consider the Proportional
Scheduler (or (1,log)-policy). In this setting, the BackPressure policy is
maximum stable, but must maintain a queue for every route-destination, which
typically grows rapidly with a network's size. However, this proportionally
fair policy only needs to maintain a queue for each outgoing link, which is
typically bounded in number. As is common with Internet routing, by maintaining
per-link queueing each node only needs to know the next hop for each packet and
not its entire route. Further, in contrast to BackPressure, the Proportional
Scheduler does not compare downstream queue lengths to determine weights, only
local link information is required. This leads to greater potential for
decomposed implementations of the policy. Through a reduction argument and an
entropy argument, we demonstrate that, whilst maintaining substantially less
queueing overhead, the Proportional Scheduler achieves maximum throughput
stability.Comment: 28 page
Dynamical Systems on Networks: A Tutorial
We give a tutorial for the study of dynamical systems on networks. We focus
especially on "simple" situations that are tractable analytically, because they
can be very insightful and provide useful springboards for the study of more
complicated scenarios. We briefly motivate why examining dynamical systems on
networks is interesting and important, and we then give several fascinating
examples and discuss some theoretical results. We also briefly discuss
dynamical systems on dynamical (i.e., time-dependent) networks, overview
software implementations, and give an outlook on the field.Comment: 39 pages, 1 figure, submitted, more examples and discussion than
original version, some reorganization and also more pointers to interesting
direction
Evolutionary Poisson Games for Controlling Large Population Behaviors
Emerging applications in engineering such as crowd-sourcing and
(mis)information propagation involve a large population of heterogeneous users
or agents in a complex network who strategically make dynamic decisions. In
this work, we establish an evolutionary Poisson game framework to capture the
random, dynamic and heterogeneous interactions of agents in a holistic fashion,
and design mechanisms to control their behaviors to achieve a system-wide
objective. We use the antivirus protection challenge in cyber security to
motivate the framework, where each user in the network can choose whether or
not to adopt the software. We introduce the notion of evolutionary Poisson
stable equilibrium for the game, and show its existence and uniqueness. Online
algorithms are developed using the techniques of stochastic approximation
coupled with the population dynamics, and they are shown to converge to the
optimal solution of the controller problem. Numerical examples are used to
illustrate and corroborate our results
Coexistence and Survival in Conservative Lotka-Volterra Networks
Analyzing coexistence and survival scenarios of Lotka-Volterra (LV) networks in which the total biomass is conserved is of vital importance for the characterization of long-term dynamics of ecological communities. Here, we introduce a classification scheme for coexistence scenarios in these conservative LV models and quantify the extinction process by employing the Pfaffian of the network's interaction matrix. We illustrate our findings on global stability properties for general systems of four and five species and find a generalized scaling law for the extinction time
- âŠ