Providing Near Per-Flow Scheduling in Commodity Switches Without Per-Flow Queues
Network quality of service (QoS) is essential for network applications. For many applications, getting a fair share of available bandwidth for their flows can prevent them from being blocked by other flows that do not respond to congestion. Providing per-flow scheduling in each output port of a comm...
Main Authors: | Shie-Yuan Wang, Chen-Yo Sun, Yu-Chen Hsiao, Yi-Bing Lin |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10138823/ |
Similar Items
-
Single Item Batch-scheduling Model for a Flow Shop with m Batch-processing Machines to Minimize Total Actual Flow Time
by: Abdul Hakim Halim, et al.
Published: (2022-10-01) -
Making programmable packet scheduling time-sensitive with a FIFO queue
by: Qianru Lv, et al.
Published: (2023-10-01) -
Kuala Perlis (Perlis) [peta]
Published: (1984) -
Semenanjung Malaysia : Perlis [peta]
Published: (1976) -
Enhancing Robustness of Per-Packet Load-Balancing for Fat-Tree
by: Chansook Lim
Published: (2021-03-01)