Titlebook: Distributed Computer and Communication Networks; 23rd International C Vladimir M. Vishnevskiy,Konstantin E. Samouylov,Dm Conference proceed

Washington

書目名稱Distributed Computer and Communication Networks影響因子(影響力)




書目名稱Distributed Computer and Communication Networks影響因子(影響力)學(xué)科排名




書目名稱Distributed Computer and Communication Networks網(wǎng)絡(luò)公開度




書目名稱Distributed Computer and Communication Networks網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Distributed Computer and Communication Networks被引頻次




書目名稱Distributed Computer and Communication Networks被引頻次學(xué)科排名




書目名稱Distributed Computer and Communication Networks年度引用




書目名稱Distributed Computer and Communication Networks年度引用學(xué)科排名




書目名稱Distributed Computer and Communication Networks讀者反饋




書目名稱Distributed Computer and Communication Networks讀者反饋學(xué)科排名

concubine

Research on Using the AODV Protocol for a LoRa Mesh Networkh changing various parameters. In the experiments results, the end-to-end delay and packet loss ratio were analyzed in the dependence on the number of nodes and packet size in the network. The simulation results show that the latency is relatively high in the LoRa mesh network, but it might be accepted for some applications.

無能性

Architecture and Functionality of the Collective Operations Subnet of the Angara Interconnectits characteristics based on the simulation modeling and actual operation. The proposed solutions allow bringing the time complexity of the collective operations execution to the theoretical limit for the kD-torus topology network.

報(bào)復(fù)

概觀

禁令

https://doi.org/10.1057/9780230629370g platforms to create the acquisition network. Variants of implementation of the interaction protocol and methods of organizing secure data transmission, taking into account the peculiarities of the problem being solved, are recommended.

禁令

Axillary

越自我

https://doi.org/10.1007/978-3-642-88410-8lgebraic perspective. Conditions for loop free routing and the relations between them were presented algebraically and proved correct. Then, we investigate loop free routing in the presence and the absence of monotonicity. Our goal is to provide theory for loop free routing with an arbitrary metric.

江湖騙子