Answers are grounded in this paper and cite their sources.
In this paper we propose a novel scheduling approach for optical packet switching (OPS) WASPNET nodes, LBWS. Unlike the original WASPNET description, our scheduler is fully distributed and its computational cost is independent from switch size. This allows shorter packets, improving network performance. Based on a deterministic evolution of the switch configuration, our scheduling algorithm predicts packet delays at packet ingress to guarantee switch stability, and assigns fibre delay lines (FDLs) accordingly. It is not necessary to emulate RAM memories, since we assign delay lines according to packet delay predictions. We demonstrate that LBWS outperforms WASPNET in the cases studied, for nonuniform input traffic.
No takes yet. Share an insight, caveat, or question.
López‐Bravo et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: