A blocking reduction scheme for multiple slot cell scheduling in multicast switching systems

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a multicast switch called BRMSCS switch consisted of shared memory, crossbar fabric and the scheduler BRMSCS (Blocking Reduction Multiple Slot Cell Scheduler). Our goals are to reduce the blocking situation in the scheduler and to guarantee free of memory access conflict (MAC), that is, no more than two output ports would access the different cells which come from the same input port. We separate the BRMSCS switch into two parts: the data section and the control section. The header of each incoming cell is sent to the control section and scheduled by BRMSCS. To meeting our goals, the RRMSCS scheduler quickly inserts the address cell into scheduling table and fills the scheduling table as full as possible. The simulation results show that the BRMSCS scheduler can efficiently insert the address cell into the MAC free location of scheduling table and has the feature of reducing blocking. © 2008 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Lee, F. C., Wang, W. F., & Shih, J. B. (2008). A blocking reduction scheme for multiple slot cell scheduling in multicast switching systems. In Communications in Computer and Information Science (Vol. 6 CCIS, pp. 168–175). https://doi.org/10.1007/978-3-540-89985-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free