Hopf bifurcation in REM algorithm with communication delay

Hong-Yong Yang and Yu-Ping Tian

Chaos, Solitons & Fractals, 2005, vol. 25, issue 5, 1093-1105

Abstract: The purpose of this paper is to study bifurcation of an Internet congestion control algorithm, namely REM (Random Exponential Marking) algorithm, with communication delay. By choosing the delay constant as a bifurcation parameter, we prove that REM algorithm exhibits Hopf bifurcation. The formulas for determining the direction of the Hopf bifurcation and the stability of bifurcating periodic solutions are obtained by applying the center manifold theorem and the normal form theory. Finally, a numerical simulation is present to verify the theoretical results.

Date: 2005
References: View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077905000068
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:25:y:2005:i:5:p:1093-1105

DOI: 10.1016/j.chaos.2004.11.085

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().