Sciweavers

1259 search results - page 39 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
132
Voted
PODC
2005
ACM
15 years 9 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
XMLSEC
2003
ACM
15 years 9 months ago
First experiences using XACML for access control in distributed systems
Authorization systems today are increasingly complex. They span domains of administration, rely on many different authentication sources, and manage permissions that can be as com...
Markus Lorch, Seth Proctor, Rebekah Lepro, Dennis ...
ADHOC
2007
109views more  ADHOC 2007»
15 years 4 months ago
Access control in wireless sensor networks
Nodes in a sensor network may be lost due to power exhaustion or malicious attacks. To extend the lifetime of the sensor network, new node deployment is necessary. In military sce...
Yun Zhou, Yanchao Zhang, Yuguang Fang
167
Voted
IPPS
2009
IEEE
15 years 10 months ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
MOBICOM
2006
ACM
15 years 10 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff