International Business Machines Corporation

At&t Intellectual Property I, LP

Jean-Francois LePennec

Patrick Michel

Alain Benayoun

Aline Fichou

Jacques Fieschi

Aurelien Bruno

Patrick Sicsic

John M Ciesielczyk

Herve Tremeur

A method including formatting an advertisement message having a dedicated preferred route to one of a first physical entity and a first logical entity of a first autonomous system ('AS'), the dedicated preferred route being based on at least two routing attributes, and transmitting the advertisement message from the first AS to a second AS. A routing device including a formatting module formatting an advertisement message having a dedicated preferred route to one of a first physical entity and a first logical entity of a first autonomous system ('AS'), the dedicated preferred route being based on at least two routing attributes, and a transmitting module transmitting the advertisement message from the first AS to a second AS.

Method and system for gateway selection in inter-region communication on IP networks

The invention discloses a method of updating, in nodes on both ends of a secure link, the encryption key they share to encrypt and decrypt data. When having to transmit data from one of the nodes towards its peer remote node, a data base in the forwarding node, is first updated from the data to be transmitted. Then, encryption is performed and data transmitted to the peer remote node while a next-to-use encryption key is derived from the new contents of the data base. When received, data are decrypted with the current value of the encryption key and the peer remote node data base is updated identically from the received decrypted data after which a next-to-use encryption key is derived, thereby obtaining in the peer remote node, a next-to-use identical key. The data base is preferably the dictionary of a data compression/decompression system used simultaneously with encryption/decryption to transmit data over the secure link. While keys are frequently updated, for improved security, the invention does not require that key updates need to be actually distributed.

Method of updating encryption keys in a data communication system

Data compression using a Liv-Zempel algorithm is enhanced by organizing strings of data in a dictionary using a set of related four related fields. The first field contains an index or codeword for the last character of the string currently being processed. The second field contains an index or codeword for a SON string, a string which includes all of the characters of the current string plus one additional character. The third field contains an index or codeword for a BROTHER string which is identical to the current string except that the last characters in the two strings differ. The fourth field contains an index or codeword for a PARENT to the current string. The PARENT includes all of the characters of the current string except the last character. The memory arrangement comprises a tree structure which can be efficiently accessed by a disclosed processor to perform data compression using minimal processing resources.

System for performing data compression based on a Liu-Zempel algorithm

A conversion cache circuit, interfacing RISC busses to CISC peripheral circuits, provides master/slave Write and Read operations in a shared memory (130) and in the internal registers of the processor of said peripheral circuits (210). It enables RISC processor to Write and Read in the internal registers of the 8-bit processor in a salve operation while the 32-bit processor may perform the Write or Read operations to the shared memory through the conversion cache circuit in a master mode. The 32-bit processor may have access directly to the memory through its own direct access memory mechanism.

Growing community of inventors

Nice, France

Jean-Francois LePennec