Algorithms for simultaneous unicast and anycast flows and capacity in multilayer networks

Speaker: 

Jakub Gładysz

Date: 

10/04/2019 - 13:15

In this presentation I am goin to show models, algorithms and computational results of CFA (Capacity and Flow Assignment) problem in multi-layer networks. The idea of multilayer, based on MPLS over DWDM architecture, is as follows. The logical links given by paths allocated to demands of the upper layer are constructed using light-paths of the lower layer. In the upper layer we introduce two kinds of traffics: uni-cast (one-to-one) and any cast (one-to-one-of-many). Next I present computational results on optimization of network traffic and improvement of network parameters like total average delay, increasing network survivability, minimizing energy consumption or total network cost.

Seminar photos: 
Jakub Gładysz - Algorytmy równoczesnego wyznaczania przepustowości kanałów oraz przepływów typu unicast oraz anycast w sieciach wielowarstwowych

Author: Zbigniew Puchała | Post date: 02.04.2019 | Last modified: 30.04.2019

Historia zmian

Data aktualizacji: 30/04/2019 - 11:16; autor zmian: Jarosław Miszczak (miszczak@iitis.pl)

In this presentation I am goin to show models, algorithms and computational results of CFA (Capacity and Flow Assignment) problem in multi-layer networks. The idea of multilayer, based on MPLS over DWDM architecture, is as follows. The logical links given by paths allocated to demands of the upper layer are constructed using light-paths of the lower layer. In the upper layer we introduce two kinds of traffics: uni-cast (one-to-one) and any cast (one-to-one-of-many). Next I present computational results on optimization of network traffic and improvement of network parameters like total average delay, increasing network survivability, minimizing energy consumption or total network cost.
Data aktualizacji: 02/04/2019 - 12:19; autor zmian: Zbigniew Puchała (zbyszek@iitis.pl)

In this presentation I am goin to show models, algorithms and computational results of CFA (Capacity and Flow Assignment) problem in multi-layer networks. The idea of multilayer, based on MPLS over DWDM architecture, is as follows. The logical links given by paths allocated to demands of the upper layer are constructed using light-paths of the lower layer. In the upper layer we introduce two kinds of traffics: uni-cast (one-to-one) and any cast (one-to-one-of-many). Next I present computational results on optimization of network traffic and improvement of network parameters like total average delay, increasing network survivability, minimizing energy consumption or total network cost.
Data aktualizacji: 02/04/2019 - 12:18; autor zmian: Zbigniew Puchała (zbyszek@iitis.pl)

In this presentation I am goingo to show models, algorithms and computational results of CFA (Capacity and Flow Assignment) problem in multilayer networks. The idea of multilayer, based on MPLS over DWDM architecture, is as follows. The logical links given by paths allocated to demands of the upper layer are constructed using lightpaths of the lower layer. In the upper layer we introduce two kinds of traffics: unicast (one-to-one) and anycast (one-to-one-of-many). Next I present computational results on optimization of network traffic and improvement of network parameters like total average delay, increasing network survivability, minimizing energy consumption or total network cost.
Data aktualizacji: 02/04/2019 - 12:17; autor zmian: Zbigniew Puchała (zbyszek@iitis.pl)