Framing algorithms minimizing channel excursion

Abstract: 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.

Description: The present invention relates to time-division-multiplexed (TDM) telecommunication systems. More particularly, the invention relates to methods for inserting channel selects into a frame wherein the excursions of the channels are minimized. In multiplexing information from various channels of varying speeds, it is necessary to buffer information from each channel as the receiver of the multiplexer can only attend to one channel at a time, Each channel typically has its own buffer, and the input by the channel into the buffer relative to the output of the buffer to the receiver is typically asynchronous. It is clearly important that the buffers do not become empty or full at any instant as the empty or full condition would indicate duplication or loss of data respectively. Framing algorithms are utilized to set the frame length as well as the number of selects from each channel into the frame. It is then necessary to create a time sequence table with entries which define the order in which the receiver responds to the channels. Each entry in the table represents one bit (or in byte systems - one byte) time of the receiver. Each "channel" must have at least one entry in the frame (even if the entry represents a subsidiary frame such as a secondary or tertiary frame), and the frame is repeated at a rate which is the greatest common divisor of the channel rates. In general, some channels have a large number of entries in the table while other channels may have only a few or even a single entry. It is then desirable to space the entries for each channel such that they are an equal distance apart; i.e. to minimize the accumulated deviation (excursion) from the ideal space for the channel selects in the frame. Two methods for limiting excursion are known in the art. A first method, the "priority method" is to order the channels according to their speed and to start with the fastest channel and place the fastest channel selects as closely as possible to their ideal position. Then, the procedure is repeated for the next highest channel. If the ideal select slot is take by the previous channel, then the nearest vacant slot is sought. The procedure continues until all of the channel selects are placed in the frame. The obvious disadvantage of the "priority method" scheme is that slower channels are often moved relatively far away from their ideal slots. A further disadvantage is that considerable iterative effort is required to find and fill vacant slots. A second method for limiting excursion is described in detail in commonly owned U.S. Patent #4,727,536. In that patent, a real time allocation process is described where the channels are arranged in descending order of channel rates and starting with the fastest channel, the channels are scanned to determine whether they are ready to contribute a bit to the aggregate. Initially, all the channels are considered ready to contribute. After is first contribution to the frame, the readiness of a channel is determined by the position of a counter associated with the channel. The counter is initially set equal to the frame length. Then, each time a bit is inserted into the frame from the highest rate channel which is ready, the position counter of each channel is adjusted by subtracting the number of selects for that channel from the count, and the position counter of the contributing channel is adjusted by adding the frame length value to the counter value. When the position count reaches zero or goes negative, the channel is marked to be ready to contribute. The procedure of choosing the fastest channel which is ready to contribute continues until the frame is complete such that all the channels have contributed their proportional number of bits. Although the method of U.S. Patent #4,727,536 is non-iterative and hence efficient, it has some drawbacks in terms of excursion. Unwanted excursion occurs because the method prioritises the channels and tends to be more responsive to the faster channels. In the case of a large number of channels, the non-iterative method can introduce significant excursion to low order channels. SUMMARY OF THE INVENTION It is therefore an object of the invention to provide efficient framing algorithms which minimize channel excursion. It is a further object of the invention to provide real-time, efficient framing algorithms which assigns cost (or price) functions to channels and which minimize cost. In accord with the objects of the invention, algorithms for ordering selects for a plurality of channels into a frame are provided. The algorithms require the initializing of a channel ready indicator and a channel select position counter in each of the channels to be multiplexed. According to a first embodiment, the first and succeeding channel selects are chosen based on which ready channel has the lowest "price" (i.e. highest "cost") with the selection of the lowest price (highest cost) channel thereby minimizing total cost. The "price" of a channel is defined by the value of the channel select position counter divided by the number of selects from that channel to the frame, and the "cost" is the inverse thereof (for simplicity, the discussion hereinafter will refer to price only). After a select is made, 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, and the position counter of the selected channel only is increased by the total number of selects in the frame. After such updating, and the recalculating of prices, another selection for the frame may be made based on the relative prices of the ready channels. Because the price of each channel is not necessarily an integer value, but rather os a fraction based on how far (in terms of selects) a particular channel is from receiving another bit, channels of different rates will rarely have equal prices. Where channels have equal prices, either channel may be chosen. However, preferably, the channels are also ordered by rate (i.e. equivalently by the number of selects of the channel in the frame), and where prices are equal, a select is made of the channel having the highest rate. This first embodiment guarantees minimum excursion such that no channel will ever have more than one bit available for placement in the frame (i.e. zero bits of excursion). The advantage of such a guarantee is the knowledge that in operation, a multiplexer will not cause an overflow of a channel buffer due to a large excursion. In fact, the minimum excursion provided by the algorithm permits the reduction in the size of the channel buffers. In a second embodiment, after initialization, the first and succeeding channel selects are chosen based at least 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 relative lower value. After a select is made, the ready counter of the selected channel is decremented, and the position counters of the channels are decremented by a value corresponding to the number of selects for that channel in the frame. If the position counter of a channel reaches 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 in incremented by one. After such updating, another selection for the frame may be made based on the ready counter values of the channels. Because many of the channel ready counters will often have identical values, the channels are preferably ordered by rate (i.e. equivalently by the number of selects of the channel in the frame). In choosing among these channels having ready counter of equal values, a select is made of the channel having the highest rate. However, even if the selection was made arbitrarily (e.g. by channel number), the provided algorithm guarantees that no channel will ever have an excursion of more than one bit available for placement in the frame. Other objects and advantages of the invention will become evident upon reference to the detailed description in conjunction with the provided figures. BRIEF DESCRIPTION OF THE DRAWINGS Figures 1A and 1Aa together comprise a flow chart illustrating a first preferred embodiment of the select determination method of the invention: Figures 1B and 1Ba together comprise a flow chart illustrating an alternative first preferred embodiment of the select determination method of the invention; Figures 1C and 1Ca together comprise a flow chart illustrating a second embodiment of the select determination method of the invention; Figure 2a1 is a chart of frame selects generated by the first preferred or alternate first preferred method invention; Figure 2a2 is a chart of channel parameters of the hypothetical channels from which the selects are generated; Figures 2b-2m are charts of the computations performed in generating a hypothetical frame according to the first preferred method invention, and a chart of the resulting frame selects; and Figure 3a1 is a chart of frame selects generated according to a prior art technique; Figure 3a2 is a chart of channel parameters of the hypothetical channels for which selects are generated; Figures 3b-3m are chars of the computations performed in generating a hypothetical frame according to a prior art technique, and a chart of the resulting frame selects; Figure 4a1 is a chart of frame selects generated according to the second embodiment of the method invention of Figures 1C and 1Ca; Figure 4a2 is a chart of channel parameters of the hypothetical channels from which the selects are generated; and Figures 4b-4m are charts of the computations performed in generating a hypothetical frame according to the second embodiment of the invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Turning to Figures 1A and 1Aa, a flow chart of the first preferred method of generating selects for a frame is provided. In the first preferred embodiment, at 3⊘a the channels are ordered by rate order (as seen in Fig. 2a2) and a table is generated as having fields: the channel number, the number of selects for the channel in the frame; the channel select position counter; and the channel price. The frame select position counter of each channel is then initialized at 34a (and written into the table) to be equal to the aggregate rate divided by the frame rate. In other words, the position counters of the channels are set to a value equal to the total number of selects in the frame. With the select position counter initialized, at 36a, the prices of the channels are determined (price of channel i = frame select position counter value for channel i divided by the number of selects of channel i in the frame). Then, at 37a, the top of the table (i.e. the first entry - the data channel with the highest rate) is indexed. At 38a, if the channel is ready to contribute a bit (i.e. its select position counter value is less than or equal to the total number of selects in the frame), the price of the indexed channel is compared to the price of the lowest price previously indexed ready channel. If the indexed channel has a lower price than the previously indexed channels, its price is stored along with an indication of channel number. Otherwise, the method continues at 4⊘a with a determination of whether all channels have been scanned. If all channels have not been scanned, the next channel entry is indexed at 42a and if the channel is ready, a price comparison is made at 38a. The loop is continued until all channels have been scanned. Then at 44a select is chosen from the channel (as stored in 38a) having the lowest price (i.e. the greatest cost in terms of excursion), and the frame select position counter associated with that channel is incremented by a value equal to the number of selects in the frame. Where a plurality of channels all have the same lowest price, a select is preferably made of the channel having the highest rate. While such a constraint is not necessary to follow the invention, the result naturally follows from the preferred embodiment of steps 3⊘a and 38a where the channels are rate ordered and where the price of a slower ready channel is not stored unless its price is less than that of the previously scanned ready channels. Once a select has been made and the selected channel's position counter has been incremented, the frame select position counters of all of the channels must be updated. Thus, starting with the highest rate channel addressed at 46a, and in a loop to be described hereinafter, the position counter of each channel is updated. At 48a, a value equal to the number of selects of the particular channel in the frame (which is equal to the channel rate divided by the frame rate), is subtracted from the frame select position counter of the particular channel. Then, a determination is made at 6⊘a as to whether all channels have been updated. If not, the next entry in the table is indexed at 61a and the program returns to step 48a for the current channel being updated. If all channels have been updated, a determination is made at 62a as to whether the frame has been completed. If so, the program ends. If not, the program continues at step 37a where the highest rate channel is indexed to start a determination of the next select for the frame. Turning to Figures 1B and 1Ba, a flow chart of an alternative first method of generating selects for a frame is provided. At 3⊘b the channels are ordered by rate order (as seen in Fig. 2a2), and a table is generated with the following fields: the channel number, the number of selects for the channel in the frame; the channel select position counter; the channel price; and a channel ready counter. At 32b, the channel ready counter (indicative of the availability of a channel to contribute data) of each channel is initialized to a value of one. The frame select position counter of each channel is then initialized at 34b to be equal to the number of selects in the frame. With the ready counters set and the select position counters initialized, at 36b, the prices of the channels are determined, and at 37b, the first entry in the table is indexed. At 38b the price of the indexed channel is compared to the price of the lowest price previously indexed ready channel. If the indexed channel has a lower price than the previously indexed channels which were ready (i.e. ready counter value of one), its price is stored along with an indication of channel number. Otherwise, the method continues at 4⊘b with a determination of whether all channels have been scanned. If all channels have not been scanned, the next channel entry is indexed at 42b and if it is ready, a price comparison is made at 38b. The loop is continued until all channels have been scanned. Then at 44b a select is chosen from the ready channel (as stored in 38b) having the lowest price (i.e. the greatest cost in terms of excursion), and the ready counter value of the selected channel is decremented. Where a plurality of channels all have the same lowest price, a select is preferably made of the channel having the highest rate. While such a constraint is not necessary to follow the invention, the result naturally follows from the preferred embodiment of steps 3⊘b and 38b where the channels are rate ordered and where the price of a slower channel is not stored unless its price is less than that of the previously scanned ready channels. Once a select has been made at 44b, the frame select position counters and ready counters of the channels must all be updated. Thus, starting with the highest rate channel addressed at 46b, and in a loop to be described hereinafter, the parameters of each succeeding channel are updated. At 48b, a value equal to the number of selects of the particular channel in the frame (which is equal to the channel rate divided by the frame rate), is subtracted from the frame select position counter of the particular channel. At 52b a determination is made as to whether the frame position counter is positive. If the frame position counter is positive, the program continues at step 58b, where the next channel is indexed. However, if the position counter has gone to zero or negative, the ready counter of the channel is incremented at 54b, and a value equal to the number of selects in the frame is added to the frame select position counter at 56b. Then a determination is made at 6⊘b as to whether all channels have been updated. If not, the next entry in the table is indexed at 61b, and the program returns to step 48b for the current channel being updated. If all channels have been updated, a determination is made at 62b as to whether the frame has been completed. If so, the program ends. If not, the program continues at step 37b where the highest rate channel is indexed to start a determination of the next select for the frame. Turning to Figures 2b-2m, a hypothetical frame built according to the teachings of the invention and particularly in accord with the alternative embodiment of Figures 1B and 1Ba is seen. Nine channels are provided and are to be multiplexed into frame having a total of two hundred and forty selects. As indicated in Figure 2a2, channel five is the highest rate channel and is to be selected seventy-eight times every frame, while channel four is to be selected forty-five times. Channels three, one, and two are of equal rates and are to be selected twenty-three times each, while channels six through nine are to be selected twelve times each. Using the excursion algorithm of Figures 1B and 1Ba, selects are chosen for placement into frame depending upon the price of the channel, and secondarily upon the channel rate. In Figures 2b - 2m (as well as Figures 3b - 3m and 4b - 4m) the status of a ready counter set to one is indicated by an underline of the frame select position counter value. No underline indicates that the ready counter is at zero (i.e. the channel will not be ready to contribute information), while a double or triple underline is indicative that the ready counter value is two or three and is ready to contribute two or three bits respectively. The pattern of generated selects is seen in Fig. 2a1. Visually, the generation of the selects may be seen in Figs. 2b - 2m by locating at each select position which channel has an underlined position counter value at that position bu no underline at the next position (or double underlined at the select position and single underlined at the next position for Figures 3b - 3m). Of course, the exception to this rule is where a select is made of a channel, and immediately following the select the ready counter of that channel is increased due to the position counter having gone to zero. Following the first ten selects horizontally as listed in Fig 2a1, the method outlined in Figure 1A and 1Aa and 1B and 1Ba provides selects of the following channels in the following order: 5, 4, 3, 1, 5, 2, 4, 5, 6, 7. Continuing through the next ten selects, it will be seen that despite channels three, one and two being ready at the thirteenth select, channel eight is chosen because its price is eight (96/12) while the price of channels one, two, and three is almost ten (227/23). Similarly, at the fifteenth select, channel nine is chosen because it has a lower price than the other ready channels. At the eighteenth select, channel one with a price of a little less than four (89/23) is chosen over channel four having a price of four and one-third (195/45), while at the twentieth select, channel four is chosen with a price of two and one-third (1⊘5/45) over channel five having a price of a little more than two and one-half (198/78). Scanning through Figures 2b-2m, it can be seen that the ready counter of any channel is limited to a value of at most one (i.e. no excursion) as the provided technique successfully minimizes excursion. Indeed, it is believed that regardless of the number and relative rates of the chosen channels, the provided technique always minimizes excursion. Turning to Figures 3b-3m, the status of the ready counters for the same nine channels used in Figure 2 is shown where the framing method of U.S. Patent #4,727,536 is utilized. As indicated, only channel nine ever has a ready counter exceeding a value of one. However, channel nine carries a one bit excursion from selects twenty-one through forty (see Fig. 3c), forty-one through fifty-three (see Fig. 3d), sixty-one through seventy-four (see Fig. 3e), and eighty-one through one hundred (see Fig. 3f), a two bit excursion from selects one hundred-one through one hundred fourteen, a one bit excursion from selects one hundred fifteen through one hundred twenty (see Fig. 3g), a two bit excursion from selects one hundred twenty-one through one hundred thirty-three, a one bit excursion from selects one hundred thirty-four through one hundred thirty-six (see Fig. 3h), one hundred forty-one through one hundred Fifty-seven (see Fig. 3i), one hundred sixty-one through one hundred seventy-five (see Fig. 3j), one hundred eighty-one through one hundred ninety-seven (see Fig. 3k), and two hundred-one through two hundred eighteen (see Fig. 3l). In comparing the selects of the first embodiments of the instant invention as shown in Figures 2b - 2m to the selects of the art as shown in Figures 3b - 3m, it becomes clear that the provided method of the instant invention limits the excursion seen by the channels. Indeed, where many more channels are to be multiplexed with larger frames, it is not uncommon in the art to have excursions of four, five or even more bits. However, with the instant invention, the channel excursions never even reach one bit. This is so, because by structuring the algorithm to select the channel having the lowest price (highest cost), without any other constraints, the excursion is minimized. Turning to Figures 1C and 1Ca, a flow chart of the second embodiment of the method of generating selects for a frame is provided. In the second embodiment, at 13⊘ the channels are ordered by rate order (as seen in Fig. 4a2), and a table is generated preferably including as fields: channel number; channel rate (or number of selects per frame); select position counter; and ready counter. The ready counter of each channel is initialized to a value of one at 132. The frame select position counter of each channel is then initialized at 134 to be equal to the aggregate rate divided by the frame rate. In other words, the position counters of the channels are set to a value equal to the total number of selects in the frame. With the ready counters set and the select position counters initialized, at 136, the first channel (i.e. the data channel with the highest rate) is indexed. At 138, the value of the ready counter of the indexed channel is read and compared to the value of the ready counters of previously indexed channels. If the value of the ready counter of the indexed channel is greater than the previously stored value, the ready counter value of the indexed channel is stored along with an indication of its corresponding channel. Otherwise, the method continues at 14⊘ with a determination of whether all channels have been scanned. If all channels have not been scanned, the next channel entry is indexed at 142 and another ready counter value comparison is made at 138. The loop is continued until all channels have been scanned. Then, at 144 a select is chosen from the channel having a ready counter having the greatest value (i.e the greatest cost in terms of excursion), and the ready counter value of the selected channel is decremented. Where a plurality of channels all have ready counters equaling the greatest value, a select is made of the channel having the highest rate. While such a constraint is not necessary to follow the invention, the result naturally follows from the preferred embodiment of steps 136 and 138 where the channels are rate ordered and where the ready counter value of a slower channel is not stored unless its value exceeds that of the previously scanned ready counters. Once a select has been made at 144, the frame select position counters and ready counters of the channels must all be updated. Thus, starting with the highest rate channel addressed at 146, and in a loop to be described hereinafter, the parameters of each succeeding channel are updated. At 148, a value equal to the number of selects of the particular channel in the frame (which is equal to the channel rate divided by the frame rate), is subtracted from the frame select position counter of the particular channel. At 152 a determination is made as to whether the frame position counter is positive. If the frame position counter is positive, the program continues at step 16⊘, where the next channel is indexed 161. However, if the position counter has gone to zero or negative, the ready counter of the channel is incremented at 154, and a value equal to the number of selects in the frame is added to the frame select position counter at 156. A determination is made at 16⊘ whether all channels have been updated. If not, the next channel is indexed at 161 and the program returns to step 148 for the current channel being updated. If all channels have been updated, a determination is made at 162 as to whether the frame has been completed. If so, the program ends. If not, the program continues at step 136 where the highest rate channel is indexed to start a determination of the next select for the frame. Using the channel parameters of Figure 4a2 and the method outlined in Figures 1C and 1Ca, selects of the following channels in the following order are generated (as seen in Fig. 4a1): 5, 4, 3, 1, 5, 2, 4, 5, 6, 7. Continuing through the next ten selects, it will be seen that channel nine is not selected, as at the twentieth select, the ready counter of channel five is again one, an a select is chosen from the faster channel five rather than the slower channel nine. As a result, after the twentieth select, the ready counter of channel is increased to a value of two. Because channel nine has the highest ready counter value at the twenty-first select position, a select is taken from channel nine rather than from channels six, seven, or eight. Similarly, after the fortieth select (taken from channel eight), the ready counter of channel nine increases to a value of two. Again, at the forty-first select, a select is taken from channel nine, even though channel five which has a much greater rate is available to be chosen. Scanning through Figures 4b - 4m, it can be seen that the ready counter of any channel is limited to at most two (i.e. one bit excursion) as the provided technique successfully limits excursion. In fact, only channels eight and nine ever reach the one bit excursion, with both of them having two bits ready at selects one hundred-one (See Fig. 4g) and one hundred twenty-one (See Fig. 4h), and channel nine also having two bits ready at selects twenty-one (See Fig. 4c), forty-one (See Fig. 4d), sixty-one (See Fig. 4e), eighty-one (See Fig. 4f), one hundred-two (See Fig. 4g), one hundred twenty-two (See Fig. 4h), one hundred forty-one (See Fig. 4i), one hundred sixty-one (See Fig. 4j), one hundred eighty-one (See Fig. 4k), and two hundred-one (See Fig. 4l). There has been described and illustrated herein methods for choosing channel selects for a frame of a multiplexer. While particular embodiments of the invention have been described, it is not intended that the invention be limited thereby, as it is intended that the invention be broad in scope and that the specifications be read likewise. Thus, while one embodiment of the preferred invention was described with channel ready counters which are incremented as the excursion increases, those skilled in the art will appreciate that the ready counters could be arranged to decrement when and excursion increases. Or. because the value of the ready counter is always zero or one, a bit indicator can be used to indicate the readiness of the channel. Similarly, while an embodiment described channel select position counters which are decremented after each select and incremented upon their value reach zero, the position counters can be incremented after each select and decremented after reaching a threshold relating to the number of selects in the frame. In fact, instead of using a position counter and then dividing the position counter by the number of selects for the particular channel in the frame, a "price indicator" can be used which combines the two functions. What is critical is that the price of each channel be updated after each select in a manner relating to their relative channel rates, such that the lowest priced ready ready channel may be selected. Those skilled in the art will also understand that the "price" of a channel is inversely related to the "cost" of the channel such that the lowest priced channel is the highest cost channel. Thus, a determination of highest cost is completely equivalent to a determination of lowest price, and the two should be considered one and the same. Further, while the invention was described in terms of bit multiplexing, it will be appreciated that the provided algorithm is appropriate to byte multiplexing. In fact, the advantage of the invention is greater where bytes are multiplexed due to the relatively larger buffer size for bytes as opposed to bits. Finally those skilled in the art should appreciate that the terminology used in describing the invention (eg. "channels" , "selects", "counters", "frame", "price", "cost", etc.) is intended to be broad and non-limiting so as to encompass what is readily understood by those skilled in the art. Therefore, it will be apparent to those skilled in the art that other changes and modifications may be made to the invention as described in the specification without departing from the scope of the invention so claimed.

