, or the simplest, or both. A randomized algorithm is an algorithm that uses random numbers to influence the choices it makes in the course of its computation. Thus its behavior (typically quantified as running time or quality of output) varies from

distribute the computational burden and in which a node communicates with a randomly chosen neighbor. We analyze the averaging problem under the gossip constraint for an arbitrary network graph, and find that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly

This is a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various

Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving

“The world is either the effect of cause or chance. If the latter, it is a world for all that, that is to say, it is a regular and beautiful structure.” Marcus Aurelius Proto-organisms probably were randomly aggregated nets of chemical reactions. The hypothesis that contemporary organisms are also

This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady state in that the average nodal speed consistently decreases over time, and therefore should not be directly used for simulation

This urlfairness is caused by the fact that at any given time RED imposes the same loss rate on all jlows, regardless of their bandwidths. We propose Fair Random Early Drop (FRED), a modified version of RED. FRED uses per-active-jlow accounting to impose 011 each flow a loss rate that depends on the flow’s buffer

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration

diffusion process, but leakage and mutual inhibition work together to address several challenges to existing diffusion, random-walk, and accumulator models. The model provides a good account of data from choice tasks using both time-controlled (e.g., deadline or response signal) and standard reaction time

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds