A method for generating ATM cells for low bit rate applications

Abstract: A method for generating ATM cells for low bit rate applications, said method including a step (3) of scheduling ATM cell transmission times in a way as to keep ATM cell spacing as constant as possible, and a step (8) of multiplexing a plurality of low bit rate connections into a same ATM connection having the thus scheduled ATM cell transmission times.

Description: The present invention is generally concerned with telecommunication systems. The present invention is more particularly concerned with telecommunication systems using ATM (Asynchronous Transfer Mode). ATM is a commonly used standard for transmission of high bit rate data in telecommunication systems, which is based on an asynchronous time multiplexing of packets of fixed length called cells. Telecommunication systems using ATM may be modelized by an ATM layer and an interface layer, or ATM Adaptation Layer (AAL), between the ATM layer and users. A specific ATM Adaptation Layer has been provided for low bit rate applications such as in particular mobile communication systems, especially third generation mobile communication systems (such as in particular UMTS : "Universal Mobile telecommunication System"). Such a specific layer, or AAL2, is defined in ITU-T Recommendation 1.363.2. AAL2 is subdivided into a Service Specific Convergence Sublayer (SSCS) and a Common Part Sublayer (CPS) which allows several low bit rate connections to share a same ATM connection, by multiplexing several short packets called CPS packets into a same ATM cell. Reference may also be made for example to ZHOU ET AL. : 'Bypassing vocoders in CDMA mobile-to-mobile calls' VTC '98. 48 TH IEEE VEHICULAR TECHNOLOGY CONFERENCE. PATHWAY TO A GLOBAL WIRELESS REVOLUTION (CAT. NO. 98CH36151), OTTAWA, ONT., Canada, 18-21 MAY 1998, pages 2527-2531 vol.3, XP002116286 1998, New York, NY, USA, IEEE, USA ISBN : 0-7803-4320-4. To be efficient, the process carried out at CPS level should simultaneously achieve a number of objectives, in particular: this process should be bandwidth efficient, i.e. ATM cells should be sent with as least padding as possible, this process should meet quality of service requirements, in particular it should introduce as least delay variations as possible, this process should meet different quality of service requirements for the different types of traffic to be multiplexed ; in particular voice traffic is time sensitive and requires stringent delay variations objectives, while data or signalling traffic are usually tolerant to transfer delay variations. A currently used solution is the following. If an ATM cell is complete with CPS packets before the expiration of a timer delay, it is sent out immediately; otherwise it is sent out (completed with padding) as soon as this timer delay expires. In other words, this solution ensures that CPS packets wait at most the duration of the timer before being scheduled for transmission. Though this solution reduces the waiting time of CPS packets, it still has the drawback of introducing some delay variations. The present invention is based on a different approach, enabling in particular to avoid such a drawback. An object of the present invention is therefore a method for generating ATM cells for low bit rate applications, said method including a step of scheduling ATM cell transmission times in a way as to keep ATM cell spacing as constant as possible, and a step of multiplexing a plurality of low bit rate connections into a same ATM connection having the thus scheduled ATM cell transmission times. According to another object of this invention, said ATM cell spacing is kept as close as possible to a cell rate negociated for the corresponding ATM connection. Cell rate is a currently known parameter of a traffic agreement negociated for data transfer in ATM networks. Control of compliance with the negociated cell rate is usually performed in transit nodes of an ATM network, by compensating for cell delay variations occuring during transit in this network. Refernce may be made for example to ZHOU ET AL. : 'Bypassing vocoders in CDMA mobile-to-mobile calls' VTC '98. 48 TH IEEE VEHICULAR TECHNOLOGY CONFERENCE. PATHWAY TO A GLOBAL WIRELESS REVOLUTION (CAT. NO. 98CH36151), OTTAWA, ONT., Canada, 18-21 MAY 1998, pages 2527-2531 vol.3, XP002116286 1998, New York, NY, USA, IEEE, USA ISBN : 0-7803-4320-4. Refernce may also be made for example to WALLMEIER E ET AL : 'THE SPACING POLICER, AN ALGORITHM FOR EFFICIENT PEAK BIT RATE CONTROL IN ATM NETWORKS' PROCEEDINGS OF THE INTERNATIONAL SWITCHING SYMPOSIUM, JP, TOKYO, IEICE, vol. SYMP. 14, page 22-26 XP000337695. On the contrary, the present invention is carried out in a source node. Indeed, the present invention is concerned with a mode of generation of ATM cells which may, in itself, introduce cell delay variations. Ensuring compliance with the negociated cell rate, as from the source, therefore constitutes a simple and efficient way of avoiding such delay variations, while at the same time simplifying traffic management in the network. Depending on the type of traffic agreement for the ATM connection, and according to various embodiments of the present invention, cell rate may be: a PCR (Peak Cell Rate) in the case of service category of DBR (Deterministic Bit Rate) or CBR (Constant Bit Rate) type, a BCR (Block Cell Rate) in the case of service category of ABT (ATM Block Transfer) type, a ACR (Allowed Cell Rate) in the case of service category of ABR (Available Bit Rate) type. According to another embodiment, said negociated cell rate may be re-negociated, to optimise resource utilisation in the network. According to another object of this invention, no ATM cell is sent when there is no data available from any of said low bit rate connections, and said method includes a step of referencing said scheduling of ATM cell transmission times with respect to the next availability of data from at least one of said low bit rate connections. According to another object of this invention, said low bit rate connections are assigned different priorities, and said multiplexing step includes an intra-priority multiplexing for multiplexing low bit rate connections of same priority, and an inter-priority multiplexing for multiplexing low bit rate connections of different priorities. According to a first embodiment of the present invention, said intro-priority multiplexing and said inter-priority multiplexing are both carried out at ATM Adaptation Layer (AAL) level. According to a second embodiment of the present invention, said intra-priority multiplexing is carried out at ATM Adaptation Layer (AAL) level and said inter-priority multiplexing is carried out at ATM Layer level. Another object of the present invention is a device for generating ATM cells for low bit rate applications, said device including means for scheduling ATM cell transmission times in a way as to keep ATM cell spacing as constant as possible, and means for multiplexing a plurality of low bit rate connections into a same ATM connection having the thus scheduled ATM cell transmission times. The present invention also has for its object an entity such as a base station (or Node B in UMTS) of a mobile radiocommunication network, comprising such a device. The present invention also has for its object an entity such as a base station controller (or Radio Network Controller or RNC in UMTS) of a mobile radiocommunication network, comprising such a device. These and other objects of the present invention will become more apparent from the following description taken in conjunction with the accompanying drawings: figure 1 is a diagram intended to illustrate a first embodiment of a method according to the present invention, figure 2 is a diagram intended to illustrate a second embodiment of a method according to the present invention. As an example, this description will be made for the case of different quality of service requirements, i.e. different priorities, for the different types of low bit rate connections (or AAL2 connections) to be multiplexed onto the same ATM connection. Still as an example, this description corresponds to the case of two streams of CPS packets to be multiplexed into a same ATM connection, one corresponding to real time, or high priority, traffic (for example speech traffic) and the other one corresponding to non real time, or low priority, traffic (such as for example data traffic or signalling). In the following, index 0 will be used for high priority traffic, and index 1 will be used for low priority traffic. It should however be noted that the present invention is not limited to such examples, and other examples may be derived from the following description. The first embodiment of the present invention, illustrated in figure 1, corresponds to the case where both inter-priority and intra-priority multiplexing are carried out at ATM Adaptation Layer (AAL) level. The following notations will be used hereinafter: T: ATM emission interval (or ATM cell rate) AST: ATM Scheduling Time (or ATM cell scheduled transmission time) LL 0 : linked list of high priority (contains all the addresses of high priority CPS packets competing for packing into ATM cells) LL 1 : linked list of low priority of re-emission (contains all the addresses of low priority CPS packets competing for packing into ATM cells) SLI i : Sum of Length Indicators (or sum of the lengths of all CPS packets of linked list LL i ) As illustrated in figure 1, when a CPS packet, such as the ones illustrated at CPS 0 or CPS 1 , arrives, it is stored in a common buffer noted CB, as illustrated at 1 0 or 1 1 . Besides, as illustrated at 2 0 or 2 1 , a pointer to this CPS packet (or address, noted @, of this CPS packet in the common buffer CB) is inserted in a corresponding FIFO memory, or linked list, LL 0 or LL 1 . Besides, a new value of SL i is determined, in computation means noted 3, using the following relation: SLi = SLi + LIi where Lli is the length of the received CPS packet (indicated by a corresponding field of CPS packets). Let AST be a current ATM cell scheduled transmission time. At each scheduled cell transmission time AST , linked lists LL 0 and LL 1 are served according to their respective priority and an ATM cell is filled accordingly. In other words, every ATM cell scheduled transmission time: If SLI 0 ≥ 47 octets (i.e. if SLI 0 ≥ number of octets of an ATM cell payload), the addresses in the common buffer of the first received 47 octets of high priority are read in linked list LL 0 , the common buffer CB is "emptied" from these 47 first octets, SLI 0 is set to SLI 0 - 47, and these octets are mapped into an ATM cell (no padding in this case). If SLI 0 < 47 octets (with SLI 0 =x), the addresses in the common buffer of the "x " first received octets of high priority are read in linked list LL 0 the common buffer CB is "emptied" from these "x" octets, and SLI 0 is set to SLI 0 =0. Then: If SLI 1 = 0, i.e. if there are no low priority packets to fill the cell, these "x" octets are mapped into the ATM cell and padding is used in this case to fill the cell, If SLI 1 > 0 and SLI 1 ≥ 47-x, the addresses in the common buffer of the first 47-x received octets of low priority are read in linked list LL 1 , the common buffer CB is "emptied" from these octets, SLI 1 is set to SLI 1 =SLI 1 -(47-x), and these "x" and 47-x octets are mapped into the ATM cell (no padding in this case) If SLI 1 > 0 and SLI 1 < 47-x (with SLI 1 =y), the common buffer is emptied from the corresponding "y" octets, SLI 1 is set to 0, and these "x" and "y" octets are mapped into the ATM cell (padding is used in this case to fill the cell). If a partial CPS packet of low priority is sent, the address of this CPS packet is linked in the high priority linked list (it must be the first packet to be sent in the next ATM cell). This process is performed at each scheduled ATM cell transmission time by multiplexing means noted 8 which are schematically illustrated as mapping the selected octets into ATM cells such as ATM n , as shown at 4 0 or 4 1 . An ATM cell such as for example ATM n is currently composed of a header field, noted H, a so-called STF field, and CPS packets such as CPS 0 , CPS 1 in this example. Besides, at each scheduled ATM cell transmission time AST, if after this process the two linked fists LL 0 and LL 1 are empty, i.e. if no CPS packet is available for transmission in ATM cells, no new AST is scheduled, i.e. no new ATM cell is sent. Otherwise, if at least one of the two lists is not empty, a new AST is scheduled. Generally this new AST is determined so as to keep the ATM cell spacing as constant as possible. Advantageously AST may be computed using the following relation: AST = AST + T where T is the cell rate negociated for the corresponding ATM connection. As already indicated, ensuring compliance with the negociated cell rate constitutes a simple and efficient way of avoiding delay variations, while at the same time simplifying traffic management in the network. Besides, depending on the type of traffic agreement for the ATM connection, and according to various embodiments of the present invention, cell rate may be: a PCR (Peak Cell Rate) in the case of service category of DBR ( Deterministic Bit Rate) or CBR (Constant Bit Rate) type, a BCR (Block Cell Rate) in the case of service category of ABT ( ATM Block Transfer) type, a ACR (Allowed Cell Rate) in the case of service category of ABR ( Available Bit Rate) type. Besides, cell rate may be re-negociated to optimize resource utilisation in the network; in other words ATM cell spacing may be dynamically determined. In particular, cell rate of the ATM connection may be re-negociated: at set up or release of an AAL2 connection, when the utilisation of the ATM connection goes over a given threshold (upper re-negociation), or under a given threshold (lower re-negociation), every transmission time interval, as a function of the total AAL2 traffic to be conveyed. Besides, in the case where a new CPS packet arrives at a time "†" where both linked lists LL 0 and LL 1 are empty, i.e. in the case of a next availability of a CPS packet for transmission in ATM cells, further to a period of non availabilty, AST may be computed in the following way: if AST + T ≤ t, AST = t if AST + T > t, AST = AST + T In other words, AST = t may be considered as serving as a new reference for the computation of a new AST according to relation AST = AST + T used otherwise. Computation means such as for example the computation means 3 may be used for scheduling the ATM cell transmission times according to such a method. The second embodiment of the present invention, illustrated in figure 2, corresponds to the case where said intra priority multiplexing is carried out at ATM Adaptation Layer (AAL) level, and said inter-priority multiplexing is carried out at ATM Layer level. The method illustrated in figure 2 thus differs from the one illustrated in figure 1 in that two types of ATM cells are created by intra-priority multiplexing (i.e. by multiplexing of CPS packets of the same priority) ,each type corresponding to a type of traffic priority, and these two types of ATM cells are multiplexed into an ATM connection at ATM layer level. A first type of ATM cells, such as the one noted ATM n0 in figure 2, corresponds to high priority traffic, and a second type of ATM cells, such as the one noted ATM n1 in figure 2, corresponds to low priority traffic. The formation of each of these two types of ATM cells uses queuing means, respectively 5 0 , 5 1 and multiplexing means that do not apply any traffic priority criteria, respectively 9 0 , 9 1 . ATM cell transmission times for each of these two types of cells are scheduled according to the same principle than disclosed above, i.e. in a way as to keep ATM cell spacing as constant as possible, preferably as close as possible to a cell rate negociated for the ATM connection. Though not illustrated in detail, this may be derived from the embodiment of figure 1, by considering the case of one type of traffic only. Multiplexing of such ATM cells at the ATM layer level uses queuing means 6 0 , 6 1 and multiplexing means 7 that do apply traffic priority criteria. A method or a device for generating ATM cells for low bit rate applications may in particular be used in mobile communication systems, in particular : in a base station, or Node B in UMTS, for multiplexing low bit rate traffic from a plurality of sources into a same ATM connection, for transmission to a base station controller, in a base station controller, or Radio Network Controller (RNC) in UMTS, for multiplexing low bit rate traffic from a plurality of sources into a same ATM connection, for transmission to a base station .

