Low jitter scheduling with redundancy control for input-queued switches

Hong Cheng, Yaohui Jin, Yu Gao, Yingdi Yu, Wei Guo, Weiqiang Sun, Weisheng HuProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2007 · DOI

Abstract

In switch scheduling, jitter becomes an important performance criterion for increasing real-time applications. Low Jitter Decomposition (LJS) was proposed in the frame-based scheduling switches [9]. However, we notice that in LJS, the bandwidth requirement of schedule tables is greater than the actual amount of traffic. The redundant bandwidth requirement not only wastes the resource of switch, but also introduces an extra jitter. In this paper, we propose two algorithms to reduce the extra jitter caused by redundancy: Integer Average Redundancy Control (IARC) and Dichotomy Sequence Redundancy Control (DSRC). We demonstrate that the jitter bound of the two algorithms is lower than that of the scheme without redundancy control. Simulation experiments show that DSRC and IARC can reduce nearly 50% jitter of the scheme without redundancy control at medium switch load. We also show that DSRC has a low complexity (<i>O</i>(1) for each input-output pair) which is important for high-speed switches.
BibTeX
@inproceedings{cheng2007low,
  author = {Hong Cheng and Yaohui Jin and Yu Gao and Yingdi Yu and Wei Guo and Weiqiang Sun and Weisheng Hu},
  title = {{Low jitter scheduling with redundancy control for input-queued switches}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {2007},
  doi = {10.1117/12.745287},
}

Loading related content...

Figure