Effect of two forms of feedback on the performance of the Rate Control Protocol (RCP)
Abuthahir Abuthahir, Nizar Malangadan, Gaurav Raina

TL;DR
This paper analyzes how different feedback mechanisms in the Rate Control Protocol affect network stability, showing that removing queue size feedback can improve stability and lead to more desirable bifurcation behavior.
Contribution
The study employs control and bifurcation theory to analyze RCP feedback forms, revealing that excluding queue feedback enhances stability and results in stable limit cycles.
Findings
Removing queue feedback improves stability and convergence.
Presence of queue feedback can cause sub-critical Hopf bifurcations.
Absence of queue feedback leads to stable limit cycles.
Abstract
The Rate Control Protocol (RCP) uses explicit feedback from routers to control network congestion. RCP estimates it's fair rate from two forms of feedback: rate mismatch and queue size. An important design question that remains open in RCP is whether the presence of queue size feedback is helpful, given the presence of feedback from rate mismatch. The feedback from routers to end-systems is time delayed, and may introduce instabilities and complex non-linear dynamics. Delay dynamical systems are often modeled using delay differential equations to facilitate a mathematical analysis of their performance and dynamics. The RCP models with and without queue size feedback give rise to two distinct non-linear delay differential equations. Earlier work on this design question was based on methods of linear systems theory. For further progress, it is quite natural to employ nonlinear techniques.…
| Parameter range | System behavior |
|---|---|
| stable and non-oscillatory | |
| stable and oscillatory | |
| unstable |
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.
Effect of two forms of feedback on the performance of the Rate Control Protocol (RCP)
Abuthahir
Nizar Malangadan
Gaurav Raina
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai-600036, India
Abstract
The Rate Control Protocol (RCP) uses explicit feedback from routers to control network congestion. RCP estimates it’s fair rate from two forms of feedback: rate mismatch and queue size. An important design question that remains open in RCP is whether the presence of queue size feedback is helpful, given the presence of feedback from rate mismatch. The feedback from routers to end-systems is time delayed, and may introduce instabilities and complex non-linear dynamics. Delay dynamical systems are often modeled using delay differential equations to facilitate a mathematical analysis of their performance and dynamics. The RCP models with and without queue size feedback give rise to two distinct non-linear delay differential equations. Earlier work on this design question was based on methods of linear systems theory. For further progress it is quite natural to employ nonlinear techniques. In this study, we approach this design question using tools from control and bifurcation theory. The analytical results reveal that the removal of queue feedback could enhance both stability and convergence properties. Further, using Poincaré normal forms and center manifold theory, we investigate two nonlinear properties, namely, the type of Hopf bifurcation and the asymptotic stability of the bifurcating limit cycles. We show that the presence of queue feedback in the RCP can lead to a sub-critical Hopf bifurcation, which would give rise either to the onset of large amplitude limit cycles or to unstable limit cycles. Whereas, in the absence of queue feedback, the Hopf bifurcation is always super-critical and the bifurcating limit cycles are stable. The analysis is complemented with computations and some packet-level simulations as well. In terms of design, our study suggests that the presence of both forms of feedback may be detrimental to the performance of RCP.
keywords:
Congestion control, Rate control protocol, queue feedback, stability, convergence, Hopf bifurcation
††journal: Communications in Nonlinear Science and Numerical Simulation
1 Introduction
Most queuing systems routinely share information regarding waiting times, or queue lengths, with customers. Such information can certainly influence the behavior of customers. If such feedback is not instantaneous, but is time-delayed, it can have a significant impact on the underlying system dynamics; for example, see [1, 24, 25, 29]. The presence of feedback delays makes the system infinite-dimensional, and may pose numerous theoretical and practical challenges. 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 nonlinear system before addressing the issue of stability. However, the feedback delays of a nonlinear dynamical system may result in various complex dynamics like bifurcation, chaos, etc. So, it looks appealing to have an analytical methodology which may allow us to capture the impact of some nonlinear terms while performing a Taylor expansion of the nonlinear system about its equilibrium. Local bifurcation theory is one such methodology [11]. For example, see [5, 14, 18, 24] for some stability and bifurcation analysis of dynamical systems with feedback delays. Moreover, without an understanding of the dynamics of the system in the unstable regime, choosing an operating point close to the boundary of the stable region could be risky. A comprehensive understanding of local bifurcation phenomena may help yield insights into the behavior of the system in the unstable regime. This paper employs both linear systems theory and non-linear techniques to investigate how the feedback of queue size can impact the system behavior in the setting of congestion control protocols for the Internet. We consider protocols where end-systems use feedback, which is time-delayed, from routers to adjust their rates. There is a continued interest in analyzing the stability and dynamical properties of fluid models for Internet congestion control algorithms [10, 22, 26, 27, 34, 38]. In this paper, our focus will be on a well-known congestion control transport protocol called the Rate Control Protocol (RCP) [2, 6, 16, 17, 19].
Internet congestion control has been an active area of networking research for several decades [31]. The Transmission Control Protocol (TCP) is currently the most commonly used transport protocol, which handles congestion control in the Internet. The widespread use of high bandwidth-delay networks and wireless links create limitations on the performance of standard TCP. Currently, TCP uses packet loss and delay as signals of network congestion. But, delay and loss are damage to packets, and hence this implicit signaling mechanism affects the performance limits and system Quality of Service (QoS). This has led to the development of congestion control protocols that could employ explicit feedback. Some examples of explicit congestion control algorithms include the Rate Control Protocol (RCP) [2, 6, 16, 17, 19], eXplicit Control Protocol (XCP) [13, 15, 21], JetMax [37] and MaxNet [35]. Explicit congestion control protocols can convey accurate information to end-systems, which are then able to better regulate their flow and congestion control mechanisms. In the class of explicit feedback algorithms, the Rate Control Protocol (RCP) [2, 6, 17] has the potential to offer stable and fair network performance, along with low latency and high link utilization. One architecture that could benefit from the use of RCP is a host-centric one, i.e., IP-based networks (for example, see [3, 30] and [33]). Another architecture that appears to be appealing for RCP are future data-centric networks, which are called Named Data Networking (NDN) [36]. In NDN, there is no IP address, and all data are named with unique names. Also, the data can be retrieved through multiple paths from multiple sources. In fact, the implicit feedback mechanism used by TCP is not reliable in these environments [28]. Therefore, researchers tend to focus on employing rate-based RCP-style algorithms in NDN; for e.g., see [20, 23] and [39].
RCP aims to achieve processor sharing by assigning a single fair rate for all the flows traversing the bottleneck link. The dynamics and performance of a protocol are largely affected by the mechanisms that routers employ to control the congestion. Currently, regardless of networking architectures, RCP computes the fair rate using two forms of feedback: rate mismatch and the queue size. An outstanding question in the design of RCP is whether two forms of feedback are needed in the protocol specification. We address this question by evaluating the performance of RCP with and without two forms of feedback. Early results in [17] show that the presence of queue feedback in RCP may lead to less accurate control over the queue size. However, this insight was based on some initial simulations, and more analysis would be required before arriving at a better understanding of this design consideration. 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. Hence, the stability becomes an important consideration in the design of RCP. Apart from ensuring stability, another important design objective is to make sure that the system converges quickly to a stable equilibrium. Therefore, we explore the impact of queue feedback on the local stability and the convergence properties of RCP. It is also natural to investigate the nature of instabilities that may occur if the stability conditions are just violated. We hasten to add that we are not interested in destabilizing the network, but wish to employ the tools offered by local instability analysis to gain some insights into the non-linear properties of the system under consideration. Thus, we also conduct a detailed local Hopf bifurcation analysis to investigate the effects of queue feedback on the non-linear dynamical properties of RCP. Taken together, we consider local stability, convergence rate, the type of Hopf bifurcation, and the stability of limit cycles as the performance metrics to deduce whether the queue feedback is beneficial or not.
In a control theoretic approach, congestion control algorithms are often modeled as delay differential equations. The systems with and without feedback based on queue size give rise to different nonlinear delay differential equations. For now, we consider the RCP model that assumes flows with the same round-trip time, operating over a single bottleneck link. Here, round-trip time (RTT) denotes the sum of all the delays from source to link, and from link to source. Instability in the system could be induced by varying some of the system parameters. But, variations of some system parameters may affect the equilibrium values, which is undesirable. Moreover, to conduct a unified analysis of both the design choices, it is desirable to use a common exogenous parameter to push the system just into the unstable regime.
Previous studies of the stability of RCP were confined to developing sufficient conditions to ensure local stability [2, 17]. In this work, we derive necessary and sufficient conditions to ensure local asymptotic stability of RCP for the cases with and without queue size feedback. 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]. Similarly, the rate of convergence analysis reveals that the convergence rate to equilibrium increases when the queue size term is absent. The theoretical framework we employ to study the nature of the Hopf bifurcations is the Poincaré normal form [11] which requires the computation of a center manifold existing near the degenerate equilibrium point under investigation and the determination of the flow on this manifold. Using this framework, we analytically characterize the type of Hopf bifurcation, and the nature of the bifurcating limit cycles. In [34], it was shown that the RCP which uses only rate mismatch feedback always exhibit a super-critical Hopf bifurcation, and the emerging limit cycles are asymptotically stable. So far, the bifurcation properties for the case where we have both rate mismatch and queue size feedback have not been studied. In this paper, we show that the RCP which uses both rate mismatch and queue size feedback 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 [32]. Thus, the queue feedback in the RCP model could create adverse effects on the stability of the limit cycles.
To the best of our knowledge, this is the first study that presents strong evidence to suggest that fluid models representing Internet congestion control algorithms can undergo a sub-critical Hopf bifurcation, for some parameter values. Therefore, this study reveals some novel insights into the non-linear dynamical properties which has been overlooked in previous studies of congestion control algorithms. Moreover, in general, 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. Hence, this work could serve as an important step towards better design guidelines of the Internet congestion control algorithms. In essence, all the analytical results of this study tend to favor the design choice that uses only rate mismatch feedback. For such a system, a necessary and sufficient condition for non-oscillatory convergence is derived. This condition helps in finding an optimal value for a key protocol parameter. Bifurcation diagrams, numerical computations and packet-level simulations serve to validate some of the theoretical insights.
The rest of this paper is structured as follows. In Section 2, we outline the non-linear fluid model for RCP. In Section 3, we investigate the local stability of RCP in the presence and absence of queue size feedback. The rate of convergence and local Hopf bifurcation analysis are outlined in Sections 4 and 5. A necessary and sufficient condition for non-oscillatory convergence is derived in Section 6. Finally, in Section 7, we summarize our key insights and suggest some avenues for further research.
2 RCP Model
At the fluid level, modeling the congestion control algorithms using the framework of delay differential equations has enabled their analysis to be subjected to tools from control and bifurcation theory. This section describes the non-linear model that represents the dynamics of the RCP protocol. RCP calculates the fair rate for all flows sharing a single bottleneck link by using feedback based on rate mismatch and the instantaneous queue size. The model for RCP is governed by the following non-linear delay differential equation [6, 34]
[TABLE]
where
[TABLE]
using the notation . Here denotes the rate that RCP updates for all flows passing through the link, is the aggregate load arriving at the link, is the capacity of the link, is the instantaneous queue size, is the round-trip time (RTT) experienced by the traffic flow , represents the average RTT of packets passing through the link, and , are non-negative dimensionless protocol parameters.
The equation for the queue dynamics is
[TABLE]
3 Local stability analysis
The initial, and in fact very common, style of stability analysis for non-linear time delayed systems is to first linearize the equation and then study the stability properties of the linearized system. In this section, the non-linear fluid model of RCP is first linearized about its equilibrium, and then attractive conditions for local stability guide design recommendations. For the sake of simplicity, it is assumed that the bottleneck link carries flows with the same round-trip time . It is preferable not to use any of the system parameters as the bifurcation parameter, as varying them would affect the system equilibrium. Instead, an exogenous non-dimensional parameter, , is used to drive the system just into the regime of local instability. This has various advantages. we need not be concerned with the dimension of the parameter, and as it is common for both the design choices we can compare the results fairly.
3.1 Feedback based on rate mismatch and queue size
The RCP model under consideration can now be represented as
[TABLE]
Let represents the non-trivial equilibrium of (4), then
[TABLE]
From (5), it can be noted that the equilibrium values are independent of the bifurcation parameter . To linearize a non-linear system, we write the Taylor series expansion about the equilibrium point and include only the linear terms. Consider the perturbation , and linearize (4) about the equilibrium to obtain
[TABLE]
The characteristic equation for the linearized system (6) is
[TABLE]
By analyzing the roots of the above transcendental characteristic equation, we proceed to derive a necessary and sufficient condition for local asymptotic stability. For the system to be stable, all the roots of (7) should lie on the open left-half, , of the complex plane. The system becomes locally unstable when the roots cross the imaginary axis and go to the right half of the complex plane. Therefore, the condition for the crossover defines the bounds on the model parameters which guarantees local asymptotic stability. To find the critical value of , at which the characteristic equation (7) has a pair of purely imaginary roots, substitute in (7). Then, separating real and imaginary terms, and equating them to zero gives
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
Now, the critical value () at which (7) has a purely imaginary root is given by
[TABLE]
To exhibit that the system loses local asymptotic stability via a Hopf bifurcation, as increases beyond , the following transversality condition [11] has to be verified:
[TABLE]
Differentiating (7) with respect to gives
[TABLE]
It is clear that
[TABLE]
Therefore, instead of finding (), consider its inverse, i.e., . Further simplification gives
[TABLE]
Evaluating the real part of (13) at yields
[TABLE]
which satisfies the transversality condition. The positivity of the above derivative implies that the system transits from stability to instability through a Hopf bifurcation, at . It also means that the roots of (7) crossover the imaginary axis from left to right with positive velocity, and hence the system does not regain the stability with a further increase in . The linearized system (6) is asymptotically stable for all values of less than , and unstable for . Now, the necessary and sufficient condition for local stability of (4) is
[TABLE]
By setting = 1 (to get back to the original system), (14) can be rewritten as
[TABLE]
From (15), it can be observed that the protocol parameters and play a vital role in ensuring system local stability. Figure 1 graphically represents the Hopf condition and the region of local stability of RCP. This makes it easier to understand the relationship between and to ensure stability.
3.2 Feedback based on only rate mismatch
In this subsection, local stability analysis is performed for RCP which uses only rate mismatch feedback. To remove the queue term from the RCP model, is set to zero in (4). This gives
[TABLE]
Linearizing (16) about its equilibrium gives
[TABLE]
The characteristic equation of (17) can be written as
[TABLE]
Proceeding as outlined in the previous subsection, the necessary and sufficient condition for local asymptotic stability of (16) can be written as
[TABLE]
Substituting = 1 gives
[TABLE]
Impact of queue size feedback on stability: As compared to (15), the RCP model which uses only rate mismatch feedback gives a simple stability condition, which makes it easier to design and ensure a stable system. It should be noted that condition (20) is necessary but not sufficient for the system (4) to be locally stable. Now, if the value of protocol parameter , then the RCP system with no queue size feedback is locally stable, whereas the system with queue feedback loses its local stability through a Hopf bifurcation, as parameter varies beyond some threshold. The Hopf bifurcation would lead to the emergence of limit cycles in the system dynamics. These limit cycles can manifest themselves in the queue size, which could degrade performance. Hence, the presence of queue size feedback seems to be detrimental to the system stability. A numerical example is now given to illustrate the existence of Hopf bifurcation and the emergence of limit cycles.
Numerical Example: Let , , and . For these parameter values, using the Hopf condition (12), the critical value of the bifurcation parameter that drives the system to the edge of the stable regime is . If goes beyond this critical value, the system will lose its local stability via a Hopf bifurcation which leads to the emergence of limit cycles. To verify this, the phase portraits of (4) for the cases: and are plotted in Figure 2. Using (5), we obtain the non-zero equilibrium of the system with the above choice of parameter values as . Based on the analytical results, for the value of , the system should be locally stable. Indeed, as shown in Figure 2 (a), it can be observed that the rate converges to the stable equilibrium (), which implies that the system is locally asymptotically stable. We now marginally increase beyond (set ), thus pushing the system into the unstable region. As expected, the system exhibits limit cycles (see Figure 2 (b)). The numerical simulations were done using the numerical computing software MATLAB. The bifurcation diagram shown in Figure 3 was drawn using the MATLAB package DDE-Biftool [7, 8]. Figure 3 shows the existence of a super-critical Hopf as the bifurcation parameter increases beyond .
Another essential compliment to the theoretical analysis is the packet-level simulations. The theoretical insights should be validated by investigating if the packet-level simulations of the underlying system exhibits the qualitative properties predicted through the analysis of the fluid model. The packet-level simulations are done using a discrete event RCP simulator (for more details, refer to [17]). The simulated network has a single bottleneck link setup that considers packet per unit time, number of flows = and RTT of all the flows as time units. Simulation traces in Figure 4 (a) and Figure 4 (b) show the evolution of queue size for the choice of parameter values , and , , respectively. From (20), for the choice , , the system is expected to be stable. Indeed, this is confirmed in the simulation traces in Figure 4 (a) which does not exhibit any limit cycles in the queue size. Figure 4 (b) shows the emergence of limit cycles in the queue size. This is as expected, since the parameter values and violates the stability condition (15), and lies outside the stable region (see Figure 1).
4 Rate of convergence
We now consider some convergence properties of the system in the stable regime. Rate of convergence is a key performance metric which must be considered for a congestion control algorithm. To that end, the impact of queue feedback on the convergence rate is examined by conducting the rate of convergence analysis in the presence and absence of queue size feedback.
4.1 Feedback based on rate mismatch and queue size
To recapitulate, the characteristic equation of the linearized model of RCP which uses both rate mismatch and queue size feedback is
[TABLE]
From (21) it can be observed that the characteristic function corresponding to the system is a second order quasi-polynomial. Therefore, in this case, it is difficult to get closed-form analytical expressions for the rate of convergence. In such a case, we resort to some numerical computation tools that can assist in finding the rightmost root of the characteristic equation. The real part of the rightmost root can give insights about the system behavior, and it can be used to calculate the rate of convergence. We use DDE-Biftool to analyze the rate of convergence for the system which includes queue feedback. For delay differential equations with real coefficients, the rightmost root could be a single real root or a complex conjugate pair. Figure 5 shows the rate of convergence computed numerically using DDE-Biftool, for various values of the protocol parameters. From Figure 5, we can observe that the rate of convergence decreases as the value of increases. The parameter values chosen are and .
4.2 Feedback based on only rate mismatch
In this section, following the style of analysis outlined in [4], the rate of convergence analysis is performed for the RCP which uses only rate mismatch feedback. The analytical results enable us to investigate the impact of protocol parameters on the convergence rate. Here, we consider , to get back the original system. Now the characteristic equation can be written as
[TABLE]
Substituting in (22) yields
[TABLE]
Here, is considered to be the supremum of the solutions of (23) over which guarantees that all the characteristic roots lie on the open left half of the complex plane. Let be the largest real part of all the roots of (23). Then, the rate at which the system approaches a stable equilibrium is given by . A necessary and sufficient condition for all the eigenvalues of (23) to lie on the left half-plane is [12]
[TABLE]
where is the solution of the equation
[TABLE]
in , with if . Consider the following function
[TABLE]
which increases monotonically in the interval , with , and . Now, using (27) and (28), the inequality (26) can be rewritten as
[TABLE]
As increases, decreases, and hence is decreasing function of . Therefore, the maximum value of that satisfies (29) can be obtained by solving its corresponding equality. By a similar argument, the left hand side of (24) and (25) increases with increase in . Thus, the maximum value of that satisfies the inequalities (24), (25) can be determined by solving the corresponding equalities. If the solution does not exist for any of these equations, then there is no restriction on the value of . Now, we summarize the results as follows.
Let , , be the solutions of
[TABLE]
respectively. Consider for if there is no solution exists for the corresponding equality. Then, the convergence rate is given by
[TABLE]
Now, the next step is to analyze the dependence of convergence rate on protocol parameter , for . The function reaches its maximum value of at . Similarly the function has a minima of at . Let , then there is no solution for (31) if , and for (32) if . Let be the solution of (31) on . Similarly, consider be the solution of (32) on . At , it is obvious that the rate of convergence .
Case 1 :
Differentiating (31) with respect to gives
[TABLE]
Using (31), the derivative (34) can be written as
[TABLE]
From (35), it can deduced that if . Hence for .
Case 2 :
Substituting in (31) yields
[TABLE]
It is known that the function reaches maximum of at , thus at .
Case 3 :
For , using (32), the following holds
[TABLE]
For and , (37) can be written as
[TABLE]
From (38), it can be deduced that , and hence , and .
To summarize, the convergence rate is given by
[TABLE]
where . Figure 6 shows the variation of convergence rate with protocol parameter for various values of . It can observed that the rate of convergence increases with for , and decreases when . Also, the convergence rate is maximum at , so the optimal value of the protocol parameter for fast convergence is .
Also, the rate of convergence decreases with an increase in the round-trip time (see Figure 7). The numerical simulations shown in Figure 7 are done using the computing software XPPAUT [9].
For the sake of comparison, the rate of convergence for the case is also shown in Figure 8. As can be observed from Figure 8, the removal of queue size feedback from RCP improves the convergence rate to equilibrium. Numerical simulations in Figure 9 serve to validate the analytical insights.
However, rather than being confined to a stable regime, it is also worth investigating the behavior of the protocol if the system becomes unstable. Therefore, in the next section, we analyze the consequences associated with the loss of stability for both the design choices.
5 Local Hopf bifurcation analysis
In the previous sections, we analyzed local stability and convergence properties of the RCP protocol. The next natural step is to investigate the dynamical behavior of the system as it transits from a stable to an unstable regime. In this section, we explore the impact of loss of local stability for both the design options, i.e., with and without queue size feedback. In the bifurcation-theoretic analysis, we have to take non-linear terms into consideration, which helps to learn additional non-linear dynamical properties of the system with and without queue size feedback.
5.1 With queue feedback
In the local Hopf bifurcation analysis, we use the theoretical framework of Poincarè normal forms and the center manifold theorem to investigate the type of Hopf bifurcation and the asymptotic orbital stability of the bifurcating limit cycles. For our study, we closely follow the style of analysis provided in [11].
We start by conducting a Taylor series expansion of (4) about the equilibrium, to get
[TABLE]
At , the system satisfies the Hopf bifurcation condition, and a further increase in would drive the system into the unstable region. Let , where , and the Hopf bifurcation takes place at .
Consider the following autonomous delay-differential system
[TABLE]
where , , ,
[TABLE]
is a one-parameter family of continuous (bounded) linear operators. The operator contains the non-linear terms. We assume that and depend analytically on the bifurcation parameter for small . Note that (41) is of the form (42), where \boldsymbol{u}=\big{[}r,q\big{]}^{T}, and
[TABLE]
The objective now is to cast (42) into the form which has instead of both and , i.e.,
[TABLE]
First, transform the linear problem . By Riesz representation theorem, there exists a matrix function , such that the components of have bounded variation and for all
[TABLE]
satisfies (44). Here, is the Dirac delta function. For C^{1}\big{[}-\tau,0\big{]}, define
[TABLE]
As , (42) becomes (43) as desired. Let be the eigenfunction for corresponding to ,
[TABLE]
To find and , let , where . Now, using (50) and (48), and following the style of analysis done for the equations (8) and (9), we get
[TABLE]
Define the adjoint operator as
[TABLE]
Note that the domains of and are and , respectively. As
[TABLE]
is an eigenvalue for , and
[TABLE]
for some non-zero vector . Thus, we get
[TABLE]
where is a non-zero scalar. For and , define an inner product
[TABLE]
where means . Then, for and . Using (57) to find such that , we get
[TABLE]
On simplification, we obtain
[TABLE]
Similarly, we can also verify that . For , a solution of (43) at , define
[TABLE]
Then, on the manifold, , \boldsymbol{w}(t,\theta)=\boldsymbol{w}\big{(}z(t),\overline{z}(t),\theta\big{)}, where
[TABLE]
In effect, and are local coordinates for in in the directions of and , respectively. The existence of the center manifold enables the reduction of (43) to an ordinary differential equation for a single complex variable on . At , we get
[TABLE]
which can be abbreviated as
[TABLE]
The next objective is to expand in powers of and . However, we also have to determine the coefficients in (59). Once the coefficients are determined, the differential equation (60) for would be explicit (as abbreviated in (60)). Expanding in powers of and , we have
[TABLE]
Following [11], we write
[TABLE]
and using (43) and (61) we obtain
[TABLE]
which is rewritten as
[TABLE]
using (59), where
[TABLE]
On the manifold, , near the origin
[TABLE]
Using (59) and (61) to replace , (and their conjugates by their power series expansion) and equating this with (62), we get
[TABLE]
Note that
[TABLE]
from which we obtain and . We need to find the coefficients of , , , . Hence, we only keep these relevant terms in the expansions as follows:
[TABLE]
where . Recall that,
[TABLE]
where , and
[TABLE]
Comparing (66) and (67), and using (65), we get
[TABLE]
[TABLE]
On further simplification, we obtain
[TABLE]
For the expression of , we still need to evaluate , , and . Now for
[TABLE]
which, when compared with (63), gives
[TABLE]
[TABLE]
Solving the differential equations (68) and (69), we obtain
[TABLE]
for some and .
From \boldsymbol{h}(z,\overline{z},0)=-2\mathbf{Re}\Big{(}\overline{\boldsymbol{q}}^{*}(0)\cdot\mathcal{F}_{0}\boldsymbol{q}(0)\Big{)}+\mathcal{F}_{0}, we obtain
[TABLE]
On further simplifying the above equations, we get
[TABLE]
[TABLE]
From (48), (64), (72) and (73), we get
[TABLE]
Substituting the expression for (from (70) and (71)) in the equations (78) and (81), and solving for , , and , we get
[TABLE]
where
[TABLE]
Using (70), (71) and (88), we can find the solutions for , , and . Using these terms, we evaluate the expression for as
[TABLE]
where
[TABLE]
Finally, we derived expressions for all the quantities required to compute the type of Hopf bifurcation and the stability of the bifurcating limit cycles. Now, we can proceed with the analysis by finding out the values of and [11]
[TABLE]
where
[TABLE]
[TABLE]
We now state the definitions that will enable us to investigate the nature of the Hopf bifurcation.
- •
The Hopf bifurcation is super-critical if , and is sub-critical if .
- •
The periodic oscillations are asymptotically orbitally stable if and unstable if .
Substituting the expressions for the coefficients , , and in (91), we obtain
[TABLE]
We substitute the expressions for , and in terms of from (51) and (58) to get
[TABLE]
Let , and taking the real part of the above expression, we have
[TABLE]
Next, we compute the value of . Differentiating the characteristic equation (7) with respect to , we get
[TABLE]
Therefore, if \mathbf{Re}\,\big{(}c_{1}(0)\big{)}>0, then (sub-critical), and (unstable limit cycles). Similarly, if \mathbf{Re}\,\big{(}c_{1}(0)\big{)}<0, then and , which implies that the Hopf bifurcation is super-critical, and the emerging limit cycles are orbitally asymptotically stable. In Figure 10, we plot the variation of and as is varied.
We draw the following inferences from the results of Hopf bifurcation analysis.
Remarks:
- •
The nature of Hopf bifurcation and the stability of limit cycles explicitly depend on , where
[TABLE]
- •
Link capacity () and round-trip time () do not affect the sign of \mathbf{Re}\,\big{(}c_{1}(0)\big{)}. Hence, the type of Hopf bifurcation is independent of these system parameters.
- •
From Figure 10, we can note that for small values of , we have and , and hence the bifurcation is sub-critical and the limit cycles are unstable. Also, note that the criticality of the bifurcation changes from sub-critical to super-critical at . Therefore, for , the bifurcating limit cycles are asymptotically orbitally stable.
To validate the analysis, we now perform some numerical computations for the RCP model with queue feedback. The network parameters and are set to . We consider the following two cases.
(i) (sub-critical): Let us consider that satisfies the Hopf condition at . For these parameter values, we obtain and . Therefore, as per the above analytical characterization, the bifurcation is sub-critical Hopf and leads to unstable limit cycles. We use DDE-Biftool [7, 8] to plot the bifurcation diagram, see Figure 11(a). As expected from the analysis, Figure 11(a) shows that the system undergoes a sub-critical Hopf bifurcation. To illustrate the occurrence of a sub-critical Hopf, we present some numerical simulations (using XPPAUT) in Figure 12. Considering the initial condition and , the system converges to the stable equilibrium (see Figure 12(a)). Whereas, after the bifurcation, i.e., for , the previously stable fixed point at becomes unstable and also the solution would eventually jump to infinity as shown in Figure 12(b).
(ii) (super-critical): In this case, for the system to be at the Hopf condition with , we take . Using these values, we calculate and . implying that the local Hopf bifurcation is super-critical and the emerging limit cycles are asymptotically orbitally stable. The bifurcation diagram in Figure 11(b) shows the emergence of stable limit cycles, which corroborates the analysis. The numerical simulation shown in Figure 13(a) illustrates that the system is locally stable for . But, after the occurrence of bifurcation, the system converges to a stable limit cycle (Figure 13(b)).
Now, we present some packet-level simulations to illustrate that the RCP with queue feedback can undergo either super-critical or sub-critical Hopf depending on the parameter values. For this simulation, we consider packet per unit time, number of flows = and time units. Simulation traces in Figure 14 (a) and Figure 14 (b) show the queue size and rate for the parameter values , and , , respectively. For and , we get , and hence the type of Hopf is expected to be sub-critical. Indeed, this is confirmed in the simulation traces in Figure 14 (a) which shows the emergence of large amplitude limit cycles. However, it does not lead to blow-up due to some constraints of simulators. For the parameter values and , the system exhibits a super-critical Hopf which results in small amplitude stable limit cycles (see Figure 14 (b)). This is as expected, since the values and yield .
5.2 Without queue feedback
In [34], it has been shown that the equation (17) undergoes a local Hopf bifurcation at , where If the Hopf condition is just violated, the system would lose local stability via a super-critical Hopf bifurcation and the amplitude of the bifurcating limit cycles will be proportional to
[TABLE]
Here denotes the equilibrium of (17). It is also highlighted in [34] that equation (17) cannot undergo a sub-critical Hopf bifurcation.
Discussion: It is rather striking to find the possibility of a sub-critical Hopf bifurcation in RCP. A sub-critical Hopf would lead either to the emergence of unstable limit cycles, or to the emergence of limit cycles with a very large amplitude. Either of these outcomes is detrimental to system performance and is undesirable in engineering applications. Therefore, in the design of congestion control algorithms in which there is a possibility of violation of the conditions for local stability, an important design objective is not only to make sure that the system is stable, but also to ensure any loss of system stability produces stable limit cycles with small amplitude. Thus, the results of Hopf bifurcation analysis favors the design choice which uses only rate mismatch feedback.
6 Condition for non-oscillatory convergence
Non-oscillatory convergence is a desirable characteristic in the design of dynamical systems. In this section, we derive a necessary and sufficient condition to ensure non-oscillatory convergence of RCP which uses only rate mismatch feedback.
For the system to be non-oscillatory, the eigenvalues should be negative real numbers. Recall that the characteristic equation of the RCP without queue size feedback is
[TABLE]
Substituting in (95) gives
[TABLE]
Solving the equations (96) and (97) yields
[TABLE]
The right hand side of (98) is a decreasing function of , and has a maximum value of at . For the uniqueness of the solution, we require . Now, (97) can be rewritten as
[TABLE]
Taking the limit gives
[TABLE]
and hence . Since , then . Thus, the necessary and sufficient condition for non-oscillatory convergence of RCP without queue size feedback is
[TABLE]
After analyzing the condition for non-oscillatory convergence, and the rate of convergence, it can be deduced that the rate of convergence is maximum at the boundary of non-oscillatory regime, i.e., . Thus, the analytical results reveals that the optimal value of the protocol parameter is . The system becomes oscillatory when , and hence the rate of convergence decreases. At , the convergence rate is zero and the reason behind is that the system transits into unstable regime via a Hopf bifurcation at .
To validate the theoretical results of non-oscillatory convergence, numerical simulations obtained using XPPAUT are shown in Figure 15. As can be observed in Figure 15 (a), for , the system shows over-damped behavior, i.e., reaches equilibrium without oscillating. At , the system reaches equilibrium as quickly as possible without any oscillations. For , the system behaves in an under-damped manner, i.e., existence of convergent oscillations (see Figure 15 (b)). As shown in Figure 15 (c) and Figure 15 (d), the system loses stability at , and the amplitude of the undamped oscillations increases as increases beyond .
The dependence of system behavior on the protocol parameter value is summarized in (1).
7 Conclusions
The design of explicit congestion control protocols is an important research topic among the networking research community. The Rate Control Protocol (RCP) is a well-known explicit feedback algorithm that utilizes router feedback based on rate mismatch and queue size. However, it is currently an open question if the protocol definition should include two forms of feedback; i.e., both rate mismatch and queue feedback. In this paper, we developed a better understanding of this design choice, using tools from control and bifurcation theory. In particular, we considered stability, convergence and the impact of the loss of local stability on system dynamics.
Local stability analysis was conducted both in the presence and absence of queue size feedback and established necessary and sufficient conditions to ensure local stability. This enabled us to determine bounds on the protocol parameters to guarantee the local stability of the system. The rate of convergence analysis highlighted that the queue term should be excluded from the protocol to improve the convergence rate. Also, a necessary and sufficient condition that guarantees non-oscillatory convergence was derived for RCP where the queue size term is absent. This condition enabled us to suggest an optimal value of the protocol parameter.
Further, we also 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 analyses, a dimensionless exogenous parameter was used as the bifurcation parameter. The phenomenon of Hopf bifurcation would result in the onset of limit cycles which make it harder to control the queue size. We analyzed the Hopf bifurcation properties by applying Poincaré normal forms and the center manifold theorem. We showed that, for some parameter values, the presence of queue feedback in the RCP model leads to a sub-critical Hopf bifurcation and the emergence of unstable limit cycles. But, in the absence of queue feedback, the Hopf bifurcation is super-critical, and the bifurcating periodic solutions are asymptotically orbitally stable. In essence, all our insights revealed that the performance of the RCP could be improved by removing the queue size term from the protocol definition. Thus, based on our current analysis, we suggest it is preferable to go with the design choice that uses only rate mismatch feedback. However, this is a critical design consideration, and additional analysis and experimental results would be needed to arrive at a comprehensive understanding.
A natural extension of this study would be to validate the analytical insights through hardware experiments. In the real network environment, flows arrive and depart dynamically, and also can have heterogeneous round-trip times. Thus, future research should also include an in-depth analysis of the impact of queue feedback on the performance of the system with multiple time delays, and for a variety of flow arrival and departure patterns.
References
- [1]
G. Allon and A. Bassamboo, “The impact of delaying the delay announcements”, Operation Research, vol. 59, pp. 1198–1210, 2011.
- [2]
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.
- [3]
L. Baretto, “XCP-Winf and RCP-Winf: Improving Explicit Wireless Congestion Control”, Journal of Computer Networks and Communications, pp. 1–18, 2015.
- [4]
F. Brauer, “Decay rates for solutions of a class of differential-difference equations”, SIAM Journal on Mathematical Analysis, vol. 10, pp. 783–788, 1979.
- [5]
B. Dubey, A. Kumar and A.P. Maiti, “Global stability and Hopf-bifurcation of prey-predator system with two discrete delays including habitat complexity and prey refuge”, Communications in Nonlinear Science and Numerical Simulation, vol. 67, pp. 528–554, 2019.
- [6]
N. Dukkipati, N. McKeown and A.G. Fraser, “RCP-AC: Congestion control to make flows complete quickly in any environment”, in Proceedings of IEEE International Conference on Computer Communications, 2006.
- [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]
F.S. Gentile, J.L. Moiola and E.E. Paolini, “Nonlinear dynamics of Internet congestion control: a frequency-domain approach”, Communications in Nonlinear Science and Numerical Simulation, vol. 19, no. 4, pp. 1113–1127, 2014.
- [11]
B.D. Hassard, N.D. Kazarinoff and Y.H. Wan, Theory and Applications of Hopf Bifurcation. Cambridge University Press, 1981.
- [12]
N.D. Hayes, “Roots of the transcendental equation associated with a certain differential-difference equation”, Journal of the London Mathematical Society, vol. 25, pp. 226-232, 1950.
- [13]
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, 2017.
- [14]
C. Huang, J. Cao, M. Xiao, A. Alsaedi and T. Hayat, “Effects of time delays on stability and Hopf bifurcation in a fractional ring-structured network with arbitrary neurons”, Communications in Nonlinear Science and Numerical Simulation, vol. 57, pp. 1–13, 2018
- [15]
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, 2002.
- [16]
F. Kelly and G. Raina, Explicit Congestion Control: charging, fairness and admission management, Next-Generation Internet: Architectures and Protocols, pp. 257-274, Cambridge University Press, 2011.
- [17]
F. Kelly, G. Raina and T. Voice, “Stability and fairness of explicit congestion control with small buffers”, ACM SIGCOMM Computer Communication Review, vol. 38, no. 3, pp. 51–62, 2008.
- [18]
L. Khoshnevisan, X. Liu and F.R. Salmasi, “Stability and Hopf bifurcation analysis of a TCP/RAQM network with ISMC procedure”, Chaos, Solitons & Fractals, vol. 118, pp. 255–273, 2019.
- [19]
A. Lakshmikantha, R. Srikant, N. Dukkipati, N. McKeown and C. Beck, “Buffer sizing results for RCP congestion control under connection arrivals and departures”, ACM Computer Communication Review, vol. 39, pp. 5–15, 2008.
- [20]
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
- [21]
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, no. 3, pp. 1466–1479, 2008.
- [22]
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, no. 1, pp. 353-363, 2011.
- [23]
M. Mahdian, S. Arianfar, J. Gibson and D. Oran, “MIRCC: Multipath-aware ICN rate-based congestion control”, in Proceedings of ACM Conference on Information-Centric Networking, 2016.
- [24]
S. Novitzky, J. Pender, R.H. Rand and E. Wesson, “Non-linear dynamics in queueing theory: Determining size of oscillations in queues with delayed information”, SIAM Journal on Applied Dynamical Systems, vol. 18, pp. 279–311, 2019.
- [25]
J. Pender, R.H. Rand and E. Wesson, “An analysis of queues with delayed information and time-varying arrival rates”, Nonlinear Dynamics, vol. 91, pp. 2411–2427, 2018.
- [26]
L. Pei and L. Yang, “Prediction of period-1 oscillations of the state-dependent delayed compound TCP model with PIE queue management policy via HDHBM”, Communications in Nonlinear Science and Numerical Simulation, vol. 67, pp. 26–36, 2019.
- [27]
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.
- [28]
Y. Ren, J. Li, S. Shi, L. Li and G. Wang, “An explicit congestion control algorithm for named data networking”, in Proceedings of IEEE International Conference on Computer Communications, 2016.
- [29]
V. Sharma, “Queues with service rate controlled by a delayed feedback”, Queueing Systems, vol. 39, pp. 303–315, 2001.
- [30]
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 Proceedings of USENIX Symposium on Networked Systems Design and Implementation, 2017.
- [31]
R. Srikant, The Mathematics of Internet Congestion Control, Springer Science and Business Media, 2012.
- [32]
S.H. Strogatz, Nonlinear dynamics and chaos: with applications to physics, biology, chemistry, and engineering, CRC Press, 2018.
- [33]
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.
- [34]
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, no. 8, pp. 1908–1913, 2009.
- [35]
B. Wydrowski and M. Zukerman, “MaxNet: A congestion control architecture for max-min fairness”, IEEE Communications Letters, vol. 6, no. 11, pp. 512–514, 2002.
- [36]
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.
- [37]
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, 2008.
- [38]
S. Zhang, J. Xu and K.W. Chung, “On the stability and multi-stability of a TCP/RED congestion control model with state-dependent delay and discontinuous marking function”, Communications in Nonlinear Science and Numerical Simulation, vol. 22, pp. 269–284, 2015.
- [39]
S. Zhong, Y. Liu, J. Li and K.Lei, “A rate-based multipath-aware congestion control mechanism in named data networking”, in Proceedings 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] G. Allon and A. Bassamboo, “The impact of delaying the delay announcements”, Operation Research , vol. 59, pp. 1198–1210, 2011.
- 2[2] 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.
- 3[3] L. Baretto, “XCP-Winf and RCP-Winf: Improving Explicit Wireless Congestion Control”, Journal of Computer Networks and Communications , pp. 1–18, 2015.
- 4[4] F. Brauer, “Decay rates for solutions of a class of differential-difference equations”, SIAM Journal on Mathematical Analysis , vol. 10, pp. 783–788, 1979.
- 5[5] B. Dubey, A. Kumar and A.P. Maiti, “Global stability and Hopf-bifurcation of prey-predator system with two discrete delays including habitat complexity and prey refuge”, Communications in Nonlinear Science and Numerical Simulation, vol. 67, pp. 528–554, 2019.
- 6[6] 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 International Conference on Computer Communications , 2006.
- 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.
