Avaya Technology LLC

Avaya Inc.

Jeffrey Chu

Robert C Steiner

Michael Alan Bland

Marc A Geist

Alan R Breight

Ramesh Achuthan

Lei Zhu

The disclosure is directed to an embodiment of a system that includes: (a) a queue to receive compressed blocks of data elements to be transmitted to a destination node and a variable compression module that, in response to an unacceptable connection status with the destination node, an unacceptable level of local processing resources, and/or an unacceptable level of local memory resources, changes a number of data elements in the block and/or increases a degree of compression.

Variable compression queue

An consumer contact toll optimizer providing for the automatic disconnection and reconnection of communication links between communications devices and/or services is provided. The system allows communication links to be terminated before a specified period of time has elapsed, thereby allowing consumers of communications services charging on a time of use basis to minimize the charges incurred while using such services. In particular, the present invention allows consumers to minimize fees in connection with communications networks that charge at a first, lower rate for an initial period of time, and a second, higher rate for subsequent periods of time. The present invention is particularly well-suited for use in connection with wireless telephones having service plans that do not charge for the first incoming minute of a telephone call, and in connection with long distance service plans that charge a lower rate for an initial period of time and a higher rate for a subsequent period of time.

Consumer contact toll optimizer

A generic and dynamically-modifiable database schema has a tree structure that includes leaf nodes each defining a value of an attribute, branch container nodes each representing a different attribute and identifying those leaf nodes that define values of the container node's attribute, root nodes each representing a database record and identifying those leaf nodes in different container nodes that define values of an attribute of the root node's record, a root container node representing a database and identifying the root nodes that represent its records, attribute nodes each representing a different attribute and identifying the ii branch container node that represents that attribute, and a map container node identifying attribute nodes. Each leaf, root, and attribute node is a data structure that defines a name of an attribute, a value of the named attribute, and an identifier&mdash;an index or a dictionary&mdash;of zero or more nodes that define values of attributes of the named attribute's value. Attribute nodes lack the value. Each container node is a table, a dictionary, or an array. The schema further includes operations to insert, update, and delete records, and to add and delete attributes.

Generic (database-independent) and dynamically-modifiable schema

Growing community of inventors

Arvada, CO, United States of America

Jeffrey Chu