Paper Title:
A Stability Analysis of Randomized Scheduling Algorithm for Input-Queued Switches
  Abstract

Input-Queued switching fabrics are widely used in high speed network switches for their scalability. However, a scheduling algorithm must be elaborative designed for input-queued switches to get high throughput. The randomized algorithms are attractive in kinds of scheduling algorithms for their low complexity and well performance. In this paper, a fluid model is introduced to analyze the rate stability of switching systems with randomized schedulers. By this method, we proved that the randomized scheduling algorithm can achieve 100% throughput under any admissible traffics which satisfy the strong law of large numbers (SLLN).

  Info
Periodical
Edited by
Qi Luo
Pages
1439-1445
DOI
10.4028/www.scientific.net/AMM.20-23.1439
Citation
M. S. Sun, J. Wu, "A Stability Analysis of Randomized Scheduling Algorithm for Input-Queued Switches", Applied Mechanics and Materials, Vols. 20-23, pp. 1439-1445, 2010
Online since
January 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Na Rui Bu, Run Shan Bai, Zhang Zhen Li, De Zhong Lin
Chapter 6: Vibration, Noise Analysis and Control
Abstract:Analysis of slope stability based on BP neural network, the analytical model of slope stability is built. Aiming at the defects that BP...
1263