Abstract: A method of a real time data communication via a real time data over communication network, including the steps of transmitting at least two packets from source to destination, and determining by the destination for each one of the at least two packets, time information related to a receiving time of the packet. The source applies a predefined packet length to each packet, and the destination determines, according to the determined time information and the packet length, the characteristics of a first relation between a packet length and a source to destination delay. The destination also determines a preferred mouth to ear delay according to a preferred quality rating for the data communication, and also determines an optimal packet length to be used by the source for the preferred mouth to ear delay and according to the characteristics of the first relation.

Abstract: A data cell generator multiplexes a plurality of data/speech packets (P1, P2, P3) into a single minicell (MC1′), for instance an Asynchronous Transfer Mode Adaptation Layer minicell, and adds overhead information (OH) to the minicell (MC1′) indicative for the lengths of the data/speech packets (P1, P2, P3) multiplexed therein. Several minicells (MC1′, MC2′, MC3′, MC4′) thereafter are multiplexed into a data cell (ATM_C), for instance an Asynchronous Transfer Mode) cell.

Abstract: The present invention proposes a method to control congestion in an Optical Burst Switched (OBS) network. The method consists in dropping probabilistically a data burst based on an average delay applied to a set of data bursts. Data bursts start being preventively dropped when the average delay goes beyond a pre-determined threshold.

Abstract: A traffic policer is coupled to a network buffer. A cell stream is supplied to this traffic policer. When a frame has a mix of tagged and non-tagged cells, the distribution of tagged and non-tagged cells is determined. Based on this distribution and some predetermined criteria, a decision is made to tag all cells of the frame or to set all tags to non tagged in the frame. Exiting frames only exist of all tagged cells or all non tagged cells. Entire frames are discarded in case of congestion.

Abstract: A first discarding device is coupled to a second discarding device. This first discarding device can be a traffic policer or alternatively a network buffer. The second discarding device is a network buffer. A cell stream is supplied to the first discarding device. The system determines if the incoming cells are in accordance with the predetermined criteria and discards this cell, if this cell is not in accordance with the criterion. By discarding cells of a frame, this frame is corrupted and marked with a corrupted frame indicator, by the first discarding device. Afterwards the second discarding device may discard the remaining cells of the marked frame. If the first discarding device is a traffic policer, the traffic policer checks the conformance of the incoming cells according to conformance criterion and alternatively if the first discarding device is a network buffer it checks the conformance of the incoming cells according to some congestion determining criteria.

Abstract: The present invention discloses a method to have a real time data communication between a first user (U1) of a source (S) and a second user (U2) of a destination (DT) via a real time data over Internet Protocol communication network. The method comprises transmitting by a transmitting means (TR) of the source (S) at least two packets (T1, T2, T3, T4) to the destination (D), and determining by a receiving means (REC) of the destination (D) for each one (T2) of the at least two packets (T1, T2, T3, T4), time information (T2_t2) related to a receiving time (t2) of the packet (T2). The method further comprises applying by the transmitting means (TR) for each one (T2) of the packets (T1, T2, T3, T4) a predefined packet length (l2) out of a plurality of packet lengths (l1, l2, . . . , li) in order to be transmitted accordingly.

Abstract: The invention concerns a method to set up a voice over Internet Protocol communication between a mobile terminal (MT) and a second device (T2) whereby the voice over Internet Protocol communication comprises an air interface between the mobile terminal (MT) and a base station (BS) which is coupled via an access network and an Internet Protocol network to the second device (T2). The method comprises a step of determining, according to predefined rules and conditions, during call set-up appropriate values for a plurality of parameters which are characterizing the voice over Internet Protocol communication in order to realize a desired trade-off between a predefined user quality of said voice over Internet Protocol communication and a predefined bandwidth efficiency.

Abstract: A bursty traffic multiplexing arrangement (A) includes a multiplexing unit (MUX) to multiplex a plurality of bursty input flows (IF1, . . . , IFI, . . . , IFN) into an output flow (OF). Congestion due to insufficient throughput capacity of the multiplexing unit (MUX) is avoided by incorporating an input shaping device (ISDI) for each input (MII) of the multiplexing unit (MUX). Data elements constituting such an input flow (IFI) are stored in an input buffer (IBI) which forms part of the corresponding input shaping device (ISDI), and are applied to the multiplexing unit (MUX) at a rate (BI) which does not exceed a predetermined maximum input buffer reading rate (BIMAX) associated to this input buffer (IBI). Furthermore, via feedback input flow rate control information (IFRI), the input flow rates (A1, . . . , AI, . . . , AN) can be controlled to thereby avoid input buffer overload.

Abstract: A method is described to estimate the current datapacket rate CCR.sub.i called herein current cell rate, of a connection out of a plurality of connections which are carrying datapackets via a multiplexed transmission channel in a communication network. The method includes the steps of storing in a buffer (B) incoming datapackets of the connections, determining the total number of datapackets BC.sub.TO in the buffer (B), determining the number of datapackets of the connection BC.sub.i in the buffer (B), measuring an aggregate input datapacket rate C.sub.IN of the buffer and estimating the current datapacket rate CCR.sub.

Abstract: A shaping method is proposed in which cells (U1-U7, 01-06) of a cell stream (CS1) are mutually delayed to obtain a shaped cell stream (CS2). For this method, a shaping delay is used which depends upon the type of the cells which are so delayed in order for consecutive user cells (U1-U2, U2-U3, . . . ) to be mutually delayed over the inverse (TU) of the peak cell rate negotiated for these user cells (U1-U7). The above method is obtained by making this shaping delay equal to the above inverse when adjacent cells are user cells (U1-U2), to a fraction (TU/3) of this inverse when the second one of these adjacent cells is an operation and maintenance or OAM cell (01-07), and to the difference between the above inverse and the number of consecutive OAM cells inbetween two user cells (U5-U6) times the above fraction, if the first one of said adjacent cells is an OAM cell (03) whilst the second one is a user cell (U6).