Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
A reliable and scalable striping protocol
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An architecture for packet-striping protocols
ACM Transactions on Computer Systems (TOCS)
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
A theory of multi-channel schedulers for quality of service
Journal of High Speed Networks
A new TCP for persistent packet reordering
IEEE/ACM Transactions on Networking (TON)
Quantum-Adaptive Scheduling for Multi-Core Network Processors
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
IEEE Communications Magazine
A distributed scheduling architecture for scalable packet switches
IEEE Journal on Selected Areas in Communications
Striping within the network subsystem
IEEE Network: The Magazine of Global Internetworking
Bonded deficit round robin scheduling for multi-channel networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
Link aggregation techniques are often used to achieve higher communication bandwidth by striping network traffic across multiple transmission channels. Due to the variations in bandwidth, latency and loss rate on different channels, link striping suffers from packet reordering thereby adversely affecting the performance of any QoS concerned applications. Hardware-based solutions often prolong transmission latency which is undesirable for delay sensitive applications and are restricted with the available buffer space on the device. Thus, an effective striping protocol that ensures both load balancing and minimal packet reordering is important when striping traffic onto multiple channels. In this paper, we first propose an sequence preserving scheduling (SPS) scheme to schedule packets among multiple heterogeneous communication channels assuming that the workload is perfectly divisible. Packets assigned onto different links for transmission are ordered perfectly by applying divisible load theory (DLT). We analyze the throughput and derive expressions for the batch size, scheduling time and the maximum number of channels that can be supported by the sender and receiver. Further, to effectively schedule variable length packets for link striping, we propose a packetized sequence preserving scheduling (P-SPS) scheme by applying a combined packetized technique of deficit round robin (DRR) and surplus round robin (SRR). Extensive sensitivity results are provided through analysis and simulation to show that the proposed algorithms satisfy both the load balancing and in-order requirements for efficient packet transmission.