Abstract: A method for improved application of unreliable transfer mechanisms. An application uses application data delivered in data packets that become accessible from a peer entity via at least two packet data transmission mechanisms. The application is configured with a predefined operational range for a predefined application-specific characteristic. If the predefined application-specific characteristic exceeds the predefined operational range, the packet data transmission mechanism is changed. The mechanism facilitates maintaining an application-specific service level even if unreliable transmission mechanisms are applied.

Abstract: A method for improved application of unreliable transfer mechanisms. An application uses application data delivered in data packets that become accessible from a peer entity via at least two packet data transmission mechanisms. The application is configured with a predefined operational range for a predefined application-specific characteristic. If the predefined application-specific characteristic exceeds the predefined operational range, the packet data transmission mechanism is changed. The mechanism facilitates maintaining an application-specific service level even if unreliable transmission mechanisms are applied.

Abstract: An information system that comprises a data source that transmits a data item to a group of database instances using a packet-switched communication protocol in which retransmission of the data item to a data base instance is independent from reception of an acknowledgement to the transmitted data item from the database instance. A database instance receives the data item from the data source, stores it as a present data item and opens access to the present data item. A data consumer queries information on the present data item from the database instance and is provided with means to detect whether the information included in a response to the query is valid or not. If the information is not valid, the data consumer initiates a new query from another destination.

Abstract: A method of routing calls in a telecommunication system including a mobile services switching center (MSC) and a base station connected thereto, and mobile stations wherefrom a telecommunication connection is established by using a first predetermined protocol on a radio connection. The telecommunication system further includes a packet data network, a server communicating with the MSC and the packet data network, wherefrom a telecommunication connection is established through the packet data network and the server to the MSC. In the server, messages according to the first protocol supplied from the MSC are as such arranged into data packets of data network protocol to be forwarded through the packet data network to the terminal. The terminal transmits and receives the messages according to the first protocol arranged as such into the data packets of the packet data network protocol and emulates a mobile station using the first protocol.

Abstract: A method of routing calls in a telecommunication system comprising a mobile services switching center (MSC) and a base station connected thereto, and mobile stations wherefrom a telecommunication connection is established by using a first predetermined protocol on a radio connection. The telecommunication system further comprises a packet data network, a server communicating with the MSC and the packet data network, wherefrom a telecommunication connection is established through the packet data network and the server to the MSC. In the server, messages according to the first protocol supplied from the MSC are as such arranged into data packets of data network protocol to be forwarded through the packet data network to the terminal. The terminal transmits and receives the messages according to the first protocol arranged as such into the data packets of the packet data network protocol and emulates a mobile station using the first protocol.

Abstract: A method and a system for congestion management in a frame relay network, which includes a) buffering of data at the input boundary of a subscriber node to virtual-channel-specific buffers, b) transmitting congestion notifications in a backward direction from the network nodes to the subscriber node of the moment, and c) controlling the amount of traffic supplied towards the network from the subscriber node buffer.

Abstract: The invention relates to a method for congestion management in an FR network. The method comprises determining the virtual channel associated with a frame to be transmitted when it is received from a subscriber connection at a subscriber node. In order for the load in the network to be reduced, (a) data is buffered at the input boundary of the subscriber node to virtual-channel-specific buffers (62.sub.1 . . . 62.sub.n), (b) the fill rate of said buffers is monitored continuously, and (c) when a frame is received in a virtual-channel-specific buffer which is full, substantially all the contents of the buffer are discarded.

Abstract: A method and an equipment for prioritizing traffic in an ATM network, in which services of the network are divided into different service classes, and cells are transmitted via service-class-specific buffers, whereby a cell is temporarily stored in the buffer corresponding to the service class of said cell. In order to be able to pay as much attention as possible to the application of the subscriber at the time in question and at the same time retain the trunk network as simple as possible, the service class division is implemented at least at an NNI interface of the network only by means of a virtual path identifier (VPI) in the header of the cell so that one service class corresponds to each identifier and a certain group of virtual path identifiers belongs to the same service class.

Abstract: A method for congestion management in a frame relay network, in which a virtual channel associated with a frame to be transferred is determined. In other to provide a congestion management method which is reliable and capable of rapid responding and which allows even virtual connections to be prioritized with respect to the throughput probability, (a) at least some of the virtual channels are assigned a respective service level; (b) a congestion level having values in a predetermined relationship to the values of the service levels is determined for a network resource liable to congestion; (c) the value representing the service level of the virtual channel of the FR frame (39) is compared with the value representing the congestion level of the network resource; and (d) when the result of the comparison falls outside a predetermined value range, the frame is discarded.