Sciweavers

674 search results - page 2 / 135
» Scalable simulation of complex network routing policies
Sort
View
WSC
2004
13 years 6 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
CN
2006
106views more  CN 2006»
13 years 4 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
ICC
2007
IEEE
121views Communications» more  ICC 2007»
13 years 11 months ago
Scalable Resilient Overlay Networks Using Destination-Guided Detouring
— Routing policies used in the Internet tend to be restrictive limiting communication between source-destination pairs to one route, when often better alternates exist. To avoid ...
Sameer Qazi, Tim Moors
INFOCOM
2012
IEEE
11 years 7 months ago
Scalable routing in 3D high genus sensor networks using graph embedding
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
Xiaokang Yu, Xiaotian Yin, Wei Han, Jie Gao, Xianf...
MASCOTS
2001
13 years 6 months ago
Minimizing Routing State for Light-Weight Network Simulation
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
Polly Huang, John S. Heidemann