A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers

@article{Xu2005ASS,
  title={A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers},
  author={Yang Xu and Beibei Wu and Wenjie Li and Bin Liu},
  journal={Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.},
  year={2005},
  pages={57-64}
}
Although output queued (OQ) switches are prominent for their high performance, they are not easy to implement due to the high speedup requirement. Using a special scheduling algorithm in the first stage switch, a more scalable switch-memory-switch (SMS) architecture can emulate an OQ switch, where cells must be transferred from the inputs to the shared memories per time slot without arrival and departure conflicts. Although scheduling algorithm achieves good performance, the time complexity for… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…