Sciweavers

366 search results - page 61 / 74
» Communication Complexity with Synchronized Clocks
Sort
View
SPAA
2010
ACM
15 years 4 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
JDM
1998
101views more  JDM 1998»
14 years 11 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
ICC
2007
IEEE
128views Communications» more  ICC 2007»
15 years 6 months ago
A Session-Initiation-Protocol-Based Middleware for Multi-Application Management
Abstract—The deployment of multimedia services in nextgeneration networks is a challenge due to the high configuration complexity of the streaming process in different stationary...
Teodora Guenkova-Luy, Holger Schmidt, Andreas Scho...
TASE
2007
IEEE
15 years 6 months ago
Constraint-Based Policy Negotiation and Enforcement for Telco Services
Telco services are evolving under several aspects: for instance, services may combine different telecommunication features (messaging, multi-media, etc.) and may be activated and...
Maria Grazia Buscemi, Laura Ferrari, Corrado Moiso...
PADS
2005
ACM
15 years 5 months ago
Concurrent Replication of Parallel and Distributed Simulations
Parallel and distributed simulations enable the analysis of complex systems by concurrently exploiting the aggregate computation power and memory of clusters of execution units. I...
Luciano Bononi, Michele Bracuto, Gabriele D'Angelo...