Round-Robin with VirtualClock Scheduling Algorithm in Multiservice Packet Networks(Network)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we present a scheduler that incorporates round robin service within a VirtualClock discipline. Time-stamp based scheduling algorithms attain a low local delay bound and performance guarantee, but are computationally complex. On the other hand, round robin schemes are simple to implement and have computational complexity of O(1), but they are well known for their output burstiness and short-term unfairness. In order to overcome this problem, we combine round robin with VirtualClock in an algorithm we call VCRR. VCRR possesses better fairness than simple round robin, low jitter and a good scheduling delay bound. At the same time, VCRR preserves the O(1) time complexity of round robin. Simulation experiments show VCRR's efficiency in terms of delay performance, jitter and fairness.

• 社団法人電子情報通信学会の論文
• 2006-11-01

著者

• Wang Lei

  Alcatel Shanghai Bell Co. Ltd. Shanghai Chn

• WANG Lei

  School of Pharmacy P. O. Box 42, Shenyang Pharmaceutical University

• MacGREGOR Mike

  Department of Computing Science, University of Alberta

• Macgregor Mike

  Department Of Computing Science University Of Alberta

関連論文

• Determination of Chlorogenic Acid in Rat Plasma by High Performance Chromatography after Peritoneal Administration of Compound Daqingye Injection
• Round-Robin with VirtualClock Scheduling Algorithm in Multiservice Packet Networks(Network)
• Visual Secret Sharing Schemes for Multiple Secret Images Allowing the Rotation of Shares(Discrete Mathematics and Its Applications)
• Outage Performance of Decode-and-Forward Relay Systems Using Imperfect MRC Receiver over Nakagami-m Fading Channels
• Spectrofluorimetric Determination of Trace Amounts of Europium(III) Ion with Lutetium(III)-Sparfloxacin-Sodium Dodecyl Sulfate Luminescence Enhancement System
• Performance Analysis of Opportunistic and All-Participate Relaying with Imperfect Channel Estimation

スポンサーリンク