Methods and systems for operation upon one or more data processors for prioritizing transmission among a plurality of data streams based upon a classification associated with the data packets associated with each of the plurality of data streams, respectively. Systems and methods can operate to allocate bandwidth to priority data streams first and recursively allocate remaining bandwidth to lesser priority data streams based upon the priority associated with those respective lesser priority data streams.

Prioritizing network traffic

A close-loop quality of service system is provided that collects real-time network performance indicators at the physical, data link and network layers. Using those indicators, the system dynamically controls the network traffic in order to achieve improved performance according to the priority and policy defined by a data user or system/network administrator. Several features of this quality of service system includes (1) dynamic maximum bandwidth reallocation, (2) dynamic maximum packet sizing, (3) adaptive policing, and/or (4) real-time link status feedbacks to make more efficient use of available bandwidth and adjust to transmission requirements.

Adaptive quality of service policy for dynamic networks

Methods and systems for operation upon one or more data processors for assigning a reputation to a messaging entity. A method can include receiving data that identifies one or more characteristics related to a messaging entity's communication. A reputation score is determined based upon the received identification data. The determined reputation score is indicative of reputation of the messaging entity. The determined reputation score is used in deciding what action is to be taken with respect to a communication associated with the messaging entity.

Systems and methods for classification of messaging entities

Methods and systems for assigning reputation to communications entities include collecting communications data from distributed agents, aggregating the communications data, analyzing the communications data and identifying relationships between communications entities based upon the communications data.

Multi-Dimensional Reputation Scoring

A method and circuit for precisely synchronizing clocks in separate nodes on a communication network is provided by adjusting timestamps and related data in network messages. The circuit will allow a daisy-chain connection of the nodes and will forward time synchronization frames while accounting for delays in a manner that does not use boundary clocks, but does not depart from the IEEE 1588 standard protocol. The delays will be added on the fly to synchronization packets and the IP checksum and frame CRC will be adjusted. Deterministic data delivery and redundant data paths are also provided in a full duplex Ethernet network.

Time synchronization, deterministic data delivery and redundancy for cascaded nodes on full duplex ethernet networks

An apparatus for and a method of dynamically prioritizing packets over a packet based network. Packets are dynamically prioritized on the basis of their ‘time to live’ in the network as they travel from one network entity to another. Packets are assigned a priority in accordance with how ‘old’ or ‘young’ they are. Packets with a relatively long time left to live are assigned lower priority then those with relatively little time left to live. A time to live (TTL) field is added to the packet as it travels from one network entity to another. The contents of the time to live (TTL) field represents how ‘young’ or ‘old’ the packet is and conveys the time left before the packet is no longer of any use. Each network entity that receives the packet with a TTL field, subtracts from it the time the packet spends passing through that entity. The field decreases as it hops from network entity to entity until it reaches its destination or is discarded.

Method of dynamic prioritization of time sensitive packets over a packet based network

An apparatus for and a method of remote echo cancellation in a packet based telephony system. Echo cancellation algorithms normally performed on the local end of a connection, are performed instead by the remote end of the connection. Alternatively, the echo cancellation algorithms are performed for both the local and remote ends of a connection on a remote device. In the former case, the remote endpoint estimates the echo function of the local endpoint using audio and timing synchronization data corresponding to the actual audio played at the local endpoint. Using this information, the remote endpoint is able to accurately perform echo cancellation.

Gad Azriel

Papers

Method of dynamic prioritization of time sensitive packets over a packet based network

Remote echo cancellation in a packet based network