Abstract
The traffic of large-scale interconnection networks is increasingly showing high-speed and high-burst characteristics, which imposes a big challenge on the performance of switching systems. However, the existing scheduling and routing algorithms for the switching systems have either high computation complexity or high operation cost, which cannot keep up with the rapid development of the Internet. To cope with this problem, we present a parallel scheduling algorithm and a parallel routing algorithm for large-scale high-speed switching systems in this paper. Starting from the edge coloring problem of bipartite graphs, this paper first presents algebraic edge coloring approach, based on which we design the scheduling and routing algorithms. Our simulation results show that these algorithms possess the following features: 1) They have a low computation complexity; 2) They can provide 100% throughput; 3) They can achieve end-to-end delay in microseconds; 4) They do not require any hardware acceleration, and do not lead to packet out-of-sequence problem.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call