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.展开更多
文摘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.
