The composite scheme based on preemption and small buffers is an efficient method for contention resolution. To support services differentiation, it is the first time that the analytical model of delay preemption base...The composite scheme based on preemption and small buffers is an efficient method for contention resolution. To support services differentiation, it is the first time that the analytical model of delay preemption based priority is built. Further, in order to guarantee the low-loss requirement for high priority bursts, an improved scheme is proposed and investigated by limiting the buffered right of low priority bursts within the specific traffic states. The simulation results show that, without the deterioration of blocking performance, there is more than 40% reduction on burst loss being achieved under the conditionρ=1.0 for high priority bursts.展开更多
An optimal design problem of local buffer allocation in the FMS is discussed in order to maximize a reward earned from processed jobs at all workstations. Structural properties of the optimal design problem are analyz...An optimal design problem of local buffer allocation in the FMS is discussed in order to maximize a reward earned from processed jobs at all workstations. Structural properties of the optimal design problem are analyzed for the model with two job routing policies. Based on these properties, approaches to optimal solutions are given.展开更多
针对传统并行多路传输中数据调度算法存在的问题,基于MPTCP协议,提出了带宽预测和前向时延的数据调度算法(data-scheduling algorithm using bandwidth estimation and forward trip-time,DA-BEFT)。该算法充分考虑子流间传输时延差较...针对传统并行多路传输中数据调度算法存在的问题,基于MPTCP协议,提出了带宽预测和前向时延的数据调度算法(data-scheduling algorithm using bandwidth estimation and forward trip-time,DA-BEFT)。该算法充分考虑子流间传输时延差较大的影响,结合性能好的重传选路策略,减轻接收端因数据乱序导致的缓存阻塞,提高整个连接吞吐量。通过仿真实验验证了DA-BEFT在子流时延差变化时能够提高带宽利用率,提高网络的吞吐量。展开更多
文摘The composite scheme based on preemption and small buffers is an efficient method for contention resolution. To support services differentiation, it is the first time that the analytical model of delay preemption based priority is built. Further, in order to guarantee the low-loss requirement for high priority bursts, an improved scheme is proposed and investigated by limiting the buffered right of low priority bursts within the specific traffic states. The simulation results show that, without the deterioration of blocking performance, there is more than 40% reduction on burst loss being achieved under the conditionρ=1.0 for high priority bursts.
文摘An optimal design problem of local buffer allocation in the FMS is discussed in order to maximize a reward earned from processed jobs at all workstations. Structural properties of the optimal design problem are analyzed for the model with two job routing policies. Based on these properties, approaches to optimal solutions are given.
文摘针对传统并行多路传输中数据调度算法存在的问题,基于MPTCP协议,提出了带宽预测和前向时延的数据调度算法(data-scheduling algorithm using bandwidth estimation and forward trip-time,DA-BEFT)。该算法充分考虑子流间传输时延差较大的影响,结合性能好的重传选路策略,减轻接收端因数据乱序导致的缓存阻塞,提高整个连接吞吐量。通过仿真实验验证了DA-BEFT在子流时延差变化时能够提高带宽利用率,提高网络的吞吐量。
