Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
IEEE Transactions on Software Engineering
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Heavy-tailed probability distributions in the World Wide Web
A practical guide to heavy tails
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
Scheduling and Load Balancing in Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
On the characteristics and origins of internet flow rates
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Multiprocessing in High Performance IP Routers
Proceedings of the IFIP WG6.1/WG6.4 Third International Workshop on Protocols for High-Speed Networks III
Fast address look-up for internet routers
BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
Adaptive Load Sharing for Clustered Digital Library Servers
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Load balancing for parallel forwarding
IEEE/ACM Transactions on Networking (TON)
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet
IEEE Communications Magazine
World Wide Web caching: trends and techniques
IEEE Communications Magazine
A framework for optimizing the cost and performance of next-generation IP routers
IEEE Journal on Selected Areas in Communications
Design issues for high-performance active routers
IEEE Journal on Selected Areas in Communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
A Buffer Space Optimal Solution for Re-establishing the Packet Order in a MPSoC Network Processor
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A Novel Multipath Load Balancing Algorithm in Fat-Tree Data Center
CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
E-AHRW: An Energy-Efficient Adaptive Hash Scheduler for Stream Processing on Multi-core Servers
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Flow-based load-balancing architecture for the agile all-photonic network
Photonic Network Communications
An efficient parallelized L7-filter design for multicore servers
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming traffic is scheduled to multiple processors based on a deterministic mapping. The mapping formula is derived from the robust hash routing (also known as the highest random weight--HRW) scheme, introduced in K. W. Ross, IEEE Network, 11(6), 1997, and D. G. Thaler et al., IEEE Trans. Networking, 6(1), 1998. No state information on individual flow mapping has to be stored, but for each packet, a mapping function is computed over an identifier vector, a predefined set of fields in the packet. An adaptive extension to the HRW scheme is provided to cope with biased traffic patterns. We prove that our adaptation possesses the minimal disruption property with respect to the mapping and exploit that property to minimize the probability of flow reordering. Simulation results indicate that the scheme achieves significant improvements in processor utilization. A higher number of router interfaces can thus be supported with the same amount of processing power.