TY - JOUR
T1 - "Supernodes" in networks employing spread spectrum with code division multiple access
AU - Birk, Yitzhak
AU - Tobagi, Fouad A.
N1 - Funding Information:
* Portions of this paper were presented at INFOCOM '86, Miami, F.L. This work was supported in part by the De-fence Advanced Research Projects Agency under contract MDA903-84-K-0249, monitored by ONR. Yitzhak Birk was supported by an IBM graduate student fellowship.
PY - 1988/10
Y1 - 1988/10
N2 - A spread-spectrum channel can accommodate severa concurrent successful transmissions, and a single-transceiver node can thus utilize only a small fraction of the channel's capacity. As a result, the maximum network throughput is much lower than this capacity whenever a single node, such as a gateway or a file server, must carry a large fraction of the traffic. In order to allocate the appropriate fraction of capacity to a "busy" node, we propose to equip it with several transmitters and receivers, thereby turning it into a "supernode". Several architectures and operation policies for supernodes are suggested and compared. It is shown, for example, that an M-receiver supernode can significantly outperform M independent conventional nodes. In a slotted system with packet lengths of one slot, this is achieved by special routing of the supernode's inbound traffic. In an unslotted system, it is achieved by appropriate code assignment policies. Packet-ratio networks with half-duplex nodes, as well as networks with full-duplex nodes, are considered.
AB - A spread-spectrum channel can accommodate severa concurrent successful transmissions, and a single-transceiver node can thus utilize only a small fraction of the channel's capacity. As a result, the maximum network throughput is much lower than this capacity whenever a single node, such as a gateway or a file server, must carry a large fraction of the traffic. In order to allocate the appropriate fraction of capacity to a "busy" node, we propose to equip it with several transmitters and receivers, thereby turning it into a "supernode". Several architectures and operation policies for supernodes are suggested and compared. It is shown, for example, that an M-receiver supernode can significantly outperform M independent conventional nodes. In a slotted system with packet lengths of one slot, this is achieved by special routing of the supernode's inbound traffic. In an unslotted system, it is achieved by appropriate code assignment policies. Packet-ratio networks with half-duplex nodes, as well as networks with full-duplex nodes, are considered.
KW - Channel Access Protocols
KW - Code Division Multiple Access
KW - Communications Networks
KW - Multi-transceiver Stations
KW - Multiaccess Protocols
KW - Packet Radio Networks
KW - Spread Spectrum Multiple Access
UR - http://www.scopus.com/inward/record.url?scp=0024101622&partnerID=8YFLogxK
U2 - 10.1016/0169-7552(88)90004-9
DO - 10.1016/0169-7552(88)90004-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0024101622
SN - 0169-7552
VL - 15
SP - 341
EP - 357
JO - Computer Networks and ISDN Systems
JF - Computer Networks and ISDN Systems
IS - 5
ER -