期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2013
期号：59
语种：English
出版社：National Technical University of Ukraine
摘要：In this article was proposed a method of selecting clients, taking into account the physical location of peers and the delay between them. The shortest path between clients in the relevant AS is based on constructing a graph of the closest autonomous systems. The analysis of the dependence of the load factor on the number of customers and placing them in different autonomous systems is adopted.
