Abstract: A system includes a laser microphone or laser-based microphone or optical microphone. The laser microphone includes a laser transmitter to transmit an outgoing laser beam towards a face of a human speaker. The laser transmitter acts also as a self-mix interferometry unit that receives the optical feedback signal reflected from the face of the human speaker, and generates an optical self-mix signal by self-mixing interferometry of the laser power and the received optical feedback signal; and a speckles noise reducer to reduce speckles noise and to increase a bandwidth of the optical self-mix signal. The speckles noise reducer optionally includes a vibration unit or displacement unit, to cause vibrations or displacement of one or more mirrors or optics elements of the laser microphone, to thereby reduce speckles noise.

Abstract: A network element includes a data structure, a cache memory and circuitry. The data structure is configured to store multiple rules specifying processing of packets received from a communication network. The cache memory is configured to cache multiple rules including a subset of the rules stored in the data structure. Each rule that is cached in the cache memory has a respective cost value corresponding to a cost of retrieving the rule from the data structure. The circuitry is configured to receive one or more packets from the communication network, to process the received packets in accordance with one or more of the rules, by retrieving the rules from the cache memory when available, or from the data structure otherwise, to select a rule to be evicted from the cache memory, based on one or more respective cost values of the rules currently cached, and to evict the selected rule.

Abstract: A network element includes multiple ports and packet processing circuitry. The ports are configured for exchanging packets with a communication network. The packet processing circuitry is configured to forward first packets over a forward path from a source node to a destination node, to forward second packets over a reverse path, which is opposite in direction to the forward path, from the destination node to the source node, and to mark one or more of the second packets that are forwarded over the reverse path, with an indication that notifies the source node that congestion is present on the forward path.

Abstract: ECMP routing is carried out in fabric of network entities by representing valid destinations and invalid destinations in a group of the entities by a member vector. The order of the elements in the member vector is permuted. A portion of the elements in the permuted vector is pseudo-randomly masked. A flow of packets is transmitted to the first valid destination in the masked member vector.

Abstract: A stacked switch packet communication system is connected to a Multi-Chassis Link Aggregation Group (MLAG). Devices in the system include a designated device for receiving packets that are destined for the MLAG. A new MLAG device is enabled while continuing packet communication by identifying an address of a single port in the new MLAG device. In first updates of the devices the single port is established in the forwarding databases of the devices and the packets transmitted through the devices to the single port. Thereafter, in second updates the single port is replaced in the forwarding databases by another port of the new MLAG device. Upon completion of respective second updates, the packets are transmitted through the devices to the other port in the MLAG.

Abstract: A network device includes circuitry and multiple ports. The circuitry is configured to hold a definition of a normalization function that determines, based on (i) a reference probability of applying a congestion indication operation to packets having a predefined reference packet-size and (ii) a packet-size parameter, a normalized probability of applying the congestion indication operation to packets whose size equals the packet-size parameter. The normalization function depends exponentially on a ratio between the packet-size parameter and the reference packet-size. The circuitry id configured to store packets in a queue, and to schedule transmission of at least some of the queued packets via an output port, to calculate the normalized probability for a given packet, by applying the normalization function to an actual reference probability and an actual size of the given packet, and randomly apply a congestion indication operation to the given packet, in accordance with the normalized probability.

Abstract: A network element includes multiple interfaces and circuitry. The interfaces are configured to connect to a communication system. The circuitry is configured to receive via an ingress interface a packet that includes an Error Detection Code (EDC) field including an input EDC value, to determine an input timestamp indicative of a time-of-arrival of the received packet at the network element, and overwrite at least part of the input EDC value in the EDC field of the packet with the input timestamp, to estimate for the packet a traversal latency between reception at the ingress interface and transmission via a selected egress interface, based at least on the input timestamp, and to produce a deliverable version of the packet by writing an output EDC value to the EDC field, and send the deliverable version of the packet via the selected egress interface.

Abstract: Methods, systems and computer program product for determining parking occupancy. In some embodiments, the parking occupancy is determined based on at least one distance between a parking location of a user and a destination of the user. In some embodiments, the parking occupancy is determined based on one or more parking instances in a paid parking lot and is based on the distance from the paid parking lot. In some embodiments, the parking occupancy is determined based on at least one route of a vehicle while searching for parking. In some embodiments, the parking occupancy is determined based on a parking curve. The parking occupancy can be used to compute an estimated arrival time which includes an estimated searching for parking time. The parking occupancy information can be used to rank parking areas.

Abstract: Pelvic implant having a frame with two arms and a sheet are disclosed. The sheet may be held under tension in the assembled implant. The implant may be planar (flat) or may be non-planar. The implant may be contoured laterally. A curved non-planar implant may be convex or concave in a rostro-caudal direction. The implants may (optionally) include two additional arms and a second sheet for supporting a urethra and/or a bladder neck. Methods for constructing and assembling the implants are disclosed. A method ultrasonically welding the frame of the implant without thermally damaging the sheet is disclosed. Methods of implantation of the implants are disclosed.

