Sciweavers

2924 search results - page 426 / 585
» Lower Bounds in Distributed Computing
Sort
View
WINE
2005
Springer
107views Economy» more  WINE 2005»
15 years 10 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
POLICY
2005
Springer
15 years 10 months ago
Automated Decomposition of Access Control Policies
Modern dynamic distributed information systems need access control policies to address controlling access to multiple resources that are distributed. The s may be considered as a ...
Linying Su, David W. Chadwick, Andrew Basden, Jame...
PERCOM
2006
ACM
16 years 4 months ago
Node Clustering in Mobile Peer-to-Peer Multihop Networks
In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes an...
Chansu Yu, Kang G. Shin, Ben Lee, Seung-Min Park, ...
ISORC
2003
IEEE
15 years 10 months ago
Enhancing Time Triggered Scheduling with Value Based Overload Handling and Task Migration
Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are ...
Jan Carlson, Tomas Lennvall, Gerhard Fohler
INFOCOM
2009
IEEE
15 years 11 months ago
Duty-Cycle-Aware Broadcast in Wireless Sensor Networks
—Broadcast is one of the most fundamental services in wireless sensor networks (WSNs). It facilitates sensor nodes to propagate messages across the whole network, serving a wide ...
Feng Wang, Jiangchuan Liu