Sciweavers

2796 search results - page 524 / 560
» The coolest path problem
Sort
View
WSC
2004
15 years 1 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
WSC
2004
15 years 1 months ago
Fast Model-Based Penetration Testing
Traditional approaches to security evaluation have been based on penetration testing of real systems, or analysis of formal models of such systems. The former suffer from the prob...
Sankalp Singh, James Lyons, David M. Nicol
MMNS
2003
119views Multimedia» more  MMNS 2003»
15 years 1 months ago
A New Available Bandwidth Measurement Technique for Service Overlay Networks
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 1 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
WSC
1998
15 years 1 months ago
Informational Macrodynamics: System Modelling and Simulation Methodologies
Informational Macrodynamics (IMD) presents a unified informational systemic approach with common information language for modeling, analysis and optimization of a variety of inter...
Vladimir S. Lerner