IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v79y2022i1d10.1007_s11235-021-00841-7.html
   My bibliography  Save this article

Intra and inter-flow link aggregation in SDN

Author

Listed:
  • Ronaldo R. R. Junior

    (Universidade Federal de Minas Gerais)

  • Marcos A. M. Vieira

    (Universidade Federal de Minas Gerais)

  • Luiz F. M. Vieira

    (Universidade Federal de Minas Gerais)

  • Antonio A. F. Loureiro

    (Universidade Federal de Minas Gerais)

Abstract

Link saturation is a problem in computer networks. We propose a link aggregation solution that is robust and solves this problem. The approach consists of creating a virtual link by combining multiple physical interfaces, summing up their bandwidth. Besides increasing the data transmission throughput, this type of solution enables a fast and clear repair in the case of link unavailability. Since Software-Defined Networking usage is increasing daily in business scenarios, this work demonstrates a way to create link aggregation in such situations. This led to the improvement of services availability, among many advantages. To achieve that, we defined and implemented a system with self-adaptive link aggregation. We study the intra-flow and inter-flow link aggregation. To evaluate the implementation, we created three algorithms under different conditions: Virtual Round-Robin, Traffic Analysis, and Hash Table. We evaluated the three algorithms in real-world and virtual scenarios. We used the Ryu controller and, for packet switching, the OVS (Open vSwitch) and BPFabric. Virtual Round-Robin achieved 95% of fairness and Hash Table provided higher throughput.

Suggested Citation

  • Ronaldo R. R. Junior & Marcos A. M. Vieira & Luiz F. M. Vieira & Antonio A. F. Loureiro, 2022. "Intra and inter-flow link aggregation in SDN," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 79(1), pages 95-107, January.
    • Handle: RePEc:spr:telsys:v:79:y:2022:i:1:d:10.1007_s11235-021-00841-7
    DOI: 10.1007/s11235-021-00841-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-021-00841-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-021-00841-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lucas A. M. Silva & Marcos A. M. Vieira & Dorgival Guedes & Ronaldo A. Ferreira, 2020. "Software-defined networking with services oriented by domain names," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 74(1), pages 67-82, May.
    2. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Briskorn, Dirk & Horbach, Andrei, 2009. "A Lagrangian approach for minimum cost tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 647, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    3. Jaeseob Han & Seung-Hyun Jeon & Gyeong-Ho Lee & Sangdon Park & Jun-Kyun Choi, 2023. "Power and Frequency Band Allocation Mechanisms for WPT System with Logarithmic-Based Nonlinear Energy Harvesting Model," Sustainability, MDPI, vol. 15(13), pages 1-27, July.
    4. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    5. Jari Kyngäs & Kimmo Nurmi & Nico Kyngäs & George Lilley & Thea Salter & Dries Goossens, 2017. "Scheduling the Australian Football League," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 973-982, August.
    6. Dries Goossens & Jeroen Beliën, 2023. "Teaching Integer Programming by Scheduling the Belgian Soccer League," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 164-172, May.
    7. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    8. Guillermo Durán & Mario Guajardo & Facundo Gutiérrez & Javier Marenco & Denis Sauré & Gonzalo Zamorano, 2021. "Scheduling the Main Professional Football League of Argentina," Interfaces, INFORMS, vol. 51(5), pages 361-372, September.
    9. Yi, Xiajie & Goossens, Dries & Nobibon, Fabrice Talla, 2020. "Proactive and reactive strategies for football league timetabling," European Journal of Operational Research, Elsevier, vol. 282(2), pages 772-785.
    10. Briskorn, Dirk, 2009. "A branching scheme for minimum cost tournaments with regard to real world constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 643, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Hoshino, Richard & Kawarabayashi, Ken-ichi, 2011. "A multi-round generalization of the traveling tournament problem and its application to Japanese baseball," European Journal of Operational Research, Elsevier, vol. 215(2), pages 481-497, December.
    12. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    13. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    14. Roel Lambers & Dries Goossens & Frits C. R. Spieksma, 2023. "The flexibility of home away pattern sets," Journal of Scheduling, Springer, vol. 26(5), pages 413-423, October.
    15. Alireza Tajbakhsh & Kourosh Eshghi & Azam Shamsi, 2012. "A hybrid PSO-SA algorithm for the travelling tournament problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 2-25.
    16. Stephan Westphal, 2014. "Scheduling the German Basketball League," Interfaces, INFORMS, vol. 44(5), pages 498-508, October.
    17. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    18. Deligiannis, Michalis & Liberopoulos, George & Benioudakis, Myron, 2023. "Dynamic supplier competition and cooperation for buyer loyalty on service," International Journal of Production Economics, Elsevier, vol. 255(C).
    19. Fernando Alarcón & Guillermo Durán & Mario Guajardo & Jaime Miranda & Hugo Muñoz & Luis Ramírez & Mario Ramírez & Denis Sauré & Matías Siebert & Sebastián Souyris & Andrés Weintraub & Rodrigo Wolf-Yad, 2017. "Operations Research Transforms the Scheduling of Chilean Soccer Leagues and South American World Cup Qualifiers," Interfaces, INFORMS, vol. 47(1), pages 52-69, February.
    20. Elizabeth L. Bouzarth & Benjamin C. Grannan & John M. Harris & Kevin R. Hutson, 2022. "Scheduling the Valley Baseball League," Interfaces, INFORMS, vol. 52(2), pages 189-197, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:79:y:2022:i:1:d:10.1007_s11235-021-00841-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.