Abstract: A method, computer product and computerized system, the method comprising: obtaining travel information regarding at least one future travel for a user, the travel information comprising at least source, destination and travel start time for the at least one travel; determining a location indication and a mobility status for the user, the mobility status determined at least from acceleration readings taken by a mobile device associated with the user; based on the future travel information, mobility status and location indication, determining that the user is in a pre-stage for the at least one future travel; querying a database for a travel partner matching the user and the future travel; and issuing a suggestion to the user to at least partially share a ride from the source to the destination with the travel partner.

Abstract: A network device determines, based on a size of a lookup value, that the lookup value is to be stored across a set of two or more memory banks including a first memory bank and a second memory bank of a database. A first hash function is for determining locations for storing lookup values entirely in the first memory bank, whereas a second hash function is for determining locations for storing lookup values entirely in the second memory bank. A hash operation is performed on the lookup value using the first hash function to determine a memory location for storing the lookup value. A first segment of the lookup value is stored in the first memory bank at the memory location determined using the first hash function, and a second segment of the lookup value is stored in the second memory bank at the memory location determined using the first hash function.

Abstract: ECMP routing is carried out in fabric of network entities by representing valid destinations and invalid destinations in a group of the entities by a member vector. The order of the elements in the member vector is permuted. A portion of the elements in the permuted vector is pseudo-randomly masked. A flow of packets is transmitted to the first valid destination in the masked member vector.

Abstract: Communication apparatus includes a TCAM, which stores a corpus of rules, including respective sets of unmasked and masked bits. The rules conform to respective rule patterns, each defining a different, respective sequence of masked and unmasked bits to which one or more of the rules conform. A RAM caches rule entries corresponding to rules belonging to one or more of the rule patterns that have been selected for caching. Decision logic extracts respective classification keys from data packets, each key including a string of bits extracted from selected fields in a given data packet, and classifies the data packets by first matching the respective classification keys to the cached rule entries in the RAM and, when no match is found in the RAM, by matching the respective classification keys to the rules in the TCAM.

Abstract: Communication apparatus includes multiple interfaces configured to be connected to respective links in a packet data network. Switching circuitry in the apparatus is coupled between the interfaces and is configured to receive, via a first interface among the multiple interfaces, an adaptive routing notification (ARN) requesting that a specified flow of packets from a given source to a given destination in the network be rerouted. The switching circuitry is configured, upon verifying that the first interface serves as an egress interface for the packets in the specified flow, to reroute the specified flow through a different, second interface among the multiple interfaces when there is an alternative route available in the network from the second interface to the given destination, and after finding that there is no alternative route available from any of the interfaces to the given destination, to forward the ARN to a plurality of the interfaces.

Abstract: A stacked switch packet communication system is connected to a Multi-Chassis Link Aggregation Group (MLAG). Devices in the system include a designated device for receiving packets that are destined for the MLAG. A new MLAG device is enabled while continuing packet communication by identifying an address of a single port in the new MLAG device. In first updates of the devices the single port is established in the forwarding databases of the devices and the packets transmitted through the devices to the single port. Thereafter, in second updates the single port is replaced in the forwarding databases by another port of the new MLAG device. Upon completion of respective second updates, the packets are transmitted through the devices to the other port in the MLAG.

Abstract: A data packet is received in a network element. The network element has a cache memory in which cache entries represent a portion of addresses stored in a main memory, The destination address and the cache entries each comprise a binary number. A first determination is made that a number M of the most significant bits of a cache entry and the destination address are identical. A second determination is made that an additional number M+L of the most significant bits of a cache entry and the destination address are identical. Routing information is then retrieved the cache memory, and the packet processed according to the routing information.

Abstract: A method implementable in a mobile device includes determining a driving or walking motion state of the mobile device associated with a user from at least a motion type of sensor on the mobile device and storing a parking location for a vehicle associated with the mobile device, received from a location type of sensor on the mobile device, when the mobile device changes from a driving state to a walking state.

Abstract: A routing table is represented as a binary search tree ordered by prefix lengths. Markers are placed to guide accessing nodes in designated subtrees to search for a longest prefix match with destination addresses of data packet. Destination descendant nodes in remote hierarchical levels of the tree are associated with the markers. The traversal of the binary search tree is conducted by accessing the respective destination descendant nodes while avoiding accessing nodes in intermediate hierarchical levels. The packet is processed using the longest prefix match.

Abstract: A network element includes circuitry and multiple ports. The ports are configured to transmit packets to a common destination via multiple paths of a communication network. Each port includes multiple serializers that serially transmit the packets over respective physical lanes. The power consumed by each port is a nonlinear function of the number of serializers activated in the port. The circuitry is configured to select one or more serializers among the ports to (i) meet a throughput demand via the ports and (ii) minimize an overall power consumed by the ports under a constraint of the nonlinear function, and to activate only the selected serializers. The circuitry is configured to choose for a packet received in the network element and destined to the common destination a port in which at least one of the serializers is activated, and to transmit the packet to the common destination via the chosen port.

Abstract: Packet classification apparatus includes a plurality of switches, including one or more leaf switches and one or more spine switches, each including a memory configured to hold packet classification entries. The ports of the leaf switches include external ports for connection to a packet network and internal ports, which are connected to the ports of at least one of the spine switches. The packet classification entries are selected from a database, which includes an outer partition, which is stored in the memory of the leaf switches, and at least one inner partition, which is stored in the memory of the one or more spine switches.