| 摘要 |
Packets are spread among a number of packet processors with load-balancing. The incoming packets are logically divided into a number of packet flows, where the number of packet flows is greater than the number of packet processors. Each packet flow is assigned to a particular packet processor. When a packet is received, the packet flow for the packet is determined, and the packet is queued for the packet processor associated with the flow based upon a predetermined queuing scheme. The mapping of packet flows to packet processors is not fixed, but rather is dynamically updated based upon the amount of data associated with each packet flow and each packet processor.
|
