发明名称 ALGORITHMS FOR MINIMIZING EXCURSION IN PLACEMENT OF CHANNEL SELECTS INTO MULTIPLEXER FRAME
摘要 72235-8 Algorithms for ordering selects for a plurality of channels to be multiplexed into a frame so as to minimize or reduce channel excursion are provided. The channel select position counter for each of the channels to be multiplexed are initialized. In one embodiment, the first and succeeding channel selects are chosen based on the lowest price (highest cost) ready channel, with the price of a channel being equal to the value of the channel select position counter divided by the number of selects for that channel in the frame, and the readiness of the channel being indicated either by an indicator, or by the relative value of the position counter to the initial value of the position counter. After a select is made, the position counter of the selected channel is increased by the total number of selects in the frame, and the position counters of all of the channels, including the selected channel are decremented by a value corresponding to the number of selects for that channel in the frame. After such updating, another selection for the frame may be based on the lowest priced ready channel. In a second embodiment, the first and succeeding channel selects are chosen based primarily on the respective values of the channel ready counters such that a channel having a ready counter of relative higher value is always selected before a channel having a ready counter of relatively lower value. Where channel ready counter integer values of more than one channel are equal, the highest rate channel of the highest ready count contributing first. After a select is made, the ready counter of the selected channel is decremented by a value corresponding to the number of selects for that channel in the frame. If the position counter of a channel reach zero or goes negative as a result of the decrementing, the position counter of that channel is increased by the total number of selects in the frame, and the ready counter for that channel is incremented by one.
申请公布号 CA1320290(C) 申请公布日期 1993.07.13
申请号 CA19890612471 申请日期 1989.09.22
申请人 GENERAL DATACOMM, INC. 发明人 BAINS, KULDIP S.;GORDON, DAVID P.
分类号 H04J3/16 主分类号 H04J3/16
代理机构 代理人
主权项
地址