About one of the methods for solving problems in QoS routing

A fundamental problem in QoS (quality-of-service) routing is the multi-constrained path (MCP) problem. The MCP problem used the shortest path with respect to a single edge weighting function as an approximate solution to MCP. For solving MCP problem was offered a lot of methods. One of these methods...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings (IEEE International Siberian Conference on Control and Communications. Online) S. 1 - 4
Hauptverfasser: Abramkina, Olga A., Shuvalov, Vyacheslav P.
Format: Tagungsbericht Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.05.2016
Schlagworte:
Algorithms
Approximation
Approximation algorithms
Conferences
Delays
Lagrangian functions
Mathematical analysis
MCP-problem
method of Lagrange
Minimum cost
Multi-constraint routing
QoS-routing
Quality of service
Quality of service architectures
Receiving
Routing
Shortest-path problems
ISSN:2380-6516
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fundamental problem in QoS (quality-of-service) routing is the multi-constrained path (MCP) problem. The MCP problem used the shortest path with respect to a single edge weighting function as an approximate solution to MCP. For solving MCP problem was offered a lot of methods. One of these methods is based on Lagrangian Relaxation. These algorithms allow finding the shortest paths from the source to the receiving based on metrics with the minimum cost among all possible paths. This new algorithm is a complex mathematical realization, but has the most accurate calculations.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2380-6516
DOI:10.1109/SIBCON.2016.7491669