The performance of hash-based Scheduling optimization algorithm for network flow cannot be bounded under the worst-case because of hash conflicts. To make up for the shortage of the above algorithm, a multiple-hash algorithm based on counting Hash Adapter, which stores the digest of flow needed to be adjusted in the Exact Stream Hash Adapter (ESHA) structure, is designed. Compared with the basic hash table, the integrity of the conversation is maintained and the query performance is improved due to the lower probability of conflict. An example is given as a validation of this method and the result data reflect the practical effect.
展开▼
