A minimum interference routing algorithm with reduced computational complexity

DOI10.1016/J.COMNET.2005.06.015MaRDI QIDQ2507263zbMATH OpenOpenAlexFDO

Authors Gustavo B. Figueiredo, Nelson L. S. Da Fonseca, José Augusto Suruagy Monteiro

Publication date 10 October 2006

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2005.06.015

zbMATH Keywords

minimum interference routingMPLStraffic engineering

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Routing algorithms under mutual interference constraints
• scientific article; zbMATH DE number 2088594
• Study of minimum interference routing algorithm for MPLS traffic engineering
• An integrated approach to routing and via minimization
• An efficient lower bound algorithm for channel routing
• A minimum-hop routing algorithm based on distributed information
• scientific article; zbMATH DE number 4085576

Cited in

(3)

• A new algorithm for improving network performance by minimizing the number of edge overlaps
• Advanced routing algorithms to reduce time complexity in mobile corporative network
• Study of minimum interference routing algorithm for MPLS traffic engineering

This page was built for publication: A minimum interference routing algorithm with reduced computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2507263)