Binary-tree multiplexing scheduling
First Claim
1. A method for multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising the steps of:
- checking for adequate channel bandwidth for a plurality of information blocks according to a summed ratio of number of segments per repetition period for each respective information block;
mapping channel positions in a non-sequential order corresponding to a binary tree, whereby each layer of the binary tree corresponds to a repetition period; and
assigning information segments of each information block to unassigned channel positions corresponding to binary tree nodes of a layer on the binary tree associated with the repetition period of the information block.
3 Assignments
0 Petitions
Accused Products
Abstract
A method for multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions. The information block from each source has a repetition period and is divided into a number of segments. A bandwidth adequacy verification is performed for expected information blocks to be scheduled on the channel. Mapping positions are assigned corresponding to nodes in a binary tree, whereby each layer of the binary tree corresponds to a repetition period of the respective information block. Assignment of the information blocks to the binary tree is based on a priority order of repetition period of the respective information block, starting with the smallest repetition period. As each binary tree position node is assigned, all child nodes of the assigned position node are also marked as assigned.
-
Citations
13 Claims
-
1. A method for multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising the steps of:
-
checking for adequate channel bandwidth for a plurality of information blocks according to a summed ratio of number of segments per repetition period for each respective information block; mapping channel positions in a non-sequential order corresponding to a binary tree, whereby each layer of the binary tree corresponds to a repetition period; and assigning information segments of each information block to unassigned channel positions corresponding to binary tree nodes of a layer on the binary tree associated with the repetition period of the information block. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for scheduling information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising the steps of:
-
verifying adequate channel bandwidth according to a ratio of number of segments per repetition period for each respective information block; creating a first list comprising information blocks sorted by a priority order according to ascending repetition period; creating a second list containing mapping positions for assignment of information block segments corresponding to nodes in a binary tree, the binary tree having a plurality of layers, each layer corresponding to a repetition period; assigning information segments of each block according to the order of the first list at unassigned positions in the layer corresponding with the repetition period of the block and to all corresponding child nodes down to the bottom layer on the binary tree. - View Dependent Claims (11, 12, 13)
-
Specification