To address the trade-off between high throughput and low latency in scheduling algorithms for fiber channel switches, this paper proposes a time-triggered queue proportional sampling (lp-QPS) algorithm. The algorithm introduces a long-queue prioritization mechanism to preferentially match virtual output queue (VOQ) exceeding the threshold, while employing queue proportional sampling for cyclic scheduling of the remaining queues. Comparative experiments with other iterative scheduling algorithms demonstrate that the lp-QPS algorithm achieves 100% throughput and superior latency performance under four traffic models, including both Bernoulli and burst arrival processes. These findings provide valuable insights for optimizing the performance of fiber channel switches.