• Publications
  • Influence
Experimental evaluation of wireless simulation assumptions
A comprehensive review of six assumptions that are still part of many ad hoc network simulation studies, despite increasing awareness of the need to represent more realistic features, including hills, obstacles, link asymmetries, and unpredictable fading are provided. Expand
Driving Cache Replacement with ML-based LeCaR
The ML-based LeCaR (Learning Cache Replacement) is competitive with ARC for relatively large cache sizes, but is markedly superior to it when cache sizes become smaller. Expand
Outdoor experimental comparison of four ad hoc routing algorithms
This paper reports on an outdoor comparison of four different routing algorithms, APRL, AODV, ODMRP, and STARA, running on top of thirty-three 802.11-enabled laptops moving randomly through an athletic field, providing insight into the behavior of ad hoc routing algorithms at larger real-world scales than have been considered so far. Expand
Joint Host-Network Optimization for Energy-Efficient Data Center Networking
This paper proposes a joint optimization scheme that simultaneously optimizes virtual machine (VM) placement and network flow routing to maximize energy savings, and builds an OpenFlow based prototype to experimentally demonstrate the effectiveness of the design. Expand
Lookahead revisited in wireless network simulations
  • Jason Liu, D. Nicol
  • Computer Science
  • Proceedings 16th Workshop on Parallel and…
  • 12 May 2002
This paper identifies and exploits lookahead for conservative synchronization protocols in three ways, exploiting characteristics of low power networks, the transceiver logic, and the way in which protocol stacks are typically constructed. Expand
RINSE: the real-time immersive network simulation environment for network security exercises
The architecture and function of RINSE is described and how techniques like multiresolution traffic modeling and new routing simulation methods are used to address the scalability challenges of this application are outlined. Expand
Simulation validation using direct execution of wireless ad-hoc routing protocols
It is concluded that it is possible to have fairly accurate results using a simple radio model, but the routing behavior is quite sensitive to one of this model's parameters, and one should use a more complex radio model that explicitly models point-to-point path loss. Expand
Simulation Modeling of Large-Scale Ad-hoc Sensor Networks
The architecture of this framework, comprised of inter-operating sub-models for terrain, dispersion of hazardous substance, radio propagation, and the actual source code of ad-hoc networking protocols, is described and experiments that confirm its usefulness in the study of routing algorithms are presented. Expand
Composite Synchronization in Parallel Discrete-Event Simulation
This paper considers a technique for composing global (barrier-style) and local (channel scanning) synchronization protocols within a single parallel discrete-event simulation and demonstrates an implementation which finds an optimal solution at runtime and considers its performance on network topologies. Expand
Performance prediction of a parallel simulator
It is shown how the internal overheads of the Dartmouth implementation of the SSF API (DaSSF) can be used to predict the performance of a given model, using given features of the simulator, without having to run, or even build, the model. Expand