A Minimum Output Burstiness Traffic Scheduling Algorithm

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σ_i,ρ_i) where σ_i is the bucket size (or burstiness) and ρ_i is the leaky rate. Compared with the totally isolated scheme where connection i is allocated a bandwidth r_i = max{(σ_i)/(d_i),ρ_i} (d_i is the delay bound requirement of connection i), the DM/ARR algorithm has a better performance in the sense that it has a larger admission region. We prove that, among all possible scheduling algorithms that satisfy the delay bound requirements of established connections, DM/ARR results in the minimum output burstiness. This is important because a smaller burstiness implies a smoother traffic and thus the receiver (or next switch node in a multihop network) can handle it more easily. Numerical results show that the admission region of the DM/ARR algorithm is close to that of the earliest deadline first [1] algorithm. A packetized version is studied for ATM networks.

• 一般社団法人電子情報通信学会の論文
• 1999-11-25

著者

• Lee Tsern-huei

  Faculty Of National Chiao Tung University

• Kuo Y‐w

  National Chiao Tung Univ. Hsinchu Twn

• KUO Yaw-Wen

  Institute of Communication Engineering, National Chiao Tung University

関連論文

• Fast Admission Control for Rate Monotonic Schedulers
• A Minimum Output Burstiness Traffic Scheduling Algorithm

スポンサーリンク