A fast algorithm for multi-channel/port traffic assignment
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The authors propose a simple algorithm, the K-HOL algorithm, to expedite the processing of multi-channel/port traffic assignment, and compare this algorithm with two typical algorithms found in the literature.
Abstract
Multi-channel/port communication structures are often found in multiaccess networks and switching systems, where data packets from input channels/ports are directed to their destinations of output channels/ports, following certain traffic assignment rules. The authors propose a simple algorithm, the K-HOL algorithm, to expedite the processing of multi-channel/port traffic assignment. Recursive equations are given to find the parameter K and the maximum achievable throughput for the algorithm. They compare this algorithm with two typical algorithms found in the literature. Simulation results show that the proposed algorithm has close performance to the two algorithms whereas the computational complexity is reduced greatly.>
