text:
|Publication number
|Publication type
|Application number
|Publication date
|Jul 1, 1980
|Filing date
|Mar 27, 1978
|Priority date
|Mar 27, 1978
|Also published as
|Publication number
|Gregory T. Hopkins, Paul E. Wagner
|Original Assignee
|The Mitre Corporation
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (7), Referenced by (111), Classifications (9)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates to communications systems, and more particularly, to time division, multiple access digital bus communications systems.
The need for the efficient interconnection of computers and computer-related devices has become increasingly apparent with the development of computer technology. In particular, multi-processor systems typically include a number of computers, often widely distributed, which are interconnected by a data bus to remote subscriber terminals and associated peripheral devices. With the developing technology, such terminals and devices have become diverse and capable of wide distribution. The interconnection between such devices has become critical to the system use and performance, particularly in view of the need for adequate digital communication bandwidth, fast response time, high reliability, and the requirement for full access to all coupled but physically distributed devices. Conventional systems typically utilized circuit and message switching techniques. In addition, packet switching techniques have been utilized, although such systems have required relatively expensive store and forward nodes, which raise cost and reliability problems.
Primarily, the conventional time division multiple access (TDMA) bus communications systems have relied on time slotting and assignments of these slots to transmitting subscribers, either permanently or at sign-on to the TDMA system. For example, see U.S. Pat. No. 3,851,104, Willard, et al. While such systems are efficient for a population of high duty cycle traffic, large numbers of low duty cycle users, such as intercommunicating computers, quickly overburden many of the prior art TDMA systems having slots uniquely assigned to various subscribers.
In view of this problem, bus contention protocols have been developed to more efficiently utilize the available bandwidth for computer and terminal communications. Generally, contention systems permit a user to gain access to the entire channel bandwidth for his message burst. In operation, a user having a message to send is permitted to transmit his message whenever he is ready. In the event another user is presently transmitting over the channel, or does so during the first user's transmission, then a message collision occurs. The system users must sense these collisions and, in response, retransmit their respective messages. Some systems provide random delays before retransmissions to avoid "butting", i.e. continual collisions between users.
The contention protocols take advantage of the low duty cycle or "bursty" nature of data being transmitted from terminals and computers. For a large subscriber population of bursty users, the law of large numbers ensures that the channel bandwidth is only required to match the average aggregate data transmission rate of the entire population, rather than matching the sum of the peak rates for bursty subscribers as in the noncontention systems.
Several approaches to the contention protocol have been developed in the prior art. For example, the ALOHA system (see N. Abrahamson "The ALOHA System--Another Alternative For Computer Communications", 1970 Fall Joint Computer Conference, AFIPS Conf. Proc. Vol. 37, AFIPS Press, 1970), describes an unslotted system wherein a plurality of remote stations are connected to a central station by way of a single radio channel. The various remote stations contend for the channel and transmit complete packets of data. In this unslotted configuration, the data packets are not synchronized between stations. When a collision is detected by failure to receive an acknowledgement from the central station, each of the transmitting terminals then retransmits its packet. With this configuration, the ALOHA system is relatively efficient for bursty terminals (e.g. a terminal duty cycle on the order of 1%), compared with a system using separate channels for each station. However, a collision detected during a packet transmission results in the waste of the entire overlapping transmission intervals for the terminals (i.e. as much as two packet lengths), limiting maximum efficiency.
Slotted (i.e. systems where the transmitted packets are synchronized from terminal to terminal) ALOHA systems have been suggested to provide an improvement in efficiency compared with unslotted ALOHA systems. In the latter configuration, the channel is divided into time slots of duration equal to the fixed data packet length. Each user is constrained to begin transmission of a data packet at the start of any time slot. When a collision occurs during a slot, the wasted time is equal to a single packet length, resulting in a substantially higher efficiency than the unslotted system.
Another form of slotted, contention protocol communications system is disclosed in U.S. patent application Ser. No. 881,704, assigned to the assignee of the present application.
An unslotted, listen-while-talk (LWT), protocol, baseband communications system is disclosed in U.S. Pat. No. 4,063,220. This system includes a plurality of remote terminals coupled to a two-way communications medium. Prior to transmission, a terminal monitors the medium to detect activity (i.e. to sense whether the medium is currently busy). If the medium is busy, the terminal must defer at least until the current user is finished and the medium is no longer busy. If any terminal determines that the medium is not presently busy, that terminal may attempt to transmit on the medium.
As a user transmits his message, he also monitors the medium. If the user does not detect any errors in his own transmission for the duration of the end-to-end propagation delay along the medium, then he determines that he has gained sole access to the medium and will successfully complete his packet transmission (unless due to noise interference other than from other users competing for the medium). Upon detection of a collision within the propagation delay interval, each colliding user aborts his transmission, and subsequently retransmits his message at a time when he determines that the medium is no longer busy. With this configuration, the time wasted during a collision is only the end-to-end propagation delay interval for the medium, in contrast to an interval equal to a single packet length as in the slotted ALOHA system, and an interval greater than a packet length as in the unslotted ALOHA system.
Although relatively efficient compared with contention systems of the unslotted and slotted ALOHA types, the prior art LWT systems incorporating baseband transmission over a two-way medium generally require bi-directional repeaters located with minimum separations along the medium. This requirement is particularly important for relatively large systems where a terminal must perform the collision detection packet comparison operation with his own very high signal-to-noise ratio transmission with the substantially lower signal-to-noise ratio transmission which might come from a distant subscriber. In order to perform this operation, repeaters are provided to digitally regenerate the baseband signals on the medium, including reclocking of the signals to obtain full period bits with satisfactory rise and fall times. In addition, the repeaters must be spaced relatively close together on a multi-drop medium in order to offset delay distortion. These requirements for close repeater spacing are costly in terms of equipment and reliability. Furthermore, the prior art baseband LWT systems are highly susceptible to low frequency noise often found in industrial and computer environments.
It is an object of the present invention to provide an unslotted radio frequency, multiple access bus communications system employing a listen-while-talk contention protocol.
It is a further object to provide a radio frequency, multiple access bus communications system with listen-while-talk contention protocol over a system having unidirectional inbound and outbound signal paths connecting subscriber terminals.
Briefly, the present invention is directed to an unslotted radio frequency multiple access bus communications system employing a contention listen-while-talk (LWT) protocol. The system includes a plurality of remotely located terminals coupled to a communications bus. The bus includes a pair of oppositely directed, unidirectional signal paths which are connected at one end so that one path is an inbound path to that end and the second is an outbound path from that end. Each of the remote terminals includes a bus interface unit (BIU) coupled to both the inbound and outbound paths at the remote location. By way of example, the communications bus may comprise a pair of coaxial cables and conventional CATV components connected in a two-way cable distribution network.
Each BIU is adapted to transmit and receive modulated carrier signals on the inbound and outbound paths, respectively. The bus interface unit transmits on the inbound cable and receives on the outbound cable. No repeater or other head end equipment is necessary since the system is unslotted and each BIU transmits and receives on the same frequency. In alternative embodiments, frequency conversion may be utilized at the junction of the inbound and outbound paths.
In operation, when a terminal wishes to send a message to another terminal, the terminal's BIU initially performs an rf carrier sensing operation on the outbound path to make an initial determination as to whether or not any other subscriber is transmitting on the inbound path. In the event no carrier is detected, indicating that no other subscriber is using the inbound path, the BIU confirms this initial determination by performing its listen-while-talk function by first transmitting a message addressed to the desired receiving terminal on the inbound path, and then monitoring (i.e. "listening-while-talking") the outbound path for at least the maximum (end-to-end) propagation delay of the entire bus. If the transmitted message is received intact by the transmitting terminal within this period, the transmitting terminal's BIU determines that no collision has taken place between its message and a message sent by another terminal, and that the transmitting terminal has gained access to the bus. Thereafter, the BIU may transmit any remaining portion of its message packet on the inbound path. However, in the event a collision is detected, the transmitting terminal's BIU aborts its transmission and then backs off for a random time period before again attempting to gain access to the bus and transmit its message.
Thus, with this multiple access configuration, all subscribers (i.e. terminals) share the digital channel and have access to all information on the channel and are capable of transmitting all other subscribers on the channel. In addition, no subscriber starts a transmission unless, to the best of the subscriber's knowledge, the channel is not in use. Generally, this determination is made by sensing carrier on the outbound path.
With this configuration, a large number of low duty cycle, or "bursty", subscribers may be accommodated by determining a bandwidth appropriate to match the average aggregate data transmission rate of the entire population, rather than match the sum of the peak rates for bursty subscribers, as in conventional systems. Through the use of message transmission by modulated carrier signal on a unidirectional signal path, the present invention provides a more efficient system than the presently known listen-while-talk protocol systems, since the transmitted data is effected relatively little by signal-to-noise degradation on the line, and no repeaters are required. Furthermore, by utilizing the unidirectional signal paths aspects of the present invention, relatively large bandwidth can be used and thereby increasing the data transfer capability. As a further advantage of the present system, the modulated rf signals are relatively immune to error generation in the data due to interference from external noise sources compared with comparable data signals used in baseband systems.
The foregoing and other objects of this invention, the various features thereof, as well as the invention itself, may be more fully understood from the following description, when read together with the accompanying drawings in which:
FIG. 1 shows, in block diagram form, an exemplary communications system embodying the present invention;
FIG. 2 shows, in block diagram form, the bus interface unit (BIU) of the system of FIG. 1;
FIG. 3 shows, in schematic form, the bus interface unit (BIU) of the system of FIG. 1;
FIG. 4 shows, in schematic form, the modulator of the BIU of FIG. 2;
FIG. 5 shows, in schematic form, the demodulator of the BIU of FIG. 2;
FIGS. 6A-6C show, in block form, the functional operation of the BIU of FIG. 2;
FIGS. 7-14 show, in detailed flow chart form, the functional operation blocks of FIG. 6; and
FIG. 15 shows the packet format for the system of FIG. 1.
FIG. 1 shows a communications system 5 embodying the present invention. This embodiment includes a communications bus comprising an inbound unidirectional signal path 10 and an outbound unidirectional signal path 12 and a unidirectional path coupler 14 for transferring signals from the inbound path to the outbound path at the system head-end. The inbound and outbound paths 10 and 12, respectively each pass through a plurality of remote locations at which subscribers may couple to the communications bus. In the present embodiment, signal paths 10, 12 and coupler 14 include a single coaxial cable and associated conventional unidirectional coupling devices (at each subscriber location).
At each subscriber location, a subscriber terminal having a bus interface unit (BIU) and an associated subscriber device may be coupled to paths 10 and 12. Each BIU has an associated subscriber address. In FIG. 1, each BIU is denoted by reference designation 20 and a suffix representative of one of the exemplary locations A,B,C, and D. Similarly, the subscriber devices are denoted by reference designation 22 and a location-keyed suffix. Each BIU 20 receives data from its associated subscriber device 22, formats that data into a standard packet with header information (including originating and destination terminal addresses) and buffers that data packet until transmission time. At that time, the BIU 20 transmits the addressed data packet on the inbound path 10.
In addition, each BIU 20 also scans each packet of data on the outbound path for its own address. If a packet with the address for that BIU is detected, then the BIU reads the complete packet from the outbound path 12 into a buffer, error checks the packet, acknowledges the transmission, and then clocks the data to the subscriber device 22 at a predetermined data rate.
FIGS. 2 and 3 show a BIU 20 in block diagram form and detailed schematic form, respectively. BIU 20 includes a clock/bit rate generator 28, microprocessor 30, random access memory (RAM) 32, programmable read-only memory (PROM) 34, program interval timer 36, modem interface 40 and subscriber device interface 42. The microprocessor 30 is an MOS Technology type 6502A NMOS microprocessor. In Intel type 8205 decoder is configured to select the various units peripheral to microprocessor 30 based on the state of address line A8 -A10. RAM 32 is a 2048 byte memory configured from four Intel type 2114 units to provide message buffering, program stack, and temporary storage. PROM 34 is a pair of 1024 byte Intel type 2708 units for providing storage of the BIU program, as shown in the Appendix. The program interval timer 36 is an MOS Technology type 6522 unit. The clock/bit rate generator 28 is a Motorola type 14411 unit, 1.8432 MHz crystal, and switch network arranged to provide a 1.8432 MHz clock signal to microprocessor 30, a 307.2 Kbps clock signal to the modem interface 40, and eight switch selectable clock signals for the device interface 42 (9600 bps, 4800 bps, 2400 bps, 1200 bps, 600 bps, 300 bps, 110 bps, 75 bps).
The modem interface 40 includes a bus universal asynchronous receiver transmitter (UART) 50 and rf modulator 52 and demodulator 54. Bus UART 50 is a Motorola type 6850 asynchronous communications interface adapter (ACIA). The modulator 52 and demodulator 54 are shown in detailed schematic form in FIGS. 4 and 5, respectively. Tables I and II show the component values for the circuit elements in modulator 52 and demodulator 54, respectively.
TABLE I______________________________________R1 = 10K Z1 = 7406 Cl = 10 pfR2 = 10K C2 = 18 pfR3 = 10K C3 = 18 pfR4 = 10K Q1 = 40673 C4 = 10 pfR5 = 5K, Q2 = 40673 C5 = 10 pfR6 = 5.6K Q3 = 2N3904 C6 = 1 ufdR7 = 10K C7 = 1 ufdR8 = 10K C8 = 36 pfR9 = 1.2K D1 = MV2105 C9 = 36 pfR10 = 560 D2 = 1N914 C10 = 200 pfR11 = 100K D3 = 1N914 C11 = 1 ufdR12 = None C12 = 82 pfR13 = 820 C13 = 370 pfR14 = 1K, L1 = 51/2 T C14 = 2 pfR15 = 5.1K L2 = 1 μHy C15 = 36 pfR16 = 2K L3 = 4 1/4 T C16 = 2 pfR17 = 75 L4 = 5 1/2 T C17 = 36 pfR18 = 1K L5 = 5 1/2 T C18 = 2 pfR19 = 1K L6 = 4 1/4 T C19 = 82 pf C20 = 370 pf C21 = 1 ufd C22 = 1 ufd______________________________________
TABLE II______________________________________R1 = 75 Z1 = NE592 C1 = 270 pf C19 = 1 ufdR2 = 820 Z2 = LM2111 C2 = 82 pf C20 = 1 ufdR3 = 1K Z3 = MC1330 C3 = 2 pf C21 = 62 pfR4 = 100 Z4 = RC3302 C4 = 36 pf C22 = 390 pfR5 = 1K Z5 = 74122 C5 = 2 pf C23 = 1 ufdR6 = 100 Z6 = 7486 C6 = 36 pf C24 = 1500 pfR7 = 5K Z7 = 7438 C7 = 2 pf C25 = 1 ufdR8 = 100 C8 = 82 pf C26 = 1 ufdR9 = 200 C9 = 270 pf C27 = 500 pfR10 = 1K D1 = IN961 C10 = 1500 pf C28 = 680 pfR11 = 100 D2 = IN914 C11 = 1 ufd C29 = 750 pfR12 = 100 C12 = 1500 pf C30 = 1500 pfR13 = 5K C13 = 22 pf C31 = 130 pfR14 = 1K L1 = 4 1/4 T C14= 1 ufd C32 = 1 ufdR15 = 1K L2 = 5 1/2 T C15 = 1 ufd C33 = 1 ufdR16 = 1K L3 = 5 1/2 T C16 = 5 pf C34 = 1000 pfR17 = 2K L4 = 4 1/4 T C17 = 36 pfR18 = 100 L5 = 5 1/2 T C18 = 1 ufdR19 = 2.7K L6 = 1.5 μHyR20 = 560R21 = 13KR22 = 6.2KR23 = 1K,R24 = 1KR25 = 5.1K______________________________________
As shown in FIG. 2, the device interface 42 includes an RS-232C serial data port 56 and an 8 bit full duplex parallel data port 58, although only one of these ports may be selected for operation at a time. In alternative embodiments, both or other conventional device interfaces may be used. The port 56 includes a device UART 60 and signal conversion unit 62, provided by a Motorola type 6850 ACIA unit and associated Signetics type 1488 and 1489 RS-232-C quad driver and quad receiver units, respectively. With this configuration, an Infoton type terminal, for example, may readily be coupled to the BIU. The port 58 includes a parallel port interface 64 which is provided by the type 6522 unit used for the program interval timer 36.
In operation, on power-up or when reset, each BIU 20 asks its associated subscriber device 22 for the destination address (DA) of subsequent transmissions. Where the device 22 is an attended data terminal in the present embodiment, the inquiry is accomplished by printing an inquiry code at the terminal and then waiting for a keyboard entry. BIU 20 transforms the operators response to a 16-bit DA word. The operator may change the entered DA at any time. Where the device 22 is a computer, either a similar dialogue occurs in software or the BIU is programmed to accept and supply completely formatted packets to/from the computer.
All subsequent data from the subscriber device is then buffered in the BIU until an end-of-message, e.g. carriage return, is received or the buffer is filled. The destination address and the BIU's own 16-bit address (OA-originator address) are then appended to the message, together with other header data, to form a packet.
Once a packet has been assembled for transmission, the BIU reads the "receive key" line from the RF demodulator. When the receive key is "off" (i.e. no rf carrier is detected on outbound path 12) no other subscriber is currently transmitting. An "on" condition (i.e. rf carrier is detected) for the receive key indicates that the bus is in use. This is the basic carrier sense mechanism. With the receive key off, the BIU lowers the "transmit key" line and the BIU begins to transmit the message. Multiple transmit buffers for the subscriber device inputs are used so that data may still be accepted from the device while the bus transmission is in progress.
With its receiver enabled, the transmitting BIU sees the receive key go on after the round trip propagation delay of the inbound and outbound paths, and then begins to receive its own transmission. The four bytes (32 bits) are compared against those transmitted and, if identical, the transmitting BIU disables its receiver, and then transmits the remainder of the packet. If the test fails due to noise or another subscriber keying on during the propagation delay window, the BIU disables the transmitter, raises the transmit key signal (the receive key will then go high) and waits a pseudorandom time interval whose mean is approximately 400 microseconds. This random back-up feature is required to eliminate the possibility of two subscribers continually attempting simultaneous retransmissions.
With this configuration, the transmitting BIU listens for only 4 bytes (32 bits), i.e. the destination address and originator address. The four byte collision window (i.e. listening period) is longer than the maximum end-to-end propagation delay of the bus, which defines the limits of the time window in which other subscribers can possibly start transmissions without hearing, and therefore, deferring from transmitting their packets. This is the basic feature of the "listen-while-talk" protocol. Detection of collisions is insured since the first two characters of each message are the destination address and originator's address. This is a unique combination for each transmitting BIU.
In alternative configurations, different length collision windows may be utilized depending on the system geometry. The collision window must commence at least t1 from the packet start transmit time and extend at least t2 from that transmit time, where t1 equals the signal propagation time from the location of the transmitting BIU along the inbound path, the head end coupler, and along the outbound path back to the transmitting BIU, and where t2 equals t1 plus the signal propagation time along the inbound path between the transmitting BIU and the BIU located furthest from the head end along that path.
Computer subscribers to the bus insert the destination address into each packet transmitted since in the present embodiment no dialogue with the computer itself is conducted to establish addresses. Computer subscribers also supply the byte count of the packet. The BIU then accepts the proper number of bytes from the computer and then the packet is transmitted.
Packet reception from the outbound path which originate from other subscribers occurs in the following manner. At power-up the receiver of each BIU is enabled. The BIU compares the first 16 bits of each received packet with its own address. If the address comparison is successful, (i.e. detects a match), subsequent characters from the network are buffered until the received byte count is satisfied or the receive buffer is full. If the comparison fails the BIU disables its receiver. During any bus transmission, the receive key signal is on. When the receive key returns to the off condition, i.e., the previous packet transmission is complete, the BIU re-enables the receiver and awaits reception of the next packet.
Other receive filtering criteria are possible. Most systems require special message types (status, assignment) or filtering on originator's address as opposed to or in addition to the destination address in the packet. These features are readily programmed within the BIU.
Once a complete packet has been received, the BIU clocks the data to the subscriber at the subscriber data rate. Again, multiple buffering of received packets is employed so that subsequent packets may be received from the network while the first is being clocked to the subscriber.
For data received from the outbound path 12, the bus UART 50 performs serial-to-parallel conversion of data from the demodulator 52, checks each character for the proper number of start/stop bits, and generates an interrupt to the microprocessor 30 for each character received when the bus UART 50's receiver is enabled. Since the bus UART 50 is a full duplex device, data transmission can occur simultaneously. For data to be transmitted on inbound path 10, the microprocessor 30 first strobes each data word onto the bus UART 50 data bus lines. Then the bus UART 50 inserts start/stop bits, parity bits, performs the parallel-to-serial conversion, and clocks the data to the modulator at the supplied transmit clock rate. Since the bus UART 50 is double buffered on receive and transmit, a second character can be received while the first is being read by the microprocessor 30 or a second character can be loaded for transmission by the microprocessor 30 while the first is being clocked out to the modulator 52.
The bus UART 50 also provides a status register which can be read by the microprocessor 30 to indicate:
(1) the receiving holding register is full (this also causes an interrupt);
(2) the transmitter holding register is empty;
(3) the status of the "receive key" signal (logic "1" indicates the network is available, logic "0" indicates the network is busy);
(4) a false start bit was detected;
(5) the receiver holding has been overrun by a second character since the first was not read by a peripheral device;
(6) a parity error was detected;
(7) an interrupt was generated.
The device UART 60 used to interface the subscriber device 22 functions in conjunction with microprocessor 30 in a manner similar to UART 50. Serial data input by the device 22 is received by RS-232-C signal conversion hardware and then input to the device UART 60.
In the present configuration, each BIU performs the following functions in support of the basic packet transfer mechanism of "listen-while-talk":
(1) Initialize the microprocessor and its peripheral units at power-on and when the BIU is reset;
(2) move packets from the buffer memory 32 to the bus UART 50;
(3) check each packet transmitted to insure that collisions have not occurred. If a collision occurs, randomly back-off and then automatically retransmit the packet;
(4) receive properly addressed packets from the inbound path 10 and deposit them in memory 32.
In general, the device software is specific to the particular subscriber device 22 being interfaced to a location along the bus. However, each BIU 20 performs the following functions to support its associated subscriber device:
(1) Move received packets from the memory 32 to the connected device 22;
(2) accept data from the connected device 22 and format complete subscriber messages into the network packet;
(3) support a dialogue with terminal subscribers to establish destination address of subsequent data.
In addition, the present embodiment performs packet error checking and acknowledgements, retransmission of packets not acknowledged, and generation of status messages.
The above functions are depicted generally in the function block diagrams of FIGS. 6A-C, and in detail in the flow-charts of FIGS. 7-14, where each of FIGS. 7-14 corresponds to one of the blocks of FIGS. 6A-C.
The present embodiment provides an error correcting, packet communications protocol which includes the parts described in the following sections:
(1) Packet Transfer--This part of the protocol provides the listen-while-talk (LWT) mechanism for sharing the digital channel among a large number of subscribers.
(2) Error Correction--This part of the protocol provides end-to-end (transmitting BIU to receiving BIU) error detection and automatic retransmission of packets in error. An 8-bit check-sum is used for error detection.
(3) Flow Control--Receiving subscribers to the bus may control the rate at which buffers are transmitted in point-to-point conversations. Through the use of large buffers in the BIU's and this flow control mechanism, receiver overrun is avoided.
(4) Status--The BIU 20 automatically provides unsolicited status messages at approximately one minute intervals. Status messages contain the results of BIU self tests (e.g. memory and peripheral status register checks) and the current state of the connected device 22.
(5) Networking Addressing--Each subscriber device 22 may establish and change destination addresses.
The LWT protocol requires each subscriber to hear his own packet transmissions as well as those of all other subscribers. When a BIU is ready to transmit, the BIU first checks the outbound channel to see if it is busy. If busy, the BIU simply waits until the line is free. When free, the first words of the packet are transmitted on the inbound channel and the BIU begins to see its own transmission on the outbound channel but delayed by the propagation time. The BIU then checks to see if the transmitted data is identical to that being received. If so, the BIU transmits the remainder of the packet knowing that all other subscribers are now waiting. If an error (either caused by noise or another subscriber's transmission), is detected, the BIU determines that a "collision" exists. In response to this determination, the BIU stops transmitting, freeing the channel for other subscribers, and then backs off a random amount of time before retransmitting. Thus, the transmitting subscriber listens to his own transmission for at least the maximum proagation delay of the cable system, since this is the time window in which another subscriber could start before hearing the original transmission.
In the present embodiment, the choice of the random back-off time uses a random number generator in the BIU with a fixed means of about 400 microseconds. In heavily loaded systems, collisions between packets and subsequent random retransmissions of the packet occur frequently. In other words, as the system becomes busier, the probability that two subscribers start a packet transmission within the end-to-end propagation delay window increases.
FIG. 15 shows the basic packet format for the LWT bus. Four 16 bits form the header portion, with the words being representative of the destination address (DA), originator address (OA), message type (MT), and byte (8 bits) count (BC). The header portion is followed by as many as 960 bits of message data and an 8 bit check-sum word used for error control.
In addition to receiving its own transmission, each BIU examines the outbound channel for address matches or special message types. Subject to processing time limitations within the BIU, this message type and address filtering may readily be varied.
Although the LWT packet transfer protocol provides some error detection on the front end of each packet and subsequent retransmission, an error correcting end-to-end technique is used in addition. More particularly, an acknowledgement for each packet transmitted without error. Automatic retransmission is provided for each packet not acknowledged. To provide this error correction, each packet includes a sequence bit (1 or 0) and an 8 bit check-sum (CS). When the packet is received at the destination address, the check-sum is compared with received packet. If the check-sum is correct for the received packet, the receiver transmits an ACK message to the originating terminal containing the same sequence bit as that received. Thus, a transmitter whose packet is not acknowledged must retransmit the original packet after waiting a fixed time interval. A receiver who acknowledges a packet but subsequently receives a packet with the same sequence bit must assume that the ACK packet was lost and must retransmit the ACK. If eight retries are unsuccessful, the transmitter deletes the packet from the transmit queue, and increments a "failed packet transmission" count. Each retry also causes a "retry" count to be incremented.
Receivers may control the flow of data transmitted to them by selectively failing to acknowledge packets. The data flow is effectively controlled since the transmitter must retransmit the same packet. This aspect of the present invention is particularly useful in aiding transmissions from a computer subscriber device to an I/O terminal subscriber device. In this case, the large buffers contained in the terminal BIU can free the computer from a relatively slow I/O terminal.
The programmable communications interface provides an opportunity to perform BIU 20 self-tests and report this information to a central status monitor and/or the connected subscriber device 22. To this end, the BIU performs self-tests in the background when it is not involved in the transmission or reception of data from either the network or the connected device. Specifically, the following tests are performed and results thereof maintained in memory:
(1) The BIU performs a complete memory test of all random access memory (RAM) 32 locations.
(2) The BIU examines the status registers contained in the parallel port 58, serial port 56, and interval timer 36. The comparison is performed to determine differences between the expected values and the actual values of each register.
In addition, the following status data is maintained between status messages:
(1) A count of the number of unacknowledged packets.
(2) A count of the number of packets that were discarded because eight retransmissions were attempted but not acknowledged.
The results of each of these tests, the status data, the current value of the device status register in either parallel port 58 or serial port 56, the number of packets queued for transmission, and the number of queued received packets are reported in each transmitted status message. Each BIU provides an unsolicited status message approximately every minute based on interval timer 36 within the BIU.
The status message is a unique message type on the LWT bus, and is characterized by an associated code word in the message type (MT) portion of the packet format.
The BIU permits its connected subscriber to quickly change the destination address of packets it wishes to transmit. Computer subscribers may be in conversation with a number of other network subscribers. Thus, successive packets may contain a variety of destination addresses. Therefore, computer subscribers must completely format each packet before sending it to the BIU. The BIU simply accepts this formatted packet and faithfully transmits it onto the network.
For attended terminal devices, power-on reset or the manual reset switch causes the BIU 20 to explicitly inquire as to the desired receiver. Valid responses are converted into destination addresses, and the BIU transmits a sign-on request message to the specified destination address. If no response is received within approximately fifteen seconds, a "SYSTEM NOT AVAILABLE" message is transferred to the device 22. If a response is received, the BIU 20 assumes a proper connection and a "LINK ACCEPTED" message is transferred to device 22.
For unattended devices, i.e. printers, cassette recorders, discs, etc., sign-on requests are immediately accepted if the device is not currently logically connected to another subscriber. Otherwise, a response to the sign-on request is not transmitted, and a "SYSTEM NOT AVAILABLE" message is transferred to the device that originated the sign-on request.
The invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. ##SPC1## ##SPC2##
|Cited Patent
|Filing date
|Publication date
|Feb 11, 1974
|Nov 25, 1975
|Digital Communications Corp
|TDMA satellite communications system with guard band obviating ongoing propagation delay calculation
|Feb 21, 1975
|May 18, 1976
|Fujitsu Ltd.
|Acquisition system for the SDMA/TDMA satellite communication system
|Aug 30, 1974
|May 18, 1976
|Omron Tateisi Electronics Co.
|Data communication system
|Mar 31, 1975
|Dec 13, 1977
|Xerox Corporation
|Multipoint data communication system with collision detection
|Jan 27, 1977
|May 16, 1978
|Her Majesty The Queen In Right Of Canada, As Represented By The Minister Of National Defence
|Satellite communications system
|Oct 13, 1977
|Jun 20, 1978
|International Business Machines Corporation
|Common channel access method for a plurality of data stations in a data transmission system and circuit for implementing the method
|Mar 21, 1977
|Sep 19, 1978
|Satellite Business Systems
|Single channel per burst TDMA multiple transponder network
|Citing Patent
|Filing date
|Publication date
|Mar 31, 1980
|Mar 9, 1982
|U.S. Philips Corporation
|Transmitter apparatus for an information transmission system
|Feb 12, 1981
|Apr 5, 1983
|Electric Power Research Institute, Inc.
|Data highway access control system
|Apr 16, 1981
|Jun 7, 1983
|Ncr Corporation
|Data processing system wherein at least one subsystem has a local memory and a mailbox memory within the local memory for storing header information
|Mar 10, 1981
|Aug 30, 1983
|Vanderhoff Communications Ltd.
|Speech and data communication network
|Oct 23, 1981
|Oct 25, 1983
|Bell Telephone Laboratories, Inc.
|Collision avoiding system, apparatus and protocol for a multiple access digital communications system including variable length packets
|Apr 30, 1981
|Feb 14, 1984
|The United States Of America As Represented By The United States Department Of Energy
|Carrier sense data highway system
|Sep 3, 1981
|Mar 27, 1984
|Bell Telephone Laboratories, Incorporated
|Collision avoiding system and protocol for a multiple access digital communications system
|Feb 24, 1982
|Mar 27, 1984
|General Electric Company
|Bimodal bus accessing system
|Feb 24, 1982
|Aug 7, 1984
|General Electric Company
|Bi-directional token flow system
|Jun 8, 1982
|Oct 9, 1984
|Cromemco Inc.
|Random entry intercomputer network with collision prevention
|Apr 16, 1981
|Jan 15, 1985
|Ncr Corporation
|Data processing system employing broadcast packet switching
|Dec 13, 1982
|Feb 5, 1985
|Trw Inc.
|Communication network and method for its use
|Mar 14, 1983
|Feb 5, 1985
|Scientific Atlanta, Inc.
|Multiaccess broadcast communication system
|Aug 2, 1982
|Feb 19, 1985
|Dahod Ashraf M
|Digital communication system
|Aug 20, 1981
|Mar 5, 1985
|Stanford University
|Local area communication network utilizing a round robin access scheme with improved channel utilization
|Apr 4, 1983
|Apr 9, 1985
|General Electric Company
|Prioritized unidirectional distributed bus accessing system
|Oct 26, 1981
|Apr 16, 1985
|Patelhold Patentverwertungs- & Elektro-Holding Ag
|Common bus access system using plural configuration tables for failure tolerant token passing among processors
|Jun 15, 1983
|May 14, 1985
|General Electric Company
|Preemptive bid communication system
|Jul 19, 1982
|Jul 30, 1985
|At&T Bell Laboratories
|Collision avoiding system and protocol for a two path multiple access digital communications system
|Mar 24, 1983
|Aug 20, 1985
|Mds Qantel, Inc.
|Multi-processor system with communication controller using poll flags for non-contentious slot reservation
|Jun 8, 1983
|Aug 27, 1985
|Cselt Centro Studi E Laboratori Telecommunicazioni Spa
|Variable-band switching system for voice and data communication
|Dec 30, 1983
|Sep 17, 1985
|At&T Bell Laboratories
|Reconfigurable collision avoiding system, station and protocol for a two path multiple access digital communications system
|Jul 18, 1983
|Feb 4, 1986
|Northern Telecom Limited
|Method of, and a terminal for, transmitting bytes to a bus
|Jan 24, 1983
|Feb 25, 1986
|Intel Corporation
|Collision detection method using CRC code
|Jan 26, 1983
|Mar 4, 1986
|Trw Inc.
|Communication bus interface unit
|Jun 10, 1983
|Mar 4, 1986
|Nec Corporation
|Multiple access system and method
|May 31, 1983
|Apr 8, 1986
|At&T Bell Laboratories
|Local area network packet protocol for combined voice and data transmission
|Apr 16, 1981
|Apr 15, 1986
|Ncr Corporation
|Data processing system wherein all subsystems check for message errors
|Jun 3, 1982
|Apr 22, 1986
|Christian Ryckeboer
|Method and device for the asynchronous series communication on the multipoint type of a plurality of logic transceivers
|Dec 19, 1983
|Jun 17, 1986
|Tokyo Shibaura Denki Kabushiki Kaisha
|Data transmission system for a local network
|Apr 23, 1984
|Jul 22, 1986
|Codex Corporation
|Local area data communication network
|Oct 2, 1984
|Nov 11, 1986
|Japanese National Railways
|Channel control system for loop type signal transmission channel
|May 22, 1984
|Dec 2, 1986
|Rolm Corporation
|Time division multiplexed computerized branch exchange
|Apr 19, 1985
|Dec 16, 1986
|At&T Bell Laboratories
|Bidirectional dual network
|Oct 29, 1982
|Apr 7, 1987
|Fuji Xerox Co., Ltd.
|Digital signal transmission system
|Nov 29, 1985
|Aug 18, 1987
|Rca Corporation
|Asynchronous random access communication system with collision resolution based on time of arrival
|Apr 29, 1982
|Jan 12, 1988
|Motorola, Inc.
|Method and apparatus for limiting bus utilization
|Jan 5, 1987
|May 17, 1988
|General Electric Company
|Random access communication system with contention scheduling of subpacketized data transmissions and scheduled retransmission of unsuccessful subpackets
|Jul 11, 1986
|Jun 7, 1988
|Tadiran Electronics Industries Ltd.
|Data switching system and method
|Nov 14, 1985
|Jun 14, 1988
|Hughes Network Systems, Inc.
|TDM collision detector
|Nov 24, 1987
|Aug 9, 1988
|Minnesota Mining And Manufacturing Company
|Communication system for the transfer of small digital message blocks and large digital message blocks
|Apr 10, 1987
|Sep 13, 1988
|Northern Telecom Limited
|Private cellular system
|Sep 10, 1986
|Sep 27, 1988
|General Electric Company
|Random access communication system with scheduled data transmission and asynchronous contention scheduling
|Sep 11, 1984
|Mar 20, 1990
|Siegfried Schwarz
|Onechip-computers as network-controller and computer
|Dec 3, 1985
|May 1, 1990
|The University Of Western Australia
|Queueing protocol
|Oct 27, 1988
|Jul 31, 1990
|Motorola, Inc.
|System for cooperatively reassigning duties in a multiple controller environment
|May 2, 1989
|Dec 4, 1990
|Complex, Societe Anonyme
|Method and device for the asynchronous transmission of data by packets
|Mar 8, 1990
|Sep 24, 1991
|Robert M. Newman
|Queueing protocol
|Feb 26, 1990
|Jan 14, 1992
|International Business Machines Corporation
|Method and apparatus for distributed queue multiple access in a communication system
|Jul 7, 1992
|Nov 30, 1993
|Digital Equipment Corporation
|Collison detection and signaling circuit
|Jan 13, 1992
|Jan 4, 1994
|Windata, Inc.
|Wireless local area network communications system
|Dec 14, 1992
|May 10, 1994
|At&T Bell Laboratories
|Multiple-master digital communication technique utilizing a dedicated contention bus
|Jun 18, 1992
|Aug 2, 1994
|Digital Equipment Corporation
|Communications system with reliable collision detection method and apparatus
|Aug 6, 1991
|Sep 27, 1994
|Robert M. Newman
|Queueing protocol
|Jul 24, 1992
|Sep 5, 1995
|Cyplex Corporation
|Frequency hopping time-diversity communications systems and transceivers for local area networks
|May 25, 1994
|Mar 12, 1996
|Robert Bosch Gmbh
|Monitoring a computer network
|Mar 8, 1996
|Jun 9, 1998
|Dsc Communications Corporation
|Method and apparatus for avoiding collisions in an electronic business set terminal
|May 28, 1998
|Mar 13, 2001
|3Com Corporation
|Memory based buffering for a UART or a parallel UART like interface
|Jan 29, 1999
|Nov 5, 2002
|Kabushiki Kaisha Sega Enterprises
|Game system
|Dec 3, 1999
|Mar 25, 2003
|Kent Ridge Digital Labs
|CSMA/CD wireless LAN
|Jan 5, 2000
|Apr 6, 2004
|Yijun Zhao
|Network adapter for providing initialization and protocol translation between a microprocessor and a network interface
|Oct 6, 2003
|Apr 1, 2008
|Colder Products Company
|Data collision detection device and method
|Apr 25, 2006
|Dec 15, 2009
|Microsoft Corporation
|Variable OFDM subchannel coding and modulation
|Mar 30, 2007
|Apr 19, 2011
|Microsoft Corporation
|FEC in cognitive multi-user OFDMA
|Apr 25, 2006
|Apr 26, 2011
|Mircosoft Corporation
|OFDMA based on cognitive radio
|Sep 5, 2007
|Jun 28, 2011
|Microsoft Corporation
|OFDM transmission and reception for non-OFDMA signals
|Dec 12, 2006
|Mar 27, 2012
|Microsoft Corporation
|Cognitive multi-user OFDMA
|May 12, 2006
|May 29, 2012
|Microsoft Corporation
|Stack signaling to application with lack of requested bandwidth
|Jan 25, 2008
|Feb 12, 2013
|Microsoft Corporation
|Orthogonal frequency division multiple access with carrier sense
|Apr 18, 2012
|Aug 13, 2013
|Microsoft Corporation
|Stack signaling to application with lack of requested bandwidth
|Jun 6, 2011
|May 6, 2014
|Microsoft Corporation
|OFDM transmission and reception for non-OFDM signals
|Mar 21, 2011
|Sep 23, 2014
|Microsoft Corporation
|FEC in cognitive multi-user OFDMA
|Dec 18, 2008
|Oct 7, 2014
|Microsoft Corporation
|Wireless access point supporting control by multiple applications
|Apr 20, 2012
|Dec 30, 2014
|Microsoft Corporation
|Signaling to application lack of requested bandwidth
|Mar 22, 2012
|Jun 23, 2015
|Microsoft Technology Licensing, Llc
|Cognitive multi-user OFDMA
|Apr 18, 2014
|Jun 7, 2016
|Microsoft Technology Licensing, Llc
|OFDM transmission and reception for non-OFDM signals
|Feb 9, 2013
|Jun 7, 2016
|Microsoft Technology Licensing, Llc
|Orthogonal Frequency Division Multiple Access with carrier sense
|Dec 12, 2013
|Jul 5, 2016
|Microsoft Technology Licensing, Llc
|Signaling to application lack of requested bandwidth
|Jun 25, 2010
|Sep 13, 2016
|Microsoft Technology Licensing, Llc
|Fine-grained channel access in wireless networks
|Mar 11, 2015
|May 2, 2017
|Microsoft Technology Licensing, Llc
|Cognitive multi-user OFDMA
|Jan 19, 2001
|Nov 15, 2001
|Lack Craig D.
|Printing of polishing pads
|Dec 21, 2001
|Jun 27, 2002
|Telefonaktiebolaget Lm Ericsson (Publ)
|Digital bus system
|Mar 2, 2001
|Sep 5, 2002
|Wuhan P&S Electronics Company Ltd.
|Network server and database therein
|Oct 6, 2003
|Jul 8, 2004
|Colder Products Company
|Data collision detection device and method
|Jul 5, 2001
|Aug 12, 2004
|Sam-Chul Ha
|Network control system for home appliances
|Dec 20, 2004
|Jul 21, 2005
|Airbus Deutschland Gmbh
|Data bus system
|Dec 7, 2004
|Jun 8, 2006
|Fengji Ye
|Media access controller with enhanced data unit retransmission for broadband wireless communication and method
|Apr 25, 2006
|Oct 25, 2007
|Microsoft Corporation
|OFDMA based on cognitive radio
|Apr 25, 2006
|Oct 25, 2007
|Microsoft Corporation
|Variable OFDM subchannel coding and modulation
|May 12, 2006
|Nov 15, 2007
|Microsoft Corporation
|Stack signaling to application with lack of requested bandwidth
|Jun 21, 2007
|Jan 3, 2008
|Paradox Security Systems Ltd.
|Device network
|Dec 12, 2006
|Jun 12, 2008
|Microsoft Corporation
|Cognitive multi-user OFDM
|Mar 30, 2007
|Oct 2, 2008
|Microsoft Corporation
|FEC in cognitive multi-user OFDMA
|Sep 5, 2007
|Nov 13, 2008
|Microsoft Corporation
|OFDM transmission and reception for non-OFDMA signals
|Jan 12, 2009
|May 21, 2009
|Intel Corporation.
|Methods and media access controller for broadband wireless communications with variable data unit size and delayed data unit construction
|Dec 18, 2008
|Jun 24, 2010
|Microsoft Corporation
|Wireless access point supporting control by multiple applications
|Mar 21, 2011
|Jul 14, 2011
|Microsoft Corporation
|Fec in cognitive multi-user ofdma
|Jan 19, 1984
|Jul 26, 1984
|Intel Corp
|Verfahren zur feststellung einer nachrichtenkollision
|Oct 30, 1981
|May 26, 1982
|Xerox Corporation
|A shared-line communication system, and components therefor
|Nov 5, 1981
|Jun 9, 1982
|Xerox Corporation
|A shared line receiver
|Nov 5, 1981
|Aug 11, 1982
|Xerox Corporation
|A shared line receiver
|Jun 8, 1983
|Dec 21, 1983
|CSELT Centro Studi e Laboratori Telecomunicazioni S.p.A.
|Distributed variable-band switching system for speech and data
|Oct 17, 1986
|May 13, 1987
|Minnesota Mining And Manufacturing Company
|Communication system for the transfer of small digital message blocks and large digital message blocks
|Jul 5, 2001
|Dec 5, 2007
|LG Electronics Inc.
|Network control system for home appliances
|Jul 5, 2001
|Nov 14, 2012
|LG Electronics Inc.
|Network control system for home appliances
|Aug 17, 1982
|Mar 3, 1983
|Tobagi, Fouad, A.
|A local area communication network
|Feb 24, 1983
|Sep 29, 1983
|Western Electric Co
|Bidirectional dual network
|Mar 25, 1983
|Nov 10, 1983
|Motorola, Inc.
|Method and apparatus for limiting bus utilization
|Dec 3, 1985
|Jun 19, 1986
|The University Of Western Australia
|Queueing protocol
|Nov 16, 2001
|Jun 6, 2002
|P & S Datacom Corporation
|Microprocessor-interface communication protocol
|Dec 15, 2006
|Jun 21, 2007
|Paradox Security Systems Ltd.
|Device network interface
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification


text:
Storm Resources Ltd. announce the successful closing of the previously announced acquisition of a 100% working interest in 29 sections of land in the Umbach-Nig area prospective for liquids rich natural gas from the Montney formation (the "Acquisition"). Included in the Acquisition are two horizontal wells producing from the Montney formation.
The total cost of the Acquisition was approximately $87.9 million, which consisted of approximately $30.0 million in cash and 13.6 million common shares ("Common Shares") of Storm with a deemed value of $4.25 per Common Share, being the closing price of the Common Shares on the TSX Venture Exchange on January 30, 2014.
Storm Resources Ltd.
Please be civil. Job and promotion will not be added into the comment page.
Leave this field blank
Your name*
Your e-mail*
Your website
Your comment*
(Use Markdown for formatting.)
Leave this field blank
This question helps prevent spam:
What color is the sky on a clear day?*
Remember me
your browser.
Mobile news
Our news
your website
Do you have any
tips to us
About us | Contact | Privacy | Terms |
Editor: Michael Rogers
Copyright 1973-2016. Scandinavian Oil-Gas Online. ISSN 1500-709X.
Tel: +47 22 44 72 70, Fax: +47 22 44 72 87

subset: commoncrawl


text:
Begin New Search
Refine Last Search
Cemetery Lookup
Add Burial Records
Help with Find A Grave
Top Contributors
Success Stories
Community Forums
Find A Grave Store
Log In
Mary Hall Ferguson
member for 8 years, 4 months, 5 days
Add to MyFriends
Bio and Links
I have a web site called AT ONE TIME and I am taking photos of cemeterys in Lamar Co,TX.This is something I started in 2004 and now have 71 cemeterys from Lamar Co. on line. I have also done cemeterys in different countys in Texas, Oklahoma, Arkansas & Kansas. Feel free to use any photo that is in your family line to add to your family records, but if you use these taken in Lamar Co. TX for other publication please ask permission by email and give credit to:
If you find any errors in my memorials or would like to take over editing for your family member, please email by using the Find A Grave's "Edit" button. I'm happy to transfer memorials for persons NOT related to me BUT or related to you. If requesting a transfer please indicate how you're related to the deceased.
Please Use The Edit Button For Any Information Or Request.
Thank You,
Mary Hall Ferguson
All rights Reserved:2016
Leave Public Message
Contributions to
Find A Grave
11,050 Memorials Added
10,755 Memorials Managed
25 Memorials/Week
17,992 Photos
14 Photo Requests
739 Volunteer Photos Taken
5,897 Virtual Flowers
23 Virtual Cemeteries
59 Fame Ratings
Search Contributor's Records
First Name
Last Name
Virtual Cemeteries
Bobo Family
Born in 1700
Burkeen Family
Citizen Of The Republic O...
Civil War Memorials
Civil War AR
Civil War OK
Civil War TX
Code Talkers
View all Virtual Cemeteries...
Messages left for Mary Hall Fergu... (454)
Leave Message
RE: George Tompkins
what memorial # is this George Tompkins?
thank you
Added by
on Jun 18, 2017 9:52 PM
Donna Spurgin Lay
Cynthia A. Rice Tudor #74673281
While research my husband's family I found Cynthia in the Tennessee, Compiled Marriages, 1851-1900 being married to Thomas N. Lay on Marriage Date: 28 Mar 1856, County:Claiborne, State:Tennessee. The 1860 census shows Thomas & Cynthia with three children: Mary age 3, John age 2 and Gilbert age 2/12 months. As your memorial for Cynthia mentioned never having children, I would appreciate any comments you may have about this.
Added by
Donna Spurgin Lay
on Jun 06, 2017 9:45 AM
Reeves Gilmore
Transfer request
Please transfer Find A Grave# 45483884 Ruth Nautilla Harral Reeves to me (#47699322). Ruth is my grandmother.
Thank you for all that you do and consideration of my request. Reeves Gilmore
Added by
Reeves Gilmore
on Jun 01, 2017 1:52 PM
Stephen Connor Schneider
Shirley Culpepper
Thank you for finding and photographing her headstone.
Added by
Stephen Connor Schneider
on May 02, 2017 4:16 AM
Garrell Lanford
RE: Garry Hall
Here is some information that I have and not sure if you have it. First I don't know where Garry's parents are buried, but Garry always said he grew up around Rosston/Cale area. I don't know if he was just kidding or what.
You know he had a sister at East Memorial Gardens, Isabell Fullilove. There is another sister buried there, Floyce Hall Chastain Moore, Born 9/12/1909, death 6/29/1992. Memorial #89466785. Her husband was Dolan Chastain. They had a child named Joe Donald Chastain, born 9/16/1928 in Lake Charles, Louisiana Calcasien county. He died in a work accident 5/11/1971. He is buried at East and his memorial # is 98591670. His wife Dorothy Dale Moore McDaniel(1935-2013) is at east # 111913658. They had 2 daughters that may still live in Texarkana just not. They are Rita Sawyer and Linda K. Gray.
I lived next to them growing up and the entire family was friendly and best friends you could have. Joe Donald was a great man and taught me a lot.
Hope this helps you.
Added by
Garrell Lanford
on Apr 24, 2017 6:59 AM
Debbie Zaharis
Walter E Lenoir
Than k you so much!
Added by
Debbie Zaharis
on Apr 24, 2017 1:10 AM
Garrell Lanford
RE: Garry Hall
I have no idea but will try to help you find them. Any information I find I will send to you. My e-mail is firstname.lastname@example.com. If you are ever back in Texarkana let my wife and I know and maybe we can meet.
Added by
Garrell Lanford
on Apr 19, 2017 5:53 AM
Garrell Lanford
RE: Garry Hall
On familysearch.org in the 1920 census I found Garry's brothers and sisters, brother-in-law and great grandparents. HIs siblings were sister Jo Hall, born 1908 in Arkansas. Sister Floyce Hall, born 1910 in Arkansas, sister Isabella born 1908 in AR, brother Denner born in 1912 in AR, sister, Armeda born 1919 in AR. They lived in Caney, Nevada County, AR. I have not been able to find Garry's parents grave.
In the 1940 census, Tom W. Fulstone, son-in-law married to Isabella, lived with them. They also had Joe Chastain, grandson born 1929 in Louisiana, Mary Sue Chastain, granddaughter born 1930 in Arkansas. They lived in Garland City, Miller County. Their address was a farm, 173 Duley Fery Road.
There was a Mattie Sark listed on a couple of the census. I do not know how they were related.
In the 1880 census was Joe L. Hall's parents, Mother, F.M. Hall, born 1856 in GA. Father, F.W. Hall born 1857 in AR. I do not know where they are buried. My email is email@example.com if you have any other questions. Good luck!
Added by
Garrell Lanford
on Apr 15, 2017 12:52 PM
Garrell Lanford
RE: Garry & Mary Hall
Thank you for responding. We uploaded a photo of his tombstone yesterday. He is buried next to my grandmother, Mary. I will try to get photos of Garry uploaded to find a grave soon.
I remember sitting in the kitchen with Garry listening to the St. Louis Cardinals games. He loved drinking coffee out of his saucer. We played many canasta games with the family. We enjoyed his sense of humor. He was very good to my grandmother and all the children and grandchildren. He always gave us a $2 bill every birthday and Christmas. Garry was always "Grandpa" to me.
I am new at this, but I am going to look up census records for free on familysearch.org (Mormons. You can also find information on Ancestry.com. Good luck in your search.
Added by
Garrell Lanford
on Apr 13, 2017 10:25 AM
James Dean Toland
RE: Powers
Thank you kindly. I've just added Sheila Frances Powers Dunn as her memorial was missing, and linked her to her family members as well.
Added by
James Dean Toland
on Apr 04, 2017 3:05 PM
View all messages...
Privacy Statement
Terms of Service


text:
A Seattle-based federal jury awarded US$21.5 million in damages to a man from Illinois who was injured by an automatic sliding-glass door on a Holland America cruise ship.
The Seattle Times reported that the verdict included US$16.5 million punitive damages. Attorneys argued that dozens of other travelers had been injured by the doors on HAL cruises.
The company denied that claim and asked the court to reduce the judgment. Holland America Line says it will appeal.
Surveillance video showed James Hausman of Springfield, walking through an automatic door in 2011, while he was on a world cruise. The door shut and struck the passenger in the face and side of the head.
A ship doctor diagnosed concussion. Hausman's attorneys said he suffered minor brain injury which caused seizures.


text:
We have recently re-introduced our iPoints currency and rewards system whereby you can stand a chance to win various cool prizes in our raffles which are held at regular intervals!
Our first raffle is up, whereby you can win an awesome 2-in-1 Stylus and Pen for iPhone, iPad and iPod Touch (or any other capacitive touch screen device for that matter)
How to enter the raffle
Simply register on our site, participate in our forums and comments section, automatically earn iPoints for your participation, and enter the raffle on our raffle page! Simple as that!
There will be MANY more prizes to come – all you need to do is earn those iPoints so you don't miss out!
What earns me iPoints?
Your participation in the forum and comments section earns you iPoints.
e.g. Creating a new thread, replying to existing posts, referring new members to the forum, voting in our polls and much more!.
Enter now!
So what are you waiting for, get posting and commenting and win some cool prizes!
Share This:


text:
Ok ok, not that kind of cruising, but still:
Tuesday, June 2, 2015
Spencer Cruises New York!
Posted by South Florida Lawyers at 6:30 AM
Labels: cruise ships, Spencer Aronfeld
5 comments:
- GodwhackerJune 2, 2015 at 7:23 AM
Hehe. Cheeky!ReplyDelete
- AnonymousJune 2, 2015 at 1:29 PM
- AnonymousJune 3, 2015 at 7:16 AM
But where did he buy that suit? Inquiring minds want to know.ReplyDelete
In the very back of the frame on the left you can see Elvis and Jimmy Hoffa stop and get a hot dog from a vendor. This is a riddle wrapped around a conspiracy.ReplyDelete
Subscribe to: Post Comments (Atom)


text:
UK Dating
I have found my match on your site am ecstatically happy and would like to cancel my subscription as I believe he is the man... more..
Other UK Dating Group Sites
Bruni reveals head of state waiting as she had sex with Sarkozy - European datingPosted on: May 11, 2010 20:53:29
While many people might have interesting stories about their dating or sex lives, it's arguable that very few will have kept a country's leader waiting because of an intimate moment.
However, Carla Bruni, the wife of French president Nicolas Sarkozy, confessed that they did just that, according to a new book.
The Daily Mail reports that the latest literary offering mentioned a revelation made to Michelle Obama, which triggered speculation the Queen was the one left waiting by the amorous couple.
Only weeks after they tied the knot at the beginning of 2008, they visited the UK and stayed at Windsor Castle during their official visit.
Bruni, a former supermodel, had been dating Sarkozy for just 11 weeks when they decided to get married, with her former lovers including Mick Jagger and Eric Clapton.
The book, entitled The Promise, claimed that Bruni shocked America's first lady when she started to discuss her sex life.
Find some continental amour by trying out European dating.
Related European Dating News
Jenny Frost and Vicente Juan Spiteri wedPosted on: August 16, 2011 12:23:47
Lonely hearts looking for love using online dating websites could be pleased to hear that Jenny Frost has married boyfriend Vicente Juan Spiteri Photographs from the big day are set...
(read more)
Selma Blair spotted with new babyPosted on: August 11, 2011 16:57:30
UK singles looking for a new partner to start a perfect family with could receive encouragement from recent pictures of Selma Blair Published in the Daily Mail the photographs show...
(read more)
Snooki single again?Posted on: June 8, 2011 16:51:07
Lonely hearts looking for a new partner using online dating websites could be sad to hear rumours that Snooki has split up with her boyfriend The Jersey Shore star who...
(read more)
Cristiano Ronaldo and Irina Shayk spotted in PortugalPosted on: May 26, 2011 17:08:15
Lonely hearts looking for a new partner using online dating sites could be happy to hear that things appear to be going well for Cristiano Ronaldo and Irina Shayk The...
(read more)
News Index
Online Dating (1340)
Senior Dating (48)
40 Plus Dating (91)
Elite Dating (238)
Adult Dating (165)
Mobile Dating (81)
Gay Dating (20)
Christian Dating (12)
Black Dating (7)
BBW Dating (11)
Lesbian Dating (12)
Military Dating (15)
European Dating (30)
South African Dating (5)
USA Dating (154)


text: Before season 6 begins, I was pretty sure we would see Walt again before the end, but now we're here, I'm not so sure. Do you think (without spoilers) he will be in one of the final episodes ? I don't care if Malcolm is 17 and Walt is supposed to be 13, I just want he comes back. He was really important, the Others even took him, and now it's like everybody forgot him. With his special gift, he could have been a Candidate.


text: State Rep. Tony Hwang, a Republican from Fairfield: "This bill moves forward and reinforces our fundamental right to know what is in our food so we can make informed choices about what we feed our families . . . Consumers may or may not wish to purchase foods that they know to be genetically modified, but they need the information made available to them to make those informed choices."


text:
Olivier Rousteing: I queued for Lagerfeld
Olivier Rousteing can vividly remember queuing to get hold of Karl Lagerfeld for H&M so is astounded it's now his designs people are clamouring for.
The Balmain creative director is the latest big name to team up with the high street retailer, with his pieces hitting stores globally on 5 November (15). It's still a dream come true for Olivier, who can't believe he's joined the likes of Stella McCartney and Karl by designing for the company.
"Ten years ago, I was queuing for the Karl Lagerfeld for H&M launch," he told WWD. "Now people will line up for me."
Although the collection has already been teased in promotional images, fans will get a real chance to see what they are like on Tuesday (20Oct15). A runway presentation will take place in New York, with models-of-the-moment Kendall Jenner, Gigi Hadid and Jourdan Dunn all taking part.
Up for grabs are a number of pieces which have fused Olivier's high-fashion aesthetic with the high street. Although the options are more expensive than usually seen in H&M - for example there's a monochrome beaded dress costing 499 euros - the team believes they represent value for money because so much work has gone into them. That doesn't mean the whole process was easy though.
"He wanted everything to be super short," Ann-Sofie Johansson, H&M's creative adviser, said. "We want short as well, but you have to be able to move in the dress."
There are a lot of sequins included in the line, as well as velvet jackets, shirt dresses and silk and velvet. It has a masculine vibe to it thanks to the bold lines on structured tops and tuxedo jackets, with Olivier explaining why that was important to him.
"I believe in strong women," he noted, "and women with all shapes. We have to get away from the real skinny girls."
Ann-Sofie added: "We didn't have any problems. It was only that he wanted to make a really big collection. We had to take it down a bit. He has so many ideas. He's a lot of fun. He's a team player."
Cover Media