Share Email Print

Proceedings Paper

Low jitter scheduling with redundancy control for input-queued switches
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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 (O(1) for each input-output pair) which is important for high-speed switches.

Paper Details

Date Published: 19 November 2007
PDF: 10 pages
Proc. SPIE 6784, Network Architectures, Management, and Applications V, 67842V (19 November 2007); doi: 10.1117/12.745287
Show Author Affiliations
Hong Cheng, Shanghai Jiao Tong Univ. (China)
Yaohui Jin, Shanghai Jiao Tong Univ. (China)
Yu Gao, Shanghai Jiao Tong Univ. (China)
YingDi Yu, Shanghai Jiao Tong Univ. (China)
Wei Guo, Shanghai Jiao Tong Univ. (China)
Weiqiang Sun, Shanghai Jiao Tong Univ. (China)
Weisheng Hu, Shanghai Jiao Tong Univ. (China)

Published in SPIE Proceedings Vol. 6784:
Network Architectures, Management, and Applications V
Jianli Wang; Gee-Kung Chang; Yoshio Itaya; Herwig Zech, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?