Centralized Routing Algorithm Based On Flow Permutations (CROSBI ID 653037)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Krile, Srećko ; Rakús, Martin ; Schindler, Frank
engleski
Centralized Routing Algorithm Based On Flow Permutations
This paper describes a centralized routing algorithm based on permutation of M traffic flows entering the network. The proposed approach is significantly less complex than combinatorial approach and can be used as load-balancing tool. The main advantage of such approach is that many non-perspective flow permutations could be eliminated from the calculation very early. If a new flow enters the network the algorithm offers one or more routing solutions, including the path migration for the existing flows. Of course, path migration will be performed only if it is necessary. Proposed heuristic algorithm significantly reduces the complexity, solving efficiently the problems with huge number of flows. In the sense of TE (Traffic Engineering) this routing technique looks like a very perspective load-balancing tool.
Centralized Traffic Routing ; Load-balancing ; Software Designed Networking - SDN ; SDN Control Plane ; MPLS DiffServ Traffic Engineering
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
68-73.
2016.
objavljeno
10.1109/TSP.2016.7760831
Podaci o matičnoj publikaciji
39TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP)
Herencsar, N
New York (NY): Institute of Electrical and Electronics Engineers (IEEE)
978-1-5090-1288-6
Podaci o skupu
39TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP)
predavanje
27.06.2016-29.06.2016
Beč, Austrija