You are on page 1of 4

Optimization of the Quality of Service using

modified Multiple Level Service (MMLS) for the
scheduled lightpath demand

Dhaou Gueroil Jamel Bel hadj Tahar
Institute National of technical and applicable science Graduate School of communications of Tunis, Sup'Com
INSAT Centre Urbain Nord BP 676 – 1080, Tunisia Cité Elghazela, 2083 Ariana,Tunisia
E-mail: E-mail:

Abstract-This paper addresses to optimize the quality problem of RWA by using multi level of service. The
of service (QoS) for routing and wavelength assignment existing method minimizes the number of wavelength
with objective to minimize the number of wavelengths and required to support a given set of demands. In this
the congestion in the optical network. We consider resource article, firstly, we will represent our approach to handle
allocation under the scheduled traffic model and we define the multiple levels of the service to produce solutions,
simple and double levels of service for low and high quickly, even for wide-area networks in the first part.
priority of demand. The simulation results based on
Modified multiple level of service (MMLS), using a In section 2, we represent an overview of the
minimum of wavelengths for two cases of configuration, literature related to this work. Section 3 attacks the
show that the interference effect is decreased leading, thus, routing problem, in which we describes the modified
to a significant reduce the congestion of the network. We technique MMLS (modified multiple level of service)
prove that the complexity of the formulation is lower as like
as the existing approach with reducing the number of
witch used to produce a good approximate solution for
parameters that gives better reliability and flexibility for the RWA problem. Finally, Section 4 presents numerical
high bandwidth optical network. examples and section 5 concludes the study.

Keywords: Quality of service QOS, wavelength division II. RELATED WORKS

multiplex WDM, integer linear program ILP, assignment and Allocating the resources of an optical network
routing wavelength RWA, modified multiple level service in advance is actually a special case of the static
MMLS. lightpath establishment (SLE) problem [8]. SLE is a dual
problem: 1) a network design problem in which the
objective is to minimize the number of lightpaths that
I. INTRODUCTION pass through a particular link at any given time (i.e.,
minimize congestion); and 2) a network operation
Some models of the traffic were considered for problem of maximizing the number of established
the problem of assignments and routing wavelength connections for a fixed number of wavelengths. An
(RWA) [1] in the optical networks of multiplexing integer linear program (ILP) for the original SLE
wavelength (WDM) [2]. Those include the static traffic problem has been formulated and shown to be NP-
(the set of demands are fixed and known in advance). A complete in [4] and [10]. For the design problem of
model more adapted, for this type of traffic, is the minimizing the number of wavelengths needed to
programmed model of the traffic suggested in [3.4]. In support a set of lightpaths, Banerjee and Sharan use an
this model, the setup and teardown times of the demands evolutionary algorithm in [6] to generate an approximate
are known in advance, so that the algorithm of RWA can solution. The model ILP (integer to linear program) of
optimize the attribution of resource in space and time. the traffic is based on scheduled lightpath demands
These last years, the research is devoted to design the (SLDs) which were introduced in [5]. In this model,
networks of WDM. An approach [7], the demand needs each demand is represented by five variables (s, d, n, ts,
two lightpaths, a primary (or working) path and an edge- te), where s and d are source and destination, n
disjoint backup (or protection) path. In [8], the path represents the number of circuits necessary for the
protection can be shared with other path protection even demand and the ts, te are the setup (start) and teardown
if the corresponding primary paths are edge-disjoint. In (end) times of demand. We showed the algorithms of
this work, we present a modified technique for the
connection of RWA can more effectively use resources in
the existing formulation of SLDs [1],[8],[9] ,[11]. Figure 1: The topology of a network with 8 nodes

III. THE MODIFIED TECHNIQUE MMLS D. Example of matrix of demands
A. The principle In this table, we will present a matrix of
In this article, we will present a new technique of requests with all the other data necessary for the
routing based on the method of differentiation of establishment of the calls:
services in two levels; one of high priority and the other
of low priority. The first type of service will devote a Table 1: the matrix of demands
primary lightpath and a backup lightpath. Then, the low
priority demand uses a just one type of lightpaths. In the demande πl sl dl Lightpath
normal function of the network, the backup lightpath can 1 0 1 3 Cp= 1-8-3
be used to make requests for low priority. But, when 2 1 1 4 Cp=1-2-3-4
there is on the primary education circuits, the request for Cb=1-8-3-4
low priority will be rejected and the other request will 3 0 7 6 Cp= 7-8-6
use its protective circuits. This technique offers many 4 1 7 5 Cp= 7-6-5
advantages such as the reduction in a number of circuits Cb=7-8-5
used, to reduce the congestion and at the same time to
guarantee the establishment of the significant requests
We notice the demands l1 and l2 have a same
under all the conditions.
path (3-8). When, it has been a problem at the primary
B. The parameters path of l2, the demand l1 will be rejected and l2 uses his
backup path (Cb = 1-8-3-4). Thus, the demands l 3 and l4
• The physical parameters of the network G [V,
have a same path (7-8). When, it has been a problem at
E], where V is the set of nodes, and E is the set the primary path of l4, the demand l3 will be rejected and
of links. l4 uses his backup path (Cb=7-8-5).
• K is the set of channels which each fiber can

