Pregled bibliografske jedinice broj: 446630
Bandwidth Reservation in Overloaded MPLS/DiffServ Networks
Bandwidth Reservation in Overloaded MPLS/DiffServ Networks // 2009 Networking and Electronic Commerce Conference - NAEC 2009 / Bezalel Gavish (ur.).
Dallas (TX): Graduate School of Management, 2009. str. 37-45 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 446630 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Bandwidth Reservation in Overloaded MPLS/DiffServ Networks
Autori
Krile, Srećko ; Kos, Mladen ; Peraković, Dragan
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
2009 Networking and Electronic Commerce Conference - NAEC 2009
/ Bezalel Gavish - Dallas (TX) : Graduate School of Management, 2009, 37-45
ISBN
978-0-9820958-2-9
Skup
NAEC 2009 (Networking and Electronic Commerce Conference)
Mjesto i datum
Riva del Garda, Italija, 06.10.2009. - 11.10.2009
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Bandwidth reservation; traffic engineering in DiffServ/MPLS networks; constraint-based routing; congestion avoidance during SLA creation; load balancing control
Sažetak
In QoS end-to-end provisioning some bandwidth portions on the link may be reserved for certain traffic classes (and for particular set of users) so the congestion problem of concurrent flows (traversing the network simultaneously) can appear. It means that in overloaded and poorly connected MPLS/DS networks the CR (Constraint-based Routing) becomes insufficient technique. If traffic engineering (TE) is supported with appropriate traffic load control the congestion possibility can be predicted before the utilization of guaranteed service. In that sense the initial (pro-active) routing can be pre-computed much earlier, possible during SLA (Service Level Agreement) negotiation. In the paper a load simulation technique for load balancing control purpose is proposed. It could be a very good solution for congestion avoidance and for better load-balancing purpose where links are running close to capacity. To be acceptable for real application such complicated load control technique needs very effective algorithm. Proposed algorithm was tested on the network with maximum M core routers on the path and detail results are given for N=3 service classes. Further improvement through heuristic approach is made and results are discussed. Some heuristic options show significant complexity savings that is very important for load control in huge networks.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika, Računarstvo, Tehnologija prometa i transport
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb,
Fakultet prometnih znanosti, Zagreb,
Sveučilište u Dubrovniku