Claims: A method for ordering selects for a plurality of channels into a multiplexer frame, comprising: (a) providing a channel select position counter for each of said plurality of channels; (b) initialising said channel select position counters to a value corresponding to the total number of selects in said frame (34a); (c) choosing a select of a ready channel (44a); and (d) changing the position counter of each channel, including said selected channel, by a value corresponding to the number of selects in said frame for that particular channel (48a); the method being characterised by (e) choosing said select of said ready channel (44a) at least based on respective prices of said channels, wherein a channel is deemed a ready channel according to a comparison of the value of its channel select position counter to said value corresponding to the total number of selects in said frame, and wherein a channel having a relatively lower price is always chosen over a channel having a relatively higher price, and the price of a channel corresponds to a value of the position counter of that channel divided by a value corresponding to the total number of selects of that channel in the frame (38a); (f) changing the position counter of a selected channel by said value corresponding to the total number of selects in said frame (44a); and (g) repeating steps (c) to (f) until said frame is substantially filled with selects (62a). A method according to claim 1, wherein said changing the position counters of step (d) comprises decrementing the position counters (48a), and said changing the position counter of step (f) comprises incrementing the position counters (44a). A method according to claim 2, wherein said position counters are initialized to and incremented by a value equal to the total number of selects in said frame (34a,44a), said position counters are decremented by a value equalling the number of selects in said frame for that channel (48a), and a channel is deemed ready when its position counter has a value which equals or is less than said total number of selects in said frame (38a). A method of ordering selects for a plurality of channels into a multiplexer frame, comprising: (a) providing an indicator for each of said plurality of channels; (b) initialising said indicator for each particular channel to a value related to the total number of selects in said frame; (c) choosing a select of a ready channel; and (d) changing said indicator of each channel, including said selected channel; the method being characterised by (e) providing each indicator as a channel price indicator; (f) initialising said channel price indicator for each particular channel to a value corresponding to the total number of selects in said frame divided by the number of selects for the particular channel, (g) choosing said select of said ready channel at least based on respective indicated prices of said channels, wherein a particular channel is deemed a ready channel according to a comparison of the value of its channel price indicator, wherein a channel having a relatively lower price is always chosen over a channel having a relatively higher price; (h) changing the respective channel price indicator of said selected channel, by a value corresponding to unity; (i) changing said channel price indicator of a selected channel by said value corresponding to the total number of selects in said frame divided by the number of selects for a particular channel; and (j) repeating steps (c), (d) and (g) to (i) until said frame is substantially filled with selects. A method according to claim 4, wherein said changing the respective channel price indicators of step (h) comprises decrementing the channel price indicators, and said changing the respective channel price indicators of step (i) comprises incrementing the channel price indicators. A method according to claim 4 or 5, wherein said channel price indicators are initialized to and incremented by a value equal to the number of selects in said frame divided by the respective number of selects of the respective channel in said frame. A method for ordering selects for a plurality of channels into a multiplexer frame, comprising: (a) providing a channel ready indicator and a channel select position counter for each of said plurality of channels; (b) initialising said channel ready indicator (32b); (c) initialising said channel select position counters to a value corresponding to the total number of selects in said frame (34b); (d) choosing a select of a channel (44b); (e) changing the indication of the channel ready indicator to indicate channel unreadiness of said channel selected at step (d) (54b); (f) changing the position counter of each channel by a value corresponding to the total number of selects in said frame for that channel (48b); and (g) changing the indication of said channel ready indicator to indicate channel readiness when said channel position counter for that channel reaches or passes through a predetermined value threshold (44b); the method being characterised by (h) choosing said select of said channel (44b) at least based on respective prices of ready channels as indicated by said channel ready indicators, wherein a channel having a relatively lower price is always chosen over a channel having a relatively higher price, and the price of a channel corresponds to a value of the position counter of that channel divided by a value corresponding to the number of selects of that channel in the frame (38b); (i) changing the position counter of a channel (56b) by said value corresponding to the total number of selects in said frame when said position counter for that channel reaches or passes through said predetermined value threshold (52b); and (j) repeating steps (d) to (i) until said frame is substantially filled with selects (62b). A method according to claim 7, wherein said changing the position counters of step (f) comprises decrementing the position counters (48b), and said changing the position counters of step (i) comprises incrementing the position counters (56b). A method according to claim 8, wherein said position counters are initialized to a value equal to the number of selects in said frame (34b), said position counters are decremented by a value equalling the number of selects in said frame for that channel (48b), and said predetermined value threshold is zero (52b). A method according to any of claims 7 to 9, wherein said changing the indication of channel ready indicators of step (e) comprises incrementing the ready indicators (54b), and said changing the value of the channel ready indicators of step (g) comprises decrementing the ready indicators (44b). A method according to claim 10, wherein said channel ready indicators are initialized to a value of one (32b), and said incrementing (54b) and decrementing (44b) said channel ready indicators comprises incrementing and decrementing by a value of one. A method for ordering selects for a plurality of channels into a multiplexer frame, comprising: (a) providing a channel ready indicator for each of said plurality of channels; (b) initialising said channel ready indicators (32b); (c) choosing a select of a channel (44b); and (d) changing the indication of the channel ready indicator to indicate channel unreadiness of said channel selected at step (c) (54b); the method being characterised by (e) providing a channel price indicator for each of said plurality of channels; (f) initialising said channel price indicator for each particular channel to a value corresponding to the total number of selects in said frame divided by the number of selects for the particular channel; (g) choosing said select of said channel at least based on channel prices of ready channels as indicated by said channel price indicators and said channel ready indicators, wherein a channel having a relatively lower price is always chosen over a channel having a relatively higher price; (h) changing the channel price indicator for each channel by a value corresponding to unity; (i) changing the channel price indicator of a channel by said value corresponding to the total number of selects in said frame divided by the number of selects for the particular channel when said channel price indicator for that channel reaches or passes through a predetermined value threshold; (j) changing the indication of said channel ready indicator to indicate channel readiness when said channel price indicator of that channel reaches or passes through said predetermined value threshold; and (k) repeating steps (c), (d) and (g) to (j) until said frame is substantially filled with selects. A method according to claim 12, wherein said changing the channel price indicator of step (h) comprises decrementing the channel price indicator by one, and said changing the channel price indicator of step (i) comprises incrementing the channel price indicator by the number to which it was initialized, and said predetermined value threshold is zero. A method according to claim 13, wherein said changing the indication of channel ready indicators of step (d) comprises incrementing the ready indicators by one, and said changing the value of the channel ready indicators of step (j) comprises decrementing the ready indicators by one. A method according to any of claims 12 to 14 further comprising ordering said channels by channel rate (30b), wherein said choosing a select of a channel of step (g) (44b) is further based on said channel rate, such that where a plurality of channels have identical lowest prices, a select is chosen from the channel among those plurality having the highest channel rate. A method for ordering selects for a plurality of channels into a multiplexer frame, comprising: (a) providing a channel ready counter and a channel select position counter for each of said plurality of channels; (b) initialising said channel ready counters (132); (c) initialising said channel select position counters to a value corresponding to the total number of selects in said frame (134); (d) choosing a select of a channel (144); and (e) changing the position counter of each channel by a value corresponding to the number of selects in said frame for that channel (148); the method being characterised by (f) choosing said select of said channel (144) at least based on respective values of the channel ready counters of said channels, wherein a channel having a ready counter value indicative of relative greater excursion is always chosen over a channel having a ready counter value indicative of a relative lesser excursion (138); (g) changing the position counter of a channel by said value corresponding to the total number of selects in said frame when said position counter reaches or passes through a predetermined value threshold (156); (h) changing the value of said channel ready counter to indicate greater excursion when said channel position counter for that channel reaches or passes through said predetermined value threshold (154); (i) changing the value of the channel ready counter to indicate less excursion of said channel selected at step (f) (144); and (j) repeating steps (d) to (i) until said frame is substantially filled with selects (162). A method according to claim 16, wherein said changing the position counters of step (e) comprises decrementing the position counters (148), and said changing the position counter of step (g) comprises incrementing the position counters (156). A method according to claim 17, wherein said position counters are initialized to a value equal to the number of selects in said frame (134), said position counters are decremented (148) by a value equalling the number of selects in said frame for that channel, and said predetermined value threshold is zero (152). A method according to any of claims 16 to 18, wherein said changing the value of channel ready counters of step (h) comprises incrementing the ready counters (154), and said changing the value of the channel ready counters of step (i) comprises decrementing the ready counters (144). A method according to claim 19, wherein said channel ready counters are initialized to a value of one (132), and said incrementing (154) and decrementing (144) said channel ready counters comprises incrementing and decrementing value of one. A method according to any one of claims 16 to 20, further comprising ordering said channels by channel rate (130), wherein said choosing a select of channel of step (f) (144) is further based on said channel rate, such that where said channel ready counters of a plurality of channels have identical values indicative of greatest excursion, a select is chosen from the channel among those plurality having the highest rate.

Inventors: BAINS KULDIP S, GORDON DAVID P, BAINS, KULDIP S., GORDON, DAVID P.
Applicants: GEN DATACOMM IND INC, GENERAL DATACOMM, INC.
Application year: 1989
Main classification: H04J3
IPC codes: H04J3