DYNAMIC RESOURCE MANAGEMENT APPROACH IN

QoS-AWARE IP NETWORKS USING FLATNESS BASED

TRAJECTORY TRACKING CONTROL

Lynda Zitoune, Amel Hamdi, Hugues Mounier, Véronique Vèque

Institut d’Electronique Fondamentale, Bât 220
Unviversité Paris Sud XI, 91405 Orsay cedex, France
Lynda.zitoune@u-psud.fr

ABSTRACT
In this paper, we present a reactive control policy which adapts the source bit rate to the
reserved resources in order to ensure performance guarantees for multimedia applications.
The proposed method called flatness based trajectory tracking deals with drastic traffic
flow rate changes and limits the traffic in order to respect the time constraints. We show
the contribution of the reactive control and the dynamic regulation using purely control
theoretic approaches which stabilize the network and avoid undesirable oscillations for
the transmission of such critical flows. Here, we present a performance analysis for such
rate control mechanism, and illustrate its feasibility through its implementation on
MPLS-TE control plane of SSFnet/Glass simulator.

Keywords: QoS, traffic engineering, rate regulation, trajectory tracking appproach.

1 INTRODUCTION conclude that token bucket shaping can experience

The growth of multimedia applications over
wide area networks has increased research interest in
QoS (Quality of Service). Such applications need to
find appropriate and available network resources and
reserve them in order to support and guarantee their
specific services. For instance, MPLS-TE (Multi-
Protocol Label Switching, Traffic Engineering TE)
[1] intends to balance load over multiple paths in the
network to minimize its congestion level. It is
performed using QoS routing algorithms in order to
meet QoS constraints, while at the same time
optimizing some global, network-wide objective
such as utilization [1], [2].
However, MPLS-TE provides no per-flow QoS
guarantee [2], [3]. We claim that QoS routing is not
enough in itself to guarantee accurate QoS
requirements. QoS routing is able to provide some
high level granularity of performance when traffic
load is stationary. But, in case of high throughput
variation, data flows can be affected by longer
queuing delays or at worst by losses.
So, we must resolve the congestion and service
degradation problems where they occur, i.e., at the
routers queues. We use packet flow control and
queue management operations that control the buffer
occupancy, same as the conditioning functions of
DiffServ (Differentiated Service) [4] token bucket
approach [5]. However, most developed works
unpredictable delays, packet reordering, and even
losses when congestion occurs [6], [7], [8].
Therefore, to improve services offered to
applications, we propose to add a flow control
function to adjust the traffic arrival according to
traffic specification to achieve QoS requirements.
In this paper, we present a mathematical
framework for rate regulation (adaptation) of
multimedia applications, with the aim of matching
QoS requirements and maximizing network resource
utilization. We use a nonlinear approach of
theoretical control named flatness based trajectory
tracking and develop a reactive and an adaptive
control method which stabilizes general network
behavior, improves network resource utilization and
ensures delay transfer requirements.
The rest of the paper is organized as follow. In
section 2, we give the main motivations for
developing a reactive packet streams control. Section
3 explains the functionality of our trajectory tracking
control. Section 4 is devoted to the flatness
methodology and to the implementation of the
approach based on our target environment. In section
5, we present the simulation results and their analysis
that illustrate feedback control by the trajectory
tracking approach. Finally, section 6 summarizes our
rate analysis findings and concludes the paper.

Ubiquitous Computing and Communication Journal 1

2 MOTIVATIONS AND RELATED WORKS
2.1 Traffic Engineering Tools
Many architectures and mechanisms have been
proposed by the IETF (Internet Engineering Task
Force) for enabling QoS, such as IntServ (Integrated
Service) [9], DiffServ (Differentiated Service) [4],
[10] and MPLS-TE (Multi-Protocol Label Switching,
Traffic Engineering) [1], [11]. Two QoS issues are
mainly addressed and developed using Traffic
Engineering (TE) functionalities: resource allocation
and performance optimization.
To achieve Traffic Engineering goals, the
utilization of the network resources is optimized by
the Traffic Engineering process periodically. As
defined by TEWG (Traffic Engineering Working
Group) of IETF, the process of traffic Engineering
consists of measuring, characterizing, modelling and
control of the network resources. It encompasses the
reliable expeditious movement of traffic through the
network, the efficient utilization of network
resources, and the planning of network capacity [1],
[11]. In other terms, the main objective of Traffic
Engineering is an efficient mapping of traffic
demands onto the network topology to maximize
resource utilization while meeting QoS constraints
such as delay, jitter, packet loss rate and throughput.
Using QoS routing mechanisms such as multi-
path routing, MPLS-TE avoids link saturation and
achieves some link optimization. The general
schematic of multipath routing algorithm consists of
two steps: computation of multiple candidate paths
and traffic splitting among these multiple paths like
CBR Constraint-Based Routing (as summarized in
[2], [3]. Each multi-path routing mechanism in the
literature is declared very efficient by its authors but
generally with restricted conditions [3]. A new
routing paradigm that emphasizes searching for
acceptable paths satisfying various QoS requirements
is needed for integrated communication networks.
QoS routing of MPLS-TE is a coarse-grained
solution that offers many advantages to service
providers. However, it provides no per-flow QoS
guarantee. So, we must resolve the congestion and
service degradation problems where they occur, i.e.
at the router's queues.
The network optimization process is performed
with three temporal resolution levels [11], [12]. The
long term: as the network evolves with traffic
demand growth, capacity management and planning
are required to meet the traffic demands. In
intermediate-time-resolution, QoS routing
mechanisms are used as an important tool for
resource control as mentioned earlier. The short time
resolution level: some traffic engineering methods
Ubiquitous Computing and Communication Journal
such as queue management, conditioning and
scheduling at switches and routers to deal with
problems of congestion and service degradation.
Token bucket conditioning approach checks the
packet flow compliance with respect to the
negotiated contract, by smoothing exceeding flow
(policing and shaping) [5]. The token bucket is a
source descriptor in terms of burst and mean rate. It
gives a simplified model of the sources though it is
not faithful to actual behaviour. The most advance
works concerns the definition and the adaptation of
the token bucket parameters [5], [6], and [7] in order
to shape input traffic in accordance with negotiated
traffic profiles. It is seen that token bucket shaping
can experience unpredictable delays, packets re-
ordering and even losses when congestion occurs (as
demonstrated in [5], [6], and [8]. Using token bucket
control, no deterministic service can be provided in
the network.
As a conclusion, we believe that token bucket is
not a service guarantee mechanism because of two
main drawbacks: 1) it is independent of router's
buffer state, since token bucket parameters are
specified based on a priori source models. 2) It is an
open loop control which does not consider the input
rate variations, i.e. the source bit rates during
transmission.
On the other side, a numbers of researchers have
developed solutions to dynamically control the video
bit-rates depending on available network bandwidth.
Most of these solutions adopt TCP protocol for
transporting video stream. They use its feedback
loop control information to estimate network state,
and subsequently determine the bit-rate to be used
for converting and transmitting the video stream [13]
So, to provide end-to-end QoS support over the
network, we propose to add packet flow control to
TE short term process. Unlike TCP feedback control
used to adapt video stream, this study focus on
developing dynamic bit-rate adaptation approach to
enforce the network resource planning which is
performed at the long term resolution level. We use
flatness based control theory to develop this new
monitoring method.
2.2 Why Feedback Control
Although steady-state characteristics can be well
understood using queuing theory (e.g., as is done
with capacity planning). Here, we use flatness based
control theory to address dynamics of resource
management, especially changes in network
workloads and configuration.
In other words, we are interested in designing a new
network resource monitoring approach in order to
2
ensure performance characteristics of critical
applications in MPLS-TE networks, especially delay
transfer, bandwidth and queue's lengths. We consider
network metric like queue length, as measured
output and the traffic requirements or profiles as
inputs.
The control is performed by adjusting the
network inputs, i.e. application’s input rates which
affect buffer sizes with respect to the buffer planning.
The need for regulatory control arises first to track
the reserve capacity, and second to enforce the
application service guarantees.
Since the measured outputs are used to
determine the control inputs, and the inputs then
affect the outputs, the mechanism is called feedback
or closed loop. Feedback control based on flatness
notion is a powerful tool 1) to ensure that the
measured output (buffer utilization) tracks very
closely the reference input (buffer planning) even in
the presence of disturbances, 2) to deal with network
stability and other aspects of control performance,
especially when changes in network workloads and
configuration occur.
2.3 Our Work Objective
Depending on network variations, we use a
feedback mechanism to inform the sources when
they exceed their profile and regulate their input
rates in order to match the reserved network resource
and to meet their QoS requirements. As a result,
dynamic adaptation is provided between clients and
their service provider.
The purpose of this work is to present this new
Traffic Engineering approach, which aims to
optimize the network utilization and performance by
intelligently handling the buffer reservations at the
routers. We take benefit of traffic descriptors to
model communication behaviours and QoS
requirements by using trajectories.
Trajectory would be a new way of mapping traffic
demands over networks. The trajectory establishment
or network resource planning translation into
trajectories is out of the scope of this paper. Here, we
are interested mainly in source bit rate regulation to
meet QoS requirements and bounding packet delay.
3 RATE REGULATION SCHEME
Our method called Flatness-based trajectory
tracking control is a network-driven intra-domain
and inter-domain layer 3 bandwidth provision
approach. We aim to prove its efficiency, when
applied at the hotspot nodes such as the ingress
nodes of large scale networks like Internet, and also,
the nodes that aggregate flows of several LSPs
(Label switched Path), in case of an MPLS-TE
domain (as in figure Fig.1). Network resources
Ubiquitous Computing and Communication Journal
considered here are buffers and bandwidth. Our
controller monitors the router queue state according
to the traffic requirements and regulates the
incoming bit rate in a smooth manner. Indeed, the
delivered service is more reliable and predictable
with regard to network performance.
Classically, most papers consider the problem
from the network dimensioning point of view: given
an input stream and a scheduling policy, what is the
worst case buffer requirement and what is the nature
of the output stream? However, in our case the
output stream and the buffer size are given and
described by the trajectory. So, we the input stream
to meet buffer constraints and to maintain QoS. We
use a nonlinear theoretical approach to resolve this
reverse problem, named flatness based trajectory
tracking control [14], [15], [16].
In the following, we first state the problem
definition, and then briefly recall flatness notion and
expose the trajectory tracking control method with
reference to the target environment of figure Fig.1.
The packet stream is processed and controlled at the
node denoted Rc and, the router resources considered
here are the buffer size and the bandwidth.
3.1 Trajectory Tracking Control Methodology
QoS control requires an understanding of the
quantitative parameters at the application and
network layers. For example, from a traffic
descriptor which describes the requested service, we
deduce what will be the node buffer variation of the
corresponding LSP and we define the buffer
trajectory, denoted as qref (example in section 5.1).
Recall that we assume a MPLS-TE architecture.
For each incoming stream an LSP is established and,
a buffer queue is created to support the
corresponding packets. The critical router Rc of the
figure Fig.1, collects the packets generated by n
earlier routers in its buffer q(t). The incoming rates
of these packets are denoted ui(t). The aggregated
packets are served with some service bit rate r(q(t))
to the next hop following their LSP. If Rc is not able
to handle all the incoming packets, the packets are
either buffered to wait for transmission service or
rejected in case of buffer saturation. The lack of
feedback between adjacent routers may cause an
excessive data loss and bad transmission service
(delay violation) for these critical flows.
3
 are identically satisfied.

