초록 ▼

A communication system (100) comprises a processor (150), a channel memory (160), a communication line (180), a transmit connect table (146), a transmit scheduler table (144), and a program memory (148). The channel memory (160) stores channels (161) with data cells (102). The processor (150) writes

A communication system (100) comprises a processor (150), a channel memory (160), a communication line (180), a transmit connect table (146), a transmit scheduler table (144), and a program memory (148). The channel memory (160) stores channels (161) with data cells (102). The processor (150) writes channel identifiers (e.g., 1 2) into schedule fields (110-V) of the transmit scheduler table (144) and points with a pointer R and a pointer V to the schedule fields (110-V). The pointers R and V identify fields in which the processor (150) looks up for a first channel identifier. The processor (150) forwards data cells (102) from the channel memory (160) to the communication line (180) for the channel (161) corresponding to the first channel identifiers. Then, the processor (150) moves the first channel identifier to an other field and writes a second channel identifier stored in the transmit connect table (146) to the field of the first channel identifier.

대표청구항 ▼

[ What is claimed is:] [1.] In an apparatus continuously receiving cells from channels and periodically in one time slot transmitting a total number N.sub.slot of said cells to a communication line, a method for selecting cells comprising the steps of:(i) assigning a first pointer R and a second poi

[ What is claimed is:] [1.] In an apparatus continuously receiving cells from channels and periodically in one time slot transmitting a total number N.sub.slot of said cells to a communication line, a method for selecting cells comprising the steps of:(i) assigning a first pointer R and a second pointer V to schedule fields; and(ii) in a time slot identified by said first pointer R,(a) assigning a counter N to N.sub.slot ;(b) looking up in the schedule fields identified by said second pointer V for channel identifiers "s" and if "s" is found transmitting a cell from one channel identified by "s", moving said channel identifier "s" to a different schedule field identified by J, and changing said counter N, wherein channel identifiers are moved with the following substeps:reading a period P (s) of said channel from a parameter field;reading an entry L (s) from a link field identified by "s";writing said entry L (s) to first schedule field V;calculating J by: J:=mod.sub.M (V+P (s));reading a channel identifier from a first schedule field J;writing said channel identifier to said link field identified by "s"; andwriting "s" to said first field J;(c) depending on said counter N, repeating said step (b) or changing said first pointer R and starting said step (ii) for a new time slot;(d) if said second pointer V and said first pointer R are different, changing said second pointer V and repeating said step (b).