Optimization of the latency in networks SDN

Gilles Armel KEUPONDJO SATCHOU, Nogbou Georges ANOH, Tchimou N'Takpé, Souleymane Oumtanaga

Abstract


Unlike traditional networks, software-defined networking (SDN) are characterized by a physical separation of the control and the transfer plan. Thus, a centralized controller communicates the functions of control plan to each device via the OpenFlow Protocol whenever he is asked or that it deems appropriate. This impact strongly the latency time which is important for new services or multimedia applications. In order to optimize the time of transmission in network data with SDN, the proactive approach based on the algorithm back - pressure is usually oered. However, we note that the proactive approach while reducing strongly this time, does not account settings such as the failure of a node part of the way to transfer or the breaking of a bond that greatly increases the latency time. In this document, we will propose a joint routing approach based on proactive and reactive routing. This in order to optimize the routing functions by simply placing the traffic where capacity allows, in order to avoid congestion of highly stressed parts of the network taking into account the failures and significantly reduce the time latency. Simulation results show that our proposal allows a considerable reduction of latency even when there are failures in the network.

Keywords


Software-dened Networking (SDN), routing, multi-path, latency

Full Text:

PDF PDF

References


Bui, L.; Srikant, R.; Stolyar, A. (2009); Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing, INFOCOM 2009, IEEE, 2936-2940, 2009.

Erickson, D. (2013); The beacon openflow controller, Proc. of the second ACM SIGCOMM workshop on Hot topics in software defined networking, 13-18, 2013.
https://doi.org/10.1145/2491185.2491189

Gojmerac, I.; Reichl, P.; Jansen, L. (2008); Towards low-complexity internet traffic engineering: the adaptive multi-path algorithm, Computer Networks, 52(15), 2894-2907, 2008.
https://doi.org/10.1016/j.comnet.2008.06.004

Goransson, P.; Chuck B. (2014); Software Defined Networks: A Comprehensive Approach, British Labrary Cataloguing-in-Publication Data, 2014.

Jacobson, V.; Smetters, D.K.; Thornton, J.D.; Plass, M.F; Briggs, N.H.; Braynard, R.L.( 2009); Networking named content, Proc. of the 5th Intl. Conf. on Emerging networking experiments and technologies, 1-12, 2009.

Kulkarni, S.S.; Badarla, V.(2014); On multipath routing algorithm for software defined networks, Advanced Networks and Telecommuncations Systems (ANTS), 2014 IEEE Intl. Conf. on, 1-6, 2014.

Luca, R.L.; Ciotirnae, P.; Popescu, F. (2016); Influence of the QoS Measures for VoIP Traffic in a Congested Network, Intl. J. of Computers Communications & Control, 11(3), 405-413, 2016.
https://doi.org/10.15837/ijccc.2016.3.2558

Maglaras, L.A.; Katsaros, D. (2011); Layered backpressure scheduling for delay reduction in ad hoc networks, World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2011 IEEE International Symposium on, 1-9, 2011.

Maldonado-Lopez, F.A. ; Calle, E.; Donoso, Y. (2016); Checking Multi-domain Policies in SDN, Intl. J. of Computers Communications & Control, 11(3), 428-440, 2016.
https://doi.org/10.15837/ijccc.2016.3.2560

Moeller, S.; Sridharan, A.; Krishnamachari, B.; Gnawali, O.(2010); Routing without routes: The backpressure collection protocol, Proc. of the 9th ACM/IEEE Intl. Conf. on Information Processing in Sensor Networks, 279-290, 2010.

Nithin, M.; Ao, T.; Dahai, X. (2013); Optimal link-state hop-by-hop routing, Network Protocols (ICNP), 2013 21st IEEE Intl. Conf. on, 1-10, 2013.

Pinheiro, B.; Cerqueira, E.; Abelem, A. (2016); NVP: A Network Virtualization Proxy for Software Defined Networking, Intl. J. of Computers Communications & Control, 11(5), 697-708, 2016.
https://doi.org/10.15837/ijccc.2016.5.2681

Tassiulas, L.; Ephremides, A. (1992); Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE trans- actions on automatic control, 37(12), 1936-1948, 1992.
https://doi.org/10.1109/9.182479

Tootoonchian, A.; Gorbunov, S.; Ganjali, Y. (2015); On Controller Performance in Software- Defined Networks, IEEE/Mediterranean Electrotechnical Conference, 1-6, 2015.

Ying, L.; Shakkottai, S.; Reddy, A.; Liu, S. (2011); On combining shortest-path and backpressure routing over multihop wireless networks, IEEE/ACM Transactions on Networking (TON), 19(3), 841-854, 2011.

Foodlight [Online]. http://openflowhub.org, Accessed: March 10, 2016.

OpenFlow Switch Specification [Online]. https://www.opennetworking.org/softwarede fined-standards/specifications/, Accessed: June 25, 2016.




DOI: https://doi.org/10.15837/ijccc.2018.5.3316



Copyright (c) 2018 Gilles Armel KEUPONDJO SATCHOU, Nogbou Georges ANOH, Tchimou N'Takpé, Souleymane Oumtanaga

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2016: IF=1.374. .

IJCCC is indexed in Scopus from 2008 (CiteScore 2017 = 1.04; SNIP2017 = 0.616, SJR2017 =0.326):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.