Investigation of architecture of Internet secured segments

One of the main problems of working with Secured parts of Internet is absence of full and actual list of it's nodes. This problem comes from complexity of the searching for resource addresses. More than that, lifetime of most Internet secured segments nodes are really small, comparing with resources of Visible Net. This paper describes the ways of generating lists of Internet secured segments nodes, provides the algorithm for constructing a dynamically updated list. In our implementation of this algorithm, directed graph of linked resources is obtained. It makes further resource analysis easier. In addition, some statistics of resources lifetime after their discovery is provided.