Escolar Documentos
Profissional Documentos
Cultura Documentos
XX Jornadas de Paralelismo
Organiza:
Grupo de Arquitectura de Computadores
Universidade da Coruña
EDITORES:
ISBN: 84-9749-346-8
Comité de coordinación
Entidades Colaboradoras
Entidades Organizadoras
El número de asistentes a las Jornadas de Paralelismo ha ido creciendo con cada nue-
va edición. En este año se han recibido 119 artı́culos, y el número de participantes con el
que contamos asciende a más de 170. Finalmente el programa ha quedado estructurado
en más de 20 horas de trabajo, repartidas en 24 sesiones que cubren los temas siguien-
tes: tecnologı́as grid y plataformas distribuidas; aplicaciones; redes y comunicaciones;
arquitecturas, algoritmos y aplicaciones sobre aceleradores hardware; arquitecturas de
procesador, multiprocesadores y chips multinúcleo; algoritmos y técnicas de programa-
ción paralelas; compilación para sistemas de altas prestaciones; docencia en Arquitectura
y Tecnologı́a de Computadores (ATC); y evaluación de prestaciones.
Contamos en esta edición con dos conferencias plenarias, impartidas por los profe-
sores Mark Baker, de la Universidad de Reading (Reino Unido), sobre Cloud Computing
y sus servicios, y Enrique Quintana-Ortı́, de la Universitat Jaume I, sobre técnicas su-
perescalares en la construcción de bibliotecas numéricas para procesadores multinúcleo
y GPUs. Además tendremos la oportunidad de asistir a dos sesiones técnicas imparti-
das por HP España y Bull España, y a la asamblea de la Sociedad de Arquitectura y
Tecnologı́a de Computadores (SARTECO).
El programa de las Jornadas incluye también dos mesas redondas sobre asuntos que
actualmente están provocando un intenso debate entre la comunidad universitaria. La
primera de ellas trata sobre cómo trasladar las fichas del Grado y Master en Informáti-
ca a los nuevos planes de estudio. La segunda mesa redonda abordará el tema de la
transferencia de conocimiento universidad-empresa.
Aplicaciones
ix
Ultra-fast Tomographic Reconstruction with a Highly Optimized Back-
projection Algorithm
J.I. Agulleiro, E.M. Garzón, I. Garcı́a y J.J. Fernández . . . . . . . . . . . . . . . . . . . . . . 75
Alternativas de Optimización Multiobjetivo Paralela en la Predicción de
Estructuras de Proteı́nas
J.C. Calvo, J. Ortega y M. Anguita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
Aplicación de Estadı́sticos para el Análisis y el Estudio de la Estimación y
Compensación de Movimiento en MPEG-2
A.J. Dı́az-Honrubia, G. Fernández-Escribano y P. Cuenca . . . . . . . . . . . . . . . . . . . 87
La Necesidad de Mejoras en Predicción y Computación para el Modelo
MM5
H. Ihshaish, A. Sairouni, A. Cortés y M.A. Senar . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
Entorno de Desarrollo de Heurı́sticas Distribuidas Utilizando OSGi
P. Garcı́a-Sánchez, P.A. Castillo, J. González, J.J. Merelo y A.A. Escámez . . . . 99
Enhanced Non-embedded Lower Tree Wavelet Encoder
O. López, M. Martı́nez-Rach, P. Piñol, M.P. Malumbres y J. Oliver . . . . . . . . . 105
Resolución del Problema del Lı́der-seguidor mediante Algoritmos Paralelos
J.L. Redondo, A.G. Arrondo, I. Garcı́a y P.M. Ortigosa . . . . . . . . . . . . . . . . . . . . . 111
A Partitioning Method Based on Convex Hulls for Crowd Simulations
G. Vigueras, M. Lozano, J. M. Orduña y F. Grimaldo . . . . . . . . . . . . . . . . . . . . . . . 117
PySParNLCG: Interfaz-librerı́a del Método del Gradiente Conjugado no
Lineal Paralelo para Sistemas Dispersos
H. Migallón, V. Migallón y J. Penadés . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
Using Evolutionary Intelligent Systems to Enhance Forest Fire Spread Pre-
diction
K. Wendt, A. Cortés y T. Margalef . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
Resolución del Problema de la Planificación de Frecuencias en Redes GSM
Utilizando GRASP y Computación Grid
J.M. Chaves-González, R. Hernando-Carnicero, M.A. Vega-Rodrı́guez, J.A.
Gómez-Pulido y J.M. Sánchez-Pérez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
MapReduce Implementation of High Resolution Irradiation Model
S. Tabik, L.F. Romero, O. Plata y G. Bandera . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
Solving Half Billion Unknowns with High Scalability Multipole Method
J.C. Mouriño, A. Gómez, J.M. Taboada, L. Landesa, F. Obelleiro y J.L.
Rodrı́guez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
x
Mejorando el Rendimiento SMT: Algoritmo Genético para la Configuración
de Cachés Reconfigurables
J. Dı́az, J.I. Hidalgo, F. Fernández, O. Garnica y S. López . . . . . . . . . . . . . . . . . . 159
A Cache Filtering Mechanism for Hardware Transactional Memory Sys-
tems Decoupled from Caches
L. Orosa, J.D. Bruguera y E. Antelo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
Implementación de un Predictor de Último Uso con Decaimiento
J. Alastruey, T. Monreal, V. Viñals y M. Valero . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
A Novel Transactional Book-keeping Scheme for Tiled CMPs
R. Titos-Gil, M.E. Acacio y J.M. Garcı́a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177
On the Feasibility of Fat-tree Topologies for Network-on-chip
F. Gilabert, D. Ludovici, S. Medardoni, C. Gómez, M.E. Gómez, P. López,
G.N. Gaydadjiev y D. Bertozzi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183
A Workload-Aware ROB Sharing Strategy for Multithreaded Processors
R. Ubal, J. Sahuquillo, S. Petit y P. López . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
Energy-Efficient Power Budget Matching
J.M. Cebrián , J.L. Aragón, J.M. Garcı́a, P. Petoumenos y S. Kaxiras . . . . . . . 195
Limiting the Storage Requirements for Preventing Starvation in Token
Coherence
B. Cuesta, A. Robles y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
An Efficient Memory Disambiguation Hardware in an x86 Architecture
R. Apolloni, D. Chaver, F. Castro, L. Piñuel, M. Prieto y F. Tirado . . . . . . . . . 207
RUFT: Reduced Unidirectional Fat–tree
C. Gómez, F. Gilabert, M.E. Gómez, P. López, y J. Duato . . . . . . . . . . . . . . . . . . 213
Achieving Directory Scalability and Lessening Network Traffic in Many-
core CMPs
A. Ros, M.E. Acacio y J.M. Garcı́a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219
Phit Reduction Techniques to Deal with Process Variability in NoC Links
C. Hernández, F. Silla, V. Santonja y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
Logic Tree-Based Broadcast Support for CMPs
S. Rodrigo, J. Flich y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
Needs of CQoS for Future, Many-core CMPs to Support Server Consolida-
tion and Cloud Computing
J. Merino, L.G. Menezo y V. Puente . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
Performance Analysis of Non-Uniform Cache Architecture Policies for
Chip-Multiprocessors Using the Parsec v2.0 Benchmark Suite
J. Lira, C. Molina y A. González . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
Diseño de Signaturas Explotando Localidad en Memoria Transaccional
R. Quislant, E. Gutiérrez, O. Plata y E.L. Zapata . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
xi
Arquitecturas del subsistema de memoria y almacenamiento secundario
xii
Programación de Alto Rendimiento en el Procesador Cell: Aplicación a
Simulación de Fluı́dos
C.H. González, B.B. Fraguela, D. Andrade, J.A. Garcı́a y M.J. Castro . . . . . . 333
Paralelización de la Estimación de Movimiento para Tamaño de Bloque
Variable Utilizando Aritmética OLA
J. Olivares . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 339
Evaluation of the Cell Broadband Engine Running Continuous Estimation
of Distribution Algorithms
C. Pérez-Miguel, J. Miguel-Alonso y A. Mendiburu . . . . . . . . . . . . . . . . . . . . . . . . . 343
Proyección de Algoritmos de Resolución de Sistemas Tridiagonales en la
Tarjeta Gráfica
J. Lamas-Rodrı́guez, M. Bóo, D.B. Heras y F. Argüello . . . . . . . . . . . . . . . . . . . . . 349
Docencia en ATC
xiii
Montaje de un Laboratorio de Desarrollo de Software Empotrado Usando
sólo Herramientas Open Source
J. González, J.M. Palomares y P. Garcı́a-Sánchez . . . . . . . . . . . . . . . . . . . . . . . . . . . 397
Forge: A Multi-purpose Platform for Measuring Energy and Temperature
in Commodity PCs
S. Gutiérrez, O. Benedı́, D. Suárez, J.M. Marı́n y V. Viñals . . . . . . . . . . . . . . . . . 403
Un módulo para la Gestión de Prácticas de Tecnologı́a de Computadores
en Moodle
J. Ramos, S. Romero, M.A. Trenas, F. Corbera y E. Gutiérrez . . . . . . . . . . . . . . 409
Evaluación de prestaciones
Redes y comunicaciones
xiv
Análisis de Opciones de Externalización de Interfaces de Red con Modelos
HDL
W.M. Haider, J. Ortega, A.F. Dı́az y A. Ortiz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 475
Sistema Integrado de Simulación de NoCs.
F. Triviño, F. J. Andújar, A. Ros, J.L. Sánchez y F.J. Alfaro . . . . . . . . . . . . . . . . 481
Multipath Fault-Tolerant Routing Policies for High-Speed Interconnection
Networks
G. Zarza, D. Lugones, D. Franco y E. Luque . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 487
Interconexión de Sistemas Basados en HyperTransport
J.A. Villar, F.J. Alfaro, J.L. Sánchez, J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493
Reducing User-Perceived Latencies and Web Server Load by Prevalidating
Web Objects
J. Domènech, J.A. Gil, J. Sahuquillo y A. Pont . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 499
FBICM: Control de Congestión Eficiente y Escalable en Redes de Interco-
nexión con Encaminamiento Distribuido Determinista
J. Escudero-Sahuquillo, P.J. Garcı́a, F.J. Quiles, J. Flich y J. Duato . . . . . . . . . 505
Biblioteca de Primitivas Colectivas en Paso de Mensajes para Java en Sis-
temas Multi-core
S. Ramos, G.L. Taboada, J. Touriño y R. Doallo . . . . . . . . . . . . . . . . . . . . . . . . . . . . 511
Biblioteca de Operaciones Colectivas para el Lenguaje de Programación Pa-
ralela UPC
J. Andión, G.L. Taboada, J. Touriño y R. Doallo . . . . . . . . . . . . . . . . . . . . . . . . . . . 517
Evaluation of Traffic Exposure in Anonymous Routing Protocols for MA-
NETs
M. Nácher, C.T. Calafate, J.C. Cano y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . . 523
Cross-Layer Evaluation of a VANET-based Content Delivery Framework
J. Márquez, C.T. Calafate, J.C. Cano y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . 529
The Watchdog: a Black-hole Intrusion Tolerance Implementation for Ad-
hoc Networks
J. Hortelano, J.C. Ruiz y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 535
Evaluating Warning Dissemination in VANETs
F.J. Martı́nez, J.C. Cano, C.T. Calafate y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . 541
A Multi-objective Genetic Approach for Concurrent Mapping and Routing
in Networks-on-Chip
R. Tornero, V. Sterrantino, M. Palesi y J.M. Orduña . . . . . . . . . . . . . . . . . . . . . . . . 547
Hardware Study of the SCFQ-CA and DRR-CA Egress Link Schedulers
J.M. Claver, R. Martı́nez, F.J. Alfaro y J.L. Sánchez . . . . . . . . . . . . . . . . . . . . . . . . 553
Experimenting with the IEEE 802.11e Technology in a Real Testbed
A. Torres, C.T. Calafate, J.C. Cano y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . . . 559
Analyzing the Behavior of Acoustic Link Models in Underwater Wireless
Sensor Networks
J. Llor, E. Torres, P. Garrido y M.P. Malumbres . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565
xv
Thin trees: Cost-Effective Tree-like Networks
J. Navaridas, J. Miguel-Alonso y W. Denzel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 571
Evaluación en Servidores Web de una Interfaz de Red Distribuida
A. Ortiz, J. Ortega, A.F. Dı́az y A. Prieto . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 577
Esquemas Dinámicos de Distribución de Claves en Redes Peer-to-peer Mul-
timedia
J.A.M. Naranjo, J.A. López-Ramos y L.G Casado . . . . . . . . . . . . . . . . . . . . . . . . . . . 583
Upper Bound of Web Page Latency Saving in an Experimental Prefetching
System
B. de la Ossa, J. Sahuquillo, A. Pont y J.Gil . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 587
xvi
Replicación de Datos en PVFS2 para Conseguir Tolerancia a Fallos
E. Nieto-Tovar, R. Hernández-Palacios, H.E. Camacho-Cruz, A.F. Dı́az-
Garcı́a, M. Anguita-López y J. Ortega-Lopera . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659
Implementación Grid de Algoritmo Scatter Search. Aplicación a la Opti-
mización de Dispositivos de Fusión Nuclear
A. Gómez-Iglesias, M.A. Vega-Rodrı́guez, F. Castejón, J.M. Sánchez-Pérez,
M. Cárdenas-Montes y E. Morales-Ramos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 665
Elastic Management of Tasks in Virtualized Environments
I. Goiri, J. Guitart y J. Torres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 671
Planificación Avanzada en GridWay
L.T. Bolı́var, C. Carrión y M.B. Caminero . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
Expanding a Node Memory Beyond the Node Limits
H. Montaner, F. Silla y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683
Modelo de Asignación de Tareas en Entornos Multicluster Heterogéneos y
no Dedicados
H. Blanco, J.L. Lérida, F. Guirado y A.I. Usié . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 689
A Non-Additive Negotiation Model for Utility Computing Markets
M. Macı́as y J. Guitart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 695
Mejora del Servicio de Información de GT4 a través del Common Infor-
mation Model
G. Fernández, I. Dı́az, P. González, M. J. Martı́n y J. Touriño . . . . . . . . . . . . . . 701
xvii
463 A Coruña, 16-18 de septiembre de 2009
Resumen— The use of simulation has grown in the usually randomly generated in much of the research
networking field, specially for Mobile Ad hoc Net- works without any kind of validation, leading to a
works (MANETs). Simulation plays a very important
role when evaluating routing protocols. However, the lack of accuracy. So, a way to characterize and vali-
validity of published simulation results has been ques- date simulation scenarios prior to evaluating routing
tioned by several authors. One of the main reasons protocols is required. This problem has been widely
exposed in the research literature is related to topol-
ogy modeling, since the specific scenarios chosen have
addressed in the literature [2], [7], [8], [9], [10], [11].
a great impact on simulation results. Most simula- For example, two metrics are used in [8] for con-
tion studies usually pick a few randomly generated structing valid MANET scenarios in order to evalu-
simulation scenarios leading to a lack of credibility of
ate routing protocols: (1) average shortest path hop
such works. Several works have been carried out re-
cently in which the authors define a set of metrics and count, and (2) average network partitioning. Some
propose several recommendations for properly choos- metrics are defined in [10] in order to quantify the
ing the simulation scenarios. However, it is almost partitioning degree too.
impossible to follow those recommendations without
the support of specific tools, specially when network However, putting into practice the suggestions
nodes are mobile. In this paper, a simulation frame- given in such works is quite complicated without the
work is presented supporting both topology model- help of adequate software tools. According to [2],
ing and the simulation automation based on the OP-
NET Modeler simulator. The proposed set of tools some of the most commonly used simulator tools for
is helpful at constructing rigorous MANET scenarios, modeling wireless networks are ns-2 [12], GloMoSim,
as well as at performing other necessary tasks such and OPNET Modeler [13]. However, the OPNET
as running simulations, extracting the selected data
from the simulation results, and generating graphs Modeler simulator is not as extended as ns-2, and
and reports. These tools have been ported to the such kind of tools is not available. Thus, in this pa-
most common platforms, and can be executed either per we present a simulation framework that is able
sequentially or in parallel on a Condor cluster.
to meet these research goals.
Palabras clave— Modeling, Simulation Life Cycle,
Automation, OPNET Modeler, Condor
The remainder of the paper is organized as fol-
lows. Firstly, an overview of the developed simula-
tion framework is presented in section II. In Sec-
I. Introduction tion III, the modeling of MANET scenarios and the
methodology for running a set of simulations are de-
M OBILE Ad hoc Networks (MANETs) are com-
posed by a group of wireless stations that com-
municate with each other to form a network. This
scribed. Section IV describes how to process the re-
sulting data from the simulations in order to generate
kind of networks does not require any sort of infras- graphs and reports that make easier the analysis of
tructure. Instead, a source node can communicate such data. Finally, conclusions are drawn in Section
with a destination node directly (if both are within V, along with references to future work.
the communication range) or through a set of inter-
mediate nodes that forward any incoming packet to II. Framework overview
the next neighbor in the established path (multihop). This paper presents a set of tools developed specif-
Implementing a real MANET scenario is costly ically for the OPNET Modeler simulator in order to
and both resource and time consuming. On the automate, not only the modeling, but also all the
other hand, these networks are mathematically in- phases involved with the simulation cycle. The spe-
tractable [1]. So, most published research works cific purpose of each one is briefly described on the
about MANETs use simulation tools [2], but the reli- following:
ability of such simulation studies has been questioned
[3], [4], [5]. • simul topogen: this is a topology generator that
Modeling appropriate scenarios and realistic mo- follows some of the recommendations proposed
bility patterns is an important task when simulating in the literature in order to build appropriate
MANETs, since small differences in the scenario’s MANET scenarios.
topology have a large impact on routing algorithms, • simul simul : used for running one or several sim-
as stated in [6] and [7]. However, the scenarios are ulation sets, specifying, for example, different
random number seeds or a list of values for some
1 Dpto. Fı́sica y Arquitectura Computadores, Univ. parameter.
Miguel Hernández, e-mail: {pgarrido, mels, jllor, • simul data: used for extracting data from all
esteban.torres}@umh.es.
2 Dpto. Informática de Sistemas, Univ. Politécnica Valencia, the binary files obtained as result of running the
e-mail: calafate@disca.upv.es. simulation sets. This program invokes another
XX Jornadas de Paralelismo 464
program called, ov2txt, which extracts data from by each mobile node is recorded in an ASCII text
the result file (.ov) for each individual simulation file (with a .trj extension) by running a simulation.
and saves it to a text file. If more flexibility is required, the decentralized ap-
• simul graphs: used for generating graphs from proach is more adequate, allowing to define a distinct
the extracted data. profile for each node.
• simul reports: used for building a report for each When executing one simulation, one random num-
programmed simulation set. ber seed must be specified. Thus, to ensure the sta-
tistical validity of the obtained results, it is necessary
All these tools are command-line programs and
to repeat the experiment with distinct random seeds.
were developed using the C programming language.
However, changing the seed affects the trajectory fol-
This has allowed to migrate them easily to several
lowed by the mobile nodes. In order to use the same
platforms such as MS-Windows, UNIX-like systems
trajectory independently of the random number seed
(e.g. Linux), or MacOS X. However, running some of
used, the generated trajectory file for each node us-
these programs will be only possible if the OPNET
ing the centralized approach should be assigned to
Modeler has been ported to that specific platform.
the corresponding mobile node using the ’trajectory’
Currently, it is available for MS-Windows and Linux
attribute. OPNET Modeler offers an option to do
(since v11.5). For example, the simul topogen tool
this assignment.
needs the External Model Access (EMA) package
from OPNET in order to building MANET scenar- Although, all the aforementioned options within
ios, and the simul simul tool invokes the op runsim OPNET Modeler are useful, when it is necessary to
program to run each simulation from the command generate a great number of MANET scenarios, doing
line. The same applies to the simul data program it manually can be a tedious task and prone to error.
because the program ov2txt is invoked, requiring the Our simul topogen tool does all those steps automat-
EMA package too. ically for a specified list of seed values, generating a
distinct scenario and trajectories for each one. An-
On the other hand, the remainder tools do not
other drawback of manually doing these tasks within
need the OPNET Modeler simulator, and so they can
the OPNET Modeler environment is that there is no
be executed on a different platform if necessary. In
way of knowing if the scenarios generated are valid
particular, simul graphs can be executed on any plat-
for conducting a rigorous research, specially in the
form in which either the R package [14] or gnuplot
presence of mobility. The position of nodes is a crit-
[15] are available. About the simul reports tool, this
ical factor because one or more of them could be
only needs a LATEX[16] distribution, which is avail-
isolated. This is specially true in the case of static
able in many platforms.
scenarios where the position of nodes provokes net-
Finally, all the developed tools are able to work
work partitioning. For example, if some nodes are
both sequentially and in parallel when a cluster sys-
isolated, they will not be able to communicate with
tem is available (e.g. Condor [17]). This is achieved
each other during all the simulation time nor receive
easily by specifying a simple option from command-
broadcast messages. In an dynamic scenario, this
line, drastically reducing the time spent in each step
problem can also occur at any time due to the mo-
of the whole process.
bility of the nodes, but it is usually temporary.
Due to these issues, some researchers have pro-
III. Modeling and Simulation
posed some recommendations when choosing the sce-
A. Modeling MANET scenarios narios for simulation. For example, as stated in [8],
in order to rigorously test a MANET routing proto-
Network simulators typically receive a scenario as
col, the scenario should meet two standards: (1) the
input, which, in the particular case of MANETs, de-
average shortest-path hop count needs to be large,
scribes the mobility pattern of a group of nodes.
and (2) only a small amount of network partitioning
Both the OPNET Modeler simulator and the pro-
should exist. Therefore, the proposed simul topogen
posed simul topogen utility allow the user to ran-
tool takes into account such recommendations and
domly set the initial node placement within a specific
checks the validity of any generated scenario.
area, as well as setting a mobility profile.
The simul topogen tool computes the average
With regard to the mobility pattern of nodes, sev-
shortest-path hop count and several metrics defined
eral mobility models have been proposed [18], but
in [8] and [10] in order to determine the network par-
only a few are available in OPNET Modeler. With
tition degree for each scenario generated. In short,
OPNET Modeler it is possible to use either a cen-
the four metrics considered in simul topogen are de-
tralized or a decentralized approach when modeling
fined as follows:
the mobility pattern. In the centralized approach,
a common mobility profile is used for all the nodes, • Average shortest-path hop count (AHC): the
and a ’Mobility Config’ object is needed. This ob- smallest number of hops along any path between
ject holds the random mobility parameters for the each pair of nodes, taking into account the trans-
Random Waypoint mobility model (RWM), namely, mission range. The minimum value is 1, indi-
the area of the movement, the speed, and the pause cating that every pair of nodes are direct neigh-
time. This is the most common mobility model bours. Although the average number of hops is
for MANETs [8], [19]. The random path followed more commonly used when evaluating the per-
465 A Coruña, 16-18 de septiembre de 2009
formance of a protocol, this metric is more con- Scenario seed=00001 − Nodos (50): 0..49
venient to check for the validity of the generated
0
m 10 2
46 17 9 21 33 0
scenarios because it is not protocol dependent. 14 24
19 16 27
29
43 30
100
• Average Network Partitioning (ANP): the pro- 44
20 5 1
portion of node pairs with no communication 42
28 8
47
15
40
200
34 7
18 32
path available. The optimum value for this met- 26 37 35 12
39
ric is 0%, indicating that there is no partitioning 36 22
300
38 45 6
25 13 4
23
degree and so all the nodes are able to commu- 3 31
11 49
48
400
41
nicate with each other. m
of partitions that exist in the network. If this Scenario seed=00001 − Nodos (50): 0..49
value is 1, all nodes are in the same group, that
0
m
is, there is no isolated node.
Average Partition Size (APS): the average num-
100
•
27 43 36
ber of nodes in each partition. The greater the 22
44 10
17
7262
45 32
20
34
200
37
size of a partition, the higher connectivity and 40
35 14 47
48
12 3
38
lower partitioning degree of the network. If this 31
11
21
91928 8
300
13
16 4142 30
value is exactly the number of nodes, all of them 49
1 5 15 3925
33 0
are in the same group. On the other hand, if this 24 2923
400
18 4
m
6
46
value is 1, each node is isolated from the others.
0 500 1000 1500
In order to automate this manual process, and to OPNET Modeler allows the user to export the col-
avoid human errors, the program simul simul has lected statistics in three different ways:
been developed. The purpose of this tool is to run
a set of simulations outside the OPNET Modeler 1. Executing the ’Export Data to Spreadsheet’ op-
environment in an unattended manner, either se- eration after showing a specific statistic within
quentially or concurrently. The program receives an the Results Browser. By using a graph template
ASCII text file as input, including the different pa- several statistics can be exported at once; how-
rameters for the simulations to run, and these are ever this process takes a long time when dealing
launched by invoking the op runsim program with with a great number of simulations.
the appropriate arguments each time. The usage of 2. Using the op cvov.exe and op cvos.exe util-
this program is the following: ities available within OPNET Modeler since
v14.0. Unfortunately, these are not available for
simul_simul -f simuls.txt previous versions.
[-cluster 20] [-distributed] 3. By means of a self-designed C program which
The input file ’simuls.txt’, which is specified uses the External Model Access (EMA) pack-
through the -f option, is a tab-delimited file, and so age. This is the most convenient option because
it can be edited within the MS-Excel application for the process has been customized in order to be
convenience. Each line corresponds to an indepen- totally unattended, and it is available for any
dent simulation set, and each column to the argu- OPNET Modeler version.
ments to the distinct simulations within the simula- Two different tools were developed for this pur-
tion set. Columns include mainly a list of random pose: (1) ov2txt, which uses the EMA package and
number seeds, and several lists of comma-separated exports several specified statistics from the output
values, which will be the varying arguments between vector file (.ov) to a single ASCII text file, and (2)
simulations. Usually only one of these arguments is simul data, which invokes to ov2txt for each simula-
the varying value, being the value shown at the ab- tion in a simulation set. Although all this functional-
scissas axis in the graphs (e.g. traffic load). ity could have been implemented in a single program,
Optionally, if a Condor cluster system [17] is avail- doing it in this way allows to parallelize the process
able, the simulation set could be run concurrently using a cluster, as it will be explained later.
specifying the option -cluster along with the maxi-
The use of the simul data program is very sim-
mum number of simultaneous simulations, which has
ple, since it receives exactly the same input file than
to be less or equal than the number of the cluster
simul simul (see Section III-B). For example:
processors available. However, since each simulation
needs the appropriate license, this value is limited by
simul_data -f simuls.txt -x @stats.txt
the number of OPNET licenses available too. The
[-cluster 96]
user only needs to specify the -cluster option, and
the program automatically generates the necessary This program interprets the simulations set de-
submit job files to launch all the simulations. That fined in the input file ’simuls.txt’ and then iterates
is, the user does not need any knowledge about the building the appropriate arguments for ov2txt invo-
Condor system. cation for each simulation. As it can be seen from
This should not be confused with the Simulation the example, in addition to the input file it is nec-
Partitioning concept [21], in which a single simula- essary to specify the statistics to be extracted with
tion is distributed onto a number of different ma- the -x option. Although it is possible to give a list of
chines in order to achieve a greater simulation scale numbers, the most convenient way is to specify a file
than on a single machine. In fact, the OPNET Mod- name which contains the names of the selected statis-
eler has a preference that can be enabled or disabled tics, as appear within the OPNET Modeler environ-
to specify whether each simulation should be run se- ment. For example, the file ’stats.txt’ contains the
quentially or in parallel on several processors. By following:
default, this preference is disabled; to enable the par-
allel preference from the simul simul tool, the option time (sec.)
-distributed should be specified in the command Wireless LAN.Throughput (bits/sec)
line. Wireless LAN.Delay (sec)
AODV.Number of Hops per Route
IV. Result processing
Finally, this program can do its task in parallel if
A. Extracting data
the -cluster option is specified. In this case, each
All the statistics resulting from the OPNET Mod- invocation to ov2txt will be a process, and the max-
eler simulations are stored in a single output vector imum number of simultaneous processes will be lim-
file (file type suffix .ov). This is a binary file that ited by the number of processors available and by the
must be converted to a text file in order to be im- value specified in the command-line. Again, it is not
ported and processed by external software like the R necessary for the user to know anything about how
package, gnuplot, or MS-Excel, for example, in order to launch jobs in Condor, as this program generates
to graphically present the data (see Section IV-B). all the necessary job files and submits them.
467 A Coruña, 16-18 de septiembre de 2009
1e+02
1e+01
AC_VO (Voice)
AC_VI (Video)
AC_BE (BestEffort)
AC_BK (Background)
56
82 77.8 68.7 58.3 42 21
46.6
24.2
30.2 editing and recompiling the software.
37.7 18.8
43.1
25.1
31.5 17.7
As the previous programs, simul graphs can be ex-
1e+00
1e+01
19.2 13.3 26.8
16.7
14.7
ecuted in parallel in a Condor system by specifying
Throughput per AC (Mbit/s)
8.3
5
1e+00
2
0.5
1e−01
0.3
AC_VO (Voice)
the Condor system.
0 AC_VI (Video)
1e−03
AC_BE (BestEffort)
1e−02
AC_BK (Background)
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
Number of hops from source to destination Number of hops from source to destination C. Generating reports
Fig. 2. Examples of graphs generated by simul graphs Finally, the last program presented allows to put
all the graphs and the summarized data used for each
graph together in a single document. That way, the
B. Generating graphs
user can analyze the results in both a visual and in
The simul graphs tool focuses on generating a numerical way more easily. The program in charge
graphs from the data extracted previously. All the of doing this task is simul reports, whose usage is the
exported data for any individual simulation within a following:
simulation set are taken into account. The usage of
simul graphs is very similar to the previous ones: simul_reports -f simuls.txt graphs.txt
[-outputprofile {pdf|dvi|dvi-ps|dvi-ps-pdf}]
simul_graphs -f simuls.txt graphs.txt
[-ci 90] [-gnuplot] [-cluster 96] where ’simuls.txt’ is the same simulation file
used in all the previous steps, and ’graphs.txt’
Again, ’simuls.txt’ is the simulation file ex- the same graphs file used for simul graphs.
plained before, and ’graphs.txt’ is the graphs file, The result of this program is a single document per
which is another text file describing each graph to be simulation set, generated using the LATEX document
generated. If the -ci option is specified, confidence preparation system [16]. Firstly, the simul reports
intervals will be computed and shown in the plots builds a source file (with a .tex extension) on the fly.
using the confidence level specified (90, 95, 99, . . . ). Then, depending on the output profile specified with
The format of the graphs file is very similar to the -outputprofile option, the source file is com-
the simulations one because it is an ASCII text tab- piled into one of the following formats: Portable Doc-
delimited file. So, both can be edited as a spread- ument Format (PDF, by default), Device Indepen-
sheet for convenience. The most relevant data in- dent format (DVI), Postscript (PS) or PDF through
cluded in the graphs file are: title and subtitle, the x Postscript. There exist viewers for all of these file
and y axis titles, the column number for the abscissa formats for the most common platforms. The graph-
values within the data files, the column numbers for ical format included in the final document (e.g. PNG
any of the data series to be plotted and the corre- or EPS) depends on the output profile chosen, but
sponding serial names to be included in the legend. all of them must have been generated previously by
Additionally, the limits of the graph, the position of simul graphs. Finally, if the user knows the LATEX
the legend, and the kind of graph to be generated. language, the source file generated can be modified
Currently, only two graph types are supported: lines or included in his/her own documents.
and stacked bars (see Figure 2).
The graphs are generated by means of some pre- V. Conclusions and future works
defined and parameterized R scripts [14], thus the
user does not need to know the R language to ob- Although simulation is the most common tech-
tain the graphs. However, the user can modify the R nique used for testing MANET routing protocols,
scripts in order to custom the output if needed. Each it is necessary to validate the scenarios generated.
graph is generated in two graphic formats, namely, Some recommendations and metrics have been pro-
Encapsulated PostScript (EPS) [22] and Portable posed in the literature in order to characterize simu-
Network Graphics (PNG) [23]. The EPS graph files lation scenarios. However, putting such suggestions
are vectorial format and it is the recommended for- into practice is very difficult without the support of
mat to be included when writing a research paper, adequate software tools. The framework presented in
whereas the PNG graphs are recommended to be in- this paper is very effective and useful when simulat-
cluded in MS-Power Point presentations. ing MANET experiments using the OPNET Modeler
On the other hand, if -gnuplot is specified, gnu- simulator.
plot [15] script files will be generated and executed. The first of the simulation tools is a topology gen-
In this case, the same graphs will be generated again, erator which considers some of the metrics suggested.
but with a distinct appearance. The formats gener- The best scenarios (or the worst ones) of a set of ran-
ated are: EPS, PNG, or Scalable Vector Graphics domly generated scenarios can be chosen, depending
(SVG) [24]. We are planning to include more dis- on one of the metrics evaluated. More metrics could
tinct outputs (e.g., Matlab or xgraph). In this way be easily added if needed. In addition, it also plots
the user can choose the desired graphics package, and the selected scenarios, including both the initial state
modify the automatically generated scripts without and the trajectories followed by each mobile node.
XX Jornadas de Paralelismo 468
The remainder tools aim at simplifying the simu- [9] S. Kurkowski, W. Navidi, and T. Camp, “Discovering
lation process and the subsequent analysis of results. variables that affect manet protocol performance,” in
Global Telecommunications Conference, 2007. GLOBE-
They provide utilities for automating tasks such as COM ’07. IEEE, 26-30 Nov. 2007, pp. 1237–1242.
running simulations, extracting relevant data, gen- [10] J. Hahner, D. Dudkowski, P.J. Marron, and K. Rother-
erating graphs, and building reports including both mel, “Quantifying network partitioning in mobile ad hoc
networks,” in Mobile Data Management, 2007 Interna-
the data and graphs previously generated. All these tional Conference on, 1-1 May 2007, pp. 174–181.
tasks can be done outside the graphical interface of [11] H. Haddadi, M. Rio, G. Iannaccone, A. Moore, and
R. Mortier, “Network topologies: inference, modeling,
OPNET Modeler, in batch mode on the most com- and generation,” Communications Surveys & Tutorials,
mon platforms. IEEE, vol. 10, no. 2, pp. 48–69, Quarter 2008.
About the usability of these tools, although all of [12] “The Network Simulator – ns-2,”
http://www.isi.edu/nsnam/ns/.
them are used from command-line and there is no [13] Opnet Technologies Inc., “OPNET Modeler,”
graphical interface, they are very easy to use, as their http://www.opnet.com/.
syntax is very similar. Moreover, the tools support [14] R Development Core Team, R: A Language and En-
vironment for Statistical Computing, R Foundation for
the use of clusters of workstations for parallel pro- Statistical Computing, Vienna, Austria, 2006, ISBN 3-
cessing, improving dramatically their running times. 900051-07-0.
[15] Jeff Racine, “gnuplot 4.0: a portable interactive plotting
Finally, the user does not need to know anything utility,” Journal of Applied Econometrics, vol. 21, no. 1,
about the R package, gnuplot, LATEX, nor the Condor pp. 133–141, 2006.
system. Thus, this framework has a weak learning [16] Leslie Lamport, LaTeX User’s Guide and Document Ref-
erence Manual, Addison-Wesley Publishing Company,
curve. Reading, Massachusetts, 1986.
As future work, it could be interesting to be able [17] Condor, “Condor project,”
to export the topology and trajectory files generated http://www.cs.wisc.edu/condor/.
[18] T. Camp, J. Boleng, and V. Davies, “A survey of mobility
(.trj files) by simul topogen to other simulators like models for ad hoc network research,” Wireless Commu-
ns-2. This would allow to compare the simulation nications & Mobile Computing (WCMC): Special issue
results against other simulators, further validating on Mobile Ad Hoc Networking: Research, Trends and
Applications, vol. 2, no. 5, pp. 483–502, 2002.
the obtained results. [19] J. Yoon, M. Liu, and B. Noble, “Random waypoint con-
The set of tools can be downloaded from the Gat- sidered harmful,” in IEEE INFOCOM Conference, 2003.
[20] S. Kurkowski, T. Camp, N. Mushell, and M. Colagrosso,
com web site (http://atc.umh.es/gatcom/), although “A visualization and analysis tool for ns-2 wireless sim-
they are still under active development. ulations: inspect,” in Modeling, Analysis, and Sim-
ulation of Computer and Telecommunication Systems,
Acknowledgments 2005. 13th IEEE International Symposium on, 27-29
Sept. 2005, pp. 503–506.
This work was partially supported by the Minis- [21] Donghua Xu and Mostafa Ammar, “Benchmap:
Benchmark-based, hardware and model-aware partition-
terio de Educación y Ciencia, Spain, under Grant ing for parallel and distributed network simulation,” in
DPI2007-66796-C03-03. The authors also would like MASCOTS ’04: Proceedings of the The IEEE Com-
to acknowledge OPNET Technologies, Inc. for pro- puter Society’s 12th Annual International Symposium on
Modeling, Analysis, and Simulation of Computer and
viding an educational OPNET Modeler license. Telecommunications Systems, Washington, DC, USA,
2004, pp. 455–463, IEEE Computer Society.
Referencias [22] Peter Vollenweider, Encapsulated PostScript: applica-
tion guide for the Macintosh and PCs, Prentice Hall
[1] L. Felipe Perrone, Yougu Yuan, and David M. Nicol, International (UK) Ltd., Hertfordshire, UK, UK, 1990.
“Modeling and simulation best practices for wireless ad [23] T. Boutell, “Png (portable network graphics) specifica-
hoc networks,” in Proceedings of the 35th Winter Simu- tion version 1.0,” Tech. Rep., United States, 1997.
lation Conference (WSC), 2003, pp. 685–693. [24] Andrew Watt, SVG Unleashed, Pearson Education, 2002.
[2] Stuart Kurkowski, Tracy Camp, and Michael Colagrosso, [25] K.I. Calvert, M.B. Doar, and E.W. Zegura, “Modeling
“Manet simulation studies: the incredibles,” SIGMO- internet topology,” Communications Magazine, IEEE,
BILE Mob. Comput. Commun. Rev., vol. 9, no. 4, pp. vol. 35, no. 6, pp. 160–163, Jun 1997.
50–61, 2005.
[3] David Cavin, Yoav Sasson, and Andre Schiper, “On the
accuracy of MANET simulators,” in 2nd ACM int. work-
shop on Principles of Mobile Computing (POMC), 2002,
pp. 38–43.
[4] K. Pawlikowski, H. D. J. Jeong, and J. S. R. Lee, “On
credibility of simulation studies of telecommunication
networks,” IEEE Communications Magazine, vol. 40,
no. 1, pp. 132–139, 2002.
[5] Todd Andel and Alec Yasinsac, “On the credibility of
manet simulations,” Computer, vol. 39, no. 7, pp. 48–54,
July 2006.
[6] G. Amoussou, B.L. Agba, Z. Dziong, M. Kadoch, and
F. Gagnon, “Performances analysis of mobile ad hoc
routing protocols under realistic mobility and power
models,” in OPNETWORK 2006, Washington D.C,
USA, 2006.
[7] M.B. Doar, “A better model for generating test net-
works,” Global Telecommunications Conference, 1996.
GLOBECOM ’96. ’Communications: The Key to Global
Prosperity, pp. 86–93, Nov 1996.
[8] Stuart Kurkowski, Tracy Camp, and William Navidi,
“Two standards for rigorous manet routing protocol eval-
uation,” in Mobile Adhoc and Sensor Systems (MASS),
2006 IEEE International Conference on, Oct. 2006, pp.
256–266.