Open AccessModel of secure routing based on determining the maximum number of disjoint paths to minimize the probability of compromise the confidential messages
Author(s) -
Олександр Лемешко,
А. С. Еременко,
Anatoliy Persikov,
Batoul Sleiman
Publication year - 2019
Publication title -
radiotekhnika
Language(s) - English
Resource type - Journals
eISSN - 2786-5525
pISSN - 0485-8972
DOI - 10.30837/rt.2019.2.197.03
Subject(s) - disjoint sets , compromise , routing (electronic design automation) , integer programming , computer science , confidentiality , integer (computer science) , computer network , mathematics , algorithm , computer security , discrete mathematics , programming language , social science , sociology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom