Abstract: A method includes determining an estimate of a data packet path time from a first base station 13 to a user equipment (UE), and determining, based at least partially upon a communication received from a second base station 15, an estimate of a data packet path time from the first base station 13 via the second base station 15 to the user equipment (UE) 10. The method includes, based at least partially upon the determined estimates, selecting either the first base station 13 or the second base station 15 to transmit a packet data unit (DPU) (PDU) to the user equipment (UE) 10.

Abstract: A method includes determining an estimate of a data packet path time from a first base station 13 to a user equipment (UE), and determining, based at least partially upon a communication received from a second base station 15, an estimate of a data packet path time from the first base station 13 via the second base station 15 to the user equipment (UE) 10. The method includes, based at least partially upon the determined estimates, selecting either the first base station 13 or the second base station 15 to transmit a packet data unit (DPU) (PDU) to the user equipment (UE) 10.

Abstract: A plurality of ATM links are transmitted via a connecting section. If a further transmitting device wishes to make a call, it is first of all necessary to check whether this new ATM link can still be multiplexed onto the connecting section. The known sigma rule algorithm is used for this purpose in the prior art. In order to achieve better utilization of the transmission capacity, the class used in this prior art is now subdivided into a plurality of sub-classes. The best class for the transmission is thus then selected.

Abstract: In ATM connections, a number of connections are usually transmitted over common connecting segments. Potentially newly added connections are allowed based on the measure of decisions made by acceptance algorithms. Knowledge of the momentarily reserved bandwidth is estimated step-by-step with the setup or release of connections.

Abstract: The inventive process prevents a loss of ATM cells when processing ATM cells processed in accordance with the WEIGHTED FAIR QUEUEING SCHEDULING process by applying a peak bit rate limiting.

Abstract: A method and a circuit configuration for the transmission of message units in message streams of different priority include passing the message units which are respectively associated with the message streams through a queue that is specific to the message stream. The queues are combined to form groups to ensure a throughput guarantee for the message streams in addition to observing the priorities. At least two of the groups in each case are combined to form a partner group. The groups which belong to a partner group are controlled in such a manner that, in the case where no message unit can currently be transmitted from one of the queue groups, the transmission capability is transferred from the relevant queue group to one of the remaining groups in the respective partner group.

Abstract: A method for alleviating the loss of ATM cells when employing the weighted fair queuing scheduling method wherein the ATM cells are subjected to a peek bit rate limitation in a further stage of the method, and wherein such limitation is of the time interval of two read counters that sample the memory elements of a calendar in a cyclical time grid.

Abstract: A method for scheduling message cells leaving an ATM node and belonging to virtual connections by means of an output controller allocated to each of the outputs of the ATM node is provided. Message cells to be transmitted via the respective output are stored in connection individual FIFO-queues. Two variables Ti, Si are allocated to each of the FIFO-queues, where Ti defines the distance between consecutive message cells of a virtual connection i served at the rate ri=1/Ti, and TSi denotes a time stamp for the message cell at the head of the FIFO-queue. A virtual time variable VT is provided. The peak cell rate is monitored individually for each of the virtual connections at the egress of the respective output controller. The FIFO-queue with the lowest time stamp serves for transmitting the message cell at the head of that FIFO-queue only when VT>TSi and the peak cell rate for the respective virtual connection is not exceeded. The time stamp for that FIFO-queue is updated if it is not empty with TSi.rarw.

Abstract: A method for statistical multiplexing wherein message cells transmitted according to an asynchronous transfer mode are supplied to a multiplexer on input lines and are forwarded on an output line. In the method, since an average message cell rate and a maximum number of message cells briefly exceeding the average message cell rate are reserved for each connection, a message cell rate is assured for each connection that is at least as high as the average message cell rate given a limited delay.

Abstract: A method and circuit arrangement for connecting ATM communication equipment to an ATM trunk group, where characteristic parameters reported for virtual connections to be set up are allocated to connection classes and to transmission classes corresponding to the connection classes. The parameters are defined for the individual lines of the ATM trunk group. Further, line particulars with respect to all of the transmission classes for which a virtual connection can still be set up, based on currently available free transmission capacity, are individually retained for the associated individual ATM trunks. When a request for setting up a virtual connection is present, an individual trunk for setting up the virtual connection is selected during the course of a search event involving the line particulars of all individual trunks. A transmission class that corresponds to the connection class to be considered in the virtual connection to be set up is determined from the line particulars of the individual trunk.

Abstract: It is presumed in the method that message cell streams having a high cell loss priority as well as message cell streams having a low cell loss priority appear on an ATM transmission line. The check of the admissibility of the set-up of a virtual connection via such a transmission line occurs in two steps. In a first step, a first capacity limit value, or a second capacity limit value that is lower in comparison thereto, is defined for the ATM transmission line based on the measure of the message cell streams having high cell loss priority, including the message cell stream to be potentially taken into consideration to be set-up. Proceeding on the basis of the respectively defined capacity limit value, a check is then made in a second step to see whether--taking into account all message cell streams transmitted via the corresponding ATM transmission line--a set-up of a virtual connection that has just been requested is possible.

Abstract: A method for a transmission line via which message cells of a plurality of virtual connections having separately defined transmission bit rates asynchronously transmitted, wherein, depending on the transmission bit rate declared for a connection and depending on the chronological spacing of message cells belonging to the same connection that are intended for forwarding, a time slot in which a message cell is to be forwarded is identified for every message cell, whereby a message cell--depending on the length of the time slot calculated for it--either is discarded or is stored for forwarding in the respective, calculated or in a following time slot.

Abstract: For route searching in a multi-stage ATM switching matrix network, the free transmission capacities of ATM links are individually stored with an occupation memory. For setting up new virtual connections, a required transmission capacity is reported. Based on the extent thereof, a route selection occurs only via ATM links having free transmission capacity that is momentarily adequate. Bit rate classes are formed for storing the free transmission capacity. The required transmission capacities are also classified therein. For a respective ATM link group that is connected to an ATM switching element at the output side and/or input side, link-associated storage locations are binarily identified in storage cells of the occupation memory provided per bit rate class when transmission capacity corresponding to the allocated bit rate class is still respectively freely available. Presence of coincidence in view of the binary identification established for the respective bit rate class is checked in the route searching.