CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines
Abstract As a key component of high‐performance switches and routers, the packet forwarding engine (PFE) is mainly responsible for selecting the appropriate output port for tens of thousands of packets within an extremely short time frame. However, the performance of PFE is determined by the selecte...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | IET Communications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cmu2.12701 |
| _version_ | 1797353591348920320 |
|---|---|
| author | Ruisi Wu Wen‐Kang Jia |
| author_facet | Ruisi Wu Wen‐Kang Jia |
| author_sort | Ruisi Wu |
| collection | DOAJ |
| description | Abstract As a key component of high‐performance switches and routers, the packet forwarding engine (PFE) is mainly responsible for selecting the appropriate output port for tens of thousands of packets within an extremely short time frame. However, the performance of PFE is determined by the selected group membership algorithm. This paper puts forth a hybrid strategy–caching scalar‐pair and vectors routing and forwarding (CSVRF), consisting of virtual output port bitmap caching (VOPBC) and fractional‐N SVRF to address major multicast forwarding issues such as scalability by using content addressable memory. In CSVRF, a virtual output port bitmap cache is introduced, which includes the most popular combinations of output port bitmap and divides the big scalar‐pair into N sub‐groups to achieve parallel compute and the reusability of less bit‐length prime. The results demonstrate that the memory space and the forwarding latency are effectively reduced compared with previous work. In space efficiency, it only required 10% memory space compared with the original SVRF/fractional‐N SVRF, decreased 10% memory usage compared with pure VOPBC and nearly improved 1 to 4 orders of magnitude of packet processing time compared with the original SVRF and the fractional‐N SVRF respectively. |
| first_indexed | 2024-03-08T13:33:14Z |
| format | Article |
| id | doaj.art-468d4f6398634d518881e236c4bac2fb |
| institution | Directory Open Access Journal |
| issn | 1751-8628 1751-8636 |
| language | English |
| last_indexed | 2024-03-08T13:33:14Z |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Communications |
| spelling | doaj.art-468d4f6398634d518881e236c4bac2fb2024-01-17T02:51:21ZengWileyIET Communications1751-86281751-86362024-01-01181405410.1049/cmu2.12701CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward enginesRuisi Wu0Wen‐Kang Jia1College of Photonic and Electronic EngineeringFujian Normal UniversityFuzhouChinaCollege of Photonic and Electronic EngineeringFujian Normal UniversityFuzhouChinaAbstract As a key component of high‐performance switches and routers, the packet forwarding engine (PFE) is mainly responsible for selecting the appropriate output port for tens of thousands of packets within an extremely short time frame. However, the performance of PFE is determined by the selected group membership algorithm. This paper puts forth a hybrid strategy–caching scalar‐pair and vectors routing and forwarding (CSVRF), consisting of virtual output port bitmap caching (VOPBC) and fractional‐N SVRF to address major multicast forwarding issues such as scalability by using content addressable memory. In CSVRF, a virtual output port bitmap cache is introduced, which includes the most popular combinations of output port bitmap and divides the big scalar‐pair into N sub‐groups to achieve parallel compute and the reusability of less bit‐length prime. The results demonstrate that the memory space and the forwarding latency are effectively reduced compared with previous work. In space efficiency, it only required 10% memory space compared with the original SVRF/fractional‐N SVRF, decreased 10% memory usage compared with pure VOPBC and nearly improved 1 to 4 orders of magnitude of packet processing time compared with the original SVRF and the fractional‐N SVRF respectively.https://doi.org/10.1049/cmu2.12701IP networksmulticast communicationpareto analysisswitches |
| spellingShingle | Ruisi Wu Wen‐Kang Jia CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines IET Communications IP networks multicast communication pareto analysis switches |
| title | CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines |
| title_full | CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines |
| title_fullStr | CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines |
| title_full_unstemmed | CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines |
| title_short | CSVRF: A CAM‐based popularity‐aware egress group‐caching scheme for SVRF‐based packet forward engines |
| title_sort | csvrf a cam based popularity aware egress group caching scheme for svrf based packet forward engines |
| topic | IP networks multicast communication pareto analysis switches |
| url | https://doi.org/10.1049/cmu2.12701 |
| work_keys_str_mv | AT ruisiwu csvrfacambasedpopularityawareegressgroupcachingschemeforsvrfbasedpacketforwardengines AT wenkangjia csvrfacambasedpopularityawareegressgroupcachingschemeforsvrfbasedpacketforwardengines |