Abstract: A data processing system having first and second data processing apparatuses and a data communication network supporting HTTP communications to which the first and second processing apparatuses are connected and a method of exchanging electronic files between the first and second processing apparatuses. A Web server is provided running a Web application implementing a Web service accessible by the first and second processing apparatuses through Web browsers. The Web application receives a file from the first processing apparatus, and sends it to the second processing apparatus without storing it in a Web server local file. The first processing apparatus accesses the Web service via the respective Web browser, and uploads a selected file from a file system local thereto to the Web server; under responsibility of the Web application, the uploaded file is received at the Web server and, upon request by the second processing apparatus, is sent thereto.

Abstract: A data processing system having first and second data processing apparatuses and a data communication network supporting HTTP communications to which the first and second processing apparatuses are connected and a method of exchanging electronic files between the first and second processing apparatuses. A Web server is provided running a Web application implementing a Web service accessible by the first and second processing apparatuses through Web browsers. The Web application receives a file from the first processing apparatus, and sends it to the second processing apparatus without storing it in a Web server local file. The first processing apparatus accesses the Web service via the respective Web browser, and uploads a selected file from a file system local thereto to the Web server; under responsibility of the Web application, the uploaded file is received at the Web server and, upon request by the second processing apparatus, is sent thereto.

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: This method enables optimizing the time required for reestablishing connections between end users attached to a data communication network, which connections were disrupted due to a network failure. The network includes access nodes and transit nodes interconnected with network links/trunks (with no specific distinction being herein required between both designations of a communication line). The end users are attached to the network through access nodes and each said access node permanently stores an image of the current network trunk including the number N.sub.i of connections currently supported by said network trunk. Upon detection of a trunk failure, each access node supporting connections affected by said failure, is made aware of the total number (N.sub.i) of connections in each priority group affected by the failure, together with a network dependent parameter (TP) representing the elementary processing time required to reroute a single network connection.

Abstract: High speed network nodes can establish new connections by preempting existing ones when insufficient bandwidth is available in the network. Numerous preemption priorities are arranged in a limited number of groups and a median priority level is defined within each group. This median, stored in the topology database of each node of the network, permits better bandwidth utilization per group while consuming very little memory space and generating very low traffic overhead.

Abstract: A topology manager within a data communication network including a number of nodes interconnected by bi-directional links, wherein each said node is provided with means for dynamically setting and storing within the node a full topology database including full parent-node-relationship references. The system is is capable of fast path determination and fast spanning tree recovery based on the topology database contents.