Sciweavers

388 search results - page 11 / 78
» Communication chains and multitasking
Sort
View
JACM
2008
90views more  JACM 2008»
13 years 8 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
VTC
2008
IEEE
14 years 2 months ago
Finding the Best QoS Path in a Gilbert Channel Network
—Many different types of modern wired and wireless communication links can be mathematically described as discretebert channels. In this extended abstract, we present an exact me...
Edwin Soedarmadji
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 8 months ago
Secure outsourced aggregation via one-way chains
We consider the Outsourced Aggregation model, where sensing services outsource their sensor data collection and aggregation tasks to third-party service providers called aggregato...
Suman Nath, Haifeng Yu, Haowen Chan
INFOCOM
2009
IEEE
14 years 2 months ago
A Chain Reaction DoS Attack on 3G Networks: Analysis and Defenses
Abstract—The IP Multimedia Subsystem (IMS) is being deployed in the Third Generation (3G) networks since it supports many kinds of multimedia services. However, the security of I...
Bo Zhao, Caixia Chi, Wei Gao, Sencun Zhu, Guohong ...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg