Abstract: The present invention relates to a method of switching media content for a mobile apparatus comprising a player and a selector. It is characterized in that it comprises the steps of: receiving an http streaming request from said player for playing a first media content on said player (RX_REQ1 (C1)); sending to said player first http messages related to said http streaming request comprising first files corresponding to said first media content, said first media content being segmented within some of said first files (TX_MSG1 (C1.F1; C1.F2)); receiving an http switching media content request from said selector for playing a second media content on said player (RX_REQ2 (C2)); replacing within said first http messages said first files by second files corresponding to said second media content (RPL_C); and sending to said player first http messages related to said http streaming request comprising said second files, said second media content being segmented within some of said second files (TX MSG1 (C2.F1; C2.

Abstract: In a system of the type in which for call setup each circuit segment is selected from available circuit segments, at least one circuit segment is permanently reserved on each trunk between nodes needed to set up circuits for particular calls to or from preferred users, and circuit segments are dynamically allocated from the reserved segments for setting up a circuit from the terminal of one user who has a preferred user attribute for particular calls in the event of a call set-up request by one of the users in respect of a call for which he has been granted a preferred user attribute.

Abstract: The method enables a set of services to be maintained within a private communications network even in the event of the network becoming split. It uses emergency means providing dynamic accesses that are previously defined by the user of the network. The dynamic accesses serve to carry signaling signals. Calls are routed using a method of routing that is both static and predetermined, imposing a path that is predetermined before a fault occurs, thereby making it possible for the network to react more quickly once it detects faulty operation.

Abstract: The invention concerns a method of routing between a source node and a destination node in a network having nodes connected by links, compression being used on at least one of said links, the method comprising at least two routing calculation steps for a given number of compressions, i.e. in a plane P(v). A routing calculation step for a given number of compressions uses information obtained during a routing calculation step for a number of compressions less than said given number. In this way a cost function can be minimized whilst assuring that in the route obtained the total number of compressions remains less than a maximum value. The route can be calculated for a given number of compressions using the Dijkstra algorithm and verifying the number of compressions when adding a node to the route. In this case, on reaching a link for which the given number of compressions is exceeded, the distance to the source node is saved for a subsequent calculation step.

Abstract: A method of routing a call in a private network, with overflow (alternate routing) onto another network, calculates various routes for setting up the call, with one or more overflows onto the other network, and chooses a route as a function of the overflow cost and the number of overflows. This minimizes the overflow cost and maximizes the use of private network resources. Taking the number of overflows into account limits the call setup time.

Abstract: In a method of routing calls to an external network from a calling node of a private network having a plurality of external network access circuit groups, each circuit group is connected to a gateway node of the private network. The method calculates a cost for different possible routes to the external network, the cost of a route to the external network being a function of the circuit group used and the route in the private network between the calling node and the gateway node of the circuit group used. It also chooses a route as a function of the calculated costs. The cost of a route to the external network is a decreasing function of the resources available on the circuit group used and is also a decreasing function of the load of the links used for routing in the private network. This optimizes use of the resources of the private network.

Abstract: In a method of routing calls to an external network from a calling node of a private network having a plurality of external network access circuit groups, each circuit group is connected to a gateway node of the private network. The method calculates a cost for different possible routes to the external network, the cost of a route to the external network being a function of the circuit group used and the route in the private network between the calling node and the gateway node of the circuit group used. It also chooses a route as a function of the calculated costs. The cost of a route to the external network is a decreasing function of the resources available on the circuit group used and is also a decreasing function of the load of the links used for routing in the private network. This optimizes use of the resources of the private network.

Abstract: In private telecommunication networks offering a call completion on busy link service, if a call request cannot be completed because of congestion of a link, and if setting up the call entails an overflow to the public network, the rights of the user may not be sufficient for subsequent completion of the call. To prevent this service being offered to a user whose rights are insufficient to enable subsequent call completion, because of the overflow, costs are assigned to the various links of the private network as a function of the overflows and access to the call completion on busy link service is monitored as a function of the rights of the user and the minimum total cost of completing the requested call. This prevents users with insufficient rights being queued indefinitely waiting for the call completion on busy link service.

Abstract: The invention relates to a method of routing a call in a network having a plurality of nodes interconnected by trunks, the method including calculating the costs of different routes for taking the call, and selecting a route as a function of cost. According to the invention, the cost of a route is a function of the bandwidth available on the trunks making up the route, of the resources available on said trunks, and of the bandwidth required for the call. The cost of a trunk can be represented in the form of a vector whose first component is a decreasing function of the available bandwidth, and whose second component is a decreasing function of available resources. The invention makes it possible, when routing a call, to take account of quality of service in terms of bandwidth.

Abstract: In private telecommunication networks offering a call completion on busy link service, if a call request cannot be completed because of congestion of a link, and if setting up the call entails an overflow to the public network, the rights of the user may not be sufficient for subsequent completion of the call. To prevent this service being offered to a user whose rights are insufficient to enable subsequent call completion, because of the overflow, costs are assigned to the various links of the private network as a function of the overflows and access to the call completion on busy link service is monitored as a function of the rights of the user and the minimum total cost of completing the requested call. This prevents users with insufficient rights being queued indefinitely waiting for the call completion on busy link service.

Abstract: In a method of routing a call in a network with a plurality of nodes connected by trunks, each call is assigned a priority level as a function of which it can pre-empt calls in the network. The cost of different routes for routing the call is calculated and one route is chosen as a function of the cost. The cost of a route is a function of the maximum value on the trunks constituting the route, the priority level of the calls pre-empted on each of the trunks, the number of calls pre-empted on the trunks and the resources available on the trunks. The priority level of existing calls can therefore be taken into account when routing a call. The single figure of the accompanying drawing shows the typical trend of the cost function of a trunk as a function of the available resources.

Abstract: A method is disclosed of providing the preferential facility of obtaining particular calls between users manner by reserving circuit segments for some users of a communication network in the event that the particular calls are established via at least two switching nodes of the network, in the context of a network constituted so that each call requested by a user via a terminal is set up via a circuit for connecting the terminal to the terminal of a called user, the circuits comprising one circuit segment or a plurality of circuit segments connected in series, when the call is set up via a plurality of switching nodes of the network, each segment being selected from available circuit segments on a trunk between two switching nodes so that a circuit is set up enabling the calling user and the called user to communicate.

Abstract: The method enables a set of services to be maintained within a private communications network even in the event of the network becoming split. It uses emergency means providing dynamic accesses that are previously defined by the user of the network. The dynamic accesses serve to carry signaling signals. Calls are routed using a method of routing that is both static and predetermined, imposing a path that is predetermined before a fault occurs, thereby making it possible for the network to react more quickly once it detects faulty operation.

Abstract: In a method of managing call collisions, in the event of a bit rate collision or a logical channel collision occurring at the time of a request to set up a call between a first terminal and a second terminal, one terminal is designated the master terminal and the other terminal is designated the slave terminal. Depending on the source of the call request packets, the two calls are automatically transmitted via the signaling channel or a data channel.

Abstract: In private telecommunication networks offering a call completion on busy link service, if a call request cannot be completed because of congestion of a link, and if setting up the call entails an overflow to the public network, the rights of the user may not be sufficient for subsequent completion of the call. To prevent this service being offered to a user whose rights are insufficient to enable subsequent call completion, because of the overflow, costs are assigned to the various links of the private network as a function of the overflows and access to the call completion on busy link service is monitored as a function of the rights of the user and the minimum total cost of completing the requested call. This prevents users with insufficient rights being queued indefinitely waiting for the call completion on busy link service.