TCP in casting referred to as one of the complex problems in the data center, which receives a huge amount of traffic volume from n number of senders. There are many methods proposed to solve the TCP Incast problem. In this paper, there are two steps proposed: (i) grouping sender nodes using the k-means algorithm and (ii) handling incoming packets from the senders after grouping. Grouping senders make it easy to handle the incoming packets effectively as the complexity reduces reasonably. This is achieved through the k-means algorithm that groups the senders and makes a priority queue for each group. The second step can be achieved through Pro-Ack (Pro-Acknowledgement) control in one of the methods for handling a huge volume of data at the receiver side. We demonstrated how the incoming packets can be processed and handled effectively through Pro-Ack control with the help of the k-means algorithm. Along with the above concepts, the robust algorithm is proposed to make priority queues. The input throughput also out performs with the existing algorithms.

中文翻译：

---

通过使用 k-means 算法解决 TCP Incast 问题来优化数据中心网络吞吐量

TCP in cast被称为数据中心中的复杂问题之一，它接收来自n的大量流量发件人数量。提出了许多解决 TCP Incast 问题的方法。在本文中，提出了两个步骤：（i）使用 k-means 算法对发送者节点进行分组，以及（ii）在分组后处理来自发送者的传入数据包。随着复杂性的合理降低，对发送者进行分组可以很容易地有效地处理传入的数据包。这是通过 k-means 算法实现的，该算法将发送者分组并为每个组创建一个优先级队列。第二步可以通过Pro-Ack（Pro-Acknowledgement）控制在接收端处理海量数据的一种方法中实现。我们演示了如何在 k-means 算法的帮助下通过 Pro-Ack 控制有效地处理和处理传入的数据包。连同上述概念，提出了鲁棒算法来制作优先级队列。输入吞吐量也优于现有算法。