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

An approach to support traffic engineering in IPv6 networks based on IPv6 facilities

Author

Listed:
  • Line Y. Becerra Sánchez

    (Universidad Católica de Pereira)

  • Jhon J. Padilla Aguilar

    (Universidad Pontificia Bolivariana)

Abstract

IPv6 is an Internet protocol with the ability to provide a large number of addresses to allow the connectivity of each existing thing to the global network. It also allows the deployment of many technologies and services of the next generation. One of the major changes that occurred in the IP header with this new version is the addition of the IPv6 flow label field, which was created with the intention of labeling packets that belong to a particular flow to provide an appropriate treatment by routers. However, this field has not been widely exploited yet, and it is being set to zero in almost all IPv6 packets. The main Internet routing problem is that said routing is based on the shortest path algorithm, which leads to the possibility of some paths being congested while others are underused. To solve the congestion problem, many solutions aiming at traffic engineering support have been proposed, but this topic remains an open issue. This paper describes a new solution to support traffic engineering based on the usage of the IPv6 flow label for providing fast packet switching, which we have called PSA-TE6. In this document, we present the PSA-TE6 operation and evaluation regarding the label space reduction, label stacking cost and its minimization. The results show that PSA-TE6 is cheaper compared to the IP/MPLS solution when there is no label stacking, and that PSA-TE6 also outperforms IP/MPLS when the stacking is enabled until achieving a 40% presence of tunnels for encapsulation levels greater than 1.

Suggested Citation

  • Line Y. Becerra Sánchez & Jhon J. Padilla Aguilar, 2019. "An approach to support traffic engineering in IPv6 networks based on IPv6 facilities," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 72(1), pages 11-27, September.
    • Handle: RePEc:spr:telsys:v:72:y:2019:i:1:d:10.1007_s11235-018-00543-7
    DOI: 10.1007/s11235-018-00543-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-018-00543-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-018-00543-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. M. Ericsson & M.G.C. Resende & P.M. Pardalos, 2002. "A Genetic Algorithm for the Weight Setting Problem in OSPF Routing," Journal of Combinatorial Optimization, Springer, vol. 6(3), pages 299-333, September.
    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. Ayşegül Altın & Bernard Fortz & Mikkel Thorup & Hakan Ümit, 2013. "Intra-domain traffic engineering with shortest path routing protocols," Annals of Operations Research, Springer, vol. 204(1), pages 65-95, April.
    2. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    3. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    4. Ricardo Silva & Mauricio Resende & Panos Pardalos, 2014. "Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm," Journal of Global Optimization, Springer, vol. 60(2), pages 289-306, October.
    5. Xi Zhang & Zhili Zhou & Dong Cheng, 2017. "Efficient path routing strategy for flows with multiple priorities on scale-free networks," PLOS ONE, Public Library of Science, vol. 12(2), pages 1-16, February.
    6. Peter Broström & Kaj Holmberg, 2006. "Multiobjective design of survivable IP networks," Annals of Operations Research, Springer, vol. 147(1), pages 235-253, October.
    7. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    8. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    9. Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    10. L. A. C. Roque & D. B. M. M. Fontes & F. A. C. C. Fontes, 2014. "A hybrid biased random key genetic algorithm approach for the unit commitment problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 140-166, July.
    11. R. M. A. Silva & M. G. C. Resende & P. M. Pardalos, 2015. "A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 710-728, October.
    12. Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro, 2016. "A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks," Journal of Global Optimization, Springer, vol. 65(4), pages 813-835, August.
    13. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
    14. Changyong Zhang, 2017. "An origin-based model for unique shortest path routing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 935-951, August.
    15. Carlos A. S. Oliveira, 2005. "An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 61-75, August.

    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:72:y:2019:i:1:d:10.1007_s11235-018-00543-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.