Designing Information Secure Networks with Graph Theory

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientific

    Abstract

    Graph theory studies the properties of graphs and networks. Graphs are an excellent tool for designing, analysing and optimizing data networks. In a data network there are unequal components, which need different amount of information security depending on their properties. Information security includes all measures which try to prevent destruction, manipulation or stealing of information. But at the same time the information must be available for those who have the permission to access it. Computer network can be modeled with graph, where vertices are components of network such as computer, switch or database. With edges we can illustrate allowed connections between those components. Every vertex has importance value; the smaller value means that the protection of the component is more important. Software-defined networking (SDN) is a quite new approach to designing, creating and controlling computer networks. In a software-defined network all components can be directly connected. The main result of this Thesis is the algorithm twintrees, which makes software defined networks more secure and reliable, where it is hard for malware to advance. Security levels make the network segmented, which protects critical parts from threats which could spread from the less protected parts of the network. It takes time for malware to spread from higher levels to lower levels and thus it is easier to react to threat before any catastrophic happens. The algorithm, which this Thesis represents, transfers full graphs to 2-edge-connected graphs by combining two independent spanning trees. For software designed network the 2-edge-connectivity is an excellent property. With this property it is possible to remove any connection between two components so that the network remains still connected.
    Original languageEnglish
    Title of host publication7th International Conference on Cyber Conflict. Proceedings 2015
    Subtitle of host publicationArchitectures in Cyberspace
    PublisherNATO Cooperative Cyber Defence Centre of Excellence
    Number of pages12
    ISBN (Electronic)978-9949-9544-3-8
    ISBN (Print)978-9949-9544-2-1
    Publication statusPublished - 2015
    MoE publication typeB3 Non-refereed article in conference proceedings
    Event7th International Conference on Cyber Conflict, CyCon 2015 - Tallinn, Estonia
    Duration: 26 May 201529 May 2015
    Conference number: 7

    Conference

    Conference7th International Conference on Cyber Conflict, CyCon 2015
    Abbreviated titleCyCon 2015
    CountryEstonia
    CityTallinn
    Period26/05/1529/05/15

    Fingerprint

    Graph theory
    Security of data
    Computer networks
    Switches
    Malware
    Software defined networking

    Keywords

    • graph theory

    Cite this

    Vallivaara, V. (2015). Designing Information Secure Networks with Graph Theory. In 7th International Conference on Cyber Conflict. Proceedings 2015: Architectures in Cyberspace NATO Cooperative Cyber Defence Centre of Excellence.
    Vallivaara, Visa. / Designing Information Secure Networks with Graph Theory. 7th International Conference on Cyber Conflict. Proceedings 2015: Architectures in Cyberspace. NATO Cooperative Cyber Defence Centre of Excellence, 2015.
    @inproceedings{51b40ff9a6e844ea992036435f45d1bc,
    title = "Designing Information Secure Networks with Graph Theory",
    abstract = "Graph theory studies the properties of graphs and networks. Graphs are an excellent tool for designing, analysing and optimizing data networks. In a data network there are unequal components, which need different amount of information security depending on their properties. Information security includes all measures which try to prevent destruction, manipulation or stealing of information. But at the same time the information must be available for those who have the permission to access it. Computer network can be modeled with graph, where vertices are components of network such as computer, switch or database. With edges we can illustrate allowed connections between those components. Every vertex has importance value; the smaller value means that the protection of the component is more important. Software-defined networking (SDN) is a quite new approach to designing, creating and controlling computer networks. In a software-defined network all components can be directly connected. The main result of this Thesis is the algorithm twintrees, which makes software defined networks more secure and reliable, where it is hard for malware to advance. Security levels make the network segmented, which protects critical parts from threats which could spread from the less protected parts of the network. It takes time for malware to spread from higher levels to lower levels and thus it is easier to react to threat before any catastrophic happens. The algorithm, which this Thesis represents, transfers full graphs to 2-edge-connected graphs by combining two independent spanning trees. For software designed network the 2-edge-connectivity is an excellent property. With this property it is possible to remove any connection between two components so that the network remains still connected.",
    keywords = "graph theory",
    author = "Visa Vallivaara",
    note = "Project : 154300",
    year = "2015",
    language = "English",
    isbn = "978-9949-9544-2-1",
    booktitle = "7th International Conference on Cyber Conflict. Proceedings 2015",
    publisher = "NATO Cooperative Cyber Defence Centre of Excellence",
    address = "Estonia",

    }

    Vallivaara, V 2015, Designing Information Secure Networks with Graph Theory. in 7th International Conference on Cyber Conflict. Proceedings 2015: Architectures in Cyberspace. NATO Cooperative Cyber Defence Centre of Excellence, 7th International Conference on Cyber Conflict, CyCon 2015, Tallinn, Estonia, 26/05/15.

    Designing Information Secure Networks with Graph Theory. / Vallivaara, Visa.

    7th International Conference on Cyber Conflict. Proceedings 2015: Architectures in Cyberspace. NATO Cooperative Cyber Defence Centre of Excellence, 2015.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientific

    TY - GEN

    T1 - Designing Information Secure Networks with Graph Theory

    AU - Vallivaara, Visa

    N1 - Project : 154300

    PY - 2015

    Y1 - 2015

    N2 - Graph theory studies the properties of graphs and networks. Graphs are an excellent tool for designing, analysing and optimizing data networks. In a data network there are unequal components, which need different amount of information security depending on their properties. Information security includes all measures which try to prevent destruction, manipulation or stealing of information. But at the same time the information must be available for those who have the permission to access it. Computer network can be modeled with graph, where vertices are components of network such as computer, switch or database. With edges we can illustrate allowed connections between those components. Every vertex has importance value; the smaller value means that the protection of the component is more important. Software-defined networking (SDN) is a quite new approach to designing, creating and controlling computer networks. In a software-defined network all components can be directly connected. The main result of this Thesis is the algorithm twintrees, which makes software defined networks more secure and reliable, where it is hard for malware to advance. Security levels make the network segmented, which protects critical parts from threats which could spread from the less protected parts of the network. It takes time for malware to spread from higher levels to lower levels and thus it is easier to react to threat before any catastrophic happens. The algorithm, which this Thesis represents, transfers full graphs to 2-edge-connected graphs by combining two independent spanning trees. For software designed network the 2-edge-connectivity is an excellent property. With this property it is possible to remove any connection between two components so that the network remains still connected.

    AB - Graph theory studies the properties of graphs and networks. Graphs are an excellent tool for designing, analysing and optimizing data networks. In a data network there are unequal components, which need different amount of information security depending on their properties. Information security includes all measures which try to prevent destruction, manipulation or stealing of information. But at the same time the information must be available for those who have the permission to access it. Computer network can be modeled with graph, where vertices are components of network such as computer, switch or database. With edges we can illustrate allowed connections between those components. Every vertex has importance value; the smaller value means that the protection of the component is more important. Software-defined networking (SDN) is a quite new approach to designing, creating and controlling computer networks. In a software-defined network all components can be directly connected. The main result of this Thesis is the algorithm twintrees, which makes software defined networks more secure and reliable, where it is hard for malware to advance. Security levels make the network segmented, which protects critical parts from threats which could spread from the less protected parts of the network. It takes time for malware to spread from higher levels to lower levels and thus it is easier to react to threat before any catastrophic happens. The algorithm, which this Thesis represents, transfers full graphs to 2-edge-connected graphs by combining two independent spanning trees. For software designed network the 2-edge-connectivity is an excellent property. With this property it is possible to remove any connection between two components so that the network remains still connected.

    KW - graph theory

    M3 - Conference article in proceedings

    SN - 978-9949-9544-2-1

    BT - 7th International Conference on Cyber Conflict. Proceedings 2015

    PB - NATO Cooperative Cyber Defence Centre of Excellence

    ER -

    Vallivaara V. Designing Information Secure Networks with Graph Theory. In 7th International Conference on Cyber Conflict. Proceedings 2015: Architectures in Cyberspace. NATO Cooperative Cyber Defence Centre of Excellence. 2015