Pregled bibliografske jedinice broj: 140869
SLA Acceptance and Optimal Resource Distribution in End-to-End QoS Routing
SLA Acceptance and Optimal Resource Distribution in End-to-End QoS Routing // Proceedings Of 11th International Conference on Software, Telecommunications & Computer Networks - SoftCOM 2003 / Dinko Begušić, Nikola Rožić (ur.).
Split: Sveučilište u Splitu, 2003. str. 326-330 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 140869 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
SLA Acceptance and Optimal Resource Distribution in End-to-End QoS Routing
Autori
Krile, Srećko ; Šarić, Slavko
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings Of 11th International Conference on Software, Telecommunications & Computer Networks - SoftCOM 2003
/ Dinko Begušić, Nikola Rožić - Split : Sveučilište u Splitu, 2003, 326-330
Skup
SoftCOM 2003 (Software, Telecommunications & Computer Networks)
Mjesto i datum
Ancona, Italija; Venecija, Italija; Dubrovnik, Hrvatska; Split, Hrvatska, 07.10.2003. - 10.10.2003
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
quality of service in DiffServ networks; constrained-based path selection; end-to-end QoS routing; SLA creation; traffic handling mechanisms
Sažetak
The classification of the aggregated flows on input of core routers in DiffServ-based networks is performed according to the SLA (Service-Level Agreement), signed between a customer and the ISP. To obtain quantitative end-to-end QoS guarantees in DiffServ architecture, based on traffic handling mechanisms with aggregate flows, some kind of congestion control through negotiation process in new SLA creation is necessary. The basic condition is that predicted traffic demands (existing SLAs) must be satisfied at any moment (contract has a time limit), using optimal resource distribution. For N quality-of-service levels (service classes) an efficient heuristic algorithm for end-to-end congestion control is being developed. The problem is seen as an expansion problem of link capacity in given limits from the common source. If the optimal expansion sequence has any link expansion that exceeds allowed limits (existing link capacity), then new SLA must be rejected or redefined through negotiation process.
Izvorni jezik
Engleski