Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
191
Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks
- MOBIHOC'02
, 2002
"... Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering its wide use as a building block for other network layer protocols, the MANET community needs to standardize a single meth ..."
Abstract
-
Cited by 519 (4 self)
- Add to MetaCart
methodology that efficiently delivers a packet from one node to all other network nodes. Despite a considerable number of proposed broadcasting schemes, no comprehensive comparative analysis has been previously done. This paper provides such analysis by classifying existing broadcasting schemes
BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers
- In SIGCOMM
, 2009
"... This paper presents BCube, a new network architecture specifically designed for shipping-container based, modular data centers. At the core of the BCube architecture is its server-centric network structure, where servers with multiple network ports connect to multiple layers of COTS (commodity off-t ..."
Abstract
-
Cited by 248 (31 self)
- Add to MetaCart
show that BCube can be seamlessly integrated with the TCP/IP protocol stack and BCube packet forwarding can be efficiently implemented in both hardware and software. Experiments in our testbed demonstrate that BCube is fault tolerant and load balancing and it significantly accelerates representative
Optimal implementation of the weakest failure detector for solving consensus.
- In Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS’2000),
, 2000
"... Abstract The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, like Consensus. In this paper, algorithms that implement failure detectors in pa ..."
Abstract
-
Cited by 62 (14 self)
- Add to MetaCart
algorithms guarantee that, eventually, all the correct processes agree permanently on a common correct process, i.e., they also implement a failure detector of the class Omega (Ω ). They are also shown to be optimal in terms of the number of communication links used forever. Additionally, a wait
Optimal message-driven implementations of omega with mute processes
- ACM Transactions on Autonomous and Adaptive Systems (TAAS
"... We consider the complexity of algorithms in message-driven mod-els, i.e., models of distributed computations where events can only be caused by message receptions but not by the passage of time. Hutle and Widder (2005) have shown that there is no self-stabilizing imple-mentation of the eventually st ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
of processes that crash during an execution. In this paper we show that f+2 is in fact a lower bound in message-driven systems, even if non stabilizing algorithms are considered. This contrasts time-driven models where f+1 is sufficient for failure detector implementations. After that, we provide an efficient
Computing Aggregates for Monitoring Wireless Sensor Networks
, 2003
"... Wireless sensor networks involve very large numbers of small, low-power, wireless devices. Given their unattended nature, and their potential applications in harsh environments, we need a monitoring infrastructure that indicates system failures and resource depletion. In this paper, we briefly descr ..."
Abstract
-
Cited by 179 (6 self)
- Add to MetaCart
algorithm that enables energy-efficient computation of some classes of aggregates. Second, we show through actual implementation and experiments that wireless communication artifacts in even relatively benign environments can significantly impact the computation of these aggregate properties. In some cases
Efficient algorithms to implement unreliable failure detectors in partially synchronous systems
- Proc. 13th Symposium on Distributed Computing (DISC'99), Bratislava (Slovakia), Springer Verlag LNCS #1693
, 1999
"... Unreliable failure detectors, proposed by Chandra and Toueg [2], are mechanisms that provide information about process failures. In [2], eight classes of failure detectors were dened, depending on how accurate this information is, and an algorithm implementing a failure detector of one of these cla ..."
Abstract
-
Cited by 33 (3 self)
- Add to MetaCart
Unreliable failure detectors, proposed by Chandra and Toueg [2], are mechanisms that provide information about process failures. In [2], eight classes of failure detectors were dened, depending on how accurate this information is, and an algorithm implementing a failure detector of one
Coordinated data aggregation in wireless sensor networks using the omega failure detector
"... Abstract. We present an algorithm implementing the failure detector class omega (Ω) in the crash-recovery model to coordinate data aggregation in wireless sensor networks. In order to minimize the energy consumption when collecting sensor data of a wireless sensor network, we divide the network in r ..."
Abstract
- Add to MetaCart
Abstract. We present an algorithm implementing the failure detector class omega (Ω) in the crash-recovery model to coordinate data aggregation in wireless sensor networks. In order to minimize the energy consumption when collecting sensor data of a wireless sensor network, we divide the network
Failure Detectors as First Class Objects
- In Proc. 1st IEEE Intl. Symp. on Distributed Objects and Applications (DOA’99
, 1999
"... One of the fundamental differences between a centralized system and a distributed one is the notion of partial failures. The ability to efficiently and accurately detect failures is a key element underlying reliable distributed computing. In current distributed systems however, failure detection is ..."
Abstract
-
Cited by 36 (9 self)
- Add to MetaCart
One of the fundamental differences between a centralized system and a distributed one is the notion of partial failures. The ability to efficiently and accurately detect failures is a key element underlying reliable distributed computing. In current distributed systems however, failure detection
ANAGRAM: A Content Anomaly Detector Resistant To Mimicry Attack
- In Proceedings of the 9th International Symposium on Recent Advances in Intrusion Detection (RAID
, 2006
"... Abstract. In this paper, we present Anagram, a content anomaly detector that models a mixture of high-order n-grams (n> 1) designed to detect anomalous and “suspicious ” network packet payloads. By using higher-order n-grams, Anagram can detect significant anomalous byte sequences and generate ro ..."
Abstract
-
Cited by 104 (15 self)
- Add to MetaCart
robust signatures of validated malicious packet content. The Anagram content models are implemented using highly efficient Bloom filters, reducing space requirements and enabling privacy-preserving cross-site correlation. The sensor models the distinct content flow of a network or host using a semi
On the Evaluation of Failure Detectors Performance
"... Despite the great number of papers that broach the consensus agreement, just a few specifically discuss the structure or the implementation of failure detectors. Even these papers usually present only the structure of the detectors, and avoid presenting a comparison between the suggested detector an ..."
Abstract
- Add to MetaCart
Despite the great number of papers that broach the consensus agreement, just a few specifically discuss the structure or the implementation of failure detectors. Even these papers usually present only the structure of the detectors, and avoid presenting a comparison between the suggested detector
Results 1 - 10
of
191