The preceding notion will be used to obtain an open

loop control; that is control laws which will ensure
the tracking of the reference flat outputs when the
model is assumed to be perfect and the initial state
conditions are assumed to be exactly known. Since
this is never the case in practice, one needs some
feedback schemes that will ensure asymptotic
convergence to zero of tracking errors.

Our framework can thus be decomposed into two

Figure 1: Target environment of the developed work
steps:
Our objective is to control the input stream’s bit
1. Design of the reference trajectory of the flat
rates ui(t) in order to meet the buffers, reserved in
outputs; off-line computation of the open
advance, at the router Rc and which we have modeled
loop controls.
by a trajectory denoted by qref. Thus, the feedback
2. Inline computation of the complementary
control adjusts the ui(t) so that the packets sent by the
closed loop controls in order to stabilize the
clients are accepted at the router queue q. In other
system around the reference trajectory.
terms, the controller ensures that q(t) tracks qref(t), in
order to maximize the utilization of the reserved
This two steps design is better than a classical
resources; especially during transitions between
stabilization scheme. The first step obtains a first
lack/availabilty of buffers, to match the QoS
order solution to the tracking problem, while
requirement like packet delay and, to avoid bit rate
following the model instead of forcing it (like in a
oscillations and excessive loss.
usual pure stabilization scheme). The second step is
refinement, where the error between the actual
QoS is of particular concern for the continuous
values and the tracked references is much smaller
transmission of high-bandwidth video and
than in the pure stabilization case (see [14], [15],
multimedia traffic demands. We have used a fluid
[16]).
flow model to represent such bulk data transfer.
4. Trajectory Tracking Control Implementation
3.2 Flatness notion brief Recall
Let us briefly recall the flatness notion for
In the fluid flow paradigm, the physical evidence
systems with a state x and controls u [14], [15]
is that the rate of packet accumulation in the buffer is
the difference between the packets inflow rate and
Definition 1. The system
the packets outflow rate. So for the model depicted
in figure Fig.1, we obtain a differential equation
x& = f ( x, u ) describing the queue length variation of router Rc

