Lucent Technologies Inc.

Ethernety Networks Ltd

Yuval Shavitt

Danny Raz

Avishai Wool

Ramachandran Ramjee

Bulent Yener

P Krishnan

Ioannis A Korilis

Sneha Kasera

Prasun Sinha

Michel Ferreira Abdalla

Shai Eshet

Xiaodong Sun

A device and a method for processing a data packet. The method includes: receiving a key, applying multiple hash functions to provide multiple hashed values; accessing a group of hash tables using the multiple hashed values; associating between the key and an accessed vacant entry of an hash table out of the group of has tables. The device includes a communication controller connected to at least one memory bank; wherein the communication controller is adapted to receive a key associated with a data packet, apply multiple hash functions to provide multiple hashed values; access a group of hash tables stored within the at least one memory bank, using the multiple hashed values; and determine a data packet processing operation in response to a content of accessed entries of the multiple hash tables.

Method and device for processing data packets

A network node computes a fair share data rate for the sharing of a shared communication channel in a local area network. The network node determines the required information for computing the fair share by snooping the network, by receiving the required information from other network nodes, or a combination of the two techniques. Alternatively, instead of computing the fair share data rate, the network node may receive the fair share data rate which was computed by another network node. The fair share data rate is enforced by the network node in a network protocol stack layer above the media access control layer. In one embodiment, the network protocol stack layer above the media access control layer is the link layer.

Fair sharing of multi-access channels

A method for mapping a network, in accordance with the present invention, includes providing distance measurements between tracers in the network, determining routes along which the distance measurements are made, and creating a system of equations which links the distance measurements between the nodes with a sum of the delays between the nodes which comprise the routes. Additional information is extracted about distances of subpaths of the routes to provide additional details to a map of the network. The additional information provides a capability of estimation of distances between nodes without tracers.

Method and apparatus for network mapping using end-to-end delay measurements

Cryptographic method for restricting access to transmitted programming content using &fnof;-redundant establishment key combinations

A distributed network management function is implemented in a computer network using a set of active nodes. Each of the active nodes comprises a router and a logically-separate active engine. The router in a given one of the active nodes diverts active packets associated with the network management function to the corresponding active engine for processing. The active engine supports one or more sessions, based at least in part on the active packets, for implementing at least a portion of the network management function. Each of the sessions supported by the active engine corresponds to a particular distributed task to be performed in the network, and has associated therewith a unique network identifier, such that different programs on different network nodes can belong to the same session. The router and active engine at a given one of the nodes may reside on the same machine, or on physically-separate machines.

Method and apparatus for efficient network management using an active network mechanism

A method and apparatus for determining locations for and placing k caches in a network for optimizing performance of a network parameter. The method includes the steps of selecting a placement parameter l that is greater than 0, assigning l caches to l arbitrary nodes in the network. selecting l caches to remove from the network, assigning l&plus;1 caches to every possible location in the network, computing and recording network performance data on the network cost parameter for each location and for each selection of l caches, determining a location where the network performance data on the network cost parameter computed and recorded is optimized, assigning l&plus;1 caches to the determined location, and repeating the above steps of selecting l caches, assigning l&plus;1 caches, computing and recording network performance, determining a location, and assigning l&plus;1 caches for k&minus;1 iterations.

Method and apparatus for locating caches in a network to optimize performance

A game has been designed to lure computer users to websites established by companies participating in the game. The participating companies advertise their products and/or services on the websites. The object of the game is to locate and procure a specified icon hidden at each of the websites. In accordance with the invention, the specified icon may assume one of three states, e.g., green, red and yellow states in that order. The three states vary with time and cycle themselves. A user is able to procure and click on a located icon only when it is in a green state, manifest by its green color. A red state of the icon indicates that the green state has just ended, and a yellow state of the icon indicates that the green state is imminent. Thus, in the course of playing the game, a user is likely to revisit or linger at a website whose icon is in a red or yellow state. As a result, such a user spends time on the website and may learn about its advertised products and/or services, thereby helping realize the advertising purpose of the website.

Technique for conducting a game over a communication network

Efficient topology aggregation is realized by generating a full-mesh topology from an original sub-network topology, without compromising accuracy. Then, the full-mesh topology is reduced to a first spanning tree aggregation topology. Distortion in the first spanning tree aggregation topology is evaluated to determine if the resultant spanning tree aggregation topology requires further refinement in order to meet a predetermined distortion criterion. If no further refinement is required, the aggregation topology is advertised. Additionally, a network parameter, e.g., a so-called network radius is generated from the full-mesh topology. In this example, the network parameter is evaluated along with the first spanning tree aggregation topology to determine if the spanning tree aggregation topology requires further refinement. If no further refinement is required, both the aggregation topology and the network parameter are advertised.

Growing community of inventors

Marlboro, NJ, United States of America

Yuval Shavitt