Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 754.84 |
A shared directional multichannel (SDM) consists of a set of inputs and a set of outputs to which transmitters and receivers respectively, are connected. A signal placed at any given input reaches a subset of the outputs, and a channel is specified by the sets of outputs that are reachable from each input. A message is received successfully at an output of the channel if and only if it is addressed to the receiver connected to that output and no other signals reach that output at the same time. Constructive lower bounds as well as some upper bounds on the uniform-traffic capacity of SDM-based single-hop interconnections between a set of multitransmitter source stations and a set of multireceiver destination stations are derived. A bidirectional interconnection among a set of stations can be obtained by representing each station as one source station and one destination station. It is shown that with randomized transmissions, SDMs that can be described as a collection of buses can perform as well as any other channels. With deterministic scheduling, however, the use of certain non-bus-oriented SDMs yields a much higher interconnection capacity