2. VALUETOOLS 2007: Nantes, France
Peter W. Glynn (Ed.): Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2007, Nantes, France, October 22-27, 2007. ACM 2007 ACM International Conference Proceeding Series ISBN 978-963-9799-00-4
Information theory and power control
Samson Lasaulce, Alberto Suárez, Mérouane Debbah, Laura Cottatellucci: Power allocation game for fading MIMO multiple access channels with antenna correlation. 1
Masato Uchida: Information theoretic aspects of fairness criteria in network resource allocation problems. 3
Michael Bloem, Tansu Alpcan, Tamer Basar: A stackelberg game for power control and channel allocation in cognitive radio networks. 4
Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev: Closed form solutions for water-filling problems in optimization and game frameworks. 5
Evolutionary games
Hamidou Tembine, Eitan Altman, Rachid El Azouzi, Yezekael Hayel: Multiple access game in ad-hoc network. 6
Panayotis Mertikopoulos, Aris L. Moustakas: The simplex game: can selfish users learn to operate efficiently in wireless networks? 7
Pricing


Quanyan Zhu, Lacra Pavel: End-to-end link power control in optical networks using Nash bargaining solution. 10
Fernando Beltrán, Matthias Roggendorf: Multiple equilibria in symmetric strategies for simultaneous auctions in next-generation bandwidth markets. 11
Simulation accuracy
Kayo Fujiwara, Henri Casanova: Speed and accuracy of network simulation in the SimGrid framework. 12
Jorge Hortelano, Marga Nácher, Juan-Carlos Cano, Carlos Miguel Tavares Calafate, Pietro Manzoni: Evaluating the goodness of MANETs performance results obtained with the ns-2 simulator. 13
Patrick Peschlow, Peter Martini: A discrete-event simulation tool for the analysis of simultaneous events. 14
Simulation models
Miklos Kozlovszky, Tibor Berceli, Viktor Kozlovszky: NSOSS: the non-synchronized optical switch simulator. 15
Nicola Baldo, Federico Maguolo, Marco Miozzo, Michele Rossi, Michele Zorzi: ns2-MIRACLE: a modular framework for multi-technology and cross-layer support in network simulator 2. 16
Lorenzo Bracciale, Francesca Lo Piccolo, Stefano Salsano, Dario Luzzi: Simulation of peer-to-peer streaming over large-scale networks using OPSS. 17
Simulation tools
Nicolas Letor, Peter De Cleyn, Chris Blondia: Enabling cross layer design: adding the MadWifi extensions to Nsclick. 19
Andrea Bacioccola, Claudio Cicconetti, Giovanni Stea: User-level performance evaluation of VoIP using ns-2. 20
Isabel Dietrich, Falko Dressler, Volker Schmitt, Reinhard German: SYNTONY: network protocol simulation based on standard-conform UML 2 models. 21
Optimization and games I
Vladimir Marbukh, Stephan Klink: Decentralized control of large-scale networks as a game with local interactions: cross-layer TCP/IP optimization. 22
Eitan Altman, Richard Marquez, Rachid El Azouzi, David Ros, Bruno Tuffin: Stackelberg approach for pricing differentiated services. 23
Xu Ning, Christos G. Cassandras: Optimal cluster-head deployment in wireless sensor networks with redundant link requirements. 24
Rachid El Azouzi, Tania Jiménez, Essaid Sabir, S. Benarfa, El-Houssine Bouyakhf: Cooperative and non-cooperative control for slotted aloha with random power level selections algorithms. 25
Traffic models and measurements


Hiroyuki Okamura, Yuya Kamahara, Tadashi Dohi: Estimating Markov-modulated compound Poisson processes. 28
Karim Mohammed Rezaul, Vic Grout: An overview of long-range dependent network traffic engineering and analysis: characteristics, simulation, modelling and control. 29
Petri and automata networks
Jan Trowitzsch, D. Jerzynek, Armin Zimmermann: A toolkit for performability evaluation based on stochastic UML state machines. 30
Gabriel Alves, Paulo Romero Martins Maciel, Ricardo Massa Ferreira Lima: Modeling and evaluation of supply chains with GSPN components. 31
Jean-Michel Fourneau, Brigitte Plateau, William J. Stewart: Product form for stochastic automata networks. 32
Simonetta Balsamo, Andrea Marin: Representing LCFSPR BCMP service center with Coxian service time by GSPN. 33
Optimization and games II
Vladimir Marbukh: Utility maximization for resolving throughput/reliability trade-offs in an unreliable network with multipath routing. 35

Statistical physics models for communication systems
Ralf R. Müller, Dongning Guo, Aris L. Moustakas: Vector precoding in wireless communications: a replica symmetric analysis. 38
Samson Lasaulce, Alberto Suárez, Raul L. de Lacerda Neto, Mérouane Debbah: Cross-system resource allocation based on random matrix theory. 39
Simulation I
Ben Lauwens, Jan Potemans, Bart Scheers, Antoine Van de Capelle: Hybrid simulation of a FIFO queuing system with trace-driven background traffic. 40
Mirko Eickhoff, Donald C. McNickle, Krzysztof Pawlikowski: Using parallel replications for sequential estimation of multiple steady state quantiles. 41
Mirko Eickhoff, Donald C. McNickle, Krzysztof Pawlikowski: Detecting the duration of initial transient in steady state simulation of arbitrary performance measures. 42
Queueing systems I
Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin: Aggregated bounding Markov processes applied to the analysis of tandem queues. 43
Enrique Hernández-Orallo, Joan Vila i Carbó: A histogram-based stochastic process for finite buffer occupancy analysis. 44
Susanna W. M. Au-Yeung, Peter G. Harrison, William J. Knottenbelt: Approximate queueing network analysis of patient treatment times. 45
Ana Busic, Tadeusz Czachórski, Jean-Michel Fourneau, Krzysztof Grochla: Level crossing ordering of Markov chains: computing end to end delays in an all optical network. 46
David Raz, Hanoch Levy, Benjamin Avi-Itzhak: The twin measure for queueing system predictability. 47
Grid computing, performance tuning and repairable systems
Samuel Kounev, Ramon Nou, Jordi Torres: Autonomic QoS-Aware resource management in grid computing using online performance models. 48
Simone Sbaraglia, Hui-Fang Wen, Seetharami Seelam, I-Hsin Chung, Guojing Cong, Kattamuri Ekanadham, David J. Klepacki: A productivity centered application performance tuning framework. 49
Reinaldo Vallejos Campos: Fast evaluation of the moments of the interval availability of large Markov models. 50
Francesco Moscato, Francesco Flammini, Giusy Di Lorenzo, Valeria Vittorini, Stefano Marrone, Mauro Iacono: The software architecture of the OsMoSys multisolution framework. 51
Queueing systems II
Oualid Jouini, Yves Dallery: Stationary delays for a two-class priority queue with impatient customers. 52
Aïcha Bareche, Djamil Aïssani: Kernel density in the use of the strong stability method to evaluate the proximity of G/M/1 and M/M/1 systems. 53
Ashok Argent-Katwala, Jeremy T. Bradley: Continuous PEPA queues: individual behaviour in continuous queueing networks. 54
Abhijit Datta Banik, Umesh Chandra Gupta, Mohan L. Chaudhry: Finite-buffer bulk service queue under Markovian service process. 55
Performance and design of wireless networks

Beatriz Soret, M. Carmen Aguayo-Torres, José T. Entrambasaguas: Maximum delay-constrained source rate over a wireless channel. 57
Eitan Altman, Tijani Chahed, Salah-Eddine Elayoubi: Joint uplink and downlink capacity considerations in admission control in multiservice CDMA/HSDPA systems. 58
Network calculus
Henrik Schiøler, Hans-Peter Schwefel, Martin B. Hansen: CyNC: a MATLAB/SimuLink toolbox for network calculus. 60
Luciano Lenzini, Enzo Mingozzi, Giovanni Stea: End-to-end delay bounds in FIFO-multiplexing tandems. 61
Anne Bouillard, Bruno Gaujal, Sebastien Lagrange, Eric Thierry: Optimal routing for end-to-end guarantees: the price of multiplexing. 62
Simulation II
Bruno Tuffin, Pawan K. Choudhary, Christophe Hirel, Kishor S. Trivedi: Simulation versus analytic-numeric methods: illustrative examples. 63
Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin, Jérôme Vienne, Jean-Marc Vincent: Perfect simulation and monotone stochastic bounds. 65
Volker Remuss, Armin Zimmermann: Tool-based performance evaluation of the blackboard communication system. 66
Inter-perf 2007 workshop
Alexandre Proutiere: Random multi-access protocols in networks with partial interaction and non-saturated nodes: a mean field approach. 67
Ralph El Khoury, Rachid El Azouzi: Dynamic retransmission limit scheme for routing in multi-hop ad hoc networks. 68
Ilan Lobel, Daron Acemoglu, Munther A. Dahleh, Asuman E. Ozdaglar: Preliminary results on social learning with partial observations. 69
Thomas Fuhrmann: Experiences from the SSR development. 70
Issam Mabrouki, Xavier Lagrange, Gwillerm Froc: Random walk based routing protocol for wireless sensor networks. 71
Invited talk
Jane Hillston: Quantitative analysis of biochemical signalling pathways. 72
Markov decision processes 1
Eitan Altman, Saswati Sarkar, Eilon Solan: Constrained Markov games with transition probabilities controlled by a single player. 73
José Niño-Mora: Characterization and computation of restless bandit marginal productivity indices. 74
Markov decision processes 2
Joke Lambert, Benny Van Houdt, Chris Blondia: A policy iteration algorithm for Markov decision processes skip-free in one direction. 75
José Niño-Mora: Computing an index policy for bandits with switching penalties. 76
Tools
Markus Arns: A tool for the analysis of hierarchical service-oriented extended open fork/join queueing networks. 77
Kai Lampka, S. Harwarth, Markus Siegle: Can matrix-layout-independent numerical solvers be efficient?: implementing the Moebius state-level abstract functional interface for ZDDs. 78
Phase type distributions
Applications
Gerhard Haßlinger, Sebastian Kempken: Efficiency of random walks for search in different network structures. 80
Juha Leino: Approximating optimal load balancing policy in discriminatory processor sharing systems. 81
Konstantin Avrachenkov, Danil Nemirovsky, Kim Son Pham: A survey on distributed approaches to graph based reputation measures. 82
Stochastic automata networks
Ricardo M. Czekster, Paulo Fernandes, Jean-Marc Vincent, Thais Webber: Split: a flexible and efficient algorithm to vector-descriptor product. 83
Jean-Michel Fourneau: Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN. 84



