Vasona Networks, Inc.

P-cube Ltd.

Michael Ben-Nun

Ofer Weill

Roni Bar Yanai

Nery Strasman

Itzhak Barak

Oren Sadeh

Ariel Peltz

Offer Weil

Sagy Ravid

Examples of methods, systems, and computer program products relating to supervising data in a wireless network are disclosed. At least part of a system may be located between a packet data network and a base station, and/or may be at least logically separate from the base station. The system may be capable of evaluating the service provided by the base station, and may be capable of determining whether or not any action should consequently be performed. Examples of an action may include an action which may not necessarily affect en-route data packets such as outputting a report, and/or an action which may affect en-route data packets such as delaying packets, not delaying packets, and/or stopping the delaying of packets. An action which affects data packets may or may not affect data packets uniformly. An action may or may not result in an improvement in quality of user experience.

Supervision of data in a wireless network

Congestion in a wireless network

A method, a computer program product and a device, the method may include: receiving a first signature and first control metadata; the first control metadata is indicative of at least one control plane message that was exchanged between a RAN and a core network and was intercepted by a probe; the at least one control plane message relates to a first entity that belongs to or is coupled to the RAN; processing information packets received by a policy enforcer to provide information packet signatures, the information packets undergone an address translation process before being received by the policy enforcer; and enforcing a policy associated with the first entity, the enforcing affects an information packet that is associated with an information packet signature that equals the first signature; wherein the address translation process does no corrupt the first signature.

Policy enforcer in a network that has a network address translator

Reducing time period of data travel in a wireless network

Adjusting delaying of arrival of data at a base station

A method, a computer readable media and a device, the method is for evaluating a capacity of a cell of a radio access network (RAN), and may include monitoring, by a monitor, (a) downstream traffic that is directed towards the cell and (b) responses from the cell to the downstream traffic, to provide monitoring results; calculating, in response to the monitoring results, round trip time (RTT) statistics; and generating an estimate of the capacity of the cell in response to the RTT statistics.

Evaluating a capacity of a cell of a radio access network

A method, a computer readable medium and a policy enforcer, the policy enforcer may include: multiple pairs of interfaces; multiple data blades; a switch; at least one load balancing circuit; wherein each pair of interfaces is located along a path between a RAN and an external network through which information packets should have propagated at an absence of the policy enforcer; wherein the at least one load balancing circuit is arranged to select, for each information packet, a selected policy enforcing processor; wherein the at least one load balancing circuit is arranged to select is arranged to send each information packet over the switch to a selected policy enforcing processor; wherein each selected policy enforcing processor is arranged to perform a policy enforcing operation on each information packet associated with the selected policy enforcing processor.

Policy enforcer having load balancing capabilities

A data packet classifier to classify a plurality of N-bit input tuples, said classifier comprising a hash address, a memory and a comparison unit. The hash address generator generate a plurality of M-bit hash addresses from said plurality of N-bit input tuples, wherein M is significantly smaller than N. The memory has a plurality of memory entries and is addressable by said plurality of M-bit hash addresses, each such address corresponding to a plurality of memory entries, each of said plurality of memory entries capable of storing one of said plurality of N-bit tuples and an associated process flow information. The comparison unit determines if an incoming N-bit tuple can be matched with a stored N-bit tuple. The associated process flow information is output if a match is found and wherein a new entry is created in the memory for the incoming N-bit tuple if a match is not found.

Growing community of inventors

Ramat-Hasharon, Israel

Michael Ben-Nun