Results 1 - 10 of 9,198

Frugal path mechanisms

by Aaron Archer, Éva Tardos , 2002
"... We consider the problem of selecting a low cost s − t path in a graph, where the edge costs are a secret known only to the various economic agents who own them. To solve this problem, Nisan and Ronen applied the celebrated Vickrey-Clarke-Groves (VCG) mechanism, which pays a premium to induce the edg ..."
Abstract - Cited by 119 (2 self) - Add to MetaCart
the edges to reveal their costs truthfully. We observe that this premium can be unacceptably high. There are simple instances where the mechanism pays Θ(k) times the actual cost of the path, even if there is an alternate path available that costs only (1 + ɛ) times as much. This inspires the frugal path

Reasoning the fast and frugal way: Models of bounded rationality.

by Gerd Gigerenzer , Daniel G Goldstein - Psychological Review, , 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract - Cited by 611 (30 self) - Add to MetaCart
have proposed a family of algorithms based on a simple psychological mechanism: onereason decision making. These fast and frugal algorithms violate fundamental tenets of classical rationality: They neither look up nor integrate all information. By computer simulation, the authors held a competition

Frugality in Path Auctions

by Edith Elkind, Amit Sahai, Ken Steiglitz - In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms , 2003
"... We consider the problem of picking (buying) an inexpensive s t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner only. We study the problem of finding frugal mechanisms for this task, i.e. we investigate the payments the buyer m ..."
Abstract - Cited by 63 (2 self) - Add to MetaCart
We consider the problem of picking (buying) an inexpensive s t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner only. We study the problem of finding frugal mechanisms for this task, i.e. we investigate the payments the buyer

Resilient Overlay Networks

by David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris , 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s wide-area routing protocols that take at least several minutes to recover. A R ..."
Abstract - Cited by 1160 (31 self) - Add to MetaCart
outages, each lasting over thirty minutes, over the 132 measured paths. RON’s routing mechanism was able to detect, recover, and route around all of them, in less than twenty seconds on average, showing that its methods for fault detection and recovery work well at discovering alternate paths

Token flow control

by Amit Kumar, et al.
"... As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design with route ..."
Abstract - Cited by 635 (35 self) - Add to MetaCart
/delay. In this work, we propose token flow control (TFC), a flow control mechanism in which nodes in the network send out tokens in their local neighborhood to communicate information about their available resources. These tokens are then used in both routing and flow control: to choose less congested paths

Greedy Randomized Adaptive Search Procedures

by Mauricio G. C. Resende , Celso C. Ribeiro , 2002
"... GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract - Cited by 647 (82 self) - Add to MetaCart
solution construction mechanisms and techniques to speed up the search are also described: Reactive GRASP, cost perturbations, bias functions, memory and learning, local search on partially constructed solutions, hashing, and filtering. We also discuss in detail implementation strategies of memory

Practical network support for IP traceback

by Stefan Savage, David Wetherall, Anna Karlin, Tom Anderson , 2000
"... This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denial-of-service attacks and by the difficulty in tracing packets with incorrect, or “spoofed”, source ad ..."
Abstract - Cited by 678 (13 self) - Add to MetaCart
addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs

Model Checking Programs

by Willem Visser, Klaus Havelund, GUILLAUME BRAT, SEUNGJOON PARK, FLAVIO LERDA , 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract - Cited by 592 (63 self) - Add to MetaCart
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers

Random Key Predistribution Schemes for Sensor Networks”,

by Haowen Chan , Adrian Perrig , Dawn Song - IEEE Symposium on Security and Privacy, , 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract - Cited by 832 (12 self) - Add to MetaCart
mechanisms, the q-composite random key predistribution scheme and the multi-path key reinforcement scheme, which substantially increases the security of key setup such that an attacker has to compromise many more nodes to achieve a high probability to compromise communication. Second, we propose a new

MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks

by John Burgess, Brian Gallagher, David Jensen, Brian Neil Levine - In Proc. IEEE INFOCOM , 2006
"... Abstract — Disruption-tolerant networks (DTNs) attempt to route network messages via intermittently connected nodes. Routing in such environments is difficult because peers have little information about the state of the partitioned network and transfer opportunities between peers are of limited dura ..."
Abstract - Cited by 488 (12 self) - Add to MetaCart
duration. In this paper, we propose MaxProp, a protocol for effective routing of DTN messages. MaxProp is based on prioritizing both the schedule of packets transmitted to other peers and the schedule of packets to be dropped. These priorities are based on the path likelihoods to peers according
Results 1 - 10 of 9,198