Results 1 - 10
of
60,840
MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
- 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
to historical data and also on several complementary mechanisms, including acknowledgments, a head-start for new packets, and lists of previous intermediaries. Our evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers. Our
On the mechanics of economic development
- Journal of Monetary Economics
, 1988
"... THERE have been very few reports of uterine rupture in the cat in the literature (Webb 1972). The causes include external trauma during pregnancy, severe alterations of the wall of the uterus, inadequate obstetric manipulations, and the incorrect use of drugs such as oxytocin or prostaglandin F2ec ( ..."
Abstract
-
Cited by 3847 (7 self)
- Add to MetaCart
THERE have been very few reports of uterine rupture in the cat in the literature (Webb 1972). The causes include external trauma during pregnancy, severe alterations of the wall of the uterus, inadequate obstetric manipulations, and the incorrect use of drugs such as oxytocin or prostaglandin F2ec
A comparison of mechanisms for improving TCP performance over wireless links
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Reliable transport protocols such as TCP are tuned to perform well in traditional networks where packet losses occur mostly because of congestion. However, networks with wireless and other lossy links also suffer from significant losses due to bit errors and handoffs. TCP responds to all losses by i ..."
Abstract
-
Cited by 927 (11 self)
- Add to MetaCart
by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. In this paper, we compare several schemes designed to improve the performance of TCP in such networks. We classify these schemes into three broad categories: end
Coda: A Highly Available File System for a Distributed Workstation Environment
- IN IEEE TRANSACTIONS ON COMPUTERS
, 1990
"... Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple servers ..."
Abstract
-
Cited by 530 (45 self)
- Add to MetaCart
Coda is a file system for a large-scale distributed computing environment composed of Unix workstations. It provides resiliency to server and network failures through the use of two distinct but complementary mechanisms. One mechanism, server replication,stores copies of a file at multiple
Link-Sharing and Resource Management Models for Packet Networks
, 1995
"... This paper discusses the use of link-sharing mechanisms in packet networks and presents algorithms for hierarchical link-sharing. Hierarchical link-sharing allows multiple agencies, protocol families, or traflic types to share the bandwidth on a tink in a controlled fashion. Link-sharing and real-t ..."
Abstract
-
Cited by 618 (12 self)
- Add to MetaCart
complementary, constraints at a gateway that can be implemented with a unified set of mechanisms. White it is not possible to completely predict the requirements that might evolve in the Internet over the next decade, we argue that controlled link-sharing is an essential component that can provide gateways
The Complete Atomic Structure of the Large Ribosomal Subunit at 2.4 Å Resolution
- Science
, 2000
"... ation, and termination phases of protein synthesis. Because the structures of several DNA and RNA polymerases have been determined at atomic resolution, the mechanisms of DNA and RNA synthesis are both well understood. Determination of the structure of the ribosome, however, has proven a daunting t ..."
Abstract
-
Cited by 539 (13 self)
- Add to MetaCart
ation, and termination phases of protein synthesis. Because the structures of several DNA and RNA polymerases have been determined at atomic resolution, the mechanisms of DNA and RNA synthesis are both well understood. Determination of the structure of the ribosome, however, has proven a daunting
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in com-putation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract
-
Cited by 1111 (5 self)
- Add to MetaCart
into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their compu-tational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number
Apoptosis: a Basic Biological Phenomenon with Wide-ranging Implications in Tissue Kinetics
- Br. J. Cancer
, 1972
"... Summary.-The term apoptosis is proposed for a hitherto little recognized mechanism of controlled cell deletion, which appears to play a complementary but opposite role to mitosis in the regulation of animal cell populations. Its morphological features suggest that it is an active, inherently program ..."
Abstract
-
Cited by 641 (6 self)
- Add to MetaCart
Summary.-The term apoptosis is proposed for a hitherto little recognized mechanism of controlled cell deletion, which appears to play a complementary but opposite role to mitosis in the regulation of animal cell populations. Its morphological features suggest that it is an active, inherently
PVS: A Prototype Verification System
- CADE
, 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract
-
Cited by 655 (16 self)
- Add to MetaCart
PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available
Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks
, 2003
"... Abstract — As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has n ..."
Abstract
-
Cited by 703 (15 self)
- Add to MetaCart
routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes. I.
Results 1 - 10
of
60,840