Download now Free registration required
Independent set algorithms, as a kind of packet classification algorithms with space efficiency, has lower execution efficiency for the lack of priority consideration in linear matching process. In addition, new independent sets created frequently as a result of dynamic updates greatly increase its dependence on the consumption of storage space. In order to overcome these above disadvantages, an improved algorithm based on Independent Sets using Priority Sorting (ISSP) is proposed and an improvement strategy of split rule is designed for higher storage efficiency in dynamic updates. The simulation results further show that the improved algorithm, compared with IS algorithm, reduces its dependence on storage space in dynamic updates and has higher execution efficiency.
- Format: PDF
- Size: 657.87 KB