Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- ethnology and cultural anthropology (Humanities)
- information and communication technology (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- heritage protection and conservation of monuments (Engineering and Technology)
- family studies (Family studies)
- economics and finance (Social studies)
- management and quality studies (Social studies)
- international relations (Social studies)
- computer and information sciences (Natural sciences)
(Field of Science)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 140 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 140 | Ministry scored journals list 2024 |
| 2023 | 140 | Ministry Scored Journals List |
| 2022 | 140 | Ministry Scored Journals List 2019-2022 |
| 2021 | 140 | Ministry Scored Journals List 2019-2022 |
| 2020 | 140 | Ministry Scored Journals List 2019-2022 |
| 2019 | 140 | Ministry Scored Journals List 2019-2022 |
| 2018 | 25 | A |
| 2017 | 25 | A |
| 2016 | 25 | A |
| 2015 | 25 | A |
| 2014 | 25 | A |
| 2013 | 20 | A |
| 2012 | 25 | A |
| 2011 | 25 | A |
| 2010 | 27 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 4.4 |
| Year | Points |
|---|---|
| 2023 | 4.4 |
| 2022 | 3.9 |
| 2021 | 5.2 |
| 2020 | 3.8 |
| 2019 | 3.4 |
| 2018 | 2.2 |
| 2017 | 2.4 |
| 2016 | 2.2 |
| 2015 | 2.2 |
| 2014 | 2.1 |
| 2013 | 2.3 |
| 2012 | 2 |
| 2011 | 2 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 10
Catalog Journals
Year 2024
-
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements
PublicationIn Software Defined Networks (SDN) packet data switches are configured by a limited number of SDN controllers, which respond to queries for packet forwarding decisions from the switches. To enable optimal control of switches in real time the placement of controllers at network nodes must guarantee that the controller-to-controller and switch-to-controller communications delays are bounded. Apart from the primary controllers that...
Year 2021
-
An efficient approach to optimization of semi‐stable routing in multicommodity flow networks
Publication
Year 2020
Year 2017
-
Toward Fast Calculation of Communication Paths for Resilient Routing
PublicationUtilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...
Year 2013
-
Complexity of a classical flow restoration problem
Publication -
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
Year 2010
-
On the complexity of resilient network design
Publication -
SNDlib 1.0—Survivable Network Design Library
Publication
Year 2009
-
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
PublicationPraca dotyczy problemu minimalizacji energii poprzez selektywne odłączanie urządzeń komunikacyjnych w wielointerfejsowych sieciach bezprzewodowych w taki sposób, by zapewnić realizację wymaganego grafu połączeń. Sformułowano problem optymalizacyjny, podano wyniki dotyczące jego trudności i zaproponowano algorytmy optymalizacyjne. Rozważono zarówno wariant, w którym liczba interfejsów komunikacyjnych jest parametrem stałym (narzuconym...
-
On the complexity of distributed graph coloring with local minimality constraints
PublicationArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
seen 574 times