Satellite communication framework and control method thereof

Abstract

A satellite communication framework includes a satellite system controller; at least one satellite transponder; and a plurality of remote terminals, each including a modem, a router, and a terminal agent. The terminal agent is configured to, based on a current allowable data rate and measurements of a current router queue size and a current router packet arrival rate, use a delayed uplink resource assignment for each modem and an MCV-based flow-control policy to forecast a future router queue size and a future router packet arrival rate and further update the delayed uplink resource request for a time after an uplink allocation delay. The modem is configured to communicate with the router and also with the satellite system controller through the satellite transponder, perform modulation and demodulation, and manage packet loss and delay according to the future router queue size and the future router packet arrival rate.

Claims

1. A satellite communication (SATCOM) framework, comprising: a satellite system controller; at least one satellite transponder, communicating with the satellite system controller; and a plurality of remote terminals, each including a modem, a router, and a terminal agent, wherein: the terminal agent is configured to, based on a current allowable data rate or resource entitlement for the remote terminal distributed by the satellite system controller and measurements of a current router queue size and a current router packet arrival rate, use a delayed uplink resource assignment for the modem together with a minimal-cost-variance (MCV)-based flow-control policy to adjust a future router queue size, a future router packet arrival rate and further update the delayed uplink resource request for the modem for a time after an uplink allocation delay, and the modem is configured to communicate with the satellite system controller through the at least one satellite transponder and also with the router, perform modulation and demodulation between digital data of the router and analog signals of the at least one satellite transponder, and manage packet loss and delay according to the future router queue size and the future router packet arrival rate forecasted by the terminal agent, the plurality of remote terminals includes N remote terminals, wherein: the uplink allocation delay lasts D epochs, wherein D is a positive integer and dependent on specific communication conditions and operational objectives; for an i-th (i=1, . . . , N) remote terminal, a state vector variable x.sub.i(n).sup.D+3 at epoch n is defined as $\left[\begin{array}{c}{\stackrel{}{q}}_i^r\left(n\right)\\ d_i^r\left(n\right)\\ x_i^m\left(n\right)\\ a_i\left(n\right)\end{array}\right],$ where {tilde over (q)}.sub.i.sup.r(n) is the current router queue size, representing a difference between the current router queue size q.sub.i.sup.r(n) and a desired router queue size Q.sub.i.sup.r, d.sub.i.sup.r(n) is the current router packet arrival rate, x.sub.i.sup.m(n).sup.D is the delayed uplink resource assignment for the modem, representing an uplink resource assignment for the modem delayed by D units of time, and a.sub.i(n) is the current allowable data rate or resource entitlement for the i-th remote terminal distributed by the satellite system controller; and the terminal agent of the i-th remote terminal is configured to control the future router queue size and the future router packet arrival rate of the i-th remote terminal at epoch (n+D) by determining a dynamical state vector variable x.sub.i(n+1) through x.sub.i(n+1)=A.sub.ix.sub.i(n)+B.sub.iu.sub.i(n)+G.sub.iw.sub.i(n), where constant coefficients $A_i\stackrel{}{=}\left[\begin{array}{cccc}1& {}_i^r& -{}_i^r{C}_i^m& 0\\ 0& 1& 0_{1D}& 0\\ 0_{D1}& 0_{D1}& A_i^m& B_i^m\\ 0& 0& 0_{1D}& 1\end{array}\right];B_i\stackrel{}{=}\left[\begin{array}{c}1\\ b_i^r\\ 0_{D1}\\ 0\end{array}\right];$ $G_i\stackrel{}{=}\left[\begin{array}{c}0\\ 1\\ 0_{D1}\\ 0\end{array}\right],u_i\left(n\right)$ is the MCV-based flow-control policy via MCV control-theoretic optimization for performance reliability of the i-th remote terminal; w.sub.i(n) is a measurement error due to fluctuations in competing traffic; b.sub.i.sup.r is a constant gain, .sub.i.sup.r is a preset constant; and $A_i^m=\left[\begin{array}{ccccc}0& 0& \mathrm{.Math.}& 0& 0\\ 1& 0& \mathrm{.Math.}& 0& 0\\ 0& 1& \mathrm{.Math.}& 0& 0\\ \mathrm{.Math.}& \mathrm{.Math.}& & \mathrm{.Math.}& \mathrm{.Math.}\\ 0& 0& \mathrm{.Math.}& 1& 0\end{array}\right]{}^{DD};B_i^m=\left[\begin{array}{c}1\\ 0\\ 0\\ \mathrm{.Math.}\\ 0\end{array}\right]{}^{D1};$ $C_i^m=\left[00\mathrm{.Math.}01\right]{}^{1D}.$

2. The SATCOM framework according to claim 1, wherein: the terminal agent in each remote terminal includes a filtered state estimator, essentially configured to perform a prediction of a state of the controlled router for the current router queue size and the current router packet arrival rate.

3. The SATCOM framework according to claim 2, wherein the filtered state estimator includes: a Kalman state estimator, configured to provide estimates of the current router queue size and the current router packet arrival rate; and a rate-based flow controller, configured to modify a rate of flow of packet into terminal router with assistance of the Kalman state estimator according to minimal-cost-variance (MCV) control optimization.

4. The SATCOM framework according to claim 1, wherein: .sub.i.sup.r is different for different remote terminals.

5. The SATCOM framework according to claim 1, wherein: the measurements of {tilde over (q)}.sub.i.sup.r(n) and d.sub.i.sup.r(n) of the i-th remote terminal at an end of epoch n are denoted as y.sub.i(n)=H.sub.ix.sub.i(n)+D.sub.iv.sub.i(n), where $H_i=\left[\begin{array}{cccc}1& 0& 0_{1D}& 0\\ 0& 0& 0_{1D}& 0\end{array}\right],D_i{}^{22}$ is a coupling matrix of measurement noises, and v.sub.i(n).sup.2 is a measurement noise vector; and the terminal agent of the i-th remote terminal includes a Kalman state estimator and the MCV-based flow control policy, and is configured to minimize a variance of an index J.sub.i(n.sub.0) within a transmission time from n.sub.0 epoch to M epoch, wherein: the index J.sub.i(n.sub.0) is defined as J.sub.i(n.sub.0)=.sub.k=n.sub.0.sub.+1.sup.M{x.sub.i.sup.T(k)Q.sub.ix.sub.i(k)+.sub.i,3u.sub.i(k).sup.2}, where $k=n_0,n_0+1,\mathrm{.Math.},M,Q_i\stackrel{}{=}\left[\begin{array}{cccc}{}_{i,2}& 0& 0_{1D}& 0\\ 0& {}_{i,1}& -{}_{i,1}{C}_i^m& 0\\ 0& -{{}_{i,1}\left(C_i^m\right)}^T& {{}_{i,1}\left(C_i^m\right)}^T{C}_i^m& 0\\ 0& 0& 0_{1D}& 0\end{array}\right],$ and .sub.i,1, .sub.i,2, .sub.i,3 are positive weights.

