基于先到先服务的二维动态优先级信令排队算法

摘要

针对信令寻径式交换机的特征,提出对交换机的信令实施一种以先到先服务排队策略为基础,基于信令固定优先级和交换机端口轮转优先级的二维动态优先级排队算法,该算法将不同时刻到达交换机的信令请求按照到达的先后次序进行排队,同一时刻到达交换机的信令请求先按照信令固定优先级进行排队,优先级相同的信令请求按照交换机端口的轮转优先级进行排队,因此这种排队算法称为基于先到先服务的二维动态优先级排队算法,简称TDDPFCFS(Two Dimensional Dynamic Priority-based First Come First Serve).然后,使用强占型M/M/1/∞队列对其进行建模,讨论了TDDP-FCFS算法的性能指标以及计算方法,并给出了实际的计算结果.结果表明,TDDP-FCFS排队算法兼顾了信令优先级和交换机的端口优先级,实现简单,且能够很好地满足信令寻径式交换机的调度要求,具有较高的调度效率.%According to the characteristics of the token-routing switches,the author put forward the token-queuing algorithm based on FCFS, the token fixed priority and the switch ports dynamic priority.The requests received by the switch at different time are queued based on FCFS,and the requests received by the switch at the same time is queued by the token fixed priority and the switch ports dynamic priority.So, this algorithm is called as the Two Dimensional Dynamic Priority-based First Come First Serve Algorithm, abbreviation for TDDP-FCFS.Then, the author used the seizing M/M/1/∞ queue to model the TDDP-FCFS system,and discussed its performance indexes,gave the calculation method and the actual results of the performance indexes.Results showed that the algorithm TDDP-FCFS took both the token priority and the switch ports priority into account, and could meet the scheduling requirements of the token-routing switch.TDDP-FCFS has higher operation efficiency of scheduling.