Abstract:
A data packet transmission system having a succession of stations each connected to two buses transmitting in opposite directions, both packets and time-slot requests has its capacity improved by means of a request-erase counter at each station for each bus, making possible more efficient use of time slots. Except for the different combinations of status and expectable occurrence, the queuing protocol known as DQDB, optionally is modified by D.sup.3 Q protocol, is used. For those ten situations where time-slot-request bit resetting (erasing) comes into play, status is defined by the state of certain counters while expectable occurrences are arrivals at a station's access unit of a time-slot that is empty or contains a data packet or a request bit and also the use, if any, made of the arriving time slot by the access unit of the station. The actions produced in those ten instances are in terms of setting or resetting a request bit and advancing, reducing or resetting contents of one or more counters.
Abstract:
Known methods of transferring between centers the handling of an active connection between a user and a mobile terminal in a telecommunication system designed for mobile communication generally have the disadvantage that the routing obtained is inefficient. By investigating both a first route between a first switching center and the user and a second route between a second switching center and the user for common centers which are able to handle call control and connection control separately, of which the common center situated nearest the first switching center is designated as a central intelligence point or, if the latter is not found, by designating the center situated nearest the user as a central intelligence point and then setting up a connection between the central intelligence point found in this way and the second switching center, the most efficient routing is obtained.