6. A control method of a SATCOM framework, wherein: the SATCOM framework includes: a satellite system controller; at least one satellite transponder; and a plurality of remote terminals, each including a modem, a router, and a terminal agent, and the method for controlling the SATCOM framework includes: for each remote terminal, controlling the terminal agent to, based on a current allowable data rate or resource entitlement for the remote terminal distributed by the satellite system controller and measurements of a current router queue size and a current router packet arrival rate, use a delayed uplink resource assignment for the modem and a minimal-cost-variance (MCV)-based flow-control policy to forecast a future router queue size and a future router packet arrival rate and further update the delayed uplink resource assignment for the modem for a time after an uplink allocation delay; and controlling the modem of the each remote terminal to manage packet loss and delay according to the future router queue size and the future router packet arrival rate forecasted by the terminal agent, wherein the uplink allocation delay lasts D epochs, wherein D is a positive integer and dependent on specific communication conditions and operational objectives; the SATCOM framework includes N remote terminals; for an i-th (i=1, . . . , N) remote terminal, a state vector variable x.sub.i(n).sup.D+3 at epoch n is defined as $\left[\begin{array}{c}{\stackrel{}{q}}_i^r\left(n\right)\\ d_i^r\left(n\right)\\ x_i^m\left(n\right)\\ a_i\left(n\right)\end{array}\right],$ where {tilde over (q)}.sub.i.sup.r(n) is the current router queue size, representing a difference between the current router queue size q.sub.i.sup.r(n) and a desired router queue size Q.sub.i.sup.r, d.sub.i.sup.r(n) is the current router packet arrival rate, x.sub.i.sup.m(n).sup.D is the delayed uplink resource assignment for the modem, representing an uplink resource assignment for the modem delayed by D units of time, and a.sub.i(n) is the current allowable data rate or resource entitlement for the i-th remote terminal distributed by the satellite system controller; and controlling the terminal agent to use the delayed uplink resource assignment for the modem and the MCV-based flow-control policy to forecast the future router queue size and the future router packet arrival rate and further update the delayed uplink resource request for the modem includes determining a state vector variable x.sub.i(n+1) of the i-th remote terminal at epoch (n+D) through x.sub.i(n+1)=A.sub.ix.sub.i(n)+B.sub.iu.sub.i(n)+G.sub.iw.sub.i(n), where constant coefficients $A_i\stackrel{}{=}\left[\begin{array}{cccc}1& {}_i^r& -{}_i^r{C}_i^m& 0\\ 0& 1& 0_{1D}& 0\\ 0_{D1}& 0_{D1}& A_i^m& B_i^m\\ 0& 0& 0_{1D}& 1\end{array}\right];B_i\stackrel{}{=}\left[\begin{array}{c}1\\ b_i^r\\ 0_{D1}\\ 0\end{array}\right];$ $G_i\stackrel{}{=}\left[\begin{array}{c}0\\ 1\\ 0_{D1}\\ 0\end{array}\right],u_i\left(n\right)$ is the MCV-based flow-control policy via MCV control-theoretic optimization for performance reliability of the i-th remote terminal; w.sub.i(n) is a measurement error due to fluctuations in competing traffic; b.sub.i.sup.r is a constant gain, .sub.i.sup.r is a preset constant; and $A_i^m=\left[\begin{array}{ccccc}0& 0& \mathrm{.Math.}& 0& 0\\ 1& 0& \mathrm{.Math.}& 0& 0\\ 0& 1& \mathrm{.Math.}& 0& 0\\ \mathrm{.Math.}& \mathrm{.Math.}& & \mathrm{.Math.}& \mathrm{.Math.}\\ 0& 0& \mathrm{.Math.}& 1& 0\end{array}\right]{}^{DD};B_i^m=\left[\begin{array}{c}1\\ 0\\ 0\\ \mathrm{.Math.}\\ 0\end{array}\right]{}^{D1};$ $C_i^m=\left[00\mathrm{.Math.}01\right]{}^{1D}.$

7. The control method according to claim 6, wherein: the terminal agent of each remote terminal includes a filtered state estimator, and controlling the terminal agent to use the delayed uplink resource assignment for the modem and the MCV-based flow-control policy to forecast the future router queue size and the future router packet arrival rate and further update the delayed uplink resource request for the modem includes using the filtered state estimator to perform a prediction of a state of the controlled router for the current router queue size and the current router packet arrival rate.

8. The control method according to claim 7, wherein: the filtered state estimator includes a Kalman state estimator and a rate-based flow controller; the Kalman state estimator is used to provide best estimates of the current router queue size and the current router packet arrival rate; and the rate-based flow controller is used to modify a rate of flow of packet into terminal router with assistance of the Kalman state estimator according to MCV control optimization.

9. The control method according to claim 6, wherein: .sub.i.sup.r is different for different remote terminals.

10. The control method according to claim 6, wherein: the terminal agent of the i-th remote terminal includes a Kalman state estimator and the MCV-based flow-control policy; the measurements of {tilde over (q)}.sub.i.sup.r(n) and d.sub.i.sup.r(n) of the i-th remote terminal at an end of epoch n are denoted as y.sub.i(n)=H.sub.ix.sub.i(n)+D.sub.iv.sub.i(n), where $H_i=\left[\begin{array}{cccc}1& 0& 0_{1D}& 0\\ 0& 0& 0_{1D}& 0\end{array}\right],D_i{}^{22}$ is a coupling matrix of measurement noises, and v.sub.i(n).sup.2 is a measurement noise vector; and the control method includes using the Kalman state estimator and the MCV-based flow-control policy to minimize a variance of an index J.sub.i(n.sub.0) within a transmission time from n.sub.0 epoch to M epoch, wherein: the index J.sub.i(n.sub.0) is defined as J.sub.i(n.sub.0)=.sub.k=n.sub.0.sub.+1.sup.M{x.sub.i.sup.T(k)Q.sub.ix.sub.i(k)+.sub.i,3u.sub.i(k).sup.2}, where $k=n_0,n_0+1,\mathrm{.Math.},M,Q_i\stackrel{}{=}\left[\begin{array}{cccc}{}_{i,2}& 0& 0_{1D}& 0\\ 0& {}_{i,1}& -{}_{i,1}{C}_i^m& 0\\ 0& -{{}_{i,1}\left(C_i^m\right)}^T& {{}_{i,1}\left(C_i^m\right)}^T{C}_i^m& 0\\ 0& 0& 0_{1D}& 0\end{array}\right],$ and .sub.i,1, .sub.i,2, .sub.i,3 are positive weights.

11. The method according to claim 6, wherein: the at least one satellite transponder communicates with the satellite system controller; and in each remote terminal, the modem communicates with the at least one satellite transponder and the router, and performs modulation and demodulation between digital data of the router and analog signals of the at least one satellite transponder.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The following drawings are merely examples for illustrative purposes according to various disclosed embodiments and are not intended to limit the scope of the present disclosure.

(2) FIG. 1 illustrates a schematic diagram of a spoke-hub SATCOM architecture with a non-processing transponder;

(3) FIG. 2 illustrates a schematic diagram of a system model for remote terminals;

(4) FIG. 3 illustrates a schematic diagram of a feedback structure of uplink resource allocation consistent with some embodiments of the present disclosure;

(5) FIG. 4 illustrates a schematic diagram of active queue management in terminal modems consistent with various embodiments of the present disclosure;

(6) FIG. 5 illustrates a schematic diagram of rate-based flow control in terminal routers consistent with various embodiments of the present disclosure;

(7) FIG. 6 illustrates a schematic diagram of an exemplary distributed terminal agent as a cascade of Minimal-Cost-Variance controller and a Kalman state estimator consistent with various embodiments of the present disclosure; and

(8) FIG. 7 illustrates a schematic diagram of an exemplary integrated framework for SATCOM terminal flexibility consistent with various embodiments of the present disclosure.

DETAILED DESCRIPTION

(9) Reference will now be made in detail to exemplary embodiments of the invention, which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

(10) In the field of satellite communication (SATCOM) technology, some difficulties are reviewed in keeping SATCOM responsive as operational environments and requirements rapidly evolve, especially related to accessing advanced services and providing resilience against threats. Growing interest is currently being addressed to SATCOM terminal flexibility for operating across multiple Geostationary orbit (GSO) and Non-Geostationary orbit (NGSO) constellations, in multiple frequency bands and support different modems/routers.

(11) The emphasis of the present disclosure is on the feasibility of using learning and control engineering to help SATCOM regulatory agencies more efficiently, consistently, and effectively analyze requests to autonomously operate flow control and dynamic resource allocation consistent with increasing demands for connectivity and bandwidth. Due to the repetitive nature of user experiences, application performances, and service level agreements, terminal assignments of center frequencies for transmission, signal bandwidths, communication modes, and time intervals for transmission could benefit from the data collected during previous downlink mode change requests and uplink terminal reports. Intelligent terminal agents and enforcement coordination between terminal routers and modems are proposed and discussed in the views of iterative learning and Minimal-Cost-Variance (MCV) control-theoretic frameworks.

(12) FIG. 1 illustrates a schematic diagram of a spoke-hub SATCOM architecture with a non-processing transponder. Referring to FIG. 1, the SATCOM architecture illustrates uplink or return link resource request and allocation based on periodic-transmit messaging protocols. Per-epoch (i.e., a timescale including consecutive data frames) basis, the satellite system controller performs dynamic resource allocation (e.g., supportable communication modes, non-overlapping time and frequency slots) across all the terminal request information rates to ensure uplink resources being shared efficiently and fairly. With a periodic-transmit messaging protocol, it allows the satellite ground hub and remote terminals to not react to control message drops and not acknowledge control messages.

(13) The SATCOM architecture shown in FIG. 1 includes a plurality of remote terminals. FIG. 2 illustrates a schematic diagram of a system model for remote terminals. Referring to FIG. 2, a remote terminal is usually equipped with repetitive router and modem units. According to the present disclosure, iterative learning control is adapted to those routers that have repetitive interactions to learn instantaneous modem data rates and perform quality of service and load balancing. Therefore, learning routers together with flow control mechanisms can be considered as distributed terminal agents cooperating with simple one-way feedback messages from terminal modems to achieve robust uplink allocation performance.

(14) In one embodiment, a centralized algorithm, e.g., demand assigned multiple access (DAMA) procedure is run on the satellite system controller that is part of the satellite ground hub, which for every epoch, may receive a set of terminal report messages intermixed with data traffic, containing request information rates (RIRs) from N remote terminals. The aim from equipping the DAMA algorithm with RIRs is to provide remote terminals with committed information rates, CIR.sub.i with i=1, . . . , N, that are on their service level agreements. To this end, actual RIR.sub.i(n) from remote terminals i at epoch n must be received.

(15) In the event of terminal report losses, DAMA procedure may involve learning in order to use older terminal reports to extrapolate remote terminals' RIRs. Iterative learning alongside with the satellite system controller may generate a sequence of uplink resource allocation such that data transmission by terminal modems i with i=1, . . . , N are as close as possible to meet CIR.sub.i. The inner core of iterative learning may improve allowable data rates at remote terminals on the basis of previous operational data. While under contention, the satellite system controller may allow multi-access users to get their shares of the provisioned resources, e.g., forecasting future data rates for remote terminal i so as to maintain its own current data rates following any weighted averages (also known as learning rates) of differences between available and request information rates that are sent from other remote terminals through return link assignment request messages

(16) $\begin{array}{cc}{a}_i\left(n+1\right)=a_i\left(n\right)+\frac{{\mathrm{CIR}}_i}{\underset{j=1}{\overset{N}{.Math.}}{\mathrm{CIR}}_j}\left[{\mathrm{CIR}}^{\mathrm{total}}-\underset{j=1}{\overset{N}{.Math.}}{\mathrm{RIR}}_j\left(n\right)\right]& \left(1\right)\end{array}$
where a.sub.i(n+1) is the allowable data rates to be used by remote terminal i in D E epochs in the future (also known as the uplink allocation delay or activation epoch), which refers to the number of epochs between when the assignment is made and when the assignment is used, e.g., n+D.

(17) Due to satellite propagation and processing delays, remote terminals may use the uplink resource assignments starting at the specified times, e.g., activation epoch at n+D and for the specified durations. To capture the effect of uplink allocation delay, i.e., D units, the data rates allowable at remote terminals' modems for epoch n may be denoted as

