{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:41:54Z","timestamp":1777902114701,"version":"3.51.4"},"reference-count":26,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2006,3]]},"abstract":"<jats:p>By investigating flow-level characteristics of Internet traffic, the authors are able to trace the root of load imbalance in hash-based load-splitting schemes. They model flow popularity distributions as Zipf-like and prove that for typical Internet traffic, a hashing scheme cannot balance workload statistically, not even in the long run. They then develop a novel load-balancing packet scheduler for parallel forwarding systems. The scheduler capitalizes on the nonuniform flow reference pattern and especially the presence of a few high-rate flows in Internet traffic. The authors show that detecting and scheduling these flows can be very effective in balancing workloads among network processors. They introduce an important metric, adaptation disruption, to measure the scheduling efficiency of load-balancing mechanisms in parallel forwarding systems. Because there are relatively few large flows, reassigning them in the load balancer results in little disruption to the states of individual processors. The ideas are validated by simulation results. Finally, the authors discuss the effects on cache performance when classifying flows using two different flow definitions: the destination IP address and the five-tuple. The latter results in finer flow granularity but worse route cache hit rate, which can lead to the degradation of routing table lookup performance.<\/jats:p>","DOI":"10.1177\/0037549706067079","type":"journal-article","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T07:05:59Z","timestamp":1150787159000},"page":"173-192","source":"Crossref","is-referenced-by-count":5,"title":["An Adaptive Load Balancer for Multiprocessor Routers"],"prefix":"10.1177","volume":"82","author":[{"given":"W.","family":"Shi","sequence":"first","affiliation":[{"name":"Department of Computing Science University of Alberta Edmonton, AB, T6G                         2E8, Canada,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. H.","family":"MacGregor","sequence":"additional","affiliation":[{"name":"Department of Computing Science University of Alberta Edmonton, AB, T6G                         2E8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Gburzynski","sequence":"additional","affiliation":[{"name":"Department of Computing Science University of Alberta Edmonton, AB, T6G                         2E8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,3,1]]},"reference":[{"key":"atypb1","unstructured":"Shah, N. 2001. Understanding network processors, M.S. thesis, U.C. Berkeley, September."},{"key":"atypb2","first-page":"727","volume-title":"2002 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2002)","author":"Dittmann, G."},{"key":"atypb3","first-page":"545","volume-title":"IEEE INFOCOM 2002","author":"Kencl, L."},{"key":"atypb4","first-page":"130","volume-title":"Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2003)","author":"Shi, W."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"atypb6","unstructured":"NLANR (National Laboratory for Applied Network Research) Measurement and                 Operations Analysis Team (MOAT). n.d. Packet header traces. http:\/\/moat.nlanr.net."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/26.168785"},{"key":"atypb8","first-page":"1","volume-title":"ACM SIGMETRICS 1998","author":"Srinivasan, V."},{"key":"atypb9","first-page":"3","volume-title":"ACM SIGCOMM 1997","author":"Degermark, M."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/90.663936"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/65.642358"},{"key":"atypb12","first-page":"99","volume-title":"ACM SIGCOMM Internet Measurement Workshop","author":"Sarvotham, S."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/90.554723"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039865"},{"key":"atypb15","first-page":"332","volume-title":"IEEE INFOCOM 2000","author":"Cao, Z."},{"key":"atypb16","first-page":"154","volume-title":"In Internet Performance and Control of Network Systems III at SPIE ITCOM 2002","author":"Jo, J."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1109\/90.811445"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1035115"},{"key":"atypb19","volume-title":"Human behavior and the principle of least effort","author":"Zipf, G.","year":"1949"},{"key":"atypb20","volume-title":"Zipf, power laws, and Pareto a ranking tutorial","author":"Adamic, L.","year":"2000"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1986.1146410"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/12.135552"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852881"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1002\/dac.619"},{"issue":"11","key":"atypb25","first-page":"3352","volume":"86","author":"Shi, W.","year":"2003","journal-title":"IEICE Transactions on Communications"},{"key":"atypb26","volume-title":"Computer architecture: A quantitative approach","author":"Hennessy, J. L.","year":"2003","edition":"3"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706067079","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706067079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:19:41Z","timestamp":1777634381000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549706067079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1177\/0037549706067079"],"URL":"https:\/\/doi.org\/10.1177\/0037549706067079","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}