VADIM ANTONOV
Pilots at Coronet Blvd, Belmont, CA

8185956, May 22, 2012

Mar 31, 2008

12/059471

Walter Bogorad - Danville CA, US
Vadim Antonov - Belmont CA, US

Symantec Corporation - Mountain View CA

H04L 29/06, G06F 15/173, G06F 11/00

726 25, 709223

A mechanism is provided for determining a safety reputation for a network site in a manner that provides both wide coverage of potentially malicious sites as well as improves the freshness of information from which the safety reputation is derived. Community-based information, such as reports from users related to recently-visited network sites, malware detected by reporting network nodes, non-specific information such as unusual CPU usage and network activity of visiting nodes, and information received from other types of external feeds is used in determining the safety reputation and updating the safety reputation. Such information is analyzed in order to determine network sites that are potential sources of malware, which can then be subjected to more detailed analysis. Historical information as to a site's reputation and other factors such as commercial importance can also be reviewed to make a determination as to whether information being currently gathered by a community of users is sufficient to trigger additional analysis of the network site. Thus, resources used for detailed analysis of suspect network sites is conserved.

5884046, Mar 16, 1999

Oct 23, 1996

8/735556

Vadim Antonov - Belmont CA

Pluris, Inc. - Palo Alto CA

G06F 1300, G06F 15173

39520068

A parallel local area network server is capable of sharing data and routing messages between workstations in a local area network. An apparatus according to the invention includes a plurality of processing nodes, each constituted by at least a single data processor, and an interconnect by which the processing nodes communicate. A plurality of mass storage devices are associated with the processing nodes, and a plurality of workstation computers are connected to the processing nodes. Each processing node includes is adapted to route messages to workstation computers associated with other processing nodes and to access data located both locally and at data storage devices associated with other processing nodes. A method according to the invention includes receiving a message at a first processing node and determining if the message is directed to a workstation computer at a second processing node and sending the message to the second processing node for subsequent delivery to the workstation computer. If the message includes a request for a specific data, a second determination is made if the specific data is in the local cache memory of the first processing node.

5940367, Aug 17, 1999

Nov 6, 1996

8/744356

Vadim Antonov - Belmont CA

Pluris, Inc. - Cupertino CA

H04L 12437

370218

The present invention allows a data packet to reach its destination by automatically routing the data packet around failed components by means of a simple and efficient routing algorithms. The present invention is directed to a method and apparatus for routing a data packet through a series of ring stations, a series of mid-switch routing elements, and end-switch routing elements. An apparatus according to the invention includes a first series of ring stations and routing elements that are adapted to communicate with each other, and formed in a ring. Each ring is paired with another ring that includes a second series of ring stations and routing elements that are also adapted to communicate with each other as described above to form a second ring, and thus the two rings forming a ring pair. Each routing element, mid-switch and end-switch, is adapted to switch the path of the data packet between the two rings. The present invention further requires vertical links connecting a routing element from one ring pair to another routing element from another ring pair.

7143164, Nov 28, 2006

Jul 13, 2001

09/905630

Vadim Antonov - Belmont CA, US
Mikhail Kourjanski - Albany CA, US

Exigen Group - San Francisco CA

G06F 15/173, G06F 15/16, G06F 9/44

709225, 709232, 726 3, 717164

A system for utilizing an object library to dynamically match the type structures of a client and a server to determine compatibility. Once compatibility has been established, the client and server can communicate through a secure connection. Information can be sent asynchronously between the client and the server, and a flow control provides a buffer at the flow origin to ensure that there is no overflow of information to the recipient of the flow.

7002958, Feb 21, 2006

Sep 10, 1999

09/393768

Erok Basturk - Cupertino CA, US
Vadim Antonov - Belmont CA, US

Pluris, Inc. - Cupertino CA

H04L 12/56

370392

A method for routing packets in a multipath network of nodes balances the loading of system resources while guaranteeing a FIFO network (i. e. , First In First Out). Acyclic directed graphs based on local network information are used at each node with routing bias tables that allow for local preferences. A randomizing function may be used throughout the network to allow uniform utilization of system resources. A normalizing function may be used throughout the network to reduce bit operations in routing packets.

2002017, Nov 21, 2002

Jul 20, 2001

09/909588

Vadim Antonov - Belmont CA, US
Mikhail Kourjanski - Albany CA, US

H04L009/00

713/201000

The disclosure is a method for dynamically matching a server and a client, the server and client being matched using an object library. A flow control of information is used to provide a buffer so there is no overflow of information to the recipient of the flow. The flow of information between the server and the client is provided through a secure communication. The server and client are also connected asynchronously.

2011004, Feb 17, 2011

Aug 13, 2009

12/540907

Zulfikar Ramzan - Cupertino CA, US
Walter Bogorad - Cupertino CA, US
Ameet Zaveri - Pleasanton CA, US
Vadim Antonov - Belmont CA, US
Carey Nachenberg - Northridge CA, US

G06F 15/16

709203

Reputations of objects are determined by a reputation system using reports from clients identifying the objects. Confidence metrics for the clients are generated using information determined from the reports. Confidence metrics indicate the amounts of confidence in the veracity of the reports. Reputation scores of objects are calculated using the reports from the clients and the confidence metrics for the clients. Confidence metrics and reputation scores are stored in correlation with identifiers for the objects. An object's reputation score is provided to a client in response to a request.

8621625, Dec 31, 2013

Dec 23, 2008

12/342607

Walter Bogorad - Danville CA, US
Vadim Antonov - Belmont CA, US

Symantec Corporation - Mountain View CA

G06F 21/00

726 23, 713156, 713164, 713165, 705 3, 370229

A computer-implemented method for detecting infected files may include identifying a set of known-clean files. The method may also include identifying a set of characteristics of an unchecked file. The method may further include determine that the unchecked file is related to a clean file in the set of known-clean files. The determination may be based on the set of characteristics of the unchecked file. The method may additionally include determining whether the unchecked file is functionally equivalent to the clean file. This determination may be based on the set of characteristics of the unchecked file. Various other methods, systems, and computer-readable media are also disclosed.

6044080, Mar 28, 2000

Nov 19, 1996

8/752479

Vadim Antonov - Belmont CA

Pluris, Inc. - Palo Alto CA

H04L 1228

370401

A scalable parallel packet router comprises a massively parallel computer 10 and a plurality of multiplexers 15, and is controlled by a disclosed packet routing algorithm, and a method of very high-speed packet routing. The method includes selection of an destination node by computing a hash function from source and destination addresses of a packet, so the ordering of packets is preserved.

8463235, Jun 11, 2013

Sep 14, 2010

12/881915

Vadim Antonov - Belmont CA, US
Kirill Levichev - Belmont CA, US

Symantec Corporation - Mountain View CA

H04M 1/66

455410, 455411, 455461, 455551, 4554141

Attempts to communicate telephonically by a mobile phone are detected. When an attempt is detected, an associated phone number is identified and transmitted to a server in order to glean corresponding security information. On the server, a database is maintained containing 1) phone numbers known to present potential security concerns and 2) descriptive security information concerning each of these phone numbers. The server receives phone numbers from mobile phones to check for security information, searches the database for received phone numbers, and transmits corresponding security information to the originating mobile phones. Security information concerning identified telephone numbers is received from the server by mobile phones. Responsive to the contents of the received security information, detected attempts to communicate telephonically are allowed to processed, blocked or otherwise processed.