Fair link striping with FIFO delivery on heterogeneous channels
| Autor: | Jingnan Yao, Laxmi N. Bhuyan, Jiani Guo |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Job scheduler
Computer Networks and Communications FIFO (computing and electronics) Computer science Network packet business.industry Quality of service ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Deficit round robin Throughput Load balancing (computing) computer.software_genre Telecommunications network Link aggregation Scheduling (computing) Packet switching Data striping business computer Computer network |
| Zdroj: | Computer Communications. 31:3427-3437 |
| ISSN: | 0140-3664 |
| DOI: | 10.1016/j.comcom.2008.05.042 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect