DocumentCode :
3364691
Title :
Computational complexity of the network routing logical security assessment process
Author :
Llorens, Cedric ; Valois, Denis ; Le Teigner, Yannick ; Gibouin, Alexandre
Author_Institution :
Network Security Dept., Equant, Paris, France
fYear :
2003
fDate :
24-24 March 2003
Firstpage :
37
Lastpage :
47
Abstract :
We present how to assess the network routing logical security policy of an Internet Service Provider network, through a reverse-engineering process performed on the network router configurations. The paper covers the definition of a network routing logical security policy and how to implement it in the network router configurations. In addition, it details the algorithms and their asymptotic time complexity required to assess this security policy.
Keywords :
Internet; computational complexity; graph theory; reverse engineering; telecommunication network routing; telecommunication security; Internet Service Provider network; asymptotic time complexity; computational complexity; network router configurations; network routing logical security assessment process; reverse engineering process; security policy; Business continuity; Computational complexity; Computer bugs; Computer network management; Electronic mail; Graph theory; Protection; Routing protocols; Service oriented architecture; Web and internet services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Assurance, 2003. IWIAS 2003. Proceedings. First IEEE International Workshop on
Conference_Location :
Darmstadt, Germany
Print_ISBN :
0-7695-1886-9
Type :
conf
DOI :
10.1109/IWIAS.2003.1192457
Filename :
1192457
Link To Document :
بازگشت