Sciweavers

1528 search results - page 266 / 306
» On Signatures for Communication Graphs
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 2 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
ICICS
2005
Springer
14 years 2 months ago
Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili...
SIGCOMM
2004
ACM
14 years 2 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
ICCS
2004
Springer
14 years 2 months ago
An Exportable CGIF Module from the CP Environment: A Pragmatic Approach
We have upgraded the Conceptual Programming Environment (CP) from a single standalone application to a set of component modules to increase flexibility of the environment and to a...
Heather D. Pfeiffer
ICNP
2003
IEEE
14 years 2 months ago
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
Bong-Jun Ko, Dan Rubenstein