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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings (IEEE International Siberian Conference on Control and Communications. Online) s. 1 - 4
Hlavní autori:	Abramkina, Olga A., Shuvalov, Vyacheslav P.
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!