Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/91149
Title: Dynamic Multicriteria Alternative Routing for single- and multi-service reservation-oriented networks and its performance
Authors: Francisco, Catarina
Martins, Lúcia 
Medhi, Deep
Keywords: Multicriteria Optimization; QoS Routing; Dynamic Alternative Routing; Multi-service Networks; Blocking Probability; Implied Costs
Issue Date: May-2019
Publisher: Springer
Project: FCT project grant UID/MULTI/00308/2013 do INESC Coimbra 
CENTRO-01-0145-FEDER-029312 
Serial title, monograph or event: Annals of Telecommunications
Volume: 74
Issue: 11
Abstract: We propose a new Dynamic Multicriteria Alternative Routing (DMAR) method that applies to reservation-oriented networks. DMAR combines a dynamic alternative routing scheme with a periodic update of alternative paths according to a multicriteria algorithm that aims to balance the traffic between traffic flows in single-service networks and also between services in multi-service environments. We conducted extensive simulations to compare the performance of DMAR with that of other reference alternative routing schemes in single- and multi-service networks with several topologies and load scenarios, namely with non-stationary traffic. We show that DMAR efficiently adjusts to traffic changes while often presenting better network performance than the reference alternative routing schemes, particularly in the multicriteria sense.
URI: http://hdl.handle.net/10316/91149
ISSN: 0003-4347
1958-9395
DOI: 10.1007/s12243-019-00715-9
Rights: embargoedAccess
Appears in Collections:FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais
I&D INESCC - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
DMAR_April2019Final.pdf330.47 kBAdobe PDFView/Open
Show full item record

WEB OF SCIENCETM
Citations 10

1
checked on Oct 7, 2020

Page view(s)

22
checked on Oct 22, 2020

Download(s)

2
checked on Oct 22, 2020

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons