asterisk 队列策略

; A strategy may be specified.  Valid strategies include:
;
; ringall - ring all available channels until one answers (default)
振铃所有可到达的分机直到有接听的
; leastrecent - ring interface which was least recently hung up by this queue
振铃最近被这个队列呼叫的最少的分机
; fewestcalls - ring the one with fewest completed calls from this queue
振铃这个队列完成电话数最少的分机
; random - ring random interface
随机振铃一个分机
; rrmemory - round robin with memory, remember where we left off last ring pass
基于内存的循环振铃，记住上次被振铃的分机。
; rrordered - same as rrmemory, except the queue member order from config file 
;             is preserved
和rrmemory类似，振铃顺序按照配置文件中的队列成员保存顺序
; linear - rings interfaces in the order specified in this configuration file.
;          If you use dynamic members, the members will be rung in the order in
;          which they were added
按照配置文件中指定的顺序振铃，如果是动态成员，则按动态成员的添加顺序。
; wrandom - rings random interface, but uses the member's penalty as a weight
;           when calculating their metric. So a member with penalty 0 will have
;           a metric somewhere between 0 and 1000, and a member with penalty 1 will
;                       have a metric between 0 and 2000, and a member with penalty 2 will have
;           a metric between 0 and 3000. Please note, if using this strategy, the member
;           penalty is not the same as when using other queue strategies. It is ONLY used
;           as a weight for calculating metric.
随机振铃，但是使用成员的惩罚值作为一个度量标准。因此成员惩罚值0度量标准为0-1000，惩罚只1度量标准为0-2000，惩罚值2度量标准为0-3000。请注意，如果用这个策略，这个成员惩罚值不同于其他队列的策略，它仅用于权重度量标准。


leastrecent和fewestcalls可能会造成队列不停的把进来的电话分配到某个分机上，如果该分机处于通话中并且通话时间比较长的话会造成很大的电话损失。


roundrobin和rrmemory看起来好像并没有什么不同，但它们之间还是有区别。最大的区别在于roundrobin记住上次开始的分机，然后从下一个开始。假设有1，2，3三个分机，如果第1个电话是1->2->3的顺序呼叫队列的话，第2个电话将会是 2->3->1的顺序呼叫队列，第3个电话就是3->1->2。而rrmemory记住上次最后呼叫的分机，然后从下一个开始。假设还是有1，2，3三个分机，第1个电话呼叫顺序是1->2，分机2接了或者电话挂断；那么第2个电话来将是按3->1->2的顺序来呼叫，如果是roundrobin，第2个电话进来应该是按2->3->1的顺序呼叫