with x ∈ R and u ∈ R is differentially flat if

n m n

there exists a set of variables, called a flat output, q& (t ) = ∑ u i (t − hi ) − r (q (t )) (1)

i =1

y = h( x, u , L , u (r ) ), y ∈ R m , r ∈ N where hi is the delay between Rc and the previous

hop.
Such that
The positivity of the buffer queue length as well
( ρx )
x = A( y, y& , L , y ) as its maximum capacity are considered by
describing the outflow rate r(q(t)) in terms of the
u = B( y, y& , L , y ( ρu ) ) contents of the buffers q(t) (see [6] ).

With ρ an integer, and such that the system equations q (t )

We take r (q (t )) = µ which is (as
a + q (t )
A
( y, y& , L , y ( ρ +1) ) = f ( A( y, y& , L , y ( ρ ) ), demonstrated in [17]) a positive bounded function of
dt the load q and a monotonically increasing one. The
B ( y, y& , L , y ( ρ +1) )) parameter µ may be interpreted as the maximal
processing capacity of the router. This relation is

Ubiquitous Computing and Communication Journal 4

obtained by assuming a linear relation between the Eq.(3):
residence time (queuing delay) and the buffer queue
length. In case of M/M/1 queue, a=1 (see [17] for qi (t + hi )
more details). ui (t ) = q&i (t + hi ) + α i µ n
(3)
1 + ∑ qi (t + hi )
To determine the input controls ui(t) of equation i =1
Eq.(1), we proceed as follows. We have considered
that the router is composed of n virtual files (q1(t), …, Thus, for some reference trajectories qiref(t) of the
qn(t)) which accumulate the packets coming from the
reserved buffers, the former nodes output bit rates
n former hops respectively.
are defined by equation Eq.(4):
These stored packets are released to the true file q
(see figure Fig.2). The router output service rate may
qiref (t + hi )
be expressed as r (q (t )) = α i µ
qi (t )
. ui (t ) = q& iref (t + hi ) + α i µ n
(4)
1 + ∑ qiref (t + hi )
n
1 + ∑ qi (t )
i =1
i=1
Where αi are weights for service scheduling of the n
n Which ensures the open loop tracking of qiref(t).
flows, with ∑α i = 1 . If the aggregated flows are
i=1 4.2 Flatness based control: closed loop control
We now illustrate how to compute the closed
requesting for the same QoS, we choose αi =
1
n
to loop control which ensures the tracking of the router
ensure fairness between their competing packets. buffer size qi(t) to the reference trajectory qiref(t),
when the system becomes unstable. This is done by
computing tracking error ei(t) such that ei(t) = qi(t) -
qiref(t).
The feedback control law is computed in order to
minimize the closed loop error dynamics such that
ei(t) = - Kiei(t), so

q&i (t ) − q& iref (t ) = − K i (qi (t ) − qiref (t )) (5)

Replacing q&i (t ) from equation Eq.(2) in equation

Figure 2: Virtual model at router side Rc
Eq.(5)), we have
The virtual model corresponding to the physical
model (Fig.1) is treated as a composition of n qi (t )
differential equations describing the virtual queue ui (t − hi ) − α i µ n
− q&iref (t )
variations (q1(t), …, qn(t)), summarized as: 1 + ∑ qi (t ) (6)
i =1

