Avaya Inc.

Avaya Technology LLC

Anwar A Siddiqui

John F Buford

Jayesh Govindarajan

Alan Edward Baratz

Vyankatesh Balaji Deshpande

Anthony Frank Bartolo

Richard L Robinson

Luo-Jen Chiang

Taryn Moody

Luke Anthony Tucker

Robert Reagan Gilman

Mark Harald Wutzke

Anthony H Chien

Mark Garstin

A method is employed in association with a communication session over a peer-to-peer network between a first node associated with a first session participant and a second node associated with a second session participant. In the method, identification information identifying the second session participant is received. Profile information descriptive of the second session participant is gathered using the identification information. The communication session is conducted using the profile information descriptive of the second session participant.

Profile information based on participant identity for peer-to-peer sessions

A method of operating a communication system to establish communication sessions between an origination network and a peer-to-peer network comprises receiving session signaling to establish a session between an origination device in the origination network and a destination node in the peer-to-peer network, wherein the session signaling includes a participant identifier associated with the origination device. The method further comprises processing the participant identifier to determine if persona information that identifies an originating participant and an entity associated with the originating participant is available for display by a destination device registered as the destination node on the peer-to-peer network and, if the persona information is available, transferring the persona information for delivery to and display by the destination device to a destination participant. The method further comprises establishing the session over the origination network and the peer-to-peer network and exchanging user communications for the session between the origination device and the destination device.

Determination of persona information availability and delivery on peer-to-peer networks

A method of operating a communication system comprises registering a plurality of communication devices with a peer-to-peer network as a plurality of enterprise nodes using a plurality of network handles that identify positions in an enterprise hierarchy. The method further comprises receiving a request to establish a session with a participant node and an enterprise node of the plurality of enterprise nodes using a first network handle of the plurality of network handles that identifies a first position in the enterprise hierarchy. In response to the request, the method provides identifying a routing identifier associated with the enterprise node and exchanging user communications for the session with a communication device of the plurality of communication devices registered as the enterprise node using the routing identifier.

Hierarchal structuring of nodes in a peer-to-peer network

Techniques are disclosed for establishing packet-based communication between first and second endpoints over a network, in a manner which reduces the latency and complexity associated with call setup. In accordance with one aspect of the invention, a resource is requested from the network utilizing a first protocol, and while the request is pending, transmission of packets at a first priority level is commenced. After a response is received from the network granting access to the requested resource, a tagging mechanism is utilized to identify particular packets for transmission at a second priority level higher than the first priority level. In an illustrative embodiment, the first protocol is the Resource Reservation Protocol (RSVP), the first priority level corresponds to a Better than Best Effort (BBE) policy, and the second, higher priority level corresponds to an Expedited Forwarding (EF) policy. These policy levels may be implemented for a given packet by setting a Type of Service (TOS) byte in a header of the given packet to a value specifying the corresponding policy.

Method and apparatus for policy and admission control in packet-based communication systems

The present efficient packet encryption method decreases the computation time to encrypt and decrypt successive packets of plaintext data. An S-vector is generated and the S-vector is used to encrypt successive packets of plaintext, thus reducing the per packet encryption/decryption time. The formula for encrypting successive packets includes use of the packet sequence number with a third variable injected to eliminate the predictability of the variables, thus making the present efficient packet encryption method more secure. A fourth variable is injected into the calculations to generate an encryption stream that does not repeat as frequently to provide additional security from hackers. For encrypting a packet having a long payload of plaintext, a packet byte sequence number is used to generate an encryption stream that is less likely to repeat within a particular packet.

Efficient packet encryption method

A unique method and apparatus for a dynamic rate, differential class-based quality of service agent for a communication network that provides a quality of service guarantee by taking into account the existing state of the network and user-defined classes of service is provided. A flexible quality of service agent, separate from the control plane which contains call processing and network management, is provided which optimizes network performance by minimizing the amount of information transmitted over the network to set-up a call and media negotiation, implements admission control to maintain the quality of the ongoing calls and administers the system wide quality of service by providing instantaneous feedback on the current state of the system/network at both the transmitting and receiving end.

Growing community of inventors

New York, NY, United States of America

Anwar A Siddiqui