.png){kind=icon}
返回
Load balancing for parallel forwarding
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2005.852881.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Workload distribution is. critical to the performance of network processor based, parallel forwarding systems. Scheduling schemes, that operate at the packet level, e.g., round-robin, cannot preserve packet-ordering within individual TCP connections. Moreover, these schemes create duplicate information in processor caches-and therefore are inefficient in resource utilization. Hashing operates at the flow level and is naturally able to maintain per-connection packet ordering; besides, it does, not pollute caches. A pure hash-based system, however, cannot balance processor load in the face of highly skewed flow-size distributions in the Internet; usually, adaptive methods are needed. In this paper, based on measurements of Internet traffic, we examine the sources of load imbalance in hash-based scheduling schemes. We prove that under certain Zipf-like flow-size distributions, hashing alone is not-able to balance workload. We introduce a new metric to quantify. the effects of adaptive,load balancing on overall forwarding performance. To achieve both load balancing and efficient system. resource utilization, we propose a scheduling scheme that classifies Internet flows: into two categories: the aggressive and the normal and applies different scheduling policies to the two classes of flows. Compared with most state-of-the-art parallel forwarding schemes, our Work exploits flow-level Internet traffic characteristics.
Keyword:
load balancing
parallel IP forwarding
Zipf-like distribution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容