Impact of queue feedback on the stability and dynamics of a Rate Control Protocol (RCP) with two delays
Abuthahir, Gaurav Raina

TL;DR
This paper analyzes the stability of the Rate Control Protocol (RCP) with two delays, showing that queue size feedback can destabilize the system and suggesting that feedback based only on rate mismatch is preferable.
Contribution
The study provides a detailed bifurcation analysis of RCP with two delays, revealing that queue feedback can induce sub-critical Hopf bifurcations, which are undesirable for system stability.
Findings
Queue feedback can destabilize RCP.
RCP without queue feedback undergoes super-critical Hopf bifurcation.
Queue feedback may cause large or unstable limit cycles.
Abstract
Rate Control Protocol (RCP) uses feedback from routers to assign flows their fair rate. RCP estimates the fair rate using two forms of feedback: rate mismatch and queue size. An outstanding design question for RCP is whether the queue size feedback is useful or not. To address this, we analyze stability and the bifurcation properties of RCP in both the cases i.e., with and without queue size feedback. The model considers flows with two different round-trip times, operating over a single bottleneck link. By using an exogenous bifurcation parameter, we show that the system loses stability via a Hopf bifurcation and hence we can expect a limit cycle branching from the fixed point. We highlight that the presence of queue feedback can readily destabilize the system. Using Poincar{\`e} normal forms and the center manifold theorem, we show that the Hopf bifurcation is super-critical in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Traffic and Congestion Control · Advanced Queuing Theory Analysis · Advanced Optical Network Technologies
Impact of queue feedback on the stability and dynamics of a Rate Control Protocol (RCP) with two delays
Abuthahir
Gaurav Raina
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai - 600 036, India
Abstract
Rate Control Protocol (RCP) uses feedback from routers to assign flows their fair rate. RCP estimates the fair rate using two forms of feedback: rate mismatch and queue size. An outstanding design question for RCP is whether the queue size feedback is useful or not. To address this, we analyze stability and the bifurcation properties of RCP in both the cases i.e., with and without queue size feedback. The model considers flows with two different round-trip times, operating over a single bottleneck link. By using an exogenous bifurcation parameter, we show that the system loses stability via a Hopf bifurcation and hence we can expect a limit cycle branching from the fixed point. We highlight that the presence of queue feedback can readily destabilize the system. Using Poincarè normal forms and the center manifold theorem, we show that the Hopf bifurcation is super-critical in the case of RCP without queue feedback. Whereas, in the presence of queue feedback, we show that the system can undergoes a sub-critical Hopf bifurcation for some parameter values. A sub-critical Hopf bifurcation can result in either large amplitude limit cycles or unstable limit cycles, and hence should be avoided in engineering applications. Thus, the presence of queue feedback would create adverse effects on the stability of the emerging limit cycles. In essence, the analytical results of RCP with two delays favor the design choice that uses feedback based only on rate mismatch. The theoretical analysis is validated with numerical computations and some packet level simulations as well.
keywords:
Rate Control Protocol , queue feedback , two delays , stability , Hopf bifurcation
1 Introduction
Internet congestion control has been an active area of research for several decades [26]. The Transmission Control Protocol (TCP) is the widely used transport layer protocol which control network congestion in the Internet. It has been shown that the performance of TCP is poor in the future high bandwidth delay network due to its use of implicit feedback and the standard Additive Increase Multiplicative Decrease (AIMD) control law [13]. This motivates the development of congestion control protocols that relies on more explicit feedback [5, 12, 18, 19, 20, 24, 32, 34]. Rate control protocol (RCP) is an explicit congestion control algorithm that received a lot of attention from the research community [2, 4, 3, 5, 14, 15, 16, 20, 21, 25, 29, 30, 36].
A key motivation for considering RCP, is that it continues to receive attention not only in the currently used host-centric (IP-based) networks, but also in the future data-centric networking architectures like Named Data Networking (NDN) [33]. In NDN, there is no IP address, and all data are named with unique names. Moreover, the data can be fetched from multiple sources via multiple paths which makes the implicit signaling mechanism unreliable in NDN [24]. Therefore, researchers focus on employing rate-based RCP-style algorithms in NDN [16, 20, 36]. For example, in [16] and [36], they combined RCP and the unique features of NDN to develop rate-based schemes for NDN congestion control. Similarly, RCP has attracted interest in wireless and satellite networks. In [4], RCP is extended with the support of an algorithm to accurately evaluate the capacity of wireless links. Simulation results in [29] reveal that RCP outperforms TCP in terms of throughput and queue size in the satellite networks. In [25], the feasibility of implementing RCP with flexible packet processing architectures has been demonstrated, especially in the data center networks. In this paper, our focus will be restricted to one particular design problem that arises in the study of feedback mechanism used by RCP. To expand further, RCP assigns a single fair rate for all the flows traversing the bottleneck link. These rates are computed using control equations at the routers, which in turn employ two forms of feedback: rate mismatch and the queue size. Simulation studies in [14] show that the queue size feedback in RCP, can cause the queue to be less accurately controlled. This conclusion was based on some initial simulations, and more work is needed before one could conclude that the queue size terms should be dropped from the protocol definition. In this paper, we focus on the proportionally fair variant of RCP which was introduced in [14]. The model considers single bottleneck network carrying flows with two different round-trip times.
An RCP router utilizes a field in the packet header to convey the fair share rate at which the flows can send data into the network. However, the feedback about the fair rate to end-systems is not instantaneous. Therefore, RCP works like a closed-loop control system with feedback delays. In general, the stability of a closed-loop system is sensitive to feedback delays, which normally necessitates a detailed stability analysis. Local stability analysis retains only the linear component and ignores all higher order terms of the non-linear system before addressing the issue of stability. So, it looks appealing to have an analytical methodology which may allow us to capture the impact of some non-linear terms while performing a Taylor expansion of the non-linear system about its equilibrium. Local bifurcation theory is one such methodology [11]. A comprehensive understanding of local bifurcation phenomena may help yield insights into the role played by different forms of feedback in RCP. Moreover, any congestion control algorithm is not only to ensure local stability of the equilibrium, but also to make sure that any loss of stability, that may happen, results in stable limit cycles of small amplitude. We hasten to add that we are not interested in destabilizing our network, but wish to employ the tools offered by local instability analysis to gain some insight into the non-linear properties of both the design options, i.e., with and without queue size feedback. There is considerable interest in analyzing the stability and Hopf bifurcation of the congestion control algorithms [2, 6, 17, 22, 30, 35].
We now need to decide which parameter will be used to violate the stability condition and hence act as the bifurcation parameter. We motivate a non-dimensional exogenous parameter to induce instability. This has various advantages. We need not be concerned with the dimensions of the parameter, and as it is common for both the design choices we can compare the results fairly. By analyzing the roots of the transcendental characteristic equation, we first derive necessary and sufficient conditions for local asymptotic stability. This enables us to determine the stability region in the parameter space. It is then shown that, as the bifurcation parameter varies, the system where feedback is based on both rate mismatch and queue size, readily loses local stability through a Hopf bifurcation [11]. Then, we investigate the impact of queue feedback on the direction and stability of the emerging limit cycles. To that end, we conduct a detailed Hopf bifurcation analysis for both the design choices. The Appendix contains the necessary calculations to determine the type of Hopf bifurcation and the orbital stability of the bifurcating limit cycles, as local instability just sets in. The theoretical frameworks that we employ to analyze the nature of Hopf bifurcation are the Poincarè normal forms and the center manifold theorem. We establish that the RCP which uses only rate mismatch feedback would give rise to a super-critical Hopf bifurcation which leads to stable limit cycles of small amplitude. Whereas, in the presence of queue feedback, the system can exhibit a sub-critical Hopf bifurcation, for some parameter values. A sub-critical Hopf bifurcation is undesirable for real engineering systems as a small perturbation around the system equilibrium may give rise to either limit cycles with large amplitude, or unstable limit cycles [28]. The numerical analysis tool that we use to validate the theoretical insights is DDE-Biftool (a Matlab package for numerical bifurcation and stability analysis of delay differential equations) [7], [8].
In summary, the analytical insights of our study tend to favor the design choice where the feedback is based only on rate mismatch. Numerical computations and packet level simulations serve to corroborate the analysis.
The rest of the paper is organized as follows. In Section 2, we outline the non-linear fluid model of RCP. We analyze the local asymptotic stability of RCP in Section 3. In Section 4, we conduct a local Hopf bifurcation analysis and highlight the impact of queue feedback on the nature of Hopf bifurcation. In Section 5, we conclude with a summary of our contributions, and offer avenues for further research. For ease of exposition, the Hopf bifurcation analysis is contained in an Appendix.
2 Models
The small buffer model of a proportionally fair RCP is governed by the following non-linear delay differential equation [14]
[TABLE]
where
[TABLE]
is the aggregate load at link summed over all the routes passing through link , is the rate that RCP maintains for all flows passing through link , is the rate on route , is the mean queue size at link when the arriving load is , is the capacity of link , and are non-negative protocol parameters.
Here, is the average round trip time of packets passing through link given by
[TABLE]
where,
[TABLE]
is the sum of the propagation delay from source to link j and the return delay from link to source. Here, we assume that the queuing delay is negligible as compared to the propagation delay, which conforms with our assumption of small buffers. The flow rate is given by [14]
[TABLE]
Now we will model the mean queue size term as follows. Suppose that workload arriving at resource of capacity , over a time period is Gaussian with mean and variance . The workload present at the queue reflects Brownian motion [10], with mean under its stationary distribution of
[TABLE]
The above relation is a simple approximation to mean queue size, where represents the variability of traffic in the link at a packet level. We assume , which corresponds to the Poisson arrival of packets of constant size.
For our analysis, we consider the network with single bottleneck link of capacity , carrying two sets of RCP flows with different round trip times; say and . Then the model is given by
[TABLE]
where
[TABLE]
To model the RCP without queue feedback, the parameter is set to zero to exclude the queuing term from the RCP model. Then to aim for a particular target link utilisation, say a fraction of the actual link capacity, is replaced with . Then the model of RCP without queue size feedback is given by
[TABLE]
3 Local Stability Analysis
In this section, we derive conditions for local stability in terms of model parameters. We could induce instability by varying any of the system parameters. However, we prefer not to choose any of the system parameters, but introduce an exogenous non-dimensional parameter to push the system into the unstable regime.
3.1 With queue feedback
Let denote the non-zero equilibrium of equation (6), then
[TABLE]
Let be a perturbation about the equilibrium. Then linearising (6), about the equilibrium, gives
[TABLE]
where
[TABLE]
Looking for exponential solutions, the characteristic equation of (9) is given by
[TABLE]
where , , .
For the system to be stable, all the roots of the characteristic equation should lie in the left half of the complex plane. When the round-trip times are zero, we get and hence the system is asymptotically stable. However, when the roots may cross the imaginary axis for some values of the system parameters, and hence stability of the system cannot be guaranteed. Therefore, the condition for the crossover defines the bounds on the system parameters to maintain stability. To find the critical condition, where this crossover occurs, we substitute , in (11). Equating the real and imaginary parts, we obtain
[TABLE]
[TABLE]
[TABLE]
We only treat the case , which gives . We now use the following theorem, stated in [27], to get the stability condition.
Theorem 1
The trivial solution of the scalar delay differential equation
[TABLE]
is exponentially asymptotically stable if and only if
[TABLE]
Comparing (9) with (14), the necessary and sufficient condition for the stability of (9) can be written as
[TABLE]
Substituting the value of in (16), we get
[TABLE]
Since for all values of , 0, we obtain the sufficient condition as
[TABLE]
For , using (8), we get
[TABLE]
See Fig. 1 which highlights the sufficient condition to ensure local stability for all values of , 0.
To show that the system loses local stability through Hopf bifurcation at a critical value of the bifurcation parameter, we need to satisfy the transversality condition of Hopf spectrum which has been outlined in the Appendix.
3.2 Without queue feedback
Proceeding as outlined in the previous sub-section, we get the necessary and sufficient condition for local stability of (7) as
[TABLE]
For , we obtain the sufficient condition for stability as
[TABLE]
It is important to highlight that by excluding feedback based on queue size, we can increase the range of the parameter for which the system is stable.
We now resort to simulations to study the behaviour of RCP with and without queue feedback. The network being simulated has a single resource or bottleneck link, of capacity packet per ms, and sources creating Poisson traffic. Packet level simulations are done using discrete event simulator, which models the behaviour of the RCP network. Equation (8) serves as the relation between equilibrium utilisation and the parameter b when the queuing term is present in the RCP definition. for instance, to achieve utilisation of 75% of link capacity, we need to set . To aim for the same utilisation in the case of RCP without queue feedback, we should set b = 0 and = 0.75. Packet-level traces shown in 2 illustrate that, in the presence of queue feedback, the system readily loses stability and leads to the emergence of limit cycles. These observations corroborate the results of our stability analysis which establish that the presence of queue size feedback is associated with a smaller choice of the protocol parameter . So as far as the stability is concerned, the observations from simulations favor the design choice of having no queue size feedback in the RCP definition.
4 Local Hopf Bifurcation Analysis
In stability analysis, we have shown that by excluding feedback based on queue size, we can increase the range of protocol parameter , for which the stability is guaranteed. Also, we have established that the system loses local stability via a Hopf bifurcation and leads to the emergence of limit cycles. An important design objective of the system is not only to ensure the local stability for a wide range of parameters, but also to make sure that any loss of stability always result in stable limit cycles of small amplitude. So it is natural to study the characteristics of the bifurcating periodic solutions. To that end, we do a local Hopf bifurcation analysis.
The analytical framework employed to investigate the nature of the limit cycles are the Poincaré normal form and the center manifold theorem, which are outlined in the Appendix. The analysis relies on the linear, quadratic and cubic terms in the Taylor series expansion of (6) and (7), about equilibrium, which have been tabulated in Table 1. The coefficients not listed in the table do not exist.
4.1 Without queue feedback
In this section, we consider the small buffer model of RCP without queue feedback and perform the necessary calculations to determine the type of Hopf bifurcation and the asymptotic form of the bifurcation solutions as local instability just sets in. For now, we will only be concerned with the first Hopf bifurcation. As outlined in the appendix, the stability and direction of the bifurcating limit cycles can be determined from the sign of first Lyapunov coefficient() and Floquet exponent(),
where
[TABLE]
Using the definitions outlined in the appendix and the values from Table 1, the expression for has been calculated as
[TABLE]
where
[TABLE]
From (22), we can say that the sign of depends on . From Fig. 3, it is clear that the is negative for all . Therefore \mathbf{Re}\big{(}c_{1}(0)\big{)} is negative for all . We have already shown that for all . Hence, we have and which enables us to conclude that the system undergoes a super-critical Hopf and the limit cycles are asymptotically orbitally stable.
4.2 With queue feedback
We now consider the RCP model which uses both rate mismatch and queue size feedback. Let us denote the equilibrium utilisation as
[TABLE]
Using the calculations outlined in the Appendix, we obtain the closed-form analytical expression for as
[TABLE]
where
[TABLE]
It is to be noted that the protocol parameter has no effect on the nature of the Hopf bifurcation. The criticality of the Hopf bifurcation and the oscillation amplitude depends on the value of . In this case, we go for numerical examples to study the nature of Hopf bifurcation.
Numerical Example 1: Let us consider which corresponds to equilibrium utilisation of . The values of computed using (25) for all has been plotted in Fig. 4. From Fig. 4, we can observe that both super-critical and sub-critical Hopf occurs, and the criticality varies with which is a function of and .
Numerical Example 2: Now we assume which corresponds to , and vary the equilibrium utilisation to analyze its impact on the criticality of the Hopf bifurcation. Fig. 5 shows the computed values of for . As the equilibrium utilisation increases, the criticality of the bifurcation changes from super-critical to sub-critical and so there is the potential for large amplitude limit cycles which is undesirable.
To summarise, the results of the local Hopf bifurcation analysis enables us to say that the RCP without queue feedback undergoes super-critical Hopf bifurcation and leads to orbitally stable limit cycles. Whereas, we observed sub-critical Hopf bifurcation for some parameter values if the queue size feedback is incorporated into the RCP model. The super-critical case is highly desirable from a performance viewpoint than the sub-critical one, since the sub-critical Hopf bifurcation results in sharp loss of system stability. Therefore, the removal of queue size feedback would be the most appropriate design choice for RCP.
4.3 Numerical computations
In a scalar non-linear equation with two discrete delays, both the delays play an important role in determining the type of the Hopf bifurcation. As we have just witnessed that even with the same non-linear term, by simply changing the values of the delay, we can change the type of the Hopf bifurcation.
We now validate the analytical results using some numerical examples.
4.3.1 When round-trip times vary
Numerical Example 1 (Super-critical): Let us consider the RCP system with , and which corresponds to . We set which corresponds to equilibrium utilization of 90% of link capacity i.e., . For these values, using (17), we obtain , for . From Figure 4, we can observe that the value of is positive, implying that the system undergoes a super-critical Hopf bifurcation. The bifurcation diagram drawn using the Matlab package DDE-Biftool [7, 8] is shown in Figure 6. As expected, it shows that the system loses local stability via a super-critical Hopf bifurcation, as the bifurcation parameter crosses the critical threshold (). To validate this, numerical simulations obtained using XPPAUT [9] are shown in Figure 7. For , the system converges to the equilibrium rate, (see Figure 7(a)). Whereas, for i.e. after the bifurcation, the system leads to the emergence of stable limit cycles.
Numerical Example 2 (Sub-critical): Consider , , , and (). The system undergoes a Hopf bifurcation at = 1. For these values, from Figure 4, we get , implying that the system undergoes a sub-critical Hopf. We can also observe from Figure 8 that there exists no stable limit cycle in the neighborhood, as the bifurcation parameter is varied beyond the critical threshold. Hence the Hopf bifurcation is sub-critical and the bifurcating limit cycles are unstable.
To illustrate the occurrence of a sub-critical Hopf, we present some numerical simulations in Figure 9. For , the system converges to the stable equilibrium, (see Figure 9(a)). Whereas, after the bifurcation i.e. for , the previously stable fixed point now becomes unstable and also the solution would eventually jump to infinity (Figure 9(b)).
4.3.2 When target link utilization varies
Numerical Example 1 (Super-critical): Let us consider the RCP system with , and which corresponds to . We set which corresponds to equilibrium utilization of 55% of link capacity i.e., . For these values, using (17), we obtain , for . From Figure 5, we can observe that for , implying that the system undergoes a super-critical Hopf bifurcation. The bifurcation diagram drawn using the Matlab package DDE-Biftool is shown in Figure 10. As expected, it shows that the system loses local stability via a super-critical Hopf bifurcation, as the bifurcation parameter crosses the critical threshold (). To validate this, numerical simulations obtained using XPPAUT are shown in Figure 11. For , the system converges to the equilibrium rate, (see Figure 11(a)). Whereas, for i.e. after the bifurcation, the system leads to the emergence of stable limit cycles.
Numerical Example 2 (Sub-critical): Consider , (), , and . The system undergoes a Hopf bifurcation at = 1. For these values, from Figure 5, we get , implying that the system undergoes a sub-critical Hopf. We can also observe from Figure 12 that there exists no stable limit cycle in the neighborhood, as the bifurcation parameter is varied beyond the critical threshold. Hence, the Hopf bifurcation is sub-critical and the bifurcating limit cycles are unstable.
To illustrate the occurrence of a sub-critical Hopf, we present some numerical simulations in Figure 13. For , the system converges to the stable equilibrium, (see Figure 13(a)). Whereas, after the bifurcation i.e. for , the previously stable fixed point now becomes unstable and also the solution would eventually jump to infinity (Figure 13(b)).
In summary, the results of theoretical and numerical analysis reveal that the RCP which uses both rate mismatch and queue size feedback, can undergo a sub-critical Hopf bifurcation, which is undesirable for engineering applications. In fact, in the context of congestion control algorithms, the possibility of occurrence of a sub-critical Hopf has not been extensively studied so far. The insights from Hopf bifurcation analysis could guide design considerations such that any loss of local stability only occurs via the emergence of small amplitude stable limit cycles. In other words, the nature of Hopf bifurcation and the stability of the bifurcating limit cycles should also be considered while designing congestion control protocols.
4.4 Packet-level simulations
We now validate some of the theoretical insights by investigating if the packet-level simulations of the underlying system exhibits the qualitative properties predicted through the Hopf bifurcation analysis of the fluid model. The packet-level simulations are done using a discrete event RCP simulator (for more details, refer to [14]). The simulated network has a single bottleneck link setup that considers Capacity, Giga bits per sec (Gbps) and number of sources = .
Simulation traces in Figure 14 show the evolution of queue size and flow rate for the cases with and without queue size feedback. We choose ms for half of the flows and ms for the remaining flows. Here, we set which corresponds to equilibrium utilization of 95% of link capacity. For RCP without queue size feedback, we set to achieve the same target link utilization. We can observe that the RCP which uses both rate mismatch and queue feedback exhibits large amplitude limit cycles (due to the occurrence of a sub-critical Hopf). Whereas, in the absence of queue feedback, the system undergoes a super-critical Hopf bifurcation, and leads to the emergence of small amplitude limit cycles.
From the simulation traces shown in Figure 15, we can observe that, in the presence of queue feedback, the type of Hopf bifurcation can be varied by changing the values of and .
5 Contributions
RCP estimates the fair rate of flows using feedback based on rate mismatch and queue size. An open design question in RCP is whether it is advantageous to include queue size feedback, given that the protocol already includes feedback based on rate mismatch. To address this question, we analyzed stability and Hopf bifurcation properties for both the design options, i.e., with and without queue size feedback. In this paper, we considered the RCP model that assumes single bottleneck link carrying flows with two different round-rip times. In the local stability analysis, we showed that in the presence of queue feedback, the system readily loses its stability via a Hopf bifurcation, as the bifurcation parameter varies. For our analysis, a dimensionless exogenous parameter was used as the bifurcation parameter. Then, we proceeded to analyze the dynamics of both the design choices as conditions for stability are just violated. From a bifurcation theoretic perspective we would like our algorithms to always produce stable limit cycles of small amplitude. We analyzed the type of Hopf bifurcation and the orbital stability of the bifurcating limit cycles. We highlighted that the presence of queue feedback in RCP results in a sub-critical Hopf bifurcation, for some parameter values. A sub-critical Hopf leads to either large amplitude limit cycles or unstable limit cycles, and hence its occurrence should be avoided. Whereas, in the absence of queue feedback, the Hopf bifurcation is always super-critical and leads to the emergence of stable limit cycles of small amplitude. Hence, it is advisable to go with the design choice that uses only rate mismatch feedback. We complemented the analysis with bifurcation diagrams, numerical computations, and packet-level simulations.
Naturally, the work should also extend to consider the cases with multi bottleneck link. It is also worth investigating the global stability of RCP both in the presence and absence of queue feedback.
Appendix A Hopf Bifurcation Analysis
A.1 Existence of Hopf bifurcation
Stability analysis highlights that the RCP loses stability at a critical value of bifurcation parameter ; =. Therefore, we obtain the critical value of the bifurcation parameter, at which the system loses local stability, as
[TABLE]
To show that the system undergoes a Hopf bifurcation at , we need to satisfy the following transversality condition of the Hopf spectrum [11]
[TABLE]
Now we consider the linear autonomous delay equation of the system whose corresponding characteristic equation is given by
[TABLE]
Differentiating the above equation with respect to , we get
[TABLE]
Substituting the values, we obtain
[TABLE]
where
[TABLE]
Now we have shown the existence of Hopf bifurcation at the edge of the stable regime. It is important to note that the result holds true for both the cases i.e. with, and without queue feedback , as for both.
A.2 Type and stability of Hopf bifurcation
We have shown that the system exhibits Hopf type bifurcation in both the cases i.e. with, and without queue feedback. However a comprehensive understanding of the stability and amplitudes of the emerging limit cycles would certainly help to address the question of whether the queue feedback is useful, or not.
Here, we outline the necessary calculations to determine the type of Hopf bifurcation and the asymptotic form of the bifurcation solutions as local instability just sets in. For now, we will only be concerned with the first Hopf bifurcation. The framework employed to address the stability of the limit cycles is the Poincaré normal form, and the center manifold theorem.
Consider the following nonlinear delay differential equation:
[TABLE]
where has a unique equilibrium denoted by and . Define and take a Taylor expansion for (28) including the linear, quadratic and cubic terms to obtain
[TABLE]
where, letting denote evaluation of at
[TABLE]
The calculations that follow will enable us to address questions about the form of the bifurcating solutions, as the system transits from stability to instability via a Hopf bifurcation. For this we have to take higher order terms, i.e., the quadratic and cubic of (29) into consideration. Following the work of [23], we now perform the requisite calculations.
Consider the following autonomous delay-differential system
[TABLE]
where
[TABLE]
is a one-parameter family of continuous linear operators defined as . The operator contains the nonlinear terms. Further, assume that is analytic and that and depend analytically on the bifurcation parameter. Note that (29) is a type of the form (30). The objective now is to rewrite (30) as follow
[TABLE]
which has rather than both and . By the Riesz representation theorem, there exists a matrix-valued function , with variation of each component of is bounded and for all
[TABLE]
where \mathrm{d}\eta(\theta,\mu)=\kappa\big{(}\xi_{y}\delta(\theta+\tau_{1})+\xi_{z}\delta(\theta+\tau_{2})\big{)}\mathrm{d}\theta and is the Dirac delta function.
Now we define
[TABLE]
and
[TABLE]
Now the system (30) becomes equivalent to (31) as required.
Let be the eigenfunction for corresponding to , namely
[TABLE]
Now we define an adjoint operator as
[TABLE]
Note that, the domains of and are and respectively. As
[TABLE]
is an eigenvalue for , and
[TABLE]
for some nonzero vector . For and , define a bilinear inner product
[TABLE]
Then, for Dom Dom. Let and be the eigenvectors for and corresponding to the eigenvalues and .
Value of can be evaluated using (33) and the relation as
[TABLE]
Again, using (33) we show that as
[TABLE]
Now we define
[TABLE]
Then, on the centre manifold ,
w(t,\theta)=w\big{(}z(t),\bar{z}(t),\theta\big{)} where
[TABLE]
In effect, and are local coordinates for manifold in in the directions of and , respectively. The existence of the center manifold enables us to reduce (31) to an ordinary differential equation for a single complex variable on . At , we have
[TABLE]
which can be written as
[TABLE]
Now expanding the function in powers of and we get
[TABLE]
Following [11], we write
[TABLE]
[TABLE]
which can be written as
[TABLE]
using (37), where
[TABLE]
Now, on the centre manifold , near the origin
[TABLE]
Use (35) and (37) to replace and equating this with (39), we get
[TABLE]
From (38), we get
[TABLE]
from which , and can be determined. As We only require the coefficients of and , we have
[TABLE]
Using the above expressions, we can find the expression for other quadratic and cubic terms of by substituting appropriate values for and .
Recall that
[TABLE]
Comparing the coefficients of , and , we get
[TABLE]
[TABLE]
For , we have
[TABLE]
Now using (40), we obtain
[TABLE]
From (32), (41) and (42), we derive the following:
[TABLE]
Solving the above differential equations yields
[TABLE]
for some and .
For , we get
[TABLE]
Using (32), (41) and (42), we get
[TABLE]
Evaluate , , , , and using (LABEL:w20) and (46), and substituting in (49) and (50), we get and as
[TABLE]
Thus the stability analysis of the Hopf bifurcation can now be performed using [11]. The quantities required to study the nature of the Hopf bifurcation are as follows
[TABLE]
where
[TABLE]
The direction and stability of Hopf bifurcation is determined by the sign of and respectively. If then the Hopf bifurcation is super-critical(sub-critical). Simillarly, the bifurcating solutions are asymptotically orbitally stable(unstable) if .
References
- [1]
- [2]
A. Abuthahir and G. Raina, “Local stability and Hopf bifurcation analysis of a Rate Control Protocol with two delays”, in Proceedings of Chinese Control and Decision Conference, 2015.
- [3]
H. Balakrishnan, N. Dukkipati, N. McKeown and C.J. Tomlin, “Stability analysis of explicit congestion control protocols”, IEEE Communications Letters, vol. 11, pp. 823–825, 2007.
- [4]
L. Baretto, “XCP-Winf and RCP-Winf: Improving Explicit Wireless Congestion Control”, Journal of Computer Networks and Communications, pp. 1–18, 2015.
- [5]
N. Dukkipati, N. McKeown, and A. G. Fraser, “RCP-AC: Congestion control to make flows complete quickly in any environment,” in Proceedings of IEEE INFOCOM, 2006, pp. 1–5.
- [6]
T. Dong, X. Liao and T Huang, “Dynamics of a congestion control model in a wireless access network”, Nonlinear Analysis: Real World Applications, vol. 14, pp. 671–683, 2013.
- [7]
K. Engelborghs, T. Luzyanina and D. Roose, “Numerical bifurcation analysis of delay differential equations using DDE-BIFTOOL”, ACM Transactions on Mathematical Software, vol. 28, pp. 1–21, 2002.
- [8]
K. Engelborghs, T. Luzyanina and G. Samaey, “DDE-BIFTOOL v. 2.00: a Matlab package for bifurcation analysis of delay differential equations”, Technical Report TW-330, Department of Computer Science, K.U.Leuven, Leuven, Belgium, 2001.
- [9]
B. Ermentrout, Simulating, Analyzing, and Animating Dynamical Systems: A Guide to XPPAUT for Researchers and Students, SIAM Publications, 2002.
- [10]
J.M. Harrison, Brownian Motion and Stochastic Flow Systems. New York: Wiley, 1985.
- [11]
B.D. Hassard, N.D. Kazarinoff and Y.H. Wan, Theory and Applications of Hopf Bifurcation. Cambridge, U.K.: Cambridge University. Press, 1981.
- [12]
L. He and H. Zhou, “Robust Lyapunov-Krasovskii based design for explicit control protocol against heterogeneous delays,” Telecommunication Systems, vol. 63, no. 3, pp. 377–392, Nov. 2017.
- [13]
D. Katabi, M. Handley, and C. Rohrs, “Congestion control for high bandwidth-delay product networks,” ACM SIGCOMM Computer Communication Review, vol. 32, no. 4, pp. 89–102, Oct. 2002.
- [14]
F. Kelly, G. Raina and T. Voice, “Stability and fairness of explicit congestion control with small buffers”, ACM SIGCOMM Computer Communication Review, vol. 38, pp. 51–62, 2008.
- [15]
A. Lakshmikantha, R. Srikant, N. Dukkipati, N. McKeown and C. Beck, “Buffer sizing results for RCP congestion control under connection arrivals and departures”, ACM SIGCOMM Computer Communication Review, vol. 39, pp. 5–15, 2008.
- [16]
K. Lei, C. Hou, L. Li and K. Xu, “A RCP-based congestion control protocol in named data networking”, in Proceedings of International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2015.
- [17]
F. Liu, Z. H. Guan and O. H. Wang, “Stability and Hopf bifurcation analysis in a TCP fluid model”, Nonlinear Analysis: Real World Applications, vol. 12, pp. 353–363, 2011.
- [18]
F. Liu, O. H. Wang, and Z. H. Guan, “Hopf bifurcation control in the XCP for the Internet congestion control system,” Nonlinear Analysis: Real World Applications, vol. 13, pp. 1466–1479, 2012.
- [19]
J. Liu and O.W. Yang, “Convergence, stability and robustness analysis of the OFEX controller for high-speed networks”, Control Theory and Technology, pp. 1–18, 2016.
- [20]
M. Mahdian, S. Arianfar, J. Gibson, and D. Oran, “MIRCC: Multipath-aware ICN rate-based congestion control,” in Proc. ACM Conf. Inform. Centric Netw., 2016, pp. 1–10.
- [21]
N. Malangadan and G. Raina, “Rate based feedback:some experimental evaluation with NetFPGA”, Proceedings of IEEE International Conference on Communications, 2011.
- [22]
L. Pei and Y. Wu, “Hopf bifurcation of the wireless network congestion model with state-dependent round trip delay”, International Journal of Bifurcation and Chaos, vol. 28, no. 9, 2018.
- [23]
G. Raina, “Local bifurcation analysis of some dual congestion control algorithms”, IEEE Transactions on Automatic Control, vol. 50, pp. 1135–1146, 2005.
- [24]
Y. Ren, J. Li, S. Shi, L. Li, and G. Wang, “An explicit congestion control algorithm for Named Data Networking,” in Proc. IEEE INFOCOM, 2016, pp. 294–299.
- [25]
N.K. Sharma, A. Kaufmann, T.E. Anderson, A. Krishnamurthy, J. Nelson and S.Peter, “Evaluating the Power of Flexible Packet Processing for Network Resource Allocation”, in USENIX Symposium on Networked Systems Design and Implementation, 2017.
- [26]
R. Srikant, The Mathematics of Internet Congestion Control. Birkhauser, 2004.
- [27]
G. Stépán, Retarded dynamical systems: stability and characteristic functions. Essex: Longman Scientific & Technical, 1989.
- [28]
S.H. Strogatz, Nonlinear dynamics and chaos: with applications to physics, biology, chemistry, and engineering, CRC Press, 2018.
- [29]
Y.D. Sun, Z.Z. Ji and H. Wang, “Towards Performance Evaluation of Rate Control Protocol in Satellite Networks”, International Journal of Electrical and Computer Sciences, vol. 12, pp. 37–41, 2012.
- [30]
T. Voice and G. Raina, “Stability analysis of a max-min fair Rate Control Protocol (RCP) in a small buffer regime”, IEEE Transactions on Automatic Control, vol. 54, pp. 1908–1913, 2009.
- [31]
J. Wang, P. Dong, J. Chen, J. Huang, S. Zhang and W. Wang, “Adaptive explicit congestion control based on bandwidth estimation for high bandwidth-delay product networks”, Computer Communications, vol. 30, pp. 1235–1244, 2013.
- [32]
B. Wydrowski and M. Zukerman, “MaxNet: A congestion control architecture,” IEEE Communication Letters, vol. 6, no. 11, pp. 512–514, Nov. 2002.
- [33]
L. Zhang, D. Estrin, J. Burke, V. Jacobson, J.D. Thornton, D.K. Smetters, B. Zhang, G. Tsudik, D. Massey and C. Papadopoulos, “Named Data Networking (NDN) project,” PARC, Technical Report NDN-0001, Oct. 2010.
- [34]
Y. Zhang, D. Leonard, and D. Loguinov, “JetMax: Scalable max-min congestion control for high-speed heterogeneous networks,” Computer Networks, vol. 52, no. 6, pp. 1193–1219, Apr. 2008.
- [35]
S. Zhang and J. Xu, “Quasiperiodic motion induced by heterogeneous delays in a simplified Internet congestion control model”, Nonlinear Analysis: Real World Applications, vol. 14, pp. 661–670, 2013.
- [36]
S. Zhong, Y. Liu, J. Li, and K. Lei, “A Rate-Based Multipath-Aware Congestion Control Mechanism in Named Data Networking,” in Proceeding of IEEE International Symposium on Ubiquitous Computing and Communications, 2017.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] A. Abuthahir and G. Raina, “Local stability and Hopf bifurcation analysis of a Rate Control Protocol with two delays”, in Proceedings of Chinese Control and Decision Conference , 2015.
- 3[3] H. Balakrishnan, N. Dukkipati, N. Mc Keown and C.J. Tomlin, “Stability analysis of explicit congestion control protocols”, IEEE Communications Letters , vol. 11, pp. 823–825, 2007.
- 4[4] L. Baretto, “XCP-Winf and RCP-Winf: Improving Explicit Wireless Congestion Control”, Journal of Computer Networks and Communications , pp. 1–18, 2015.
- 5[5] N. Dukkipati, N. Mc Keown, and A. G. Fraser, “RCP-AC: Congestion control to make flows complete quickly in any environment,” in Proceedings of IEEE INFOCOM , 2006, pp. 1–5.
- 6[6] T. Dong, X. Liao and T Huang, “Dynamics of a congestion control model in a wireless access network”, Nonlinear Analysis: Real World Applications , vol. 14, pp. 671–683, 2013.
- 7[7] K. Engelborghs, T. Luzyanina and D. Roose, “Numerical bifurcation analysis of delay differential equations using DDE-BIFTOOL”, ACM Transactions on Mathematical Software , vol. 28, pp. 1–21, 2002.
- 8[8] K. Engelborghs, T. Luzyanina and G. Samaey, “DDE-BIFTOOL v. 2.00: a Matlab package for bifurcation analysis of delay differential equations”, Technical Report TW-330 , Department of Computer Science, K.U.Leuven, Leuven, Belgium, 2001.