q& i (t ) = ui (t − hi ) − α i µ
qi (t )
(2) = − K i (qi (t ) − qiref (t ))
n
1 + ∑ qi (t )
i=1 qi (t + hi )
ui (t ) = − K i e(t + hi ) + α i µ n

As cited earlier (section 3.2), our framework is 1 + ∑ qi (t + hi ) (7)

decomposed into two steps: 1) off-line computation i =1

of the open loop controls. 2) Inline computation of + q&iref (t + hi )

the complementary closed loop controls to stabilize
So the closed loop control given by the equation
the system around the reference trajectories.
Eq.(7) ensures qiref (t ) tracking when instabilities
4.1 Flatness based control: open loop control occurs
The model described by the Eq.(2) is flat with
qi(t) as a flat output. In other words, we get a This dynamic control approach is extended to
complete parameterization of the system in terms of consider end-to-end QoS support over MPLS-TE
qi(t) and of a finite number of its derivatives. Thus, networks (see [18] for more details).
ui(t) is a nonlinear expression of qi(t) and its
derivatives, as explicitly demonstrated below in

Ubiquitous Computing and Communication Journal 5

5. SIMULATION AND RESULTS
5.1 Simulation Scenario
Here, we present our trajectory tracking
controller as we have implemented under SSFNet
(Scalable Simulation Framework)/Glass (GMPLS
Lightwave Agile Switching Simulator). SSFNet [19]
is a collection of Java components for modeling and
simulation of Internet protocols and networks at and
above the IP packet level. Link and physical layers
modeling can be provided in separate components,
like Glass [20] which is a simulation engine that
allows the modeling and performance evaluation of
routing, restoration, and signaling protocols for
optical networks.
We have made two major modifications. Our
controller is implemented as a new AQM (Active
Queue Management) method at the interface level.
The monitoring is done at intervals using timers. For
each interval, the controller compares the queue
occupancy, qsize, to the number of reserved buffers
qref. Based on the difference, it computes the new
input bit rate (using the discrete version of equation
Eq.(7)), that the sender must use to release its stream.
We have use a predictor (using standard Euler
prediction) for estimating network variation to
consider transfer delays hi.
For signaling, we have added a new notification
message for CR-LPD (Constraint-based Label
Distribution Protocol) of Glass Simulator, to notify
the LERs (Label Egress Router) of the new input bit
rate.
The trajectory tracking controller is tested on the
scenario depicted in figure Fig.3.
Figure 3: Simulated network topology
Our network simulation implements a MPLS-TE
architecture that configures ingress routers (Label
Edge Router LER), core routers (Label Switch
Router, LSR), and the 4 corresponding LSPs that
connect clients to servers respectively (Si, Ci). The
link connecting LSRs (Label Switch Router) 220 and
221 is the critical one, because it must support the 4
LSPs. So, we have implemented four trajectory
Ubiquitous Computing and Communication Journal
tracking controllers. Two at the LSR 221 to handle
LSP1 and LSP3, connecting (S1, C1) and (S2, C2)
respectively. The others at LSR 220 to control LSP4
and LSP6, connecting (S3, C3) and (S4, C4)
respectively. These controllers regulate the output
rate of LERs 211, 213 and 210, 212 respectively. For
these controllers, we have defined 4 reference
trajectories corresponding to each LSP, i.e.
qiref, i = 1, L ,4 as follows
q1,3ref (t ) = a1,3 + b1,3 ∑ tanh(c1,3 (t − (2 j + 1)T ))
j
and
q4, 6 ref (t ) = a4, 6 − b4,6 ∑ tanh(−c4, 6 (t − (2 j + 1)T ))
j
+ b4, 6 tanh(−c4, 6t )
with j, T ∈ Ν .
The parameters a, b determine the quantity of
data to be transferred during (2j+1)T period, and c is
used to adjust the transition between these quantities.
The parameter values are chosen to match with the
input traffic demands and as the same time to
guarantee the service performance. Mainly, to reduce
delay variation and packet loss.
The simulation results are obtained with parameter
values summarized in Table 1, for a simulation time
of 120sec and packet size of 1032bytes.
Table 1: Simulation parameters
q1ref q2ref q3ref q4ref Rate
a 473 350 235 235 15Mbps
b -73 100 -35 -35 for LSR 220
c -0.5 0.6 -0.5 -0.5 30Mbps
T 22 for LSR 221
These values are chosen in order to bound the
queuing delay to 200ms. Also, we chose the
hyperbolic tangent function because we think it
represents quite ON-OFF traffic.
The reference trajectories are shown in Fig.4. We
depict four phases of buffer planning defined by
parameter T. For example, in [0, 22] sec interval,
200packets can be stored for LSP4,6, 550packets for
LSP3 and 550packets for LSP1. During [22, 42] sec,
270packets for LSP4, 200packets for LSP6,
550packets for LSP1 and 350packets for LSP3, and so
on.
3.2 Simulation Results
The trajectory tracking control ensures the
tracking of the reference flat output qiref (figures
Fig.4, Fig.5). For example, for t Є [0, 22] sec, the
queue lengths of LSP4 and LSP6 are about
160packets compared to the reserved buffers for
6
these paths which are about 200packets.
In other words, when transition occurs, the flatness
controllers increase or reduce the LERs output rates
(figure Fig.6) in smooth manner, without affecting
the transmission service as shown in figures Fig.7,
Fig.8. The queuing delays at the LSPs queues qi are
bounded by 190ms, as well as the loss ratio by (<10-
5
). Queue’s sizes are always under qiref, so the loss
rate equals zero.
The queuing delays are quite constant during
intervals. This is accurate for characterizing the
delay variation. The service performance is ensured
due to the fact that we monitor the buffer utilizations
around these trajectories without exceeding.

