Packet Merging Effect on a Data Collection Routing Tree

We propose two packet merging policies; T-policy and N-policy, during data collections of small sized packets from a large number of sources in order to mitigate the effect of telemetry data traffic. The T-policy and N-policy are to merge small sized packets after a waiting time T and N packet arrivals, respectively. The effect of two packet merging policies on a given network is analyzed in terms of routing cost and average collection delay. The result shows that the T-policy outperforms the N-policy at most cases. However, T-policy is more sensitive to the dynamic traffic condition than N-policy.