(18) $\begin{array}{cc}{a}^m\left(n\right)\stackrel{}{=}\left[\begin{array}{c}{a}_1^M\left(n\right)\\ a_2^m\left(n\right)\\ \mathrm{.Math.}\\ a_N^m\left(n\right)\end{array}\right]\left[\begin{array}{c}{a}_1\left(n-D\right)\\ a_2\left(n-D\right)\\ \mathrm{.Math.}\\ a_N\left(n-D\right)\end{array}\right]& \left(2\right)\end{array}$
where a.sub.i(nD) are the delay components of D units for data rates allowable at remote terminals i with i=1, N. FIG. 3 illustrates the feedback structure between the satellite system controller and its remote terminals, in which the state space realization expressed in observability canonical form for allowable data rate, a.sub.i.sup.m(n) at remote terminal i may be governed by
x.sub.i.sup.m(n+1)=A.sub.i.sup.mx.sub.i.sup.m(n)+B.sub.i.sup.ma.sub.i(n)(3)
a.sub.i.sup.m(n)=C.sub.i.sup.mx.sub.i.sup.m(n),i=1, . . . ,N(4)
where the superscript m associated with the modem subsystem at remote terminal i, which has D opportunities to receive its assignments repetitively transmitted from the satellite ground hub in epochs n, n+1, . . . n+D1. Moreover, the delayed uplink resource assignment for each terminal modem may be denoted by x.sub.i.sup.m(n).sup.D1 and the system coefficients A.sub.i.sup.m.sup.DD, B.sub.i.sup.m.sup.D1, and C.sub.i.sup.m.sup.1D may be given by

(19) $A_i^m=\left[\begin{array}{ccccc}0& 0& \mathrm{.Math.}& 0& 0\\ 1& 0& \mathrm{.Math.}& 0& 0\\ 0& 1& \mathrm{.Math.}& 0& 0\\ \mathrm{.Math.}& \mathrm{.Math.}& & \mathrm{.Math.}& \mathrm{.Math.}\\ 0& 0& \mathrm{.Math.}& 1& 0\end{array}\right];B_i^m=\left[\begin{array}{c}1\\ 0\\ 0\\ \mathrm{.Math.}\\ 0\end{array}\right];C_i^m=\left[00\mathrm{.Math.}01\right].$

(20) As remote terminal capabilities grow more complex to address diverse operational requirements, e.g., across multiple satellites, frequency bands, etc., the modem is a key enabler of such a terminal flexibility. The modem may support multiple communications and networking waveforms. Basic functions of a modem are modulation and demodulation between digital data of a router and analog signals of radio reception, data rate request, and QoS management. As illustrated in FIG. 3, modem i with i=1, . . . , N may be able to influence its assigned data rate via RIR.sub.i at epoch n to the satellite system controller, e.g.,
RIR.sub.i(n)=.sub.i.sup.md.sub.i.sup.m(n)(5)
where the positive scalar, .sub.i.sup.m.sub.+ denotes an amount proportional to predicted demand in steps of 25% CIR.sub.i up to 100% CIR.sub.i and d.sub.i.sup.m(n) is the packet arrive rate or demand rate arriving from the router i.

(21) From the view point of active queue management, modem i may regulate the queue length, q.sub.i.sup.m in the modem buffer, Q.sub.i.sup.m with a fluid-flow model
q.sub.i.sup.m(n+1)=q.sub.i.sup.m(n).sub.i.sup.m[s.sub.i.sup.m(n)d.sub.i.sup.m(n)](6)
where different proportionality constants, .sub.i.sup.m.sub.+ can be used for discriminatory endowing of modem responsiveness to changing conditions and the effective packet service rate, s.sub.i.sup.m(n) at epoch n by modem i is constrained by
s.sub.i.sup.m(n)=min{q.sub.i.sup.m(n),a.sub.i.sup.m(n)}(7)

(22) Further, the shifted version of the variable q.sub.i.sup.m may be defined as {tilde over (q)}.sub.i.sup.m(n)q.sub.i.sup.m(n)Q.sub.i.sup.m. FIG. 4 illustrates a schematic diagram of active queue management in terminal modems consistent with various embodiments of the present disclosure. Referring to till. 4,

(23) $\frac{1}{z}$
is a backward shift operator, which shifts the input signal one step back in time. Given s.sub.i.sup.m(n) and .sub.i.sup.m, the queue length of modem i may be regulated around the required buffer capacity, Q.sub.i.sup.m according to the following dynamics
{tilde over (q)}.sub.i.sup.m(n+1)={tilde over (q)}.sub.i.sup.m(n).sub.i.sup.m[s.sub.i.sup.m(n)d.sub.i.sup.m(n)](8)

(24) As expected, the interface between modem and router subsystems has become increasingly important. The present disclosure provides a different kind of modem management that exists for this interface and the rationale behind them. The emergence of control messages with less overhead burdens is identified as a trend that increases the importance of router and modem interface. In the following, all coordination between modems and routers will be discussed in detail. For example, in one embodiment, modem i may share its allowable transmit data rate information, a.sub.i.sup.m(n) with router i.

(25) FIG. 5 illustrates a schematic diagram of rate-based flow control in terminal routers consistent with various embodiments of the present disclosure. Referring to FIG. 5, with regards to maintaining minimal queue in modem i, router i may be able to deliver an appropriate amount of packets to modem i in accordance with the available data rate, a.sub.i.sup.m(n) allotted to modem i by the satellite system controller. In turn, modem i may not be aware of the queue backlog and traffic demand increase in router i. Therefore, a desirable situation is that router i is in control of its active queue management. For example, future queue behavior q.sub.i.sup.r(n+1) of router i may not depend on the past, but only on the current queue size q.sub.i.sup.r(n) and future inputs, e.g., at epoch n
q.sub.i.sup.r(n+1)=q.sub.i.sup.r(n).sub.i.sup.r[s.sub.i.sup.r(n)d.sub.i.sup.r(n)](9)
where router i drives its effective service rate, s.sub.i.sup.r(n) towards the packet arrival rate or demand rate, d.sub.i.sup.r(n) by an amount proportional to the offset from d.sub.i.sup.r(n) with a factor .sub.i.sup.r.sub.+.

(26) The focus of the present disclosure is on defining a simple class of controlling the flow rate of the source and/or demand, d.sub.i.sup.r(n) and allowing router i full active queue management. As background for investigating dynamic flow control mechanisms, it is required to affect the input rate b.sub.i.sup.ru.sub.i.sup.r(n), where u.sub.i.sup.r(n) is called the control and b.sub.i.sup.r is some constant gain, e.g.,
d.sub.i.sup.r(n+1)=d.sub.i.sup.r(n)+b.sub.i.sup.ru.sub.i.sup.r(n)+w.sub.i(n)(10)
where w.sub.i(n) are the errors due to fluctuations in competing traffic and modeled by zero-mean additive white Gaussian random sequences with E{w.sub.i(n)w.sub.i(n)}=W.sub.i.

