Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "routing telecommunication networks" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Traffic splitting in MPLS networks - a hierarchical multicriteria approach
Autorzy:
Craveirinha, J. M. F.
Cli'maco, J. C. N.
Pascoal, M. M. B.
Martins, L. M. R. A.
Powiązania:
https://bibliotekanauki.pl/articles/308582.pdf
Data publikacji:
2007
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multicriterial optimization
multicriteria shortest paths
routing telecommunication networks
Internet/MPLS
Opis:
In this paper we address a new hierarchical multicriteria routing model associated with a two-path traffic splitting routing method in MPLS networks whereby the bandwidth required by a given node-to-node traffic flow is divided by two disjoint paths. The model has two levels of objective functions and several constraints. An algorithmic approach is presented for calculating non-dominated solutions and selecting good compromise solutions to this problem. Also a number of computational experiments are presented.
Źródło:
Journal of Telecommunications and Information Technology; 2007, 4; 3-10
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Algorithm for Enumerating SRLG Diverse Path Pairs
Autorzy:
Gomes, T.
Craveirinha, J.
Powiązania:
https://bibliotekanauki.pl/articles/308463.pdf
Data publikacji:
2010
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
routing
SRLG disjoint shortest paths
telecommunication networks
Opis:
Telecommunication networks are intrinsically multi-layered, a single failure at a lower level usually corresponds to a multi-failure scenario at an upper layer. In this context, the concept of shared risk link group (SRLG) allows an upper layer to select, for a given active path (AP), a backup path (BP), which avoids every SRLG that may involve the selected AP, in the event of a failure. That is a SRLG diverse path set maybe defined as a set of paths, between an origin and a destination, such that no pair of paths can be simultaneously affected by any given failure (or risk) in a single failure scenario. Firstly we present the formulation of the SRLG di- verse path pair calculation problem in a directed network. An algorithm for enumerating SRLG diverse paths, by non decreasing cost of their total (additive) cost will be presented, which is based on an algorithm proposed for generating minimal cost node disjoint path pairs. The SRLG diverse path pairs may be node or arc disjoint, with or without length constraints. Computational results will be presented to show the efficiency of the proposed algorithm for obtaining node or arc disjoint SRLG diverse path pairs in undirected networks.
Źródło:
Journal of Telecommunications and Information Technology; 2010, 3; 5-12
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hierarchical Multiobjective Routing Model in MPLS Networks with Two Service Classes - A Comparison Case Study
Autorzy:
Girao-Silva, R.
Craveirinha, J.
Clímaco, J.
Powiązania:
https://bibliotekanauki.pl/articles/309205.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multiobjective optimization
routing models
simulation
telecommunication networks
Opis:
A two-level hierarchical multicriteria routing model for multiprotocol label switching networks with two service classes (QoS, i.e., with quality of service requirements, and best effort services) and alternative routing is reviewed in this paper. A heuristic resolution approach, where nondominated solutions are obtained throughout the heuristic run and kept in an archive for further analysis is also reviewed. In this paper, an extensive analysis of the application of this procedure to two reference test networks for various traffic matrices is presented. Also a comparison of the results of our method with a lexicographic optimization approach based on a multicommodity flow formulation using virtual networks is carried out. Finally, results of a stochastic discrete event simulation model developed for these networks will be shown to illustrate the effectiveness of the resolution approach and to assess the inaccuracies of the analytic results.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 2; 29-42
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies