Evolution of Cache Replacement Policies to Track Heavy-Hitter Flows

Žádník, Martin; Canini, Marco

doi:10.1007/978-3-642-19260-9_3

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Initial naive proposals to keep counters for each flow [34], [13] are not scalable when there exist millions of flows, which is common in today's network environment. There have been extensive researches on reducing the overheads of keeping per flow counters [27], [18], [12], [41], [40] to find the accurate estimate of the rates of aggressive flows. In contrast, LAPS merely needs to identify the top aggressive flows without accurately estimating the rates of all flows.…”

Section: Benefit Of Limiting Migration To Only Top Flowsmentioning

confidence: 99%

Flow Migration on Multicore Network Processors: Load Balancing While Minimizing Packet Reordering

Iqbal

Holt²,

Ryoo

et al. 2013

2013 42nd International Conference on Parallel Processing

View full text Add to dashboard Cite

Abstract-With ever increasing network traffic rates, multicore architectures for network processors have successfully provided performance improvements through high parallelism. However, naively allocating the network traffic to multiple cores without considering diversified application nature and flow locality results in issues such as packet reordering, load imbalance and inefficient cache usage. Consequently, these issues degrade the performance of latency sensitive network processors by dropping packets or delivering packets out of order. In this paper, we propose a packet scheduling scheme that considers the multiple dimensions of locality to improve the throughput of a network processor while minimizing out of order packets. Our scheduling policy tries to maintain packet order by maintaining the flow locality, minimizes the migration of flows from one core to another by identifying the aggressive flows, and partitions the cores among multiple services to gain instruction cache locality. The scheduler uses a novel low cost two-level caching scheme to identify top aggressive flows. Our light weight hardware implementation shows improvement of 60% in the number of packets dropped and 80% improvement in the out-of-order packet deliveries over previously proposed techniques.

show abstract

Section: Benefit Of Limiting Migration To Only Top Flowsmentioning

confidence: 99%

Flow Migration on Multicore Network Processors: Load Balancing While Minimizing Packet Reordering

Iqbal

Holt²,

Ryoo

et al. 2013

2013 42nd International Conference on Parallel Processing

View full text Add to dashboard Cite

show abstract

“…The algorithm detects elephant flows with small memory space, whereas it cannot estimate the size of detected flows. Memory‐aware heavy‐hitter detection schemes may also be found .…”

Section: Related Workmentioning

confidence: 99%

On‐line detection of persistently high packet‐rate flows via a sliding window scheme with random packet sampling

Takanori

Takine

2013

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARY We consider on‐line detection of persistently high packet‐rate flows. We assume that flow information is collected via a time‐based sliding window scheme with random packet sampling. In this framework, we propose a method of determining the threshold of the number of sampled packets, which guarantees the false negative ratio. We also formulate and solve the design problem of our scheme, where we aim to minimize the false positive ratio. We then conduct sampling experiments with public trace data and confirm that our method works well as designed. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Efficient Flow Table Caching Architecture and Replacement Policy for SDN Switches

Li,

Sun,

Huang

2024

J Netw Syst Manage

View full text Add to dashboard Cite

Evolution of Cache Replacement Policies to Track Heavy-Hitter Flows

Cited by 5 publications

References 11 publications

Flow Migration on Multicore Network Processors: Load Balancing While Minimizing Packet Reordering

Flow Migration on Multicore Network Processors: Load Balancing While Minimizing Packet Reordering

On‐line detection of persistently high packet‐rate flows via a sliding window scheme with random packet sampling

Efficient Flow Table Caching Architecture and Replacement Policy for SDN Switches

Contact Info

Product

Resources

About