Académique Documents
Professionnel Documents
Culture Documents
Gordana Gardasevic
I. INTRODUCTION
Recent advances in broadband technologies have led to
tremendous growth of Internet applications and huge increases
in the average amount of bandwidth consumed per user [1].
The recent explosion of the Machine-to-Machine (M2M)
communications and the Internet-of-Things (IoT) applications
additionally contributes to rapid increase in bandwidth
demand. This poses serious challenges to providing acceptable
Quality of Service (QoS). Adding more resources to the
network may temporarily relieve congestion conditions, but it
cannot be economically justified in the long-term. Thus, there
is an ever-rising expectation from routing algorithms to
provide the efficient use of the available network resources.
However, today's networks dominantly use Shortest Path First
(SPF) algorithms to calculate routes. Since this entails that
traffic flows with the same destination IP address often use
overlapping routes, users may encounter poor quality of
experience, while the network resources are underutilized most
of the time [2]. This could be particularly problematic for
applications that require specific performance guarantees, such
as Voice over IP (VoIP), video conferencing or video-ondemand services.
The concept of dynamic routing has been introduced with the
aim of providing more efficient usage of network resources.
These algorithms usually make routing decisions by
considering the "current" load of each link [3]. Although the
OSPF (Open Shortest Path First) protocol has a QoS extension
that enables distributions of such information across the
network [4], dynamic routing is still not implemented in the
This work is supported by the Montenegrin Ministry of Science under grant
01-451/2012 (FIRMONT) and EU FP7 project Fore-Mont (Grant Agreement
No. 315970 FP7-REGPOT-CT-2013) http://www.foremont.ac.me.
Routing module
UDP
measurements
UDP routes
Computation of routes
Statistics gathering
Querry list
Topology discovery
Openflow interface
OpenFlow network
(1)
1
,0 BWP 1
residual _ bandwidth
(2)
45
SPF
MIRA-BE
DORA-BE (BWP=0.9)
DORA-BE (BWP=0.5)
SWP-BE
40
35
30
25
20
15
10
50
75
100
125
150
results also show that the routing over the paths with highest
available bandwidth (SWP-BE algorithm) offers the visible
improvement to the performances of SPF algorithm, and yet
remains simple for the implementation. In our future work we
plan to explore and implement traffic engineering mechanisms
that provide performance guarantees for the priority traffic
flows, but additionally tend to maximize the performance of
best-effort traffic. The performance study might be augmented
with the analysis of the number of rejected QoS requests and
number of flows requiring a re-routing after link failure.
Scalability of the dynamic routing solutions is in large part
determined by complexity and efficiency of the mechanisms
for network state monitoring. Therefore, more design options
for the controller's statistics gathering module should be
explored.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
[23]