Знаходження максимального зваженого потоку в комп’ютерних мережах нового покоління
The problem of finding maximal weighted flow (MWF) in new generation networks is considered. The principal differences of the considered problem from the classical one constitute therein that several classes of flows are transmitted in a network and non-linear constraints on Quality of Service (QoS)...
Gespeichert in:
| Datum: | 2017 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | Russisch |
| Veröffentlicht: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2017
|
| Schlagworte: | |
| Online Zugang: | http://journal.iasa.kpi.ua/article/view/119450 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | System research and information technologies |
Institution
System research and information technologies| Zusammenfassung: | The problem of finding maximal weighted flow (MWF) in new generation networks is considered. The principal differences of the considered problem from the classical one constitute therein that several classes of flows are transmitted in a network and non-linear constraints on Quality of Service (QoS) are introduced. The theorem about properties of a maximal weighted flow is proved and optimality conditions for a maximal weighted flow under constraints on QoS obtained. The algorithm of finding MWF under constraints on QoS for different classes of flows is developed. The algorithm may be applied for survivability estimation in communication networks with perspective technologies. |
|---|