https://www.mdu.se/

mdh.sePublikasjoner
Endre søk
Link to record
Permanent link

Direct link
Westerback, Thomas
Publikasjoner (7 av 7) Visa alla publikasjoner
Fiaschi, G., Vitucci, C., Westerback, T., Sundmark, D. & Nolte, T. (2026). Methods for Path Set Attribute Calculation in Network Systems. In: Proceedings of the 2026 IEEE International Conference on Computer, Information, and Telecommunication Systems, CITS 2026: . Paper presented at 2026 IEEE International Conference on Computer, Information, and Telecommunication Systems, CITS 2026, 22-24 June 2026, Piraeus-Athens, Greece. Institute of Electrical and Electronics Engineers (IEEE)
Åpne denne publikasjonen i ny fane eller vindu >>Methods for Path Set Attribute Calculation in Network Systems
Vise andre…
2026 (engelsk)Inngår i: Proceedings of the 2026 IEEE International Conference on Computer, Information, and Telecommunication Systems, CITS 2026, Institute of Electrical and Electronics Engineers (IEEE) , 2026Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In graph theory and its applications to networking, such as telecommunications or transportation, path-finding is a central problem. While single-path algorithms are well established, methods for handling sets of multiple paths are less developed. A companion paper introduced a formal model for defining attributes over sets of paths based on their structural properties; this paper addresses that model's practical implementation. We present an optimized algorithm for computing cut sets of a path set - a nontrivial task that can be infeasible without efficient methods - and validate its performance via systematic benchmarks on network simulations of varying complexity. Additionally, we introduce a vectorized computational framework that expresses property calculations as matrix operations, enabling concise implementations in array-oriented languages. Together, these contributions establish practical foundations for the companion model, demonstrating that its implementation is both feasible and characterized by predictable, acceptable execution times.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2026
Emneord
Error Probability;, Network optimization, Path set characterization, Routing, Graph theory, Error probabilities, Graph theory applications, In networks, Network systems, Path set, Property, Routings, Benchmarking
HSV kategori
Identifikatorer
urn:nbn:se:mdh:diva-78919 (URN)10.1109/CITS70307.2026.11637265 (DOI)2-s2.0-105048344569 (Scopus ID)9798319529589 (ISBN)
Konferanse
2026 IEEE International Conference on Computer, Information, and Telecommunication Systems, CITS 2026, 22-24 June 2026, Piraeus-Athens, Greece
Tilgjengelig fra: 2026-09-04 Laget: 2026-09-04 Sist oppdatert: 2026-09-04bibliografisk kontrollert
Fiaschi, G., Vitucci, C., Westerback, T., Sundmark, D. & Nolte, T. (2025). A Formal Model for Path Set Attribute Calculation in Network Systems. In: 2025 International Symposium on Networks, Computers and Communications (ISNCC): . Paper presented at 2025 International Symposium on Networks, Computers and Communications (ISNCC) (pp. 1-8). Institute of Electrical and Electronics Engineers (IEEE)
Åpne denne publikasjonen i ny fane eller vindu >>A Formal Model for Path Set Attribute Calculation in Network Systems
Vise andre…
2025 (engelsk)Inngår i: 2025 International Symposium on Networks, Computers and Communications (ISNCC), Institute of Electrical and Electronics Engineers (IEEE) , 2025, s. 1-8Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In graph theory and its practical networking applications, e.g., telecommunications and transportation, the problem of finding paths has particular importance. Selecting paths requires giving scores to the alternative solutions to drive a choice. While previous studies have provided comprehensive evaluation of single-path solutions, the same level of detail is lacking when considering sets of paths. This paper emphasizes that the path characterization strongly depends on the properties under consideration. While property-based characterization is also valid for single paths, it becomes crucial to analyse multiple path sets. From the above consideration, this paper proposes a mathematical approach, defining a functional model that lends itself well to characterizing the path set in its general formulation. The paper shows how the functional model contextualizes specific attributes.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2025
Serie
International Symposium on Networks, Computers and Communications, ISSN 2768-0940
HSV kategori
Identifikatorer
urn:nbn:se:mdh:diva-74717 (URN)10.1109/isncc66965.2025.11250449 (DOI)2-s2.0-105031405278 (Scopus ID)978-1-6654-5769-9 (ISBN)
Konferanse
2025 International Symposium on Networks, Computers and Communications (ISNCC)
Forskningsfinansiär
Knowledge Foundation
Tilgjengelig fra: 2025-12-02 Laget: 2025-12-02 Sist oppdatert: 2026-03-11bibliografisk kontrollert
Vitucci, C., Westerback, T., Sundmark, D., Forsberg, H., Nolte, T. & Jägemar, M. (2024). A Deductive Fault Analysis Method Based on Hypergraphs. In: IFAC-PapersOnLine: . Paper presented at 12th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes SAFEPROCESS 2024: Ferrara, Italy, June 4 – 7, 2024 (pp. 378-383). Elsevier B.V. (4)
Åpne denne publikasjonen i ny fane eller vindu >>A Deductive Fault Analysis Method Based on Hypergraphs
Vise andre…
2024 (engelsk)Inngår i: IFAC-PapersOnLine, Elsevier B.V. , 2024, nr 4, s. 378-383Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Fault tree analysis is a system malfunction hazard evaluation quantitative and qualitative procedure. The method is well-known and widely used, especially in the safety systems domain, where it is a mandatory integral part of the so-called "Hazard Evaluation"documentation. This paper proposes an alternative or complementary deductive fault analysis method: it uses system topology to build a hypergraph representation of the system to identify component criticality and support loss of functionality probability evaluation. Once automated, the proposed method seems promising when the system engineers explore the different architectures. They may have indication about architecture's reliability without continuous feedback from the system safety team. The system safety team must check the solution once the engineers select the final architecture. They can also use the proposed method to validate the correctness of the fault tree analysis.