Claims: A method for generating ATM cells for low bit rate applications, said method including a step of multiplexing a plurality of low bit rate connections into a same ATM connection, said method being characterized in that it includes a step of scheduling ATM cell transmission times in a way that as long as there is data available from at least one of said low bit rate connections, ATM cell transmission times are spaced according to a cell rate negociated for the corresponding ATM connection . A method according to claim 1, wherein said cell rate is a Peak Cell Rate PCR in the case of service category of DBR, or Deterministic Bit Rate, or CBR, or Constant bit Rate, type. A method according to claim 1, wherein said cell rate is a Block Cell Rate BCR in the case of service category of ABT, or ATM Block Transfer, type. A method according to claim 1, wherein said cell rate is an Allowed Cell Rate ACR in the case of service category of ABR, or Available Bit Rate, type. A method according to any of claims 1 to 4, wherein said cell rate may be re-negociated. A method according to any of claims 1 to 5, wherein no ATM cell is sent when there is no data available from any of said low bit rate connections, and said method includes a further step of referencing said scheduling step with respect to the next availability of data from at least one of said low bit rate connections. A method according to claim 1, wherein said low bit rate connections are assigned different priorities, and said multiplexing step includes an intra-priority multiplexing for multiplexing low bit rate connections of the same priority, and an inter-priority multiplexing for multiplexing low bit rate connections of different priorities. A method according to claim 7, wherein said intra-priority multiplexing and said inter-priority multiplexing are both carried out at ATM Adaptation Layer level. A method according to claim 7, wherein said intro-priority multiplexing is carried out at ATM Adaptation Layer level, and said inter-priority multiplexing is carried out at ATM layer level. A device for generating ATM cells for low bit rate applications, said device including means for performing a method according to any of claims 1 to 9. A base station for a mobile radiocommunication network, comprising a device according to claim 10 for multiplexing low bit rate traffic from a plurality of sources into a same ATM connection, for transmission to a base station controller. A base station controller for a mobile radiocommunication network, comprising a device according to claim 10 for multiplexing low bit rate traffic from a plurality of sources into a same ATM connection, for transmission to a base station.

Inventors: BESSET-BATHIAS CLAIRE, BESSET-BATHIAS, CLAIRE
Applicants: CIT ALCATEL, ALCATEL
Application year: 1999
Main classification: H04Q11
IPC codes: H04Q11, H04B7, H04L12