See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/3383512

QoS routing with adaptive updating of link states

Article  in  Electronics Letters · May 2001

DOI: 10.1049/el:20010373 · Source: IEEE Xplore

CITATIONS READS

12 118

3 authors:

Alfonso Ariza Quintana Eduardo Casilari-Pérez

University of Malaga University of Malaga
50 PUBLICATIONS   239 CITATIONS    171 PUBLICATIONS   1,557 CITATIONS   

SEE PROFILE SEE PROFILE

Francisco Sandoval
University of Malaga
367 PUBLICATIONS   2,964 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Flow simulator for testing function cost in high bandwidth network, View project

SHARE-it View project

All content following this page was uploaded by Alfonso Ariza Quintana on 01 December 2014.

The user has requested enhancement of the downloaded file.

Table 1: Parameter values
6 mar (rad/s)
I D
a 0.001
ATM
system in a singularity. When using the newly developed magnetic
control controller, the gimbal angles can be kept within a band
with respect to the desired gimbal angles. Fig. 2 demonstrates the
behaviour of the gimbal angles. The new controller is able to con-
trol the gimbal angles within +12" from the specified values of 6'
= [O", O", Oo, 0'1. The gimbal angles are driven overall to the spec-
ified values, but since magnetic torque is not always favourable,
0.2 they may slightly diverge for short periods of time due to magnetic
1.o control coupling and external disturbances. Since NMTdepends on
the B field, NMT will vary also depending on the spacecraft orbit
and altitude.
I 0.8 I
Conclusions: The gimbal angles of an SGCMG cluster can diverge
100 from their nominal values due to external disturbances. Using a
newly developed controller based on magnetic control, the gimbal
angles can be compensated to a specified set of angles within a
certain range, without the use of valuable consumables.

0 IEE 2001 9 March 2001

Electronics Letters Online No: 20010408
DOI: 10.1049/el:20010408
V.J. Lappas, W.H. Steyn and (2.1. Underwood (Surrey Space Centre,
University of Surrey, Guildford, Surrey, United Kingdom)
E-mail: v.lappas@eim.surrey.ac.uk

References
1 'Space vehicle dynamics and control' (AIAA Educational
WIE, 8.:
Series, Tempe, Arizona 1998)
2 BEDROSSIAN, N.s.: 'Steering law design for redundant single gimbal
control moment gyroscopes'. MSc Thesis, MIT, 1987
3 VADALI, s.R., OH, H.s., and WALKER, s.R.: 'Preferred gimbal angles
for single gimbal control moment gyros', J. Guid., Control Dyn.,
1990, 13, (6), pp. 1090-1095

-0.4 I I
0 1000 2000 3000 4000 5000 6000
time, s
1410/11
Fig. 1 CMG gimbal angles during external disturbances QoS routing with adaptive updating of link
GI states
- - _ _ G2
......,.... G3
G4
A. Ariza, E. Casilari and F. Sandoval
A crucial parameter in the design of QoS (quality of service)
0.5 routers is the periodicity with which the nodes have to broadcast
messages about possible changes in the bandwidth availability of
0.4 the links. A simple method for the adaptive control of this
broadcast process in QoS routers is presented. In particular, the
method modifies the triggering condition of the update process
with the aim of stabilising the overload provoked by the update
messages. The benefits of the method are shown in a realistic
network in terms of bandwidth loss probability and update rate.

Introduction: Current IP routers exclusively base the routing deci-

sion on the cost of the utilisation of the network topology, by
minimising the hop count between the source and the destination

::I
nodes. Due to the progressive integration of real time services in
IP networks, with strict requirements in terms of delay and losses,
the application of this policy may be insufficient to guarantee a
, , , , , , fair distribution of the traffic, as it implies that the shortest paths
-0.5 will be overloaded while longer paths will be underutilised. To
0 1000 2000 3000 4000 5000 6000 meet this new demand of quality of service (QoS), routing criteria
time, s 1410/21 must also incorporate the bandwidth availability of the network
Fig. 2 CMG gimbal angles controlled within band during external dis- links. As a consequence, nodes are now obliged to inform the net-
turbances work of the changes in the resource availability of their links. In
GI this sense, QoS routers must achieve a compromise between the
_-__ G2 necessity of updating the link states and the overprocessing and
........... G3 traffic overload introduced by the broadcast of the update mes-
G4 sages [l].
In this Letter, we propose a method to automatically control
Results: For a satellite with the characteristics listed in Table 1, this update process. The method, which could be easily imple-
without using the new controller and during external disturbances, mented in QoS routers, aims to stabilise the update rate independ-
the gimbal angles significantly diverge, as can be seen in Fig. 1. ently of the traffic load, simultaneously increasing the routing
This situation may lead to a significant reduction in control efficiency. The method is evaluated in a realistic environment
authority to the spacecraft and can potentially place the CMG under different traffic conditions.

604 ELECTRONlCS LETTERS 26th April 2001 Vol. 37 No. 9

 Adaptive control of the update process: A key aspect in QoS rout-
ers is to determine the point at which changes in link states have
to be notified to the rest of the nodes in the network. In [2] it is
shown that utilising a relative threshold for measuring the impor-
tance of these changes and triggering the updates is preferable to
fVring an absolute threshold or implementing periodical updates.
According to this policy [3], a change of By (the available band-
width in the link between two nodes i and]] is broadcast if the rel-
ative variation of Bd surpasses a certain threshold U as:
under low traffic load, the new method decreases the loss proba-
bility by almost an order of magnitude (for the worst case with Ro
= 0.1) in comparison with the method with a high fixed threshold
( U = 0.8). On the other hand, for high traffic load and a similar
loss probability, it considerably reduces the updating requirement
(decreasing the required update rate) of the method with a low
fixed threshold ( U = 0.4).
r 0.92

3 t

where U is the aforementioned threshold and B; the last notified

1
value of the available bandwidth. The main problem with this e 2
method is that the effectiveness of the updates strongly depends m
5
not only on the chosen value for U but also on the traffic load of U
n
the network. Thus, if U is high, under low traffic load (slow varia-
tions in the links), the number of updates can be insufficient to 1
properly characterise the network state in the nodes. On the con-
trary, with a low value of U and a high traffic load, the update
messages can dramatically increase the network overload.
To cope with this problem, we propose to dynamically adapt n
the value of the threshold as a function of the network conditions. 10 3 10-2 io-'
Thus, the value of U is periodically modified to stabilise the bandwidth loss probability
update rate R around a target value A,: 1023/11
k =
u { U!,-1 AU if & 5 R,
U k - 1 - AU if R k > R,
Fig. I Update rate against bandwidth loss probability for diverse global
traffic loads and both updating methods (first scenario)
-%- fixed threshold U = 0.4
where u k is the value of the threshold in the Mh inJerva1, AU is -+- fixed threshold U = 0.6
the increment (or decrement) of the threshold and Rk is the estj- -*-
-0-
fixed threshold U ' = 0.8
adaptive threshold R, = 0.1
mation of the update rate during the last interval, measured as Rk
-X- adaptive threshold R, = 0.5
= (nk -n(k-l) T)/T,where Tis the duration of the estimation inter- -A- adaptive threshold & = 1.0
val and n, the number of updates received up to the instant t.
Thus, if a change in the bandwidth occurs in to the triggering
decision will be performed using the last modified value of the
threshold (with k.T 5 to S (k+l).q, which is continuously
adjusted to compensate for the growth or decrease in the update
rate. m
2 I
I 0.79/
0.84
3:
E
Simulation and results: To evaluate the performance of the pro- 2
posed method, we simulated the commercial network of an MCI P
V
= I
Internet provider, consisting of 19 nodes and 77 OC-3 (155Mbit.k)
and T3 (4SMbitis) links. Similar results were obtained with other
real topologies. As traffic sources, we employed CBR (constant bit
rate) flows the bandwidth of which was randomly selected between
1 and 5Mbit/s utilising a uniform distribution. The call holding
r"I
time followed an exponential distribution with a mean value of 10 2 IO'
1200s. To prevent the results from being completely determined bandwidth loss probability
by the existence of bottlenecks, the traffic load was uniformly dis-
tributed among the nodes. For each path decision in the routers, it
1023/21
was considered that the cost of each link linearly depends on the Fig. 2 Update rate against bandwidth loss probability for diverse global
trafficloads and both updating methods (second scenario)
available bandwidth. For the case of the adaptive method, the
estimation interval T and the increment AU were chosen to be -*- fixed threshold U = 0.4
-+- fixed threshold U = 0.6
200s and 0.005, respectively. -a- fixed threshold U = 0.8
To analyse the efficiency of the updating method, we measured -0- adaptive threshold R, = 0.1
both the global update rate of the experiment and the bandwidth -X- adaptive threshold R, = 0.5
loss probability, defined as the ratio between the rejected band- -A- adaptive threshold R, = 1.0
width and the global bandwidth that the sources demand of the
1 network. Similar conclusions can be drawn if the second scenario is ana-
With regard to the traffic load, we considered two scenarios: lysed. In this case, Fig. 2 proves that the method is capable of
1 (i) In the first scenario, the mean call arrival rate h, which fol- adapting the threshold to changes in the traffic load, in such a
lowed a Poisson process, was kept stable for each simulation. way that the update rate remains almost constant irrespective of
(ii) In the second scenario, we considered the natural evolution the network conditions.
of the traffic load in real networks to analyse its imp_act on rout-
ing performance and, particularly, on the estimation R k . To incor- Conclusions:We have proposed a method that adaptively regulates
porate the seasonal nature of traffic (with daily traffic peaks along the triggering condition for the updates of link states in QoS rout-
the week), the mean call arrival rate was programmed to fluctuate ers. For this purpose, the method periodically modifies the relative
between 0 and 2h as a function of a sinusoid with a period of 24 triggering threshold which governs the update process. These
hours: h(t) = h.(l+sin(2nfi)), withf = 1/(8.64.104s). modifications are performed in order to maintain the update rate
Fig. 1 depicts the performance of the methods for the first sce- in a stable condition and, consequently, the burden introduced by
nario. In particular, the update rate against the bandwidth loss the update messages.
probability is shown for different mean traffic loads, comparing Using an actual network as a test-bed and considering the peri-
the behaviour of both update techniques for different values of the odicity of real traffic, we compare the proposed method with a
futed threshold (U = 0.4, 0.6 and 0.8) and the objective update policy of fmed threshold, proving its advantages in terms of the
rate (Ro = 0.1, 0.5 and 1.0 updates/s). The Figure shows that the routing performance (reducing the probability of bandwidth
adaptive method is able to stabilise the update rate. Moreover, losses) as well as in terms of overhead (reducing the update rate).
ELECTRONICS LETTERS 26th April 2001 Vol. 37 No, 9 605
 Acknowledgments: This work was partially supported by the Span-
ish Comisi6n Interministerial de Ciencia y Tecnologia (CICYT),
Project No. TEL99-0755.
0 IEE 2001 21 February 2001
Electronics Letters Online No: 20010373
DOI: lO.l049/el:20010373
A. Ariza, E. Casilari and F. Sandoval (Dpto. Tecnologia Electrdnica,
E. T.S. I. Telecomunicacidn, University of Mdlaga, Campus de Teatinos,
29071 Mdaga, Spain)
E-mail: casilari@dte.uma.es
References
GUERIN, R., and ORDA, A.: 'QoS-based routing in networks with
inaccurate information: theory and algorithms', IEEE/ACM Trans.
Netw., 1999, 7, (3), pp. 350-364
ARIZA, A . , CASILARI, E., and SANDOVAL, F.: 'Strategies for updating
link states in QoS routers', Electron. Lett., 2000, 36, (20), pp. 1749-
1750
APOSTOLOPOULOS,G., GUERIN, R., KAMAT, s., and TRIPATHI, s.:
'Improving QoS routing performance under inaccurate link state
information'. Proc. 16th Int. Teletraffic Congress (ITC'16),
Edinburgh, United Kingdom, June 1999
Using tentative decisions for carrier phase
recovery of turbo-coded transmissions
C . Langlais and M. Helard
Turbo codes can be used to increase the performance of digital
communication systems to approach the Shannon limit: with
perfect synchronisation, a BER of lo4 below Eb/No= 2dB can be
obtained. The authors demonstrate how to use tentative decisions
to perform carrier phase recovery when using convolutional turbo
codes over a satellite channel at low SNR where classical systems
fail.
Introduction: Owing to the use of turbo codes [l], digital commu-
nication systems are now able to provide very good BER perform-
ance, To exploit this good performance, synchronisation has to be
performed at low SNR, as is the case over a satellite link under
severe atmospheric conditions. The tracking mode of a classical
synchronisation system cannot support such conditions without
periodic acquisition sequences [2]. The system described in this
Letter is based on the tentative decision principle as proposed in
1982 by Ungerboeck [3] for TCM and applied in this Letter to
turbo codes. We show the performance of the proposed system for
continuous and blind transmission over a satellite channel, taking
into account all channel and receiver perturbations including con-
version phase noise introduced by oscillators.
Wlt+CpO m Cp& +mCp8)
w v/ Y- I '
T 1
noise phase noise
G
p
J [
Fig. 1 Different noise components in channel and receiver
PLL: We assume that the acquisition mode has been carried out
under good SNR conditions and focus our study on the tracking
mode of the carrier phase recovery. We chose a DDMLFBT struc-
ture [4], which means that we have a feedback (FB) decision-
directed (DD) structure, derived from the maximum likelihood
algorithm (ML); we also assume that the symbol timing (T) has
been correctly performed using a classical system [5]. This struc-
ture is the digital version of the analogical phase-locked loop
(PLL), which is represented in Fig. 1. Owing to several perturba-
tions, namely white additive Gaussian noise (On),oscillator phase
noise (cpvco and (pT) and the excess noise of the detector (qdexc),
606 ELECTRONICS LETTERS
View publication stats
the carrier phase estimate is subject to variations around the trans-
mitted carrier phase. As detailed in [5] and represented in Fig. 1,
the remaining phase error (PE is thus
where cp,,,(s) = (PAS)
- cpvco(s) + cpo, T(s) = KF(s)/s and s is the
-
Laplace variable.
Assuming H(s) = qs)/( 1+ qs)), the phase error variance is then
d= 1, +CO
(SVT + SV",, + S," + So,) I1- ff(f)I2df
high pass
where Si is the spectral density power of the noise component i.
0.:has two noise components: on the one hand, the phase noise
provided by the channel due to additive Gaussian noise and the
phase noise of the high-pass-filtered oscillators and, on the other
hand, the noise caused by the low-pass-filtereddetector. Since the
two filters have the same cut-off frequency, we have to reach a
compromise between these different noise components to obtain
the lowest phase error variance 02. To minimise the noise created
by the high-pass filter, the cut-off frequency must be high, whereas
it is the opposite case for the low-pass filter. Owing to the similar-
ity between the equivalent models for a discrete-time and continu-
ous-time synchroniser, the previous discussion is valid for both
models [5].
A very important parameter o f the PLL is the noise equivalent
bandwidth B,T,, which is defined as BnT, = IHV)l*dfwhere T, is I,"
the symbol duration.
Note that the cut-off frequency of the filter HV) acts on B,T,. A
compromise between the different noise components is thus
obtained by adjusting the value of B,,T,. Another important
parameter to be taken into account is the cycle slip phenomenon.
For QPSK modulation, the synchronisation loop has many stable
equilibrium points because of the d 2 rotational invariance of the
constellation. Sometimes, the noise or other degradations move
the equilibrium point to another point: this phenomenon is called
cycle slip and produces a continuous phase error of kd2, and so
burst errors even if differential encoding limit the error propaga-
tion.
Thus, at low SNR, frequent cycle slips considerably degrade the
performance of the system. In [5], the time between two slips T, is
given for a low SNR:
2B,Tm = - exp -
; (3 (3)
where p = 1/02, Thus in order to have as few cycle slips as possi-
ble, the phase error variance must be low.
.............. t.................................................................
& b e : : ; ....
p i n g .....
g
"
DECl DEC2
................................................................................................................................
one module of turbo-decoder
1301/21
Fig. 2 Phase carrier recovery scheme when using tentative decisions
Tentative decision system description: The turbo code used in our
application is a convolutional turbo code the structure of which
relies on the parallel concatenation of two simple convolutional,
recursive and systematic codes, C1 and C2, with an interleaver
between the two coders. The decoding process is iterative and
based on the serial concatenation of decoders DECl and DEC2.
At each iteration, DECl and DEC2 respectively decode the data
encoded by C1 and C2. These decoders both use the soft output
Viterbi algorithm separated by a de-interleaver [11.
26th April 2001 Vol. 37 No. 9