DocumentCode
818574
Title
On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
Author
Birk, Yitzhak ; Linial, Nathan ; Meshulam, Roy
Author_Institution
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
Volume
39
Issue
1
fYear
1993
fDate
1/1/1993 12:00:00 AM
Firstpage
186
Lastpage
191
Abstract
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
Keywords
channel capacity; multi-access systems; telecommunication traffic; bus-oriented shared channels; deterministic scheduling; lower bounds; multiple-access communication; multireceiver destination stations; multitransmitter source stations; shared directional multichannels; single-hop interconnections; uniform-traffic capacity; upper bounds; Aggregates; Chromium; Communication channels; Hardware; LAN interconnection; Optical fiber LAN; Optical fiber networks; Optical transmitters; Throughput; Transmitters; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.179355
Filename
179355
Link To Document