Sciweavers

290 search results - page 15 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
ICDCSW
2005
IEEE
15 years 3 months ago
Specifying Information-Flow Controls
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
Howard Chivers, Jeremy Jacob
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 10 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
MOBIHOC
2007
ACM
15 years 9 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
ICDCS
1998
IEEE
15 years 2 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen
TROB
2008
97views more  TROB 2008»
14 years 9 months ago
Physical Path Planning Using a Pervasive Embedded Network
Abstract--We evaluate a technique that uses an embedded network deployed pervasively throughout an environment to aid robots in navigation. The embedded nodes do not know their abs...
Keith J. O'Hara, Daniel B. Walker, Tucker R. Balch