Patent application number | Description | Published |
20080267106 | Apparatus and method for practical and efficient broadcast in mobile ad hoc networks - The present invention demonstrates how network-coding can be applied to a deterministic broadcast approach, resulting in significant reductions in the number of transmissions in the network. We propose two algorithms, that rely only on local two-hop topology information and make extensive use of opportunistic listening to reduce the number of transmissions: 1) a simple XOR-based coding algorithm and 2) a Reed-Solomon based coding algorithm that determines the optimal coding gain achievable for a coding algorithm that relies only on local information. | 10-30-2008 |
20090010216 | MEDIA-ACCESS-CONTROL PROTOCOL FOR A NETWORK EMPLOYING MULTI-USER WIRELESS CHANNELS - A medium-access-control (MAC) scheduler, according to one embodiment of which a station of a wireless network evaluates data throughputs corresponding to three different transmission configurations for transmission of a packet over a first of that station's wireless links. The first and second of those transmission configurations have the packet encoded in the first and second tiers, respectively, of a two-tier signal. The third transmission configuration has the packet encoded as a conventional single-tier signal. For each of the first and second transmission configurations, the station selects a second of that station's wireless links for transmission of at least a second packet, with the first and second packets encoded in different respective tiers of the two-tier signal. The station varies power allocation between the first and second tiers to optimize data throughput for each of the first and second transmission configurations and selects from the first, second, and third transmission configurations one resulting in the highest data throughput. | 01-08-2009 |
20090010234 | ROUTING PROTOCOL FOR A NETWORK EMPLOYING MULTI-USER WIRELESS CHANNELS - A routing protocol, according to one embodiment of which a first station of a wireless network monitors its outgoing transmissions corresponding to a traffic flow for occurrence of multi-tier signals and for ability to achieve a specified minimum transmission rate. Based on the monitoring, the first station may transmit an outgoing solicitation message that identifies the monitored traffic flow as a candidate for rerouting. Upon receipt of the solicitation message, a second station of the wireless network evaluates whether rerouting of the monitored traffic flow through the second station is capable of increasing data throughput for that traffic flow without decreasing data throughputs for other traffic flows presently handled by the second station. Based on this evaluation, the second station may transmit to the first station an offer to reroute the monitored traffic flow. The first station, in turn, evaluates this offer, e.g., by comparing its benefits with those of alternative offers that the first station might have received from other stations of the wireless network in response to the solicitation message. Based on the latter evaluation, the first station may reroute the monitored traffic flow through the station whose offer is deemed preferable. | 01-08-2009 |
20090296594 | ESTIMATING CARDINALITY DISTRIBUTIONS IN NETWORK TRAFFIC - In one embodiment, a method of monitoring a network. The method includes: receiving, from each host of a set of two or more hosts of the network, a corresponding vector of M components constructed based on data packets received at the host during a time period, M being an integer greater than 1; and, based on the constructed vectors, using an expectation-maximization algorithm to estimate a cardinality distribution for the hosts in the set, wherein constructing a vector includes updating a component of the vector of the corresponding host in response to the corresponding host receiving a data packet, the updating including selecting the component for updating by hashing one or more fields of the data packet received by the corresponding host. | 12-03-2009 |
20100046527 | Latency Equalization for Interactive Network Applications - A network configuration that supports latency-equalization (LEQ) routing by effectively “storing” packets on communication links, rather than at end points. A suitable network configuration is found by (i) identifying a candidate pool of routers through which the participating client terminals and application servers can exchange packets intended for LEQ routing and (ii) analyzing the delay inventory corresponding to the network paths connecting the client terminals and application servers, through those routers. Based on the analysis, M routers from the candidate pool are selected to serve as hub nodes. Each participating client terminal is assigned m of these M hub nodes and, thereafter, directs and receives its packets intended for LEQ routing through one of these m hub nodes. | 02-25-2010 |
20100292995 | METHOD AND APPARATUS FOR INCREMENTAL QUANTILE ESTIMATION - A method and apparatus for incremental quantile estimation is provided. A method for performing incremental quantile estimation using an estimated cumulative distribution function includes receiving a record, identifying an entity with which the received record is associated, determining a record type of the received record based at least in part on the entity with which the received record is associated, updating the estimated cumulative distribution function based on the record type of the received record, and storing the estimated cumulative distribution function. The record type of the received record is indicative of whether the received record is an insertion record, an update record, or a deletion record. The estimated cumulative distribution function may be used to respond to quantile query requests in real-time or near-real-time. | 11-18-2010 |
20110010327 | METHOD AND APPARATUS FOR INCREMENTAL TRACKING OF MULTIPLE QUANTILES - A method and apparatus for incremental tracking of multiples quantiles is provided. A method for performing an incremental quantile update using a data value of a received data record includes determining an initial distribution function, updating the initial distribution function to form a new distribution function based on the received data value, generating an approximation of the new distribution function, and determining new quantile estimates from the approximation of the new distribution function. The initial distribution function includes a plurality of initial quantile estimates and a respective plurality of initial probabilities. The initial distribution function is updated to form the new distribution function based on the received data value. The new distribution function includes a plurality of quantile points identifying the respective initial quantile estimates and a respective plurality of new probabilities associated with the respective initial quantile estimates. The approximation of the new distribution function is generated by, for each pair of adjacent quantile points in the new distribution function, connecting the adjacent quantile points using a linear approximation of a region between the adjacent quantile points. The new quantile estimates and the new probabilities associated with the new quantile estimates may then be stored. | 01-13-2011 |
20110010337 | METHOD AND APPARATUS FOR INCREMENTAL QUANTILE TRACKING OF MULTIPLE RECORD TYPES - A method and apparatus are provided for incrementally tracking quantiles in the presence of multiple record types. A method for performing incremental quantile tracking includes receiving a first data record of a first record type having a first data value, determining whether a second data record of a second record type is received, determining an initial distribution function, updating the initial distribution function to form a new distribution function based on the first data value and whether a second data record is received, generating an approximation of the new distribution function, determining at least one new quantile estimate associated with at least one new probability of the new distribution function using the approximation of the new distribution function, and storing the at least one new quantile estimate and the at least one new probability associated with the at least one new quantile estimate. | 01-13-2011 |
20110069632 | TRACKING NETWORK-DATA FLOWS - A network-equipment-implemented method and apparatus for tracking durations of flows received at a network node in consecutive intervals utilizes two counting bloom filters in ping-pong operation to reduce memory and processing. Identifiers for flows that exceed a predetermined duration or number of intervals are stored in a long-duration flow-identifier table. Hash functions used within the counting bloom filters and optionally used in the long-duration flow-identifier table are chosen to minimize the probability of false positives in the detection of long-duration flows. In some embodiments, flows are sampled to conserve memory and processing resources at the risk of missing detection of some long-duration flows. | 03-24-2011 |
20110222468 | CONCURRENT TRANSMISSION OF MULTIPLE SIGNALS IN A WIRELESS NETWORK - A method for concurrent transmission of multiple radio-frequency signals in a wireless network. The method is executed at a node of the wireless network and makes use of the node's knowledge of local network topology, locations of certain packets in the node's neighborhood, and local state of the radio-frequency (RF) channel to identify a relatively wide range of different opportunities for zero-forcing, aligning, and/or canceling unwanted RF signals at the receiving node(s). The identified opportunities are communicated to the neighbor nodes to advantageously cause concurrent transmissions of a relatively large number of packets. | 09-15-2011 |
20120084860 | SYSTEM AND METHOD FOR DETECTION OF DOMAIN-FLUX BOTNETS AND THE LIKE - In one embodiment, a method for detecting malicious software agents, such as domain-flux botnets. The method applies a co-clustering algorithm on a domain-name query failure graph, to generate a hierarchical grouping of hosts based on similarities between domain names queried by those hosts, and divides that hierarchical structure into candidate clusters based on percentages of failed queries having at least first- and second-level domain names in common, thereby identifying hosts having correlated queries as possibly being infected with malicious software agents. A linking algorithm is used to correlate the co-clustering results generated at different time periods to differentiate actual domain-flux bots from other domain-name failure anomalies by identifying candidate clusters that persist for relatively long periods of time. Persistent candidate clusters are analyzed to identify which clusters have malicious software agents, based on a freshness metric that characterizes whether the candidate clusters continually generate failed queries having new domain names. | 04-05-2012 |
20120170581 | POLICY HOMOMORPHIC NETWORK EXTENSION - Various exemplary embodiments relate to a method and related network node including one or more of the following: establishing a proxy device; establishing a connection between the proxy device and a local network device associated with the network group; configuring the local network device to: forward, to the proxy device, a first subset of received packets via the connection, wherein the first subset of received packets comprises packets destined for the remote node, and forward a second subset of received packets as though the second subset of packets were received directly from the remote node, wherein the second subset of received packets comprises packets received from the proxy device via the connection; and configuring the proxy device to: forward packets received from the local network device via the connection toward the remote node, and forward packets received from the remote node to the local network device via the connection. | 07-05-2012 |
20120173709 | SEAMLESS SCALING OF ENTERPRISE APPLICATIONS - Various exemplary embodiments relate to a method of scaling resources of a computing system, the method comprising. The method may include: setting a threshold value for a metric of system performance; determining an ideal resource load for at least one resource based on the threshold value for the metric; distributing a system work load among the computing system resources; and adjusting the number of resources based on the system work load, the ideal resource load, and a current number of resources. Various exemplary embodiments also relate to a computing system for scaling cloud resources. The computing system may include: internal resources; a load balancer; a performance monitor; a communication module; a job dispatching module; and a controller. Various exemplary embodiments also relate to a method of detecting dynamic bottlenecks during resource scaling using a resource performance metric and a method of detecting scaling choke points using historical system performance metric. | 07-05-2012 |
20130070827 | METHOD FOR BEAMFORMING TRANSMISSIONS FROM A NETWORK ELEMENT HAVING A PLURALITY OF ANTENNAS, AND THE NETWORK ELEMENT - In one embodiment, the method includes receiving a pilot signal from a terminal at a target antenna of the plurality of antennas of the network element, determining an uplink channel estimate for the target antenna based on the received pilot signal, and obtaining a calibration coefficient associated with the target antenna. The calibration coefficient is based on a channel estimate between the target antenna and a different one of the plurality of antennas. The method further includes beamforming a transmission to the terminal using at least the target antenna based on the determined uplink channel estimate and the obtained calibration coefficient. | 03-21-2013 |
20130072140 | METHOD OF IMPROVING TRANSMISSION GAIN AT A NETWORK ELEMENT HAVING A PLURALITY OF ANTENNAS - In one embodiment, the method includes reducing a beam width of transmission to increase an open-loop beamforming gain, reducing a channel bandwidth of the transmission to increase a channel bandwidth gain, and increasing a sequence length of the transmission to increase a sequence length gain. In this embodiment, a gain improvement is based on the product of the open loop beamforming gain, the channel bandwidth gain and the sequence length gain. | 03-21-2013 |
20130089008 | Method Of Accessing A Wireless Network And A Wireless Device - In one embodiment, this method includes sending, from a terminal, a random access request; and receiving, at the terminal, system information from a base station via a unicast transmission in response to the random access request. The system information includes an identifier, uplink bandwidth information and downlink bandwidth information. The identifier identifies the base station, the uplink bandwidth information indicates a bandwidth to use for uplink transmission, and the downlink bandwidth information indicates a bandwidth used for downlink transmission. | 04-11-2013 |
20130237167 | METHOD AND APPARATUS FOR DETERMINING AVAILABLE BANDWIDTH FOR WIRELESS COMMUNICATION - In one embodiment, the method includes determining if a next interval of a bandwidth is available if an interval of the bandwidth preceding the next interval was determined to be available such that the next interval is larger than the preceding interval. | 09-12-2013 |
20140096130 | REDUCING RESPONSE TIME VARIANCE OF VIRTUAL PROCESSORS - A capability is provided for reducing response variance of virtual processors. A controller receives a processing request. The controller may propagate the processing request toward multiple virtual processors hosted on multiple hardware devices contemporaneously. The controller may propagate the processing request toward a first virtual processor hosted on a first hardware device and propagate the processing request toward a second virtual processor hosted on a second hardware device based on a determination that a timeout period expires before a processing response is received from the first virtual processor. The timeout period may be determined based on one or more response time statistics of the virtual processor and one or more response time statistics of a physical processor. | 04-03-2014 |
20140329525 | Methods And Devices For Associating Users To Base Stations In Third Generation Wireless Networks Using Fairness Considerations - The transmission of data from base stations to users (and their devices) in a wireless network is made using proportional fairness without sacrificing throughput by taking in to account fairness considerations at the time the devices are associated with a base station. | 11-06-2014 |
20150067814 | Methods And Systems For Providing Controlled Access To The Internet - Novel, Internet-related architectures, methods and devices are proposed that are based on a fundamentally different philosophy: hosts (e.g., source and destination nodes) are given the ability to specify their access control policies to the network they are a part of, and the network enforces these policies. The architecture proposed is mobility friendly to the ever increasing number of mobile hosts and is scalable as well. | 03-05-2015 |