GB2125257A - Improved local area network systems - Google Patents
Improved local area network systems Download PDFInfo
- Publication number
- GB2125257A GB2125257A GB08222530A GB8222530A GB2125257A GB 2125257 A GB2125257 A GB 2125257A GB 08222530 A GB08222530 A GB 08222530A GB 8222530 A GB8222530 A GB 8222530A GB 2125257 A GB2125257 A GB 2125257A
- Authority
- GB
- United Kingdom
- Prior art keywords
- medium
- communication medium
- data
- station
- priority
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/407—Bus networks with decentralised control
- H04L12/413—Bus networks with decentralised control with random access, e.g. carrier-sense multiple-access with collision detection (CSMA-CD)
- H04L12/4135—Bus networks with decentralised control with random access, e.g. carrier-sense multiple-access with collision detection (CSMA-CD) using bit-wise arbitration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/36—Handling requests for interconnection or transfer for access to common bus or bus system
- G06F13/368—Handling requests for interconnection or transfer for access to common bus or bus system with decentralised access control
- G06F13/374—Handling requests for interconnection or transfer for access to common bus or bus system with decentralised access control using a self-select method with individual priority code comparator
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Signal Processing (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Small-Scale Networks (AREA)
- Use Of Switch Circuits For Exchanges And Methods Of Control Of Multiplex Exchanges (AREA)
- Time-Division Multiplex Systems (AREA)
- Radar Systems Or Details Thereof (AREA)
- Low-Molecular Organic Synthesis Reactions Using Catalysts (AREA)
- Circuits Of Receivers In General (AREA)
Abstract
In local area networks where a number of terminal equipment stations communicate with each other directly over a common medium (optic fibre, co-axial cable, or broadcasts using radio, ultrasonic, infra red etc) every station monitors the medium continuously and can distinguish between a free level (level 0) a single application (level 1) and a multiple application (level 2). When the waiting station detects a level 1 the last of the previous group is being served and when the line becomes free it can apply its request signal. If this results in a level 1 signal after a suitable guard time the requesting station knows that it is the only applicant and can start its traffic transaction. For the purposes of contention resolution every station has a binary number which may comprise, depending on system requirements, any of the following:- A) A measure of the time for which the station has been waiting. B) A number unique to the station. C) A combination of A followed by B. A allows the stations to be allocated in order of application, B allows the allocation of a group before newcomers whereas C allows the allocation and takes into account both priority and time of request.
Description
1
GB 2 125 257 A 1
SPECIFICATION
Improved local area network systems
The present invention relates to local area network systems for use with computer and office 5 automation systems and is more particularly concerned with collision control arrangements for use in such systems.
Local area networks consist basically of a common communication path to which are 10 connected various equipments which require to communicate. Typically the equipments connected to the communications medium consist of computers, micro-processors, computer terminals, word processors, facsimile equipment 1 5 and voice terminals together with gateways to public and other external communication networks.
The communication path usually spans distances in the range of 0.1 to 10 Km and is 20 ideally suited for use in office buildings as a permanently installed communications infrastructure. The communications path consists of a transmission medium and a set of interfaces for subscriber connections. The transmission 25 medium can be a co-axial cable, a twisted pair, an optical fibre, a radio or a infra red communication channel or the like. Each interface matches the input/output structure of the subscriber to the communication path protocol. The 30 communication path may either be formed into a ring, of the type shown in British Patent Specification 1,168,476, or a suitably terminated transmission line, of the type shown in British Patent Specification 1,314,180. 35 The communication path transmission potocols operate either on a packet switched basis or in a time division multiplex basis. The packet switched arrangements are ideally suited to burst mode transmission systems, such as is 40 required for handling input/output terminal requirements in a computer system, whereas the time division multiplex arrangements are ideally suited to more continuous information transmission, as is required in telephone 45 connections. To be of advantage in the environment of an integrated communication infrastructure the local area network system should be capable of handling both burst mode and telephone type transmission requirements. 50 The simplest transmission protocols for such systems include a contention protocol where each interface independently decides when to transmit an addressed information packet. With such a simple system there is a possibility that interfaces 55 handling newly arriving packets may destroy the transmissions already under way. In this case a collision is said to occur. Alternative arrangements may be provided to reduce this problem as all interfaces can be arranged to sense 60 to occupancy of the medium before transmitting. Transmissions are inhibited whenever the medium is found to be busy. Collisions still occur, however, due to the non-zero propagation delay of the communications medium between interfaces. Some of the simpler system allow colliding packets to run to completion which of course decreases the effective throughput of the communication system. Alternatively the interfaces may be adapted to sense the communication medium before and during transmission. If a collision is detected the transmission is aborted immediately. This procedure reduces the wasted time due to the transmission of collided packets, and typically the colliding interfaces reschedule a retransmission of the packet at a later time; different for each interface of the system.
Such arrangements have the major problem that a wide range of delays may be encountered when applying for the common communication medium; and this is of particular disadvantage when data messages involving a succession of data packets or continuous communication is required to be accommodated by the local area network system. The problems as far as multi packet data messages are concerned can be overcome by using large buffer stores to reassemble the message after transmission in packet form in the interface equipment however, in the case of the continuous communication facilities required for voice communication the problems are particularly difficult to surmount owing to restrictions imposed by various network standards. It is an aim of the present invention to provide a local area network system which incorporates a collision contention arrangement which reduces the delay variations encountered in gaining access to the communication medium and provides fairer service order.
According to the invention there is provided a data communication system comprising a communication medium a plurality of subscriber's interface units connected to the medium each interface unit including a data transmission arrangement for transmitting data signals onto the medium and a data reception arrangement for receiving data signals from the medium and medium seizure means coupled to the transmission arrangement and the reception arrangement and adapted to launch onto the communication medium when that medium is free a unique priority signal. The reception arrangement includes means for detecting if more than one interface is concurrently applying a demand to the communication medium and to suspend a medium seizure demand when the priority level of the signal on the medium exceeds that of the demanding interface.
In the case of non-concurrent demands the station includes means for deferring the demand until all the prior concurrent demands have been satisfied.
Typically the unique priority signal is a binary number indicative of a) a measure of the time for which the station has been waiting, b) a number unique to the station, alloted for this purpose or c) a combination of a followed by b, transmitted in series during a medium seizure demand. Each bit of the priority number is applied to the medium in
65
70
75
80
85
90
95
100
105
110
115
120
125
2
GB 2 125 257 A 2
d.c. or carrier form for a predetermined duration of 2d, where d is the propagation delay of the communication medium. Each interface includes a comparator means adapted to compare the 5 state of each bit of the priority number on the medium during the medium seizure demand period. When the most significant '0' of an interface equipment priority number co-incides with a non '0' condition on the medium that 1 o interface equipment terminates its demand. Accordingly, in concurrent seizure demand situations, 50% of the conflicts will be resolved using the first digit of the priority number; 75% using the second digit of the priority number and 15 87y% using the third digit of the priority number.
The choice of binary number in accordance with the criteria defined above when using; a) gives to the nearest time unit of the station clock the exact order of application, b) ensures service 20 to a group applying together before newcomers but does not queue the group or c) deals with the situation where two stations have applied within the same time unit of the station clock.
The most concenient signalling waveform for 25 contention resolution is direct current since it is easily made additive in voltage level and suffers negligible attenuation, however, any waveform can be used as long as the more than one '1' condition can be sensed.
30 The speed of the contention signalling must be such that delays from end to end of the medium are taken account of, resulting in typically 5 to 10 /us per bit per kilometer distance.
The invention will be more readily understood 35 from the following description which should read in conjunction with the accompanying drawings. Of the drawings Figure 1 shows the system in block form, Figure 2 shows a typical waveform sequence, and Figure 3 shows a flow diagram of 40 the medium seizure operations performed by an interface.
The embodiments of the invention uses a coaxial cable communication medium COCM which is terminated in its characteristic impedance CIA 45 and CIB at each end. Connected to the communication medium are a number of interface units l/FA, l/FB, l/FC, l/FD, l/FE, l/FF, l/FG and l/FX which match the various subscriber terminals of the local area network to the communication 50 medium COCM. The communication medium is operated on a time division multiplex basis with 30 duplex channels operating at a 5Mb/s rate. Each channel can be used in a duplex manner with go and return sub channels or alternate use 55 of the channel in each direction. For data each full time slot provides for one line of text. The terminals connected to the system will vary of course depending upon the requirements of the system. Typically micro-processor based 60 terminals such as MPT can be connected to the medium as can bulk data storage equipment MTE. Similarly digital telephones DTA and DTB allow for voice communication in addition to the handling of computer based data. In addition 65 dedicated special purpose stations may be provided for (i) digital telephone conferencing, (ii) short code dialling (iii) external connection to public or private communication networks ETE (iv) voice recording (v) network usage accounting and 70 (vi) protocol conversion stations. Obviously the data processing stations may include (i) word processors, (ii) access units for a main frame computer systems (iii) line printers, (iv) facsimile equipment FE, (v) acoustic couplers for passing 75 data over the public telephone network and (vi) bulk storage data bases DBE.
Each equipment connected to the local area network is interfacbd by its own dedicated interface unit which may be particularised to the 80 equipment from a network point of view by use of a discrete equipment priority number. This number may be the same as the system equipment number or may be different therefrom. The equipment priority number may be used to 85 resolve concurrent demands for the communication medium and its particular advantages will become clearer when considering the operation of the system.
The process (Fig. 2).
90 Every station monitors the common line continuously and on each application can distinguish between a free line (level 0), a single application (level 1) and a multiple application (level 2).
95 If on the previous application the line reaches level 2 then out waiting station knows that two or more are in contention and when the line becomes free does not apply, i.e. it defers to the group already in contention.
100 When out waiting station detects level 1 in an application, it knows that the last of the previous group is being served and when the line becomes free can apply its signal.
If this results in level 1 on the line, after a 105 suitable guard time, out station knows that he is the only applicant and begins his traffic transaction whether single burst or multiplexed.
If level 2 is detected, our station knows it is in contention with one or more others which must 110 be resolved before traffic can be sent.
For the purpose of contention resolution every station has a binary number which may comprise, depending on system requirements any of the following:
115 A) A measure of the time for which the station has been waiting, conveniently arrived at by counting at the clock rate.
B) A number unique to the station, allotted for this purpose.
120 C) A combination of A followed by B.
On detecting contention (level 2) the stations concerned apply to the line for a fixed and adequate time, the first bit of their binary number, and behave as follows:
3
5
10
15
20
25
30
35
40
45
50
55
60
GB 2 125 257 A 3
Line Level Own Signal Action
2 1 Apply next bit
0 0 Apply next bit 1 or 2 0 Withdraw and reapply when line next free
1 1 No other con tenders left start transaction
Thus O's in the presence of other 1 's cause the station to drop out of the contention eventually leaving one who can start his transaction, those having dropped out have priority over newcomers.
The choice of binary numbers A B or C above is determined by:
A gives to the nearest time unit of the station clock order of application, subject to some error due to line delays.
B ensures service to a group applying together before newcomers but does not queue within the group.
C deals with the low probability of application within the same time unit of the station clock. Failure of resolution by time order is backed up by unique station number.
The most convenient signalling waveform for contention resolution is direct current since it is easily made additive in voltage level and suffers negligible attenuation, but if preferred the data waveform can be used.
The speed of contention signalling must be such that delays from end to end of the medium are taken account of, resulting in typically 5 to 10 /us per bit per kilometer distance.
As an option to each station monitoring the state of previous applications, priority can be given to those who have dropped out of a contention by adding a prefix bit to the losing station number and dealing with losers so identified, before newcomers.
A further prefix bit can identify the next group awaiting contention and so on if required.
Where the contention resolution is taking place in a multiplexed system having timeslots chosen in length for their suitability for the traffic to be carried, it is possible that occasionally contention resolution requires longer than one time slot. In these cases contention can continue in the next free time slot or if preferred, in the next appearance of the multiplexed time slot.
System operation
When a system terminal requires to communicate with another terminal it takes into use its own interface equipment. The sequence of events is shown in the flow diagram of Fig. 3 and the following operations will be described with reference to that diagram, which deals with the case of a multiplexed system. The process is equally applicable to a non multiplexed, variable length burst system and the equivalent flow diagram would be somewhat simpler. In Fig. 3 Pb is the level of the station signal and Cb that of the communication medium.
S1—Test for contention in progress
The interface equipment monitors the "Go"
slot of each channel as it occurs to see if a contention is in progress, i.e. level 2 is detected, in which case the station does not attempt to seize the next free time slot. Typically the use of so called "Manchester" codes or a discrete busy bit in the channel bit stream may be used to prevent a true data stream from mimicing a free condition.
S2, S3—Test for free "Go" slot
Where S1 indicates no contention is in progress this station wishing to send traffic looks for the next free time slot, i.e. one not in use in a multiplexed mode.
54—Apply seize bit or next significant bit of priority number
Where S1, S2 and S3 are all satisfied the station applied its sequence of seize bit followed by priority bits one by one until either this station withdraws owing to lower priority or has succeeded in seizing the channel owing to highest priority number.
55—Right shift priority number
This sequences the priority bits in turn until slot seizure or withdraw has been achieved.
56—Withdraw with priority next time
This condition resulting from losing the contention causes the S1, no contention requirement, to be bypassed giving this station priority over newcomers.
57—Slot seized
This seizure persists until all data has been transmitted and the channel released by resetting the memory with an internal end of transmission signal. Having seized a slot the station will transmit the address of the required called terminals who will not the time slot in their frame counter and interchange data without the need for further contention or addressing.
The above description has been of one embodiment only. Alternative arrangement will readily be seen by those skilled in the art; for example the seize procedure has used an "in channel" signalling technique whereas by the use of a separate seize wire or channel the conflicts could be resolved using the priority-number comparison techniques of the invention on that separate wire or channel. Also although the channels are described as duplex they can be used in a simplex manner involving for example, a polling technique where say a master terminal polls a number of slave terminals by identifying the polled terminal in each 'GO' slot and the polled terminal responds in the corresponding 'RETURN' slot. Alternatively to assist in the time slot selection process each station can be
65
70
75
80
85
90
95
100
105
110
115
120
4
GB 2 125 257 A 4
arranged to include a list of busy and free time slots.
Claims (10)
1. A data communication system comprising a 5 common communication medium and a plurality of subscriber's interface units connected to the medium, each interface unit including a data transmission arrangement for transmitting data signals on to the communication medium and a 10 data reception arrangement for receiving data signals from the communication medium and medium seizure means coupled to the data transmission arrangement and the data reception arrangement and arranged, when an interface unit 15 requires to transmit on to the communication medium and the communication medium is free, to launch on to the communication medium a unique priority signal and the data reception arrangement includes means for detecting if more 20 than one interface unit is concurrently applying to demand on to the communication medium and means for suspending a medium seizure demand when the priority level of the signal on the medium exceed that of the demanding interface 25 unit.
2. A data communication system as claimed in Claim 1 in which the unique priority signals is a binary number which is transmitted on to the communication by said medium seizure means in
30 serial form substantially in synchronisation with priority signals from concurrent demanding interface units.
3. A data communication system as claimed in Claim 2 in which each station connected to the
35 communication medium is allocated a unique number and the unique priority signal is derived from the number of the station connected to the interface unit.
4. A data communication system as claimed in 40 Claim 2 in which the interface units include means for deferring the launch of the unique priority number until all prior concurrent demands have been satisfied and said interface unit also includes means for recording the elapsed 45 time since requesting use of the communication medium and the communication medium becoming free and unique priority signal is derived from the elapsed time recorded.
5. A data communication system as claimed in 50 Claim 4 in which each station connected to the communication medium is allocated a unique number and the unique priority signal is derived from the number of the station together with the elapsed time recorded.
55
6. A data communication system as claimed in any of Claims 2 to 5 in which each bit of the priority signal is applied to the communication medium in ascending order of significance.
7. A data communication system as claimed in 60 Claim 6 in which corresponding bits of equal significance concurrently applied add to each other in the communication medium and each interface unit includes comparator means arranged to compare the state of each bit of the 65 priority signal on the communication medium during a medium seizure demand and said comparator means is arranged to terminate the launch of the priority signal when the comparator detects a marked bit on the communication 70 medium when the corresponding bit in the interface unit's priority signal is unmarked.
8. A data communication system according to any one of the preceding claims in which the priority signals are d.c. signals and each bit is
75 applied to the communication medium for a duration of at least 2d and where d is the propagation delay of the communication medium.
9. A data communication system according to any one of the preceding claims in which the
80 communication medium is operated on a time division multiplex basis.
10. A data communication system according to Claim 9 in which each time slot in the time division multiplex includes a contention resolution
85 period in which interface units requiring to use the communication medium apply their unique priority signals.
Printed for Her Majesty's Stationery Office by the Courier Press, Leamington Spa, 1984. Published by the Patent Office, 25 Southampton Buildings, London, WC2A 1AV, from which copies may be obtained.
Priority Applications (7)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB08222530A GB2125257B (en) | 1982-08-04 | 1982-08-04 | Improved local area network systems |
| AU15474/83A AU1547483A (en) | 1982-08-04 | 1983-06-08 | Local area network systems |
| ZA834246A ZA834246B (en) | 1982-08-04 | 1983-06-09 | Local area network systems |
| EP83303450A EP0100594A3 (en) | 1982-08-04 | 1983-06-15 | Improved local area network systems |
| NO832656A NO832656L (en) | 1982-08-04 | 1983-07-21 | DATA COMMUNICATION SYSTEM. |
| JP58142401A JPS5945743A (en) | 1982-08-04 | 1983-08-03 | Data communication system |
| DK356583A DK356583A (en) | 1982-08-04 | 1983-08-04 | LOCAL NETWORK SYSTEM |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB08222530A GB2125257B (en) | 1982-08-04 | 1982-08-04 | Improved local area network systems |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| GB2125257A true GB2125257A (en) | 1984-02-29 |
| GB2125257B GB2125257B (en) | 1986-03-26 |
Family
ID=10532113
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| GB08222530A Expired GB2125257B (en) | 1982-08-04 | 1982-08-04 | Improved local area network systems |
Country Status (7)
| Country | Link |
|---|---|
| EP (1) | EP0100594A3 (en) |
| JP (1) | JPS5945743A (en) |
| AU (1) | AU1547483A (en) |
| DK (1) | DK356583A (en) |
| GB (1) | GB2125257B (en) |
| NO (1) | NO832656L (en) |
| ZA (1) | ZA834246B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2149626A (en) * | 1983-10-27 | 1985-06-12 | Otis Elevator Co | Communications system |
| GB2165726A (en) * | 1984-10-05 | 1986-04-16 | Mitsubishi Electric Corp | Arbitration system for data bus |
| GB2230166A (en) * | 1989-03-31 | 1990-10-10 | Daniel Matthew Taub | Resource control allocation |
| WO1993007684A1 (en) * | 1991-10-07 | 1993-04-15 | Sixtel S.P.A. | Cordless local area network (radio lan) with central unit |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE3241777A1 (en) * | 1982-10-29 | 1984-05-03 | Siemens AG, 1000 Berlin und 8000 München | METHOD FOR CONTROLLING ACCESS OF DATA TRANSMISSION DEVICES TO A COMMON BUS LINE |
| NL8402364A (en) * | 1984-07-27 | 1986-02-17 | Philips Nv | METHOD, STATION AND SYSTEM FOR TRANSMISSION OF MESSAGES CONTAINING DATA PACKAGES. |
| US4667191A (en) * | 1984-12-21 | 1987-05-19 | Motorola, Inc. | Serial link communications protocol |
| DE69030037T2 (en) * | 1989-08-15 | 1997-06-26 | At & T Corp | Traffic control method in a high-speed data network |
| FR2678085B1 (en) * | 1991-06-24 | 1995-04-14 | Sgs Thomson Microelectronics | METHOD FOR MANAGING TRANSMISSION OF INFORMATION ON AN ELECTRICAL DISTRIBUTION CIRCUIT, DEVICE FOR ITS IMPLEMENTATION AND APPLICATION OF THE PROCESS TO COMMUNICATIONS IN A HOME AUTOMATION SYSTEM. |
| FR2679723B1 (en) * | 1991-07-23 | 1994-12-30 | Siemens Automotive Sa | METHOD FOR TRANSMITTING DIGITAL DATA TRANSMITTED IN THE FORM OF DIFFERENTIAL SIGNAL FRAMES. |
| EP1696608B1 (en) * | 1995-06-15 | 2008-01-23 | Koninklijke Philips Electronics N.V. | Method of operating a data bus system with transmitter stations |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB1365838A (en) * | 1972-04-21 | 1974-09-04 | Ibm | Data handling system |
| EP0035731A2 (en) * | 1980-03-11 | 1981-09-16 | Siemens Aktiengesellschaft | Method and arrangement for transmitting data signals |
| GB2074764A (en) * | 1980-04-23 | 1981-11-04 | Philips Nv | Multiprocessor computer system |
| GB2090107A (en) * | 1980-12-22 | 1982-06-30 | Honeywell Inf Systems | Communication system with collision avoidance |
| GB2095078A (en) * | 1981-02-26 | 1982-09-22 | Philips Nv | Data communication system |
| GB2114333A (en) * | 1982-01-07 | 1983-08-17 | Western Electric Co | Shared facility allocation system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| IT1129371B (en) * | 1980-11-06 | 1986-06-04 | Cselt Centro Studi Lab Telecom | MESSAGE SWITCH WITH STRUCTURE DISTRIBUTED ON A CHANNEL WITH RANDOM ACCESS FOR INTERVIEW WITH MESSAGES BETWEEN PROCESSING UNITS |
-
1982
- 1982-08-04 GB GB08222530A patent/GB2125257B/en not_active Expired
-
1983
- 1983-06-08 AU AU15474/83A patent/AU1547483A/en not_active Abandoned
- 1983-06-09 ZA ZA834246A patent/ZA834246B/en unknown
- 1983-06-15 EP EP83303450A patent/EP0100594A3/en not_active Withdrawn
- 1983-07-21 NO NO832656A patent/NO832656L/en unknown
- 1983-08-03 JP JP58142401A patent/JPS5945743A/en active Pending
- 1983-08-04 DK DK356583A patent/DK356583A/en unknown
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB1365838A (en) * | 1972-04-21 | 1974-09-04 | Ibm | Data handling system |
| EP0035731A2 (en) * | 1980-03-11 | 1981-09-16 | Siemens Aktiengesellschaft | Method and arrangement for transmitting data signals |
| GB2074764A (en) * | 1980-04-23 | 1981-11-04 | Philips Nv | Multiprocessor computer system |
| GB2090107A (en) * | 1980-12-22 | 1982-06-30 | Honeywell Inf Systems | Communication system with collision avoidance |
| GB2095078A (en) * | 1981-02-26 | 1982-09-22 | Philips Nv | Data communication system |
| GB2114333A (en) * | 1982-01-07 | 1983-08-17 | Western Electric Co | Shared facility allocation system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2149626A (en) * | 1983-10-27 | 1985-06-12 | Otis Elevator Co | Communications system |
| GB2165726A (en) * | 1984-10-05 | 1986-04-16 | Mitsubishi Electric Corp | Arbitration system for data bus |
| GB2230166A (en) * | 1989-03-31 | 1990-10-10 | Daniel Matthew Taub | Resource control allocation |
| WO1993007684A1 (en) * | 1991-10-07 | 1993-04-15 | Sixtel S.P.A. | Cordless local area network (radio lan) with central unit |
| US5598407A (en) * | 1991-10-07 | 1997-01-28 | Sixtel S.P.A. | Cordless local area network having a fixed central control device |
Also Published As
| Publication number | Publication date |
|---|---|
| GB2125257B (en) | 1986-03-26 |
| NO832656L (en) | 1984-02-06 |
| EP0100594A3 (en) | 1985-11-13 |
| ZA834246B (en) | 1984-03-28 |
| JPS5945743A (en) | 1984-03-14 |
| DK356583D0 (en) | 1983-08-04 |
| AU1547483A (en) | 1984-02-09 |
| DK356583A (en) | 1984-02-05 |
| EP0100594A2 (en) | 1984-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4507778A (en) | Digital transmission system | |
| US4532626A (en) | Collision avoiding system and protocol for a two path multiple access digital communications system | |
| US5440555A (en) | Access system | |
| CA1168770A (en) | Idle time slot seizure and transmission facilities for loop communication system | |
| US5960001A (en) | Apparatus and method for guaranteeing isochronous data flow on a CSMA/CD network | |
| US4516239A (en) | System, apparatus and method for controlling a multiple access data communications system including variable length data packets and fixed length collision-free voice packets | |
| EP0122765B1 (en) | Network protocol for integrating synchronous and asynchronous traffic on a common serial data bus | |
| US4750171A (en) | Data switching system and method | |
| EP0086223B1 (en) | A local area communication network | |
| US4581735A (en) | Local area network packet protocol for combined voice and data transmission | |
| US4586175A (en) | Method for operating a packet bus for transmission of asynchronous and pseudo-synchronous signals | |
| US6973051B2 (en) | Method for assigning resources in a shared channel, a corresponding mobile terminal and a corresponding base station | |
| US5802061A (en) | Method and apparatus for network access control with implicit ranging and dynamically assigned time slots | |
| JPH0630514B2 (en) | Communication control method for communication ring system | |
| US4502137A (en) | Digital signal transmitting method | |
| EP0100594A2 (en) | Improved local area network systems | |
| EP0430955B1 (en) | Communication system | |
| US4698804A (en) | Shared data transmission system | |
| US6389474B1 (en) | Method and apparatus for accessing a shared channel in a wireless network using a time slot allocation technique based on detecting the usage of the channel during a round trip interval | |
| EP0239828B1 (en) | Method of access to a local area network with a unidirectional transmission line, and network using such method | |
| US6111890A (en) | Gigabuffer lite repeater scheme | |
| US4601030A (en) | Multipoint system for interconnecting work stations | |
| JP2641487B2 (en) | Simultaneous operation of multiple terminal devices | |
| JPS5951794B2 (en) | Control method of distributed electronic exchange | |
| WO2003009518A2 (en) | System and method for multipoint to multipoint data communication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PCNP | Patent ceased through non-payment of renewal fee |