Optimizing Data Partitioning at Broadcasting the Data on Balanced N-ary Tree Formed P2P Systems

摘要

A theoretical equation for optimizing the number of data partitioning at broadcasting the data on a balanced N-ary Tree formed peer to peer (P2P) systems is shown. The optimum partitioning number is proportional to the square root of the data size and the height of the tree. It is inversely proportional to the square root of the bandwidth of the network. If the latency between nodes becomes larger, the optimum partitioning number becomes smaller. If the number of branches of the tree becomes larger, the optimum partitioning number becomes larger. The equation was applied to a computer assisted teaching system. The computer assisted teaching system has been used for several real classes of a university.