Abstract: A list of users of a communication network is managed. For example, a list manager may manage a list identifying a set of list members, and an application server may obtain the set of members of the list. The application server may obtain status data relating to the obtained set of members and determine a set of users subscribed to the list. The application server may send updates in the obtained status data to the determined list of users.

Abstract: A method and system for establishing a conference call is presented. The method uses the Session Initiation Protocol for transporting conference information to a conference server, wherein the conference is represented in a markup language.

Abstract: An interface module for a telecommunications network service entity, the interface module being operable to communicate with an application provided on the telecommunications network service entity and a session layer of the telecommunications network service entity, the interface module comprising a generic container to communicate with the application and a protocol connector operable to communicate with an API of the session layer and the generic container, wherein the protocol connector is operable to receive a message from the protocol stack API in accordance with a corresponding protocol, and pass the message to the generic container, which passes the message to the application.

Abstract: Embodiments of the invention comprise a method of managing access to address data that is accessible via a plurality of communication devices; the method comprising the steps of establishing at least one access rule, associated with at least one communication device of the plurality of communication devices, for influencing access to the address data; and controlling access to the address data according the at least one access rule associated with the at least one communication device.

Abstract: A system arranged to receive an authorization request from an application server using a first communication protocol; identify a charging server associated with the authorization request from a plurality of charging servers, each charging server associated with a respective charging server communication protocol; and communicate with the identified charging server using the respective charging server communication protocol.

Abstract: According to one aspect of the present invention, there is provided a method, in a billing system, of supplying information to a communication device, comprising, in response to receiving a request, over a first network, to authorize a communication with the communication device: obtaining information relevant to the communication; and providing the obtained information to the communication device via a second network.

Abstract: A list of users of a communication network is managed. For example, a list manager may manage a list identifying a set of list members, and an application server may obtain the set of members of the list. The application server may obtain status data relating to the obtained set of members and determine a set of users subscribed to the list. The application server may send updates in the obtained status data to the determined list of users.

Abstract: A server for receiving first user content from a first user and sending the first user content to at least one other user in a conference session; the server arranged to receive a first invite from the first user to create or join the conference session; add the first user to the conference session; and determine if the first invite contains information that identifies first media content; and if so, send the first media content to the at least one other user.

Abstract: According to an embodiment of the present disclosure there is provided a method of facilitating the execution of a remote procedure call on a first network device, the first network device not being directly addressable from the network.

Abstract: According to one aspect of the present invention, there is provided a method, in a billing system, of supplying information to a communication device, comprising, in response to receiving a request, over a first network, to authorize a communication with the communication device: obtaining information relevant to the communication; and providing the obtained information to the communication device via a second network.

Abstract: A method for operating a node in a computer network is disclosed, where the network is made up of nodes connected by links. The method has the steps: determining an alternate path for one or more links; reserving resources for the alternate path; and rerouting traffic on the alternate path in case of a link failure. The alternate path may be periodically updated. A plurality of alternate paths may be maintained. The alternate paths may not have any links in common. User traffic may be rerouted substantially simultaneously to each link of the alternate path in the event of failure of a primary path.

Abstract: A method and system for establishing a conference call is presented. The method uses the Session Initiation Protocol for transporting conference information to a conference server, wherein the conference is represented in a markup language.

Abstract: A system arranged to receive an authorization request from an application server using a first communication protocol; identify a charging server associated with the authorization request from a plurality of charging servers, each charging server associated with a respective charging server communication protocol; and communicate with the identified charging server using the respective charging server communication protocol.

Abstract: The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. Due to high dynamicity of the traffic on transmission links, it is important to select a routing path according to a fully up-to-date information on all network resources. The simpler approach is to calculate a new path for each new connection request. This solution may be very time consuming because there are as many path selection operations as connection set up operations. On another hand, the calculation of paths based on an exhaustive exploration of the network topology, is a complex operation which may also take an inordinate amount of resources in large networks. Many of connections originated from a network node flow to the same destination network node. It is therefore possible to take a serious benefit in reusing the same already calculated paths for several connections towards the same node.

Abstract: A method for operating a node in a computer network is disclosed, where the network is made up of nodes connected by links. The method has the steps: determining an alternate path for one or more links; reserving resources for the alternate path; and rerouting traffic on the alternate path in case of a link failure. The alternate path may be periodically updated. A plurality of alternate paths may be maintained. The alternate paths may not have any links in common. User traffic may be rerouted substantially simultaneously to each link of the alternate path in the event of failure of a primary path.

Abstract: The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. A path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request.

Abstract: A method based on predefined connection priorities for assigning link bandwidth to a requesting user in a high speed digital network interconnecting network users through a path including network nodes connected through high speed links. According to this method, a predefined reservable link bandwidth is split into so-called nominal bandwidth portions and common bandwidth portions, both assignable to the same connections on a priority basis. Each of the common bandwidth priorities is individually related to a nominal bandwidth priority through a predefined relationship, making the common bandwidth priorities always lower than any nominal priority. In this way the requested link connection bandwidth, whatever be its nominal priority, is made preemptable primarily on all common bandwidth, thus avoiding the disruption of any network connection which is already established.

Abstract: In a high speed digital network including access nodes and network nodes each having topology data bases, a method for optimizing the connection set-up operations required for connecting a calling end-user attached to a local access node to a destination user attached to a remote access node, via a conventional connection set-up operation. An Access Node Connection Table (ANCT) in each access node stores a list of every remote access node for which the local access node has at least one user connection. A field in the locate reply message is defined for the destination remote Access Node Topology Database (ANTDB) and remote ANTDB information is inserted prior to sending the reply message. Locate reply message reception is monitored by the local access node, and upon reception an entry is created for the received remote ANTDB information in the local access node unless the remote access node was already identified in the local access node. An optimal path is then selected and connection set up.

Abstract: An apparatus and method that determines the end-to-end transit delay at each node of a path, in accordance with the selected probability value indicative of the probability to experience a delay at each node that is smaller than the computed transit delay. Then the computed transit delays per nodes are combined to obtain the end-to-end delay of the path, the combination being either an arithmetic operation or a convolution operation. A method to approximate the convolution operation is also disclosed.

Abstract: A method and system for reserving dynamically and in priority for each link of the network the exact amount of bandwidth necessary for the transmission of the network control traffic. An evaluation of the expected control traffic on each link of the network is performed in order to allocate a sufficient but minimum fraction of the link bandwidth and for allocating the maximum available bandwidth for the user traffic.