Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

A Heuristic Approach for Path Provisioning in Diff-Serv Networks (CROSBI ID 485572)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Krile, Srećko ; Kos, Mladen A Heuristic Approach for Path Provisioning in Diff-Serv Networks // IEEE International Syposium on Spread Spectrum Techniques and Applications (ISSSTA'02) / Šimša, Jan (ur.). Prag: ICARIS, 2002. str. 692-696-x

Podaci o odgovornosti

Krile, Srećko ; Kos, Mladen

engleski

A Heuristic Approach for Path Provisioning in Diff-Serv Networks

To achieve QoS guaranties for predicted traffic with N quality levels in differentiated services (Diff-Serv) networks with M trunks and M-1 interior routers on the path, an efficient heuristic algorithm for end-to-end congestion control is being developed. It can be applied as an effective tool for traffic engineering (TE) in MPLS-based networks or it can be used for network dimensioning in optimal sizing of transmission trunks, minimizing the total expansion cost. The heuristic algorithm is compared with algorithm based on exact approach. In all numerical test-examples the best possible result is achieved. It is obvious that heuristic option is very effective and for all cases it is possible to find the best result but with significant savings. It means that such heuristic approach can be successfully applied for MPLS-based traffic engineering in Diff-Serv networks.

MPLS-based traffic engineering; Quality of Service in Diff-Serv networks; long-term MPLS TE.

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

692-696-x.

2002.

objavljeno

Podaci o matičnoj publikaciji

Podaci o skupu

International Syposium on Spread Spectrum Techniques and Applications (ISSSTA'02)

predavanje

02.09.2002-05.09.2002

Prag, Češka Republika

Povezanost rada

Tehnologija prometa i transport