Sciweavers

1110 search results - page 30 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
JUCS
2008
135views more  JUCS 2008»
14 years 11 months ago
Approximation to a Behavioral Model for Estimating Traffic Aggregation Scenarios
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
Alberto E. Garcia, Klaus D. Hackbarth
DSN
2003
IEEE
15 years 4 months ago
Design and Implementation of a Consistent Time Service for Fault-Tolerant Distributed Systems
Clock-related operations are one of the many sources of replica non-determinism and of replica inconsistency in fault-tolerant distributed systems. In passive replication, if the ...
Wenbing Zhao, Louise E. Moser, P. M. Melliar-Smith
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 8 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
REALWSN
2010
14 years 6 months ago
Visibility Levels: Managing the Tradeoff between Visibility and Resource Consumption
Pre-deployment tests of sensor networks in indoor testbeds can only deliver a very approximate view of the correctness and performance of a deployed sensor network and it is theref...
Junyan Ma, Kay Römer
ATAL
2003
Springer
15 years 4 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling