System for transmission of ATM cells through a passive local network

Abstract: Transmission system for ATM cells between a central station and local stations. In each local station, a cell being presented is stored in a cell buffer. In addition, a first character is written to a register. If an empty time slot is being presented, a second character is written to the register. The registers are read periodically. The content thereof is transmitted to the central station in the form of register codes. The central station transmits, on the basis of the location of the first characters in said register codes, permit codes to the local stations. With the aid of the presented system, it is possible, in practice, to bridge a distance of 20 kilometres between the local stations and the central stations, said distance hitherto having been approximately 10 kilometres. The system is simple, but, owing to the FIFO behaviour, has an excellent performance.

Description: BACKGROUND OF THE INVENTION The invention relates to a method for transmitting ATM cells presented to local stations to a central station, and ATM cells presented by said central station to the local stations, wherein, if a cell destined for the central station is presented in a local station, said cell is stored in a cell buffer. The problem in this context is that, on the one hand, cells which arrive first, no matter at which local station, must also be transmitted first to the central station (FIFO: first in, first out); on the other hand, particularly if use is made of the same medium over at least part of the transmission section, for example in passive optical subscriber networks, the transmission moment has to be governed from the central station, in order to avoid a collision in the common section. It is therefore an object of the invention to provide a governing mechanism which results in ATM cells which are presented to the local stations being transmitted to the central station in order of arrival, but controlled in such a way that no collision occurs in the process. It is noted that from reference 1 a method is known for transmitting ATM cells presented to local stations to a central station, and ATM cells presented by said central station to the local stations. The known method makes use of a "Permit Distribution Algorithm" (PDA), comprising a rather complex "FIFO Permit Multiplexing RAM" (FPMR), containing a (cyclic) "Permit Scheduling Belt" and an "Interim Storage Belt". For upstream transmission, every 17 slots a periodic "Request Access Unit" (RAU) is formed, comprising an "Arrival Info Field" of 72 bits, controlling the FPMR. B. SUMMARY OF THE INVENTION The invention provides a simple, but effective registration of the moments of arrival of cells at the various local stations and periodic transmission of said registration. Furthermore, it provides processing of said information in such a way on the side of the central station that, at the same time as ATM cells are despatched to the local stations, "permits" are despatched with them, which ensure that no collision occurs and the FIFO requirement is met. According to the invention, if an ATM cell destined for the central station is presented in a local station a first character is written to a local register, while, if, instead of an ATM cell, an empty time slot is presented in the local station, a second character is written to said local register. The local registers are read, their content is transmitted to the central station in the form of register codes, and the central station, on the basis of the location of said first characters within those register codes, transmits permit codes to the local stations, indicating the permission to transmit a cell during a specific time slot. It is preferred that the local registers are read and the content thereof is transmitted periodically. Moreover, it is preferred that both, said first character and said second character only comprise one bit having mutually different values ("0" or "1"). Implementation of the method according to the invention results in a important improvement: in practice a distance of 20 km between the local stations and the central station can be bridged, compared with about 10 km using the state-of-the-art method of reference 1. The invention will be explained hereinafter in more detail with reference to some figures. C. DESCRIPTION OF THE FIGURES Figure 1 shows four subscriber stations which are connected to a central station via a passive optical link. Figure 2 schematically shows how ATM cells are buffered and the arrival times in the subscriber stations are registered by means of a string of cell arrival bits (CABs) being generated. Figure 3 shows how - after transmission of the CAB strings - the CAB strings from the various local stations are processed in the central station to give subscriber access codes (SACs, "permits"), Figure 4 schematically shows the transmission of the CAB strings to the central station and that of SACs to the subscriber stations. Figure 1 shows a number of subscriber stations 1...4 which are connected, via a passive optical network formed by glass fibres 5, a passive coupler/splitter 6 and a glass fibre 7 - common to the subscriber stations -to a central station 8 which gives access to a network. Each subscriber station may be presented with ATM cells which can be transmitted to the central station. At the same time, ATM cells can be transmitted from the central station to the subscriber stations; these cells are then presented to all subscriber stations, each subscriber station picking up only cells intended for that station and passing them on. Cells which are presented by a subscriber at his subscriber station and are intended for the central station are buffered in that subscriber station in a cell buffer, pending a despatch permission code (permit) to be emitted by the central station. In order to notify the central station of the fact that the subscriber station wants to despatch a cell, a code has to be sent to the central station. Were such a code to contain no more information than the simple message that subscriber station number such and such has received a cell and wishes to despatch it, the central station would not be able to take into account the time of presentation of said cell, or rather the times of presentation of different cells in different subscriber stations. Consequently, a cell which had been presented early on at the one subscriber station could not be given priority above a cell presented subsequently at another subscriber station. Since this "FIFO" principle is desirable from a performance point of view - after all, this is how any accumulation of cells is forestalled - provision is made according to the invention for timing information indeed to be transmitted, and that this takes place in a simple, but effective manner. As a matter of fact, not only is a code generated if an ATM is presented during a time slot, but also if a time slot is empty: in the case of an empty time slot, a code "0" is generated, and a code "1" in the case of a time slot filled with a cell. Thus a code sequence is formed, the CAB string, which reflects the times of arrival of successive cells. If, as presented in Figure 1 in subscriber station 1, out of twenty successive time slots a cell was presented only on the fourth, eleventh, thirteenth, eighteenth and nineteenth time slot, this is represented by the CAB string "01100001010000001000". This string consists of 0-bits, except at the fourth, eleventh, thirteenth, eighteenth and nineteenth location (from right to left). As long as the cells - five in total - cannot be despatched, they are buffered in a cell buffer. Similarly the figure depicts, next to the subscriber stations 2...4, the CAB strings "01010000000000011000", "00000100000101000000" and "00100010000010000100"(the time slot sequences to which these CAB strings relate are shown later on in Figure 2). The cells themselves are buffered in the cell buffers in the various subscriber stations. The various CAB strings are sent to the central station during one or possibly several time slots. In the course of the discussion of Figure 4, transmission of the CAB strings will be dealt with in more detail. Figure 2 shows, as supplementary information to what was already shown in Figure 1, the time slots, of the various subscriber stations, which form the basis of the CAB strings. Here it can be clearly seen that the CAB strings reflect said time slots: empty time slots are represented by a "0" in the CAB string; filled time slots by a "1", the location of the "1"-bits being an indication for the time of arrival of the cells. Figure 3 shows the processing, on the side of the central station, of the CAB strings of the different subscriber stations. From right to left, bitwise detection takes place of the corresponding bit values of the different CAB strings. In a), the status at slot time t is examined: all four bit values are "0", and therefore, at time t, no cell was being presented at any of the four subscriber stations. In b), the status at slot time t+1 is examined: at that time, likewise, no cell was being presented. At time t+2, represented by c), a cell was being presented only at subscriber station 4; this was therefore the first cell in the period under consideration (t...t+19). At the subsequent times, t+3, t+4, etc., cells were successively presented to subscriber stations 1 and 2, none, to subscriber station 2, to subscriber station 3, to station 4, to station 3, none, to station 1, none, to station 1, to station 4, to station 3, none, to station 2, to stations 1 and 4. to stations 1 and 2 and finally none. The action steps a)...t) therefore result in the detection of cells at successive times at the stations - (= no cell; empty time slot), -, 4, 1 and 2, -, 2, 3, 4, 3, -, 1, -, 1, 4, 3, -, 2, 1 and 4, 1 and 2, -. If a cell was being presented at the same point in time to more than one station, the determining factor for defining the sequential order of station number is the value of the station number (an inherently better mechanism, although somewhat more difficult to implement, would be to perform a "random" selection from said station serial numbers). The sequence of SACs now becomes -, -, 4, 1, 2, -, 2, 3, 4, 3, -, 1, -, 1, 4, 3, -, 2, 1, 4, 1, 2, -. These SACs are transmitted to the local stations via the preambles of the downstream time slots. This transmission of SACs will be dealt with in more detail during the discussion of Figure 4. Figure 1 shows a representation of Figure 3 in reduced form at the central station. The subscriber station access codes are received in the subscriber stations, and the ATM cells present in the cell buffers are transmitted to the central station in the sequential order prescribed by the access codes. In this manner the desired FIF0 principle is therefore entirely maintained. Figure 4 shows in detail the transmission of CABs from the subscriber stations to the central station and the transmission of SACs from the central station to the subscriber stations. Upstream, the CABs are transmitted to the central station by means of CAB strings. Per time slot, four CAB strings, from four local stations, can be transmitted. For each CAB string, 110 bits are reserved. Each CAB string starts with a preamble of 16 bits, required, inter alia, for the detection of the ATM cells (see also Patent Application NL 9301156 in the name of Applicant). The CAB string proper in practice comprises 72 bits (the figures show CAB strings of 20 bits), followed by a check string of 12 bits. A further 10 bits are reserved. When the CAB strings from the local station arrive in the central station, they are read and processed in the abovedescribed manner to give SACs. Downstream, the SACs calculated by the central station are transmitted via the successive time slots, that is to say, at bit locations within the region which, if the time slot contains an ATM cell, forms part of the preamble; even in the case of empty time slots, without an ATM cell, those same bit locations are used. SACs without a local station number ("empty" SACs, indicated in the figure by "-") are likewise transmitted, in order to form a precise reflection of the (previous) moments of arrival of the ATM cells at the different local stations. Were these empty SACs to be ignored and therefore only non-empty SACs to be transmitted, this would result in an increase in the cell rates, which increase would be detected by access monitoring units, for example in the central station or even further upstream (such an access monitoring unit is described, inter alia, in Patent EP-381275 in the name of Applicant). The SACs are, like the ATM cells, distributed ("broadcasted") over the local station, where the SACs are read. If in a local station the SAC agrees with the station number, the next ("oldest") ATM cell in the cell buffer is released for transmission to the central station, via the next time slot. The SAC value therefore determines which local station is allowed to fill the next time slot with an upstream ATM cell. Which local station is allowed to pick up the ATM cell (424 bits) appearing after the SAC (in the preamble of 16 bits) is determined by an address field in the header (40 bits) of that cell: the content of that address field is therefore entirely unrelated to the SAC field. It should be noted that where it was proposed, in the above, that the CABs and the SACs not be transmitted via ATM cells, this is nevertheless, in principle, one of the options. It would be conceivable, if bit space could be found for this, for the CABs or the SACs or both to be accommodated in the 40-bits header of the ATM cells. The CABs could then, like the SACs, be transmitted while being distributed over the successive ATM cells (and if a time slot is not filled, at the same bit location established for the purpose as in the case of a filled time slot). With the aid of the presented system, it is possible. in practice, to bridge a distance of 20 kilometres between the local stations and the central station, said distance hitherto having been approximately 10 kilometres; the delay time over those 20 kilometres is approximately 0.5 msec (the delay time does not refer to the time between the arrival at the local station of an ATM cell to be despatched upstream and the output of that cell to the upstream network). The system is simple but, owing to the FIF0 behaviour, has an excellent performance. It should be noted that it is possible for different subscribers to be connected to the local stations. At this point in time, there are assumed to be 16 local stations to each of which 32 subscribers can be connected. The ATM cells originating from the subscribers are multiplexed in the local station, which functions as a "curb", and are then stored in the (FIFO) cell buffer, until an SAC ("permit") valid for that local station is received from the central station. The system has initially been designed for an upstream bit rate of 155.52 Mb/s. In the case of a transmission distance of 20 km, the CAB is 72 bits (= the number of time slots between the local station and the central station and back). In this case, the CAB strings of 4 local stations can be sent in one time slot to the central station (see the description of Figure 4). Assuming there are 16 local stations, this means that four time slots are necessary to be able to despatch the 16 CAB strings. This means that the capacity available for useful load is 72/(72+4) = approximately 95%. Alternatively, the system can be employed with an upstream bit rate of 622.08 Mb/s over a distance of 20 km. In that case, the CAB string is 288 bits (the number of time slots between the local station and the central station and back again). Such a CAB string is sent to the central station in one time slot. Assuming there are 16 local stations, this means that 16 time slots are necessary to despatch the 16 CAB strings. This means that the capacity available for useful load is 288/(288+16) = approximately 95%. In both cases, the delay time, the time between the moment that an ATM cell arrives at a local station and the moment at which said ATM cell leaves the central station, is found to be approximately 0.5 ms (two and a half times the transmission delay between the two stations). If the number of local stations is increased from 16 to 32. this means a doubling of the overhead; the capacity for useful load is then approximately 90%. Finally, it should be noted that the CAB strings can at all times be despatched to the central station by successive time slots. This makes for simplicity in controlling read-out, although a certain distortion (negligible in practice) occurs (a break in the ATM cell stream). An inherently better solution is for the CAB strings to be transmitted via time slots whose distribution over the time slots between the local stations and central station is as regular as possible. D. REFERENCES Angelopoulos, J.D.,A distributed FIFO spacer/multiplexer for access to tree APONS, IEEE Comm Soc, Supercomm/ICC 1994, pp70-74.

Claims: Method for transmitting ATM cells presented to local stations (1...4) to a central station (8), and ATM cells presented by said central station to the local stations, wherein, if a cell destined for the central station is presented in a local station, said cell is stored in a cell buffer, characterized in that , if a cell destined for the central station is presented in a local station, moreover, a first character is written to a local register, while, if an empty time slot is presented in the local station, a second character is written to said local register; wherein the local registers are read, the content thereof is transmitted to the central station in the form of register codes, and the central station, on the basis of the location of said first characters in said register codes, transmits permit codes to the local stations, signifying the permission to transmit a cell during a specific time slot. Method according to claim 1, characterized in that the local registers are read and the content thereof is transmitted to the central station periodically. Method according to claim 1, characterized in that both, said first character and said second character only comprise one bit having mutually different values.

Inventors: DIRKSEN MARK JOHANNES GERARDUS, DIRKSEN, MARK JOHANNES GERARDUS
Applicants: KONINKL KPN NV, KONINKLIJKE KPN N.V.
Application year: 1995
Main classification: H04Q11
IPC codes: H04Q11, H04Q3, H04M3, H04L12, H04J3