Shortest path routing optimised for network utilisation
The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increa...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The shortest path routing method has an optimal routing path (Pi(Z)) within the communications network initially determined in dependence on the communications link costs (LK(L)), with evaluation of a communications traffic loading parameter (V(L)) for each of the communications links (L) and increasing of the communications link cost in dependence on a high traffic loading parameter value, with subsequent updating of the optimal routing path. |
|---|