Also, it can be seen that the router’s (LER211 and

LER213 ) bit rates vary such that at each instant the Figure 5: LSRs buffer occupation qsize
sum of their bit rates match the maximum capacity of
the LSR221, i.e. 30 Mbps quite well. Similarly, the
sum of LER210 and LER212 bit rates match the
maximum capacity of the LSR220, i.e. 15 Mbps
(figure Fig.6).

We observe an error of about 50packets between the

reference trajectories and the queue’s size. This error
depends on the control gain (Ki) values of this
simulation. Indeed, Ki values (summarized in table
Table 2) are chosen in order to reduce both the
control error and the transient response duration
which is about 2sec here.

Table 2: gain control values Ki

LSR220 LSR221 Figure 6: LERs output rate regulation ui(t)
LSP1,3 -- K4,6 = 13.6
LSP4,6 K4,6 = 10 --

qi (t )
Figure 7: Queuing delay variation at the
ri (qi (t ))
Figure 4: LSRs buffer reservation qiref LSPs buffers

Ubiquitous Computing and Communication Journal 7


Figure 8: Loss variation at the LSPs buffers
Figure 9: LSPs bandwidth utilization ratio
The flatness control mechanism successfully
prevents the router's buffer oscillation and the
queuing delay variation by tracking the reserved
buffer size. Our approach is very efficient for
managing network resources as it maximizes the
buffer utilization (see figure Fig.9), in comparison to
the reserved buffers.
6. CONCLUSION
The new traffic engineering approach presented
here, aims at optimizing the network utilization and
performance by intelligently handling the buffer
reservation at the routers. We take benefit of traffic
descriptors to model communication behaviour and
QoS requirement by using trajectories. We show that
the reactive control and the dynamic regulation using
purely control theoretic approaches stabilize the
network and avoid undesirable oscillations for
critical flow transmissions.
Ubiquitous Computing and Communication Journal
Unlike token bucket approach used in DiffServ for
traffic conditioning, our feedback mechanism
advertises, depending on network variation, the
sources when they exceed their profile and regulate
their input rate in order to match their QoS
requirements. As a result, a dynamic adaptation is
provided between clients and their service provider.
This controller is implemented as a new Active
Queue Management mechanism based on the
trajectory tracking method advocated here. This new
AQM approach provides guarantees for critical
traffic and may be used for dynamic provisioning of
transmission service. Obtained results illustrate the
feasibility of the flatness control law as well as the
efficiency of the proposed trajectory tracking
approach in controlling and adapting the critical
application bit rate depending on the reserved
resources and negotiated transmission constraints
namely delay requirement.
5. REFERENCES
[1] D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, X.
Xiao: Overview and Principles of Internet Traffic
Engineering, Network Working Group, IETF-RFC
3272, (2002).
[2] K. Lee, A. Noce, A. Toguyéni, A. Rahmani:
Comparaison of Multipath Algorithms for Load
Balancing in a MPLS Network, Proceedings of
International Conference on Information Networking,
Vol.3391, pp.463-470, (2005).
[3] K. Lee. Modèle Globale pour la QoS dans les
Réseaux FAI: Intégration de DiffServ et MPLS-TE.
PhD thesis, Ecole Centrale de Lille, (2006).
[4] S. Black, D. Black, M. Carlson, E. Davies, Z.
Wang, and W. Weiss: An Architecture for
Differentiated Services, Network Working Group
IETF-RFC 2475, (1998).
[5] Y. Berny, S. Black, D. Grossman, A. Smith: An
Informal Management Model for DiffServ Routers,
(Appendix. A Discussion of Token Buckets and
Leaky Buckets), IETF-Network Working Group,
RFC No.3290, (2002).
[6] W. Ashmawi, R. Guérin, S. Wolf, M. H. Pinson:
On the Impact of Policing and Rate Guarantees in
DiffServ Networks: a Video Streaming Application
Perspective. In ACM SIGCOMM 2001, pages 83–95,
San Diego, CA, USA, (2001).
8
[7] Y. Koucheryavy, D. Moltchanov, J. Harju: A
Top-Down Approach to VoD Traffic Transmission
over DiffServ Domain Using AF PHB Class. In ICC
2003, volume 26, pages 243–249, Seattle, (2003).
[8] L. Zitoune, H. Mounier, V. Vèque: A New
Traffic Control Scheme for Real Time Services in
Diffserv Architecture, International Conference on
Telecommunications 2005, Cape-town, South Africa,
(2005).
[9] R. Braden, D. Clarck, and S. Shenker: Integrated
Services in the Internet Architecture: An Overview,
Network Working Group, IETF-RFC 1633, (1994).
[17] V. Guffens, G. Bastin, H. Mounier: Fluid Flow
Network Modelling for Hop-by-Hop Feedback
Control Design and Analysis. In Internetworking
2003, San Jose, CA, (2003).
[18] L. Zitoune, H. Mounier., V. Vèque, A. Hamdi:
Performance Analysis of Rate Regulation
Mechanism using Trajectory Tracking Control.
International Symposium on Performance Evaluation
of Computer and Telecommunication Systems
(SPECTS'08), (2008).

[10] K. Nichols, V. Jacobson, and H. Zhang: A [19] http://www.ssfnet.org.

Two-Bit Differentiated Architecture for the Internet,
Network Working Group, IETF-RFC 2638, (1999). [20] http://www-x.antd.nist.gov/glass.

[11] Y. Lee, B. Mukherjee: Traffic Engineering in

Next-Generation Optical Networks, IEEE
Communications Surveys and Tutorials, vol. 6, no. 3,
pp. 16-33, 2004.

[12] L. Zitoune : Approches Automatique de

l’Ingénierie de Trafic Internet, PhD thesis, Université
Paris-Sud, Orsay, (2006).

[13] L.S. Lam, J.Y.B. Lee, S.C. Liew, W. Wang:

Transparent Rate Adaptation Algorithm for
Streaming Video over the Internet, 18th
International Conference on Advanced Information
Networking and Applications, AINA 2004, Vol.1,
pp.346 – 351, (2004).

[14] M. Fliess, P. Levine, P. Martin, P. Rouchon:

Flateness and Defect of Non-linear Systems:
Introduction Theory and Applications, International
Journal of Control, Vol.61, pp.1327-1361, (1995).

[15] M. Fliss, P. Levine, P. Martin, P. Rouchon: A

Lie-Backlund Approach to Equivalence and Flatness
of Nonlinear Systems. IEEE Transaction Automatic
Control, Vol. 44, pp.922–937, (1999).

[16] H. Mounier, V. Vèque, and L. Zitoune : Flatness

and GPI for Rate Control in the DiffServ
Architecture, Chapter in Algebraic Methods in
Flatness, Signal Processing and State Estimation, pp.
119–130, (2003), ISBN 968-5785-333

Ubiquitous Computing and Communication Journal 9