(27) Furthermore, according to (9), router i may update its effective packet service rate with s.sub.i.sup.r(n) governed by
s.sub.i.sup.r(n)=min{q.sub.i.sup.r(n),a.sub.i.sup.m(n)}(11)

(28) On a related note, different types of traffic may need to be placed in separate queues and thus, allowing flow controllers to accurately manage source rates for specific queues. Regulation of the queue size as described in (9) around some desired level, Q.sub.i.sup.r is a step toward eventually understanding potential minimization of losses and maximization of throughput. In particular, the evolution of router buffer size, under the shifted version of q.sub.i.sup.r(n), e.g., {tilde over (q)}.sub.i.sup.r(n)q.sub.i.sup.r(n)Q.sub.i.sup.r, may therefore be governed by
{tilde over (q)}.sub.i.sup.r(n+1)={tilde over (q)}.sub.i.sup.r(n).sub.i.sup.r[s.sub.i.sup.r(n)d.sub.i.sup.r(n)](12)
which is part of active queue management and data rate-based tracking capabilities to achieve performance agility as depicted in FIG. 5.

(29) Mainly due to anticipated terminal flexibility, various aspects of terminal provisioning, configuration, management, etc. are parts of the discussion of flexible terminal feasibility by developing conceptual frameworks. To help decision makers in their advocacy and review process for remote terminal autonomy, in one embodiment, it is recommended to connect modem i and router i. When the available transmit data rate is low, packets may build up in the queues of modem and router i. In this case, both packet service rates at the terminal modem and router as described in (7) and (11) may become
s.sub.i.sup.r(n)=s.sub.i.sup.m(n)=a.sub.i.sup.m(n)(13)

(30) With the implementation of (13), only a subset of the interfaces for the terminal control and management functions may be necessary, as follows:
{tilde over (q)}.sub.i.sup.r(n+1)={tilde over (q)}.sub.i.sup.r(n).sub.i.sup.r[a.sub.i.sup.r(n)d.sub.i.sup.r(n)](14)
d.sub.i.sup.r(n+1)=d.sub.i.sup.r(n)+b.sub.i.sup.ru.sub.i.sup.r(n)w.sub.i(n)(15)
x.sub.i.sup.m(n+1)=A.sub.i.sup.mx.sub.i.sup.m(n)+.sub.i.sup.ma.sub.i(n)(16)
a.sub.i.sup.m(n)=C.sub.i.sup.mx.sub.i.sup.m(n)(17)

(31) By highlighting the interfaces and their decisional factors as described in (14)-(17), potential standardization of these interfaces may become the principal focus, which may increase efficiency, reduce the cognitive workload on the satellite operator, and improve decision making towards multiple domain interoperability.

(32) Motivated by wideband SATCOM in which flexible terminals are deployed to support global distribution and mobility, a real-time control problem for distributed terminal controllers is necessary. A distributed terminal controller is considered as an intelligent terminal agent, which is local to its terminal router that operates autonomously under the policy guidance; i.e., uplink resource allocation assignment from its terminal modem counterpart. The strength of distributed terminal agents in controlling globally dispersed remote terminals is their ability to react in real time to local events based on local situational awareness, e.g., a state-space representation of (14)-(17) as depicted herein for remote terminal i for i=1, . . . , N
x.sub.i(n+1)=A.sub.ix.sub.i(n)+B.sub.iu.sub.i(n)+G.sub.iw.sub.i(n)(18)
where the state vector variables x.sub.i(n).sup.D+3 (including router queue sizes in packets, packet arrival rates, uplink resource allocation assignments delayed at terminal modems, uplink resource assignments by the satellite system controller, and resource entitlements distributed by the satellite system controller) are defined by

(33) $x_i\left(n\right)=\left[\begin{array}{c}{x}_{i,1}\left(n\right)\\ x_{i,2}\left(n\right)\\ x_{i,3}\left(n\right)\\ x_{i,4}\left(n\right)\end{array}\right]\stackrel{}{=}\left[\begin{array}{c}{\tilde{q}}_i^r\left(n\right)\\ d_i^r\left(n\right)\\ x_i^m\left(n\right)\\ a_i\left(n\right)\end{array}\right]$
the local transmission jitters managing routers' packet arrival rates by sources via rate-based flow control policies u.sub.i(n)u.sub.i.sup.r(n) and the constant matrix system coefficients are given by

(34) $A_i\stackrel{}{=}\left[\begin{array}{cccc}1& {}_i^r& -{}_i^r{C}_i^m& 0\\ 0& 1& 0_{1D}& 0\\ 0_{D1}& 0_{D1}& A_i^m& B_i^m\\ 0& 0& 0_{1D}& 1\end{array}\right];B_i\stackrel{}{=}\left[\begin{array}{c}1\\ b_i^r\\ 0_{D1}\\ 0\end{array}\right];G_i\stackrel{}{=}\left[\begin{array}{c}0\\ 1\\ 0_{D1}\\ 0\end{array}\right].$

(35) At the end of epoch n, the router i obtains noisy estimates of its queue size of {tilde over (q)}.sub.i.sup.r(n) and packet arrival rate of d.sub.i.sup.r(n). For analytic purposes, y.sub.i(n) is adopted to denote the measurements for router queue sizes and packet arrival rates, e.g.,
y.sub.i(n)=H.sub.ix.sub.i(n)+D.sub.iv.sub.i(n)i=1, . . . ,N(19)
where the coupling matrix of measurement noises, D.sub.i.sup.22 equals the identity matrix and the observation matrix H.sub.i.sup.2(D+3) is given by

(36) $H_i=\left[\begin{array}{cccc}1& 0& 0_{1D}& 0\\ 0& 0& 0_{1D}& 0\end{array}\right]$
and the measurement noise v.sub.i(n).sup.2 is taken as an independent identically distributed Gaussian random vector sequence with zero mean and variance of E{v.sub.i(n)v.sub.i.sup.T(n)}=V.sub.i. Consequently, it may then indicate that the measurements (19) are unbiased.

