ALOHAnet

ALOHAnet, also known as the ALOHA System,[1][2] or simply ALOHA, was a pioneering computer networking system developed at the University of Hawaii. ALOHAnet became operational in June, 1971, providing the first public demonstration of a wireless packet data network.[3][4] ALOHA originally stood for Additive Links On-line Hawaii Area.[5]

The ALOHAnet used a new method of medium access (ALOHA random access) and experimental ultra high frequency (UHF) for its operation, since frequency assignments for communications to and from a computer were not available for commercial applications in the 1970s. But even before such frequencies were assigned there were two other media available for the application of an ALOHA channel – cables and satellites. In the 1970s ALOHA random access was employed in the widely used Ethernet cable based network[6] and then in the Marisat (now Inmarsat) satellite network.[7]

In the early 1980s frequencies for mobile networks became available, and in 1985 frequencies suitable for what became known as Wi-Fi were allocated in the US.[8] These regulatory developments made it possible to use the ALOHA random-access techniques in both Wi-Fi and in mobile telephone networks.

ALOHA channels were used in a limited way in the 1980s in 1G mobile phones for signaling and control purposes.[9] In the late 1980s, the European standardisation group GSM who worked on the Pan-European Digital mobile communication system GSM greatly expanded the use of ALOHA channels for access to radio channels in mobile telephony. In addition SMS message texting was implemented in 2G mobile phones. In the early 2000s additional ALOHA channels were added to 2.5G and 3G mobile phones with the widespread introduction of GPRS, using a slotted-ALOHA random-access channel combined with a version of the Reservation ALOHA scheme first analyzed by a group at BBN.[10]

Overview

One of the early computer networking designs, development of the ALOHA network was begun in September 1968 at the University of Hawaii under the leadership of Norman Abramson along with Thomas Gaarder, Franklin Kuo, Shu Lin, Wesley Peterson and Edward Wheldon. The goal was to use low-cost commercial radio equipment to connect users on Oahu and the other Hawaiian islands with a central time-sharing computer on the main Oahu campus. The first packet broadcasting unit went into operation in June 1971. Terminals were connected to a special purpose "terminal connection unit" using RS-232 at 9600 bit/s.[11]

The original version of ALOHA used two distinct frequencies in a hub/star configuration, with the hub machine broadcasting packets to everyone on the "outbound" channel, and the various client machines sending data packets to the hub on the "inbound" channel. If data was received correctly at the hub, a short acknowledgment packet was sent to the client; if an acknowledgment was not received by a client machine after a short wait time, it would automatically retransmit the data packet after waiting a randomly selected time interval. This acknowledgment mechanism was used to detect and correct for "collisions" created when two client machines both attempted to send a packet at the same time.

ALOHAnet's primary importance was its use of a shared medium for client transmissions. Unlike the ARPANET where each node could only talk directly to a node at the other end of a wire or satellite circuit, in ALOHAnet all client nodes communicated with the hub on the same frequency. This meant that some sort of mechanism was needed to control who could talk at what time. The ALOHAnet solution was to allow each client to send its data without controlling when it was sent, with an acknowledgment/retransmission scheme used to deal with collisions. This approach radically reduced the complexity of the protocol and the networking hardware, since nodes do not need negotiate "who" is allowed to speak. (see Token Ring). This solution became known as a pure ALOHA, or random-access channel, and was the basis for subsequent Ethernet development and later Wi-Fi networks.[4] Various versions of the ALOHA protocol (such as Slotted ALOHA) also appeared later in satellite communications, and were used in wireless data networks such as ARDIS, Mobitex, CDPD, and GSM.

Also important was ALOHAnet's use of the outgoing hub channel to broadcast packets directly to all clients on a second shared frequency, using an address in each packet to allow selective receipt at each client node.[3]

ALOHA protocol

Pure ALOHA

Graph of frames being sent from 4 different stations according to the pure ALOHA protocol with respect to time, with overlapping frames shaded to denote collision.
Pure ALOHA protocol. Boxes indicate frames. Shaded boxes indicate frames which have collided.

The first version of the protocol (now called "Pure ALOHA", and the one implemented in ALOHAnet) was quite simple:

Note that the first step implies that Pure ALOHA does not check whether the channel is busy before transmitting. Since collisions can occur and data may have to be sent again, ALOHA cannot use 100% of the capacity of the communications channel. How long a station waits until it transmits, and the likelihood a collision occurs are interrelated, and both affect how efficiently the channel can be used. This means that the concept of "transmit later" is a critical aspect: the quality of the backoff scheme chosen significantly influences the efficiency of the protocol, the ultimate channel capacity, and the predictability of its behavior.

To assess Pure ALOHA, there is a need to predict its throughput, the rate of (successful) transmission of frames. (This discussion of Pure ALOHA's performance follows Tanenbaum.[12]) First, let's make a few simplifying assumptions:

Let "T" refer to the time needed to transmit one frame on the channel, and let's define "frame-time" as a unit of time equal to T. Let "G" refer to the mean used in the Poisson distribution over transmission-attempt amounts: that is, on average, there are G transmission-attempts per frame-time.

Graph of 3 frames with respect to time. The earlier green frame overlaps with the yellow frame sent at time t0, which overlaps with the later purple frame.
Overlapping frames in the pure ALOHA protocol. Frame-time is equal to 1 for all frames.

Consider what needs to happen for a frame to be transmitted successfully. Let "t" refer to the time at which it is intended to send a frame. It is preferable to use the channel for one frame-time beginning at t, and all other stations to refrain from transmitting during this time.

For any frame-time, the probability of there being k transmission-attempts during that frame-time is:

\frac{G^k e^{-G}}{k!}

Throughput vs. Traffic Load of Pure Aloha and Slotted Aloha.
Comparison of Pure Aloha and Slotted Aloha shown on Throughput vs. Traffic Load plot.

The average amount of transmission-attempts for 2 consecutive frame-times is 2G. Hence, for any pair of consecutive frame-times, the probability of there being k transmission-attempts during those two frame-times is:

\frac{(2G)^k e^{-2G}}{k!}

Therefore, the probability (Prob_{pure}) of there being zero transmission-attempts between t-T and t+T (and thus of a successful transmission for us) is:

Prob_{pure}=e^{-2G}

The throughput can be calculated as the rate of transmission-attempts multiplied by the probability of success, and it can be concluded that the throughput (S_{pure}) is:

S_{pure}=Ge^{-2G} Vulnerable time=2*T.

The maximum throughput is 0.5/e frames per frame-time (reached when G = 0.5), which is approximately 0.184 frames per frame-time. This means that, in Pure ALOHA, only about 18.4% of the time is used for successful transmissions.

Another simple and mathematical way to establish the equation for throughput in Pure ALOHA (and in Slotted ALOHA) is as follows:

Consider what needs to happen for frames to be transmitted successfully. Let T represents the frame time. For simplicity, it is assumed that the contention begins at t=0. Then if exactly one node sends during interval t=0 to t=T and no node tries between t=T to t=2T, then the frame will be transmitted successfully. Similarly during all next time intervals t=2nT to t=(2n+1)T, exactly one node sends and during t=(2n+1)T to t=(2n+2)T no node tries to send where n=1,2,3, ..., then the frames are successfully transmitted. But in pure ALOHA, the nodes begin transmission whenever they want to do so without checking that what other nodes are doing at that time. Thus sending frames are independent events, that is, transmission by any particular node neither affects nor is affected by the time of start of transmission by other nodes. Let G be the average number of nodes that begin transmission within period T (the frame time). If a large number of nodes is trying to transmit, then by using Poisson distribution, the probability that exactly x nodes begin transmission during period T is

P[X=x]=\frac{G^x e^{-G}}{x!}

Therefore, the probability that during any particular period from t=2nT to t=(2n+1)T, (that is for any particular non-zero integral value of n) exactly one node will begin transmission is

P[X=1] = \frac{G^1 e^{-G}}{1!} = Ge^{-G}

And the probability that during any particular period t=(2n+1)T to t=(2n+2)T, no node will begin transmission is

P[X=0] = \frac{G^0 e^{-G}}{0!} = e^{-G}

But for successful transmission of a frame, both the events should occur simultaneously. That is during period t=2nT to t=(2n+1)T, exactly one node begins transmission and during t=(2n+1)T to t=(2n+2)T no node begins transmission. Hence the probability that both the independent events will occur simultaneously is

P = P(0) \times P(1) = Ge^{-G} \times e^{-G} = Ge^{-2G}

This is the throughput. Throughput is intended to mean the probability of successful transmission during minimum possible period. Therefore, the throughput in pure ALOHA,

S_{pure}=Ge^{-2G}

Similarly for slotted ALOHA, a frame will be successfully transmitted, if exactly one node will begin transmission at the beginning of any particular time slot (equal to frame time T). But the probability that one node will begin during any particular time slot is

P[X=1]= \frac{G^1 e^{-G}}{1!} = Ge^{-G}

This is the throughput in slotted ALOHA. Thus,

S_{slotted} = Ge^{-G}

Slotted ALOHA

Graph of frames being sent from 8 different stations according to the slotted ALOHA protocol with respect to time, with frames in the same slots shaded to denote collision.
Slotted ALOHA protocol. Boxes indicate frames. Shaded boxes indicate frames which are in the same slots.

An improvement to the original ALOHA protocol was "Slotted ALOHA", which introduced discrete timeslots and increased the maximum throughput.[13] A station can send only at the beginning of a timeslot, and thus collisions are reduced. In this case, only transmission-attempts within 1 frame-time and not 2 consecutive frame-times need to be considered, since collisions can only occur during each timeslot. Thus, the probability of there being zero transmission-attempts in a single timeslot is:

Prob_{slotted} = e^{-G}

the probability of k packets is:

Prob_{slotted} k = e^{-G} ( 1 - e^{-G} )^{k-1}

The throughput is:

S_{slotted}=Ge^{-G}

The maximum throughput is 1/e frames per frame-time (reached when G = 1), which is approximately 0.368 frames per frame-time, or 36.8%.

Slotted ALOHA is used in low-data-rate tactical satellite communications networks by military forces, in subscriber-based satellite communications networks, mobile telephony call setup, set-top box communications and in the contactless RFID technologies.

Other protocol

The use of a random-access channel in ALOHAnet led to the development of carrier sense multiple access (CSMA), a "listen before send" random-access protocol that can be used when all nodes send and receive on the same channel. The first implementation of CSMA was Ethernet. CSMA in radio channels was extensively modeled.[14] The AX.25 packet radio protocol is based on the CSMA approach with collision recovery,[15] based on the experience gained from ALOHAnet.

ALOHA and the other random-access protocols have an inherent variability in their throughput and delay performance characteristics. For this reason, applications which need highly deterministic load behavior sometimes used polling or token-passing schemes (such as token ring) instead of contention systems. For instance ARCNET was popular in embedded data applications in the 1980 network.

Design

Network architecture

Two fundamental choices which dictated much of the ALOHAnet design were the two-channel star configuration of the network and the use of random accessing for user transmissions.

The two-channel configuration was primarily chosen to allow for efficient transmission of the relatively dense total traffic stream being returned to users by the central time-sharing computer. An additional reason for the star configuration was the desire to centralize as many communication functions as possible at the central network node (the Menehune), minimizing the cost of the original all-hardware terminal control unit (TCU) at each user node.

The random-access channel for communication between users and the Menehune was designed specifically for the traffic characteristics of interactive computing. In a conventional communication system a user might be assigned a portion of the channel on either a frequency-division multiple access (FDMA) or time-division multiple access (TDMA) basis. Since it was well known that in time-sharing systems [circa 1970], computer and user data are bursty, such fixed assignments are generally wasteful of bandwidth because of the high peak-to-average data rates that characterize the traffic.

To achieve a more efficient use of bandwidth for bursty traffic, ALOHAnet developed the random-access packet switching method that has come to be known as a pure ALOHA channel. This approach effectively dynamically allocates bandwidth immediately to a user who has data to send, using the acknowledgment/retransmission mechanism described earlier to deal with occasional access collisions. While the average channel loading must be kept below about 10% to maintain a low collision rate, this still results in better bandwidth efficiency than when fixed allocations are used in a bursty traffic context.

Two 100 kHz channels in the experimental UHF band were used in the implemented system, one for the user-to-computer random-access channel and one for the computer-to-user broadcast channel. The system was configured as a star network, allowing only the central node to receive transmissions in the random-access channel. All user TCUs received each transmission made by the central node in the broadcast channel. All transmissions were made in bursts at 9600 bit/s, with data and control information encapsulated in packets.

Each packet consisted of a 32-bit header and a 16-bit header parity check word, followed by up to 80 bytes of data and a 16-bit parity check word for the data. The header contained address information identifying a particular user so that when the Menehune broadcast a packet, only the intended user's node would accept it.

Menehune

The central node communications processor was an HP 2100 minicomputer called the Menehune, which is the Hawaiian language word for “imp”, or dwarf people,[16] and was named for its similar role to the original ARPANET Interface Message Processor (IMP) which was being deployed at about the same time. In the original system, the Menehune forwarded correctly received user data to the UH central computer, an IBM System 360/65 time-sharing system. Outgoing messages from the 360 were converted into packets by the Menehune, which were queued and broadcast to the remote users at a data rate of 9600 bit/s. Unlike the half-duplex radios at the user TCUs, the Menehune was interfaced to the radio channels with full-duplex radio equipment.[17]

Remote units

The original user interface developed for the system was an all-hardware unit called an ALOHAnet Terminal Control Unit (TCU), and was the sole piece of equipment necessary to connect a terminal into the ALOHA channel. The TCU was composed of a UHF antenna, transceiver, modem, buffer and control unit. The buffer was designed for a full line length of 80 characters, which allowed handling of both the 40- and 80-character fixed-length packets defined for the system. The typical user terminal in the original system consisted of a Teletype Model 33 or a dumb CRT user terminal connected to the TCU using a standard RS-232C interface. Shortly after the original ALOHA network went into operation, the TCU was redesigned with one of the first Intel microprocessors, and the resulting upgrade was called a PCU (Programmable Control Unit).

Additional basic functions performed by the TCU's and PCU’s were generation of a cyclic-parity-check code vector and decoding of received packets for packet error-detection purposes, and generation of packet retransmissions using a simple random interval generator. If an acknowledgment was not received from the Menehune after the prescribed number of automatic retransmissions, a flashing light was used as an indicator to the human user. Also, since the TCU's and PCU’s did not send acknowledgments to the Menehune, a steady warning light was displayed to the human user when an error was detected in a received packet. Thus it can be seen that considerable simplification was incorporated into the initial design of the TCU as well as the PCU, making use of the fact that it was interfacing a human user into the network.

Later developments

In later versions of the system, simple radio relays were placed in operation to connect the main network on the island of Oahu to other islands in Hawaii, and Menehune routing capabilities were expanded to allow user nodes to exchange packets with other user nodes, the ARPANET, and an experimental satellite network. More details are available in [3] and in the technical reports listed in the Further Reading section below. later version is most useable in world.

References

  1. ↑ N. Abramson (1970). "The ALOHA System - Another Alternative for Computer Communications" (PDF). Proc. 1970 Fall Joint Computer Conference. AFIPS Press.
  2. ↑ Frank F. Kuo (1995). "The ALOHA system". ACM Computer Communication Review: 25
  3. 1 2 3 R. Binder; N. Abramson; F. Kuo; A. Okinaka; D. Wax (1975). "ALOHA packet broadcasting - A retrospect" (PDF). Proc. 1975 National Computer Conference. AFIPS Press.
  4. 1 2 N. Abramson (December 2009). "The ALOHAnet – Surfing for Wireless Data" (PDF). IEEE Communications Magazine 47 (12): 21–25. doi:10.1109/MCOM.2009.5350363.
  5. ↑ Kamins, Robert M.; Potter, Robert E. (1998). Måalamalama: A History of the University of Hawai'i. University of Hawaii Press. p. 159. Retrieved August 2, 2015.
  6. ↑ Robert M. Metcalfe and David R. Boggs (July 1976). "Ethernet: Distributed Packet Switching for Local Computer Networks". Comm. of the ACM 19 (7).
  7. ↑ D. W. Lipke, et al. (Fall 1977). "MARISAT – a Maritime Satellite Communications System". COMSAT Technical Review 7 (2).
  8. ↑ "Authorization of Spread Spectrum Systems Under Parts 15 and 90 of the FCC Rules and Regulations" (TXT). Federal Communications Commission. June 18, 1985. Retrieved 2007-08-31.
  9. ↑ B. Stavenow (1984). "Throughput-Delay Characteristics and Stability Considerations of the Access Channel in a Mobile Telephone System". Proceedings of the 1984 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems. pp. 105–112.
  10. ↑ Will Crowther (January 1973). "A System for Broadcast Communication: Reservation-ALOHA". Proceedings of the 6th Hawaii International Conference on Systems Sciences. Honolulu. pp. 371–374.
  11. ↑ Abramson, Norman (Mar 1985). "Development of the ALOHANET". IEEE Transactions on Information Theory 31 (2): 119–123. doi:10.1109/TIT.1985.1057021. Retrieved August 2, 2015.
  12. ↑ A. S. Tanenbaum (2003). Computer Networks. Prentice Hall PTR.
  13. ↑ Roberts, Lawrence G. (April 1975). "ALOHA Packet System With and Without Slots and Capture". Computer Communications Review 5 (2): 28–42. doi:10.1145/1024916.1024920.
  14. ↑ Len Kleinrock and Fouad A. Tobagi (1975). "Packet switching in Radio Channels: Part I – Carrier Sense Multiple Access Modes and their Throughput-Delay Characteristics". IEEE Transactions on Communications (COM–23): 1400–1416. doi:10.1109/tcom.1975.1092768.
  15. ↑ "AX.25 Link Access Protocol for Amateur Packet Radio" (PDF). Tucson Amateur Packet Radio. 1997. p. 39. Retrieved 2014-01-06.
  16. ↑ Mary Kawena Pukui and Samuel Hoyt Elbert (2003). "lookup of Menehune ". in Hawaiian Dictionary. Ulukau, the Hawaiian Electronic Library, University of Hawaii Press. Retrieved August 11, 2011.
  17. ↑ Franklin F. Kuo (1981-08-11). "Computer Networks-The ALOHA System" (PDF). Retrieved 2014-07-12.

Further reading

External links

This article is issued from Wikipedia - version of the Tuesday, May 03, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.