Table 4.

Time complexity and communication cost comparison.

Proposed algorithm	Existing algorithm
$\mathrm{\text{Computation time}}=O\left(\frac{P}{N}+logk\right)+O\left(Plog\frac{1}{ϵ}\right)$	$\mathrm{\text{Computation time}}=O\left(Plogklog\frac{1}{ϵ}\right)+O\left(Plog\frac{1}{ϵ}\right)$
Communication cost = O(Nk)+O(Pk)	$\mathrm{\text{Communication cost}}=O\left(Pklog\frac{1}{ϵ}\right)$
Communication time = O(N)	$\mathrm{\text{Communication time}}=O\left(Plog\frac{1}{ϵ}logk\right)$