(37) FIG. 6 illustrates a schematic diagram of an exemplary distributed terminal agent as a cascade of an MCV-based flow controller and a Kalman state estimator consistent with various embodiments of the present disclosure. Referring to FIG. 6, given the noisy measurements on router queue sizes and router packet arrival rates, the technical solution to the control of the rate of flow of packets into terminal router i in the presence of state estimation must adopt a very useful result known as the separation principle that allows the optimal control and the estimation problems to be solved independently. For example, from the data available at any discrete-time interval n (not necessarily be at epochs), e.g., y.sub.i(n.sub.0), y.sub.i(n.sub.0+1), . . . , y.sub.i(j) with n>j, there is an urgent need to compute the best prediction of the state of the controlled router i, meaning x.sub.i(n) along with the best correction for both process and measurement noises. In this regard, the desirable prediction for one step ahead may be defined by the fundamental theorem of estimation
{circumflex over (x)}.sub.i(n|n1)=E{x.sub.i(n)|y.sub.i(n.sub.0+1), . . . ,y.sub.i(n1)}(20)
where E{|} represents for the conditional expectation operator of the enclosed entities.

(38) Further, the single-stage predicted estimate, {circumflex over (x)}.sub.i(n|n1) can be deduced
{circumflex over (x)}.sub.i(n|n1)=A.sub.i{circumflex over (x)}.sub.i(n1|n1)+B.sub.iu.sub.i(n1)(21)

(39) In one embodiment, two more parts for y.sub.i(n) must be carried on in a way that is similar to those for x.sub.i(n), e.g., the single-stage prediction estimate, .sub.i(n|n1) and the prediction error, .sub.i(n|n1)
.sub.i(n|n1)=E{y.sub.i(n)|y.sub.i(n.sub.0+1), . . . ,y.sub.i(n1)}(22)
{tilde over (y)}.sub.i(n|n1)=y.sub.i(n){tilde over (y)}.sub.i(n|n1)(23)

(40) In one embodiment, the filtered state estimate, {circumflex over (x)}.sub.i(n|n) and the predicted state estimate, {circumflex over (x)}.sub.i(n|n1) are indeed very tightly coupled with each other
{circumflex over (x)}.sub.i(n|n)={circumflex over (x)}.sub.i(n|n1)+E{x.sub.i(n)|{tilde over (y)}.sub.i(n|n1)}E{x.sub.i(n)}(24)

(41) Moreover, the filter gain, L.sub.i(n) available at the terminal agent i may be defined by
L.sub.i(n)=E{x.sub.i(n){tilde over (y)}.sub.i.sup.T(n|n1)}(E{{tilde over (y)}.sub.i(n|n1){tilde over (y)}.sub.i.sup.T(n|n1)}).sup.1 (25)

(42) Therefore, it is shown that
E{x.sub.i(n)|{tilde over (y)}.sub.i(n|n1)}=E{x.sub.i(n)}+L.sub.i(n){tilde over (y)}.sub.i(n|n1)(26)
and thus, the derivation of the Kalman filter may be given by
{circumflex over (x)}.sub.i(n|n)=A.sub.i{circumflex over (x)}.sub.i(n1|n1)+B.sub.iu.sub.i(n1)+L.sub.i(n)[y.sub.i(n)H.sub.i(A.sub.i{circumflex over (x)}.sub.i(n1|n1)+B.sub.iu.sub.i(n1))](27)

(43) Basically, {circumflex over (x)}.sub.i(n|n) available at the terminal agent i can now be determined recursively, but to the extent that the filter gain, L.sub.i(n) is needed to be found. In this respect, it is shown that
E{x.sub.i(n)|{tilde over (y)}.sub.i(n|n1)}=P.sub.i(n|n1)H.sub.i.sup.T(28)
and
E{{tilde over (y)}.sub.i(n|n1)}=H.sub.iP.sub.i(n|n1)H.sub.i.sup.T+V.sub.i+(29)

(44) Finally, it is clear that the predicted estimate error covariance, P.sub.i(n|n1) should be computed, particularly when this calculation of P.sub.i(n|n1) is recursive, dependent on the filtered estimate error covariance, P.sub.i(n1|n1), e.g.,
P.sub.i(n1|n1)=L.sub.i(n1)V.sub.iL.sub.i.sup.T(n1)+[IL.sub.i(n1)H.sub.i]P.sub.i(n1|n2)[IL.sub.i(n1)H.sub.i].sup.T(30)
and
P.sub.i(n|n1)=A.sub.iP.sub.i(n1|n1)A.sub.i.sup.T+G.sub.iW.sub.iG.sub.i.sup.T(31)

(45) In one embodiment, when the initial estimate error covariance P.sub.i(n.sub.0|n.sub.0)=P.sub.i,0 and the initial measurement y.sub.i(n.sub.0)=H.sub.ix.sub.i(n.sub.0)+D.sub.iv.sub.i (n.sub.0) are given, then the initial filter estimate may be obtained as follows
{circumflex over (x)}.sub.i(n.sub.0|n.sub.0)=x.sub.i(n.sub.0)+P.sub.i,0H.sub.i.sup.T[H.sub.iP.sub.i,0H.sub.i.sup.T+V.sub.i(n.sub.0)].sup.1[y.sub.i(n.sub.0)+H.sub.ix.sub.i(n.sub.0)](32)

(46) Since measures of application performance, e.g., packet loss rate, video packet delay, and file transfer delay are what SATCOM users care about, terminal agents may focus on a variety of potential contributors to losses and delays, e.g., (i) tracking qualities of packet arrival rates in reference to available service rates, (ii) packet overflows at terminal queues due to prolonged insufficient data rates, and (iii) variability of router transmission rates. Key performance metrics to support the aforementioned terminal agent objectives (i)-(iii) may be included in the following definition of the performance index, J.sub.i(n.sub.0) within an epoch and yet over a period of length M of fundamental units of transmission time (also known as interleaver blocks, e.g., k=n.sub.0, n.sub.0+1, . . . , M and starting from the interleaver block no)
J.sub.i(n.sub.0)=.sub.k=n.sub.0.sub.+1.sup.M{.sub.i,1d.sub.i.sup.r(k)C.sub.i.sup.mx.sub.i.sup.m(k).sup.2+.sub.i,2{tilde over (q)}.sub.i.sup.r(k).sup.2+.sub.i,3u.sub.i(k).sup.2}(33)
where the first term represents the metric (i) with a high rate of tracking seemingly desirable; the second term is a penalty for deviating from the desirable queue capacity of Q.sub.i.sup.r: whose low and high values would respectively lead to wasteful throughput and loss potentials; the last term denotes a penalty for high jitter or burstiness of router transmission rate that may be undesirable on other traffics; and finally the positive weights .sub.i,1, .sub.i,2, .sub.i,3 are degrees of design freedom.

(47) To complete the description of terminal agents, the performance index (33) is rewritten in terms of the new state variable x.sub.i(k) for the interleaver block k, e.g.,
J.sub.i(n.sub.0)=.sub.k=n.sub.0.sub.+1.sup.M{x.sub.i.sup.T(k)Q.sub.ix.sub.i(k)+.sub.i,3u.sub.i(k).sup.2}(34)
where the state weighting matrix Q.sub.i is defined by

