Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A reliable and scalable striping protocol
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
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)
Connection-level analysis and modeling of network traffic
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Program Behavior: Models and Measurements
Program Behavior: Models and Measurements
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Network Systems Design with Network Processors, Agere Version
Network Systems Design with Network Processors, Agere Version
Load balancing for parallel forwarding
IEEE/ACM Transactions on Networking (TON)
A scalable load balancer for forwarding internet traffic: exploiting flow-level burstiness
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Hash routing for collections of shared Web caches
IEEE Network: The Magazine of Global Internetworking
The effect of packet reordering in a backbone link on application throughput
IEEE Network: The Magazine of Global Internetworking
Creating advanced functions on network processors: experience and perspectives
IEEE Network: The Magazine of Global Internetworking
Performance scalability of a multi-core web server
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
A scalable multithreaded L7-filter design for multi-core servers
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Load balancing for flow-based parallel processing systems in CMP architecture
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Packet scheduling for deep packet inspection on multi-core architectures
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Bonded deficit round robin scheduling for multi-channel networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An application-aware load balancing strategy for network processors
HiPEAC'10 Proceedings of the 5th international conference on High Performance Embedded Architectures and Compilers
On the core affinity and file upload performance of Hadoop
DISCS-2013 Proceedings of the 2013 International Workshop on Data-Intensive Scalable Computing Systems
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Hi-index | 0.00 |
Load balancing in packet-switched networks is a task of ever-growing importance. Network traffic properties, such as the Zipf-like flow length distribution and bursty transmission patterns, and requirements on packet ordering or stable flow mapping, make it a particularly difficult and complex task, needing adaptive heuristic solutions. In this paper, we present two main contributions:Firstly, we evaluate and compare two recently proposed algorithmic heuristics that attempt to adaptively balance load among the destination units. The evaluation on real life traces confirms the previously conjectured impact of the Zipf-like flow length distribution and traffic burstiness. Furthermore, we identify the distinction between the goals of preserving either the sequence order of packets, or the flow-to-destination mapping, showing different strengths of each algorithm. Secondly, we demonstrate a novel hybrid scheme that combines best of the flow-based and burst-based load balancing techniques and excels in both of the key metrics of flow remapping and packet reordering.