• The parameters of demand l = {(sl, dl, nl, tsl, te)}
for the model of the scheduled programmed
traffic, the five variables sl, dl, nl, tsl and te are
defined in section II.

• πl , A priority level for each demand l ∈ L. If πl=
1, it requires l at the high priority and requires
the primary and backup path. If the πl = 0, then l
is a demand for low-priority, without backup

• Cp : the primary lightpath of each demand

• Cb: the backup lightpath of the demand for high
Figure 2: the assignment demands
C. The topology of network
E. Algorithm
We will use this topology like an example to
make our study. This algorithm used to determine the number of
1 2
Table 2: Algorithm of number of demands

1. L = number of demands
8 3 2. N: = 0 (the number of lightpaths)
7 3. For each i∈ L do setups (from 3 to 5)
4. if (πl = 1)
Give αi the primary lightpaths and βi the backup
6 4 lightpaths (we fixed αi and βi).
N1= N1 + αi + βi (With N1 the number of lighpath to
establish the demand for high priority)
5. else ( πl = 0)
Give αi the primary lightpaths (we fixed αi).
N0= N0 + αi + βi (With N0 the number of lighpaths to
establish the demand for low priority)
End if
End for
N = N1 +N0
6. Return N

This algorithm determines the number of
lighpaths of two types of demands (high and low
priority). The setup 4 permits to calculate the path for
the demand of high priority while the setup 5 allows for
the demand of low priority. Finally, we return the
number of paths for the twice types of demands.
IV. SIMULATION Figure 4: The probability of rejection of demands with number of
A. Comparison between MMLS and the existing
method of simple level of service We notice when we use only one level of service, the
In this part, we will compare the number of the two methods have almost the same number of lightpaths.
optical circuits used and the rate of rejection requests for But, the technique SLS (Simple Level of Service) is low
the two methods (our method MMLS and existing safety than our method MMLS (modified technique
method SLS (simple level of service). multiple level of service). For example, the request will
be rejected automatically on the SLS when it has been.
But, our method MMLS gives other chance for the
interesting requests (of high priority).
B. Comparison the MMLS (modified multiple level of
service) and the EMLS (multiple level of service).
This part will be devoted for the comparison of the
numbers of circuits used for our method MMLS and the
existing method.

Figure 3: Variation the number of lightpaths with number of demands

Figure 5: the assignment demands
Although, the technique EMLS used is more reliable Wavelength-Assignment in WDM Mesh Networks
but it requires an enormous quantity of lightpaths under Shared-Risk-Group Constraints",
compared to our technique MMLS. [5] H. Zang, J.P. Jue, and B. Mukherjee. A review of
routing and wavelength assignment approaches for
wavelength-routed optical WDM networks. Optical
V. CONCLUSION Networks Magazine, 1(1):pp.47-60, 2000.
In spite of the rejection of the requests for low [6] J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R.
priority in the event of defect, this method MMLS Douville, "Routing and wavelength assignment of
(modified multiple level of service) has several scheduled lightpath demands", IEEE JSAC 21 (8)
(2003),pp. 1231–1240.
advantages such as the reduction of a number of
[7] Keyao Zhu,"Ethernet-over-SONET(EoS) over
lightpaths (number wavelengths). Thus, it guaranteed the WDM in Optical Wide-Area Networks (WANs):
establishment of high priority under all the conditions. Benefits and Challenges*", in the Photonic Network
Communications, 10:1,pp 107–118, 2005
REFERENCES [8] Polina Bayvel,"Wavelength routing and optical
[1] A. Jaekel, Y. Chen, "Quality of service based burst switching in the design of future optical
resource allocation for scheduled lightpath network", in: Proc. 27 the Eur.Conf.on Opt.Comm.
demands", in: Computer Communications 30 (ECOC'01-Amsterdam).
September 2007, pp.3550–3558. [9] Paramjeet Singh, Ajay K. Sharmab, Shaveta Rani ,
[2] B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, "On service "Routing and wavelength assignment strategies", in
provisioning under a scheduled traffic model in optical networks Optical Fiber Technology 13
reconfigurable WDM optical networks", (2007), pp. 191–197.
BROADNETS October 2005, pp. 15–24. [10] R. Ramaswami and K.N. Sivarajan. "Routing and
[3] B. Wang, T. Li, C. Xin, X. Zhang, "On survivable wavelength assignment in all-optical networks".
service provisioning in WDM networks under a IEEE/ACM Transactions on Networking (TON),
scheduled traffic model", in: GLOBECOM 2005, 3(5):pp.489-500, 1995.
November–December 2005, pp. 1900–1904. [11] S. Ramamurthy, B. Mukherjee, "Survivable WDM
[4] Hui Zanga, Canhui Oub, and Biswanath mesh networks", Part I – Protection, in: Proceedings
Mukherjeeb,"Path-Protection Routing and of IEEE INFOCOM’99, 1999, pp.744–751.