sted, utgiver, år, opplag, sider
Elsevier B.V., 2024
Serie
IFAC-PapersOnLine, ISSN 2405-8963
Emneord
cut set level, fault analysis, hypergraph, loss of function probability, Accident prevention, Hazards, Reliability analysis, Trees (mathematics), Cut sets, Fault analysis methods, Fault tree analyses (FTA), Hazard evaluation, Hyper graph, System domain, System safety, Fault tree analysis
HSV kategori
Identifikatorer
urn:nbn:se:mdh:diva-68416 (URN)10.1016/j.ifacol.2024.07.247 (DOI)001296047100064 ()2-s2.0-85202861493 (Scopus ID)
Konferanse
12th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes SAFEPROCESS 2024: Ferrara, Italy, June 4 – 7, 2024
Tilgjengelig fra: 2024-09-11 Laget: 2024-09-11 Sist oppdatert: 2025-10-10bibliografisk kontrollert
Freij-Hollanti, R., Grezet, M., Hollanti, C. & Westerback, T. (2021). Cyclic flats of binary matroids. Advances in Applied Mathematics, 127, Article ID 102165.
Åpne denne publikasjonen i ny fane eller vindu >>Cyclic flats of binary matroids
2021 (engelsk)Inngår i: Advances in Applied Mathematics, ISSN 0196-8858, E-ISSN 1090-2074, Vol. 127, artikkel-id 102165Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

In this paper, first steps are taken towards characterizing rank-decorated lattices of cyclic flats Z(M) that belong to matroids M that can be represented over a prescribed finite field F-q. Two natural maps from Z(M) to the lattice of cyclic flats of a minor of M are given. Binary matroids are characterized via their lattice of cyclic flats. It is shown that the lattice of cyclic flats of a simple binary matroid without isthmuses is atomic.

sted, utgiver, år, opplag, sider
ACADEMIC PRESS INC ELSEVIER SCIENCE, 2021
Emneord
Cyclic flats, Binary matroids, Atomic lattices
HSV kategori
Identifikatorer
urn:nbn:se:mdh:diva-54126 (URN)10.1016/j.aam.2021.102165 (DOI)000636081100005 ()2-s2.0-85100033597 (Scopus ID)
Tilgjengelig fra: 2021-05-10 Laget: 2021-05-10 Sist oppdatert: 2025-10-10bibliografisk kontrollert
Grezet, M., Freij-Hollanti, R., Westerback, T. & Hollanti, C. (2019). Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. IEEE Transactions on Information Theory, 65(10), 6089-6100, Article ID 8700214.
Åpne denne publikasjonen i ny fane eller vindu >>Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
2019 (engelsk)Inngår i: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 65, nr 10, s. 6089-6100, artikkel-id 8700214Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been carried out to understand the optimal rate-distance tradeoff, but only recently the size of the alphabet has been taken into account. In this paper, a novel definition of locality is proposed to keep track of the precise number of nodes required for a local repair when the repair sets do not yield MDS codes. Then, a new alphabet-dependent bound is derived, which applies both to the new definition and the initial definition of locality. The new bound is based on consecutive residual codes and intrinsically uses the Griesmer bound. A special case of the bound yields both the extension of the Cadambe-Mazumdar bound and the Singleton-type bound for codes with locality (r, delta), implying that the new bound is at least as good as these bounds. Furthermore, an upper bound on the asymptotic rate-distance tradeoff of LRCs is derived, and yields the tightest known upper bound for large relative minimum distances. Achievability results are also provided by deriving the locality of the family of Simplex codes together with a few examples of optimal codes.

sted, utgiver, år, opplag, sider
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Emneord
Locally repairable codes (LRCs), upper bound, Griesmer bound
HSV kategori
Forskningsprogram
matematik/tillämpad matematik
Identifikatorer
urn:nbn:se:mdh:diva-46332 (URN)10.1109/TIT.2019.2911595 (DOI)000487041200008 ()2-s2.0-85077357211 (Scopus ID)
Tilgjengelig fra: 2019-12-13 Laget: 2019-12-13 Sist oppdatert: 2025-10-10bibliografisk kontrollert
Grezet, M., Westerback, T., Freij-Hollanti, R. & Hollanti, C. (2019). Uniform Minors in Maximally Recoverable Codes. IEEE Communications Letters, 23(8), 1297-1300
Åpne denne publikasjonen i ny fane eller vindu >>Uniform Minors in Maximally Recoverable Codes
2019 (engelsk)Inngår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 23, nr 8, s. 1297-1300Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matroid theory and the relation between MDS codes and uniform minors, the list of all the possible uniform minors is derived. This list is used to improve the known non-asymptotic lower bound on the required field size of a maximally recoverable code.

sted, utgiver, år, opplag, sider
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Emneord
Distributed storage, locally repairable codes, maximally recoverable codes, uniform minors, field size
HSV kategori
Identifikatorer
urn:nbn:se:mdh:diva-45093 (URN)10.1109/LCOMM.2019.2921540 (DOI)000480653100004 ()
Tilgjengelig fra: 2019-08-28 Laget: 2019-08-28 Sist oppdatert: 2025-10-10bibliografisk kontrollert
Westerback, T., Britz, T. & Shiromoto, K. (2015). Demi-matroids from codes over finite Frobenius rings. Designs, Codes and Cryptography, 75(1), 97-107
Åpne denne publikasjonen i ny fane eller vindu >>Demi-matroids from codes over finite Frobenius rings
2015 (engelsk)Inngår i: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 75, nr 1, s. 97-107Artikkel i tidsskrift (Fagfellevurdert) Published
HSV kategori
Forskningsprogram
matematik/tillämpad matematik
Identifikatorer
urn:nbn:se:mdh:diva-50958 (URN)10.1007/s10623-013-9895-3 (DOI)000351158100008 ()2-s2.0-84925290595 (Scopus ID)
Tilgjengelig fra: 2020-09-29 Laget: 2020-09-29 Sist oppdatert: 2025-10-10bibliografisk kontrollert
Organisasjoner