Hopf bifurcation and oscillations in a communication network with heterogeneous delays

Yin, Huibing; Wang, Paul; Alpcan, Tansu; Mehta, Prashant G.

doi:10.1016/j.automatica.2009.06.012

Cited by 8 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result rests on the import of concepts from chemistry, among them the non-work-conserving mass-action scheduling regime (explained in the next sections). By using the chemical paradigm, we align with the historical proposals by Keshav [24] that proposed the design of a flow control mechanism based on a control-theoretic methodology, or to the more recent work by Huibing et al [25] that attempted to formalize the analysis of TCP-like flow control schemes, and furthermore, to works such as [26,27,28,29] that have shown the benefit of using control theory to design Active Queue Management (AQM) controllers. However with the chemical paradigm, we do not merely refer to a mathematical description about the system and we do not have to try to extract a flow-model that approximates sufficiently well the proposed algorithm's dynamics.…”

Section: Control-theory and Flow-model Based Approaches For Networkinmentioning

confidence: 83%

Designing Run-Time Environments to Have Predefined Global Dynamics

Monti¹,

Imai²,

Tschudin³

2013

IJCNC

View full text Add to dashboard Cite

The stability and the predictability of a computer network algorithm's performance are as important as themain functional purpose of networking software. However, asserting or deriving such properties from thefinite state machine implementations of protocols is hard and, except for singular cases like TCP, is notdone today. In this paper, we propose to design and study run-time environments for networking protocolswhich inherently enforce desirable, predictable global dynamics. To this end we merge two complementarydesign approaches: (i) A design-time and bottom up approach that enables us to engineer algorithms basedon an analyzable (reaction) flow model. (ii) A run-time and top-down approach based on an autonomousstack composition framework, which switches among implementation alternatives to find optimal operationconfigurations. We demonstrate the feasibility of our self-optimizing system in both simulations and real-world Internet setups

show abstract

Section: Control-theory and Flow-model Based Approaches For Networkinmentioning

confidence: 83%

Designing Run-Time Environments to Have Predefined Global Dynamics

Monti¹,

Imai²,

Tschudin³

2013

IJCNC

View full text Add to dashboard Cite

show abstract

“…The papers concerned with local instability/bifurcation analysis [22], [33]- [36], and (global) numerical investigations [1], [3], [22] using deterministic fluid models show these oscillations as self-excited. With simple fluid models, analytical methods from bifurcation theory have been used to show that these self-excited oscillations can arise as a result of supercritical Hopf bifurcation [33], [35], [37] and of period doubling and border-collision bifurcations [22].…”

mentioning

confidence: 99%