(48) $Q_i\stackrel{}{=}\left[\begin{array}{cccc}{}_{i,2}& 0& 0_{1D}& 0\\ 0& {}_{i,1}& -{}_{i,1}{C}_i^m& 0\\ 0& -{{}_{i,1}\left(C_i^m\right)}^T& {{}_{i,1}\left(C_i^m\right)}^T{C}_i^m& 0\\ 0& 0& 0_{1D}& 0\end{array}\right]$

(49) According to the disclosed SATCOM framework, the terminal agent in flexible SATCOM terminals encompasses an array of design principles and decision support mechanisms, and the operational configurations that can be dynamically controlled and managed through pre-existing knowledge, e.g., starting from interleaver block k
x.sub.i(k+1)=A.sub.ix.sub.i(k)+B.sub.iu.sub.i(k)+G.sub.iw.sub.i(k)(35)
y.sub.i(k)=H.sub.ix.sub.j(k)+D.sub.iv.sub.j(k)i=1, . . . ,N(36)
subject to the router performance evaluation for terminal utilization meeting CIRs and service level agreements with high probability as well as user application experience, e.g.,
J.sub.i(n.sub.0)=.sub.k=n.sub.0.sub.+1.sup.M{x.sub.i.sup.T(k)Q.sub.ix.sub.i(k)+.sub.i,3u.sub.i(k).sup.2}(37)

(50) Moreover, seamlessly moving from one GSO/NGSO network to another requires tight coordination between terminal agents and mission management systems or network operation centers to the flexibility of handovers, while assuring high performance data transmit requirements. Therefore, robust communications between these entities are critical. In essence, the tax on the GSO/NGSO network capacity and efficient terminal operations may need to be minimized by reliably meeting CIRs and service level agreements with high probability on the first operation, rather than repeatedly sending uplink resource assignment requests and activations multiple times. Therefore, understanding the statistical distribution and variability of performance jitters as described in (37) is instrumental in enabling efficient terminal operations and helping terminal agents to select rate-based flow control policies, and it should be supported by the most natural framework of MCV control theory, in which the variance of the performance index (37) is minimized while its expected value is constrained a-priori.

(51) In the following, the description should be viewed as an important signpost representing the theory of MCV control optimization. In particular, the emphasis on minimizing of the variance of J.sub.i(n.sub.0) while its mean is forced to obey a constraint may have a bearing on the current setting, e.g.,
E{J.sub.i.sup.2|Z.sub.i(n.sub.0)}E.sup.2{J.sub.i(n.sub.0)|Z.sub.i(n.sub.0)}(38)
may be minimized, while
E{J.sub.i(n.sub.0)|Z.sub.i(n=.sub.0)}=h.sub.i(n.sub.0,Z.sub.i(n.sub.0))(39)
where E{|} denotes the conditional expectation operator and the data Z.sub.i(n.sub.0){x.sub.i(n.sub.0)}.

(52) The inevitable concern of h.sub.i(n.sub.0, Z.sub.i(n.sub.0)) may be with practical considerations, including terminal performance forecasts, planning functions, complexity of the terminal agent policies, etc. In one embodiment, given the general assessment, the choice of h.sub.i(n.sub.0, Z.sub.i(n.sub.0)) may not be entirely arbitrary. It must be selected such that it is always greater than the following quantity, e.g.,

(53) $\begin{array}{cc}\underset{u_i\left(n_0\right),\mathrm{.Math.},u_i\left(M-1\right)}{\inf }E\left\{J_i\left(n_0\right).Math.Z_i\left(n_0\right)\right\}& \left(40\right)\end{array}$

(54) Accordingly, for the special class of linear-quadratic problem, the mean value constraint may be intuitively given by
h.sub.i(n.sub.0,Z.sub.i(n.sub.0))=m.sub.i(n.sub.0)+x.sub.i.sup.T(n.sub.0)M.sub.i(n.sub.0)x.sub.i(n.sub.0)(41)
where m.sub.i(n.sub.0).sup.+ and M.sub.i(n.sub.0) is a symmetric and non-negative (D+3)(D+3) real-valued matrix. Moreover, both m.sub.i(n.sub.0) and M.sub.i(n.sub.0) should be selected such that
h.sub.i(n.sub.0,Z.sub.i(n.sub.0))>.sub.i(n.sub.0,Z.sub.i(n.sub.0))(42)
where .sub.i(n.sub.0, Z.sub.i(n.sub.0)) is as given by (40).

(55) FIG. 6 depicts the interconnection of the controlled router i, the rate-based flow control via MCV control optimization, and the Kalman state estimator. Further, the development of optimal variances of (37) may require a standard procedure for this type of consideration; first, the constraint equation may be appended to the expression to be minimized by means of a Lagrange multiplier, .sub.i(n.sub.0), and then the resulting equation may be imbedded into the more general class of problems where n.sub.0 is a variable rather than a fixed initial time. Clearly, the solution of the more general problem may lead trivially to the solution of the problem posed herein. Consequently, it may be desired to find .sub.i(k) and the router control policy for packet arrival rates be of the form .sub.i(k).sub.i(k, Z.sub.i(k)), n.sub.0kM1, such that
E{J.sub.i.sup.2(k)|Z.sub.i(k)}E.sup.2{J.sub.i(k)|Z.sub.i(k)}+4.sub.i(k)[E{J.sub.i(k)|Z.sub.i(k)}h.sub.i(k.sub.iZ.sub.i(k))](43)
is minimized, where .sub.i(k).sup.+ is a Lagrange multiplier, and where the four pre-multiplying .sub.i(k) are introduced just for convenience. It should be noted that Z.sub.i(k) contains all the information available to terminal agent i's packet arrival rate adjustments at interleaver block k and the form chosen for .sub.i(k) together with a boundedness requirement contribute to the definition of the class of admissible controls.

(56) Before proceeding with the development of the recursion equation however, let .sub.i.sup.k{.sub.i(k), .sub.i(k+1), . . . , .sub.i(M1)}, k=n.sub.0, . . . M, and let
V C.sub.i(k,Z.sub.i(k)|.sub.i.sup.k)=E{J.sub.j.sup.2(k)|Z.sub.i(k)}E.sup.2{J.sub.i(k)|Z.sub.i(k)}+4.sub.i(k)[E{J.sub.i(k)|Z.sub.i(k)}h.sub.i(k,Z.sub.i(k))](44)
where VC.sub.i signifies variance cost.

(57) In one embodiment, the assumption of linear flow control laws may lead naturally to desired quadratic costs, that is, for linear flow control laws, it is always possible to write,
VC.sub.i*(k+1,Z.sub.i(k+1))=v*.sub.i(k+1)+x.sub.i.sup.T(k+1)V*.sub.i(k+1)x.sub.i(k+1)(45)
where v*.sub.i (k+1).sup.+ and V*.sub.i(k+1) are symmetric and non-negative (D+3)(D+3) real-valued matrices and whereas n.sub.0kM1. Thus, for .sub.i(k)A.sub.ix.sub.i(k)+B.sub.i.sub.i(k), it may follow that
E{V C.sub.i*(k+1,Z.sub.i(k+1))|Z.sub.i(k)}=v*.sub.i(k+1)+.sub.i.sup.T(k)V*.sub.i(k).sub.i(k)+Tr{V*.sub.i(k+1)W.sub.i}}(46)

(58) Aside from the relevance of S.sub.i(k)Q.sub.i+M.sub.i(k+1) for n.sub.0kM1, to the final-value conditions given by m.sub.i(M)=0, M.sub.i(M)=0, v*.sub.i(M)=0, and V*.sub.i(M)=0, some mathematical manipulations may further yield

(59) 0$\begin{array}{cc}{\mathrm{VC}}_i^{*}\left(k,Z_i\left(k\right)\right)=\underset{{}_i\left(k\right),{}_i\left(k\right)}{\min }\left\{4{}_i^T\left(k\right)S_i\left(k\right)W_i{S}_i\left(k\right)+E\left\{{\left(w_i\left(k\right)S_i\left(k\right)w_i\left(k\right)\right)}^2\right\}-\mathrm{Tr}\left\{S_i\left(k\right)W_i\right\}+v_i^{*}\left(k+1\right)+{}_i^T\left(k\right)V_i^{*}\left(k+1\right){}_i\left(k\right)+\mathrm{Tr}\left\{V_i^{*}\left(k+1\right)W_i\right\}+4{}_i\left(k\right)\left[m_i\left(k+1\right)+{}_i^T\left(k\right){}_{i,3}{}_i\left(k\right)+{}_i^T\left(k\right)S_i\left(k\right){}_i\left(k\right)+\mathrm{Tr}\left\{S_i\left(k\right)W_i\right\}-m_i\left(k\right)-x_i^T\left(k\right)M_i\left(k\right)x_i\left(k\right)\right]\right\}& \left(47\right)\end{array}$

(60) Performing the minimization with respect to .sub.i(k) for each terminal agent i with i=1, . . . , N at interleaver block k, the optimal MCV-based router flow controller .sub.i*(k) for packet arrival rate adjustments at the controlled router i may be given by
*.sub.i(k)=K*.sub.i(k){circumflex over (x)}.sub.i(k|k)(48)
where the terminal agent i estimates the states {circumflex over (x)}.sub.i(k|k) of the controlled router i and feed back to configure the optimal MCV flow control policy, e.g.,

(61) $\begin{array}{cc}{K}_i^{*}\left(k\right)=-\frac{B_i^T{}_i\left(k\right)A_i}{B_i^T{}_i\left(k\right)B_i+{}_i\left(k\right){}_{i,3}}& \left(49\right)\\ {}_i\left(k\right)=S_i\left(k\right)W_i{S}_i\left(k\right)+\frac{1}{4}{V}_i^{*}\left(k+1\right)+{}_i\left(k\right)S_i\left(k\right)& \left(50\right)\end{array}$

(62) Using this MCV control gain (48) parameterized in the variance of (37) for packet arrival rate adjustments at the controlled router i and performing the minimization in terms of .sub.i(k) the mean constraint may be obtained as follows
M.sub.i(k)=.sub.i,3(K*.sub.i).sup.T(k)K*.sub.i(k)+(A*.sub.i).sup.T(k)S.sub.i(k)A*.sub.i(k)(51)
m.sub.i(k)=m.sub.i(k+1)+Tr{S.sub.i(k)W.sub.i}(52)
and the variance
V*.sub.i(k)=(A*.sub.i).sup.T(k)[4S.sub.i(k)W.sub.iS.sub.i(k)+V*.sub.i(k+1)]A*.sub.i(k)(53)
v*.sub.i(k)=v*.sub.i(k+1)+Tr{V*.sub.i(k+1)W.sub.i}+E{(w.sub.i(k)S.sub.i(k)w.sub.i(k)).sup.2}Tr.sup.2{S.sub.i(k)W.sub.i}(54)
where A*.sub.i(k)A.sub.i+B.sub.iK*.sub.i (k) and n.sub.0kM1.

(63) FIG. 7 illustrates a schematic diagram of an exemplary integrated framework for SATCOM terminal flexibility consistent with various embodiments of the present disclosure. Referring to FIG. 7, the use of terminal agents is to handle dynamic demand traffic in the presence of delayed uplink resource assignments. As expected, flow control with delayed allowable modem data rate information did require an increase in the dimension of the state space. The MCV control-theoretic framework according to the present disclosure offers an additional important advantage besides leading to a rate-based flow control design that is optimal with respect to various performance metrics. It further provides an analytical expression for optimal variances of performance index. This result is especially important in operational mindsets of performance risk aversion.

(64) Moreover, effectiveness and versatility of the rate-based flow control paradigm developed here are promoting an open standard interface. It requires a simple one-way flow control message from terminal modems to its routers informing available data rates, without the routers having to inform the modem counterparts their traffic demands, and thus, avoiding interface complexity.

(65) Also relevant is that terminal agents as anticipated here could better respond to traffic demand surges by offering SATCOM network resource efficiency while achieving resilient QoS router control and terminal performance reliability. Key capabilities to support these services are: 1) agile multi-objective terminal planning and configurations for transmission jitter mitigation, queue buffer overflow control, and source determining packet arrival rates according to available modem data rates; 2) effective modem and router interactions with less message control overheads; and 3) flow control with bounded performance jitter guarantees.

(66) Compared to existing conceptual frameworks, the disclosed integrated framework provides robust, capable and flexible interoperability standards at interfaces among routers and modems. The present disclosure would not only enable flexible SATCOM terminals, but also allow SATCOM operators to more readily incorporate diverse, incompatible proprietary platforms and legacy terminals in wideband SATCOM enterprises.

(67) The above detailed descriptions only illustrate certain exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention. Those skilled in the art can understand the specification as whole and technical features in the various embodiments can be combined into other embodiments understandable to those persons of ordinary skill in the art. Any equivalent or modification thereof, without departing from the spirit and principle of the present invention, falls within the true scope of the present invention.