Multiple computer networks and intercomputer communication
SOSP '67 Proceedings of the first ACM symposium on Operating System Principles
A study of multiaccess computer communications
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
A study of asynchronous time division multiplexing for time-sharing computer systems
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Packet Broadcast Networks A Performance Analysis of the R-ALOHA Protocol
IEEE Transactions on Computers
Performance Optimization of a CSMA Protocol for Local Computer Networks
IEEE Transactions on Computers
On Communications and Networks
IEEE Transactions on Computers
Packet switching with satellites
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Design issues for mixed media packet switching networks
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Dynamic control schemes for a packet switched multi-access broadcast channel
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
The organization of computer resources into a packet radio network
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Random access techniques for data transmission over packet-switched radio channels
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
On the energy consumption of Pure and Slotted Aloha based RFID anti-collision protocols
Computer Communications
Packet acquisition for time-frequency hopped asynchronous random multiple access
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
History of communications: an early history of the internet
IEEE Communications Magazine
| Hi-index | 0.01 |
Imagine that two users require the use of a communication channel. The classical approach to satisfying this requirement is to provide a channel for their use so long as that need continues (and to charge them for the full cost of this channel). It has long been recognized that such allocation of scarce communication resources is extremely wasteful as witnessed by their low utilization (see for example the measurements of Jackson & Stubbs). Rather than provide channels on a user-pair basis, we much prefer to provide a single high-speed channel to a large number of users which can be shared in some fashion; this then allows us to take advantage of the powerful "large number laws" which state that with very high probability, the demand at any instant will be approximately equal to the sum of the average demands of that population. In this way the required channel capacity to support the user traffic may be considerably less than in the unshared case of dedicated channels. This approach has been used to great effect for many years now in a number of different contexts: for example, the use of graded channels in the telephone industry, the introduction of asynchronous time division multiplexing, and the packet-switching concepts introduced by Baran et al., Davies, and finally implemented in the ARPA network. The essential observation is that the full-time allocation of a fraction of the channel to each user is highly inefficient compared to the part-time use of the full capacity of the channel (this is precisely the notion of timesharing) We gain this efficient sharing when the traffic consists of rapid, but short bursts of data. The classical schemes of synchronous time division multiplexing and frequency division multiplexing are examples of the inefficient partitioning of channels.