Maestrois an Inriaproject-team whose members are located in Sophia Antipolis (S. Alouf, K. Avrachenkov, P. Nain, G. Neglia), at Liain Avignon (E. Altman) and at Lirmmin Montpellier (A. Jean-Marie). Maestrois concerned with the modeling, performance evaluation, optimization and control of stochastic Discrete-Event Dynamical Systems ( Deds), with a particular emphasis on networks and their applications. The scientific contributions are both theoretical, with the development of new modeling formalisms, and applied, with the development of software tools for the performance evaluation of Deds.

Patent with Alcatel-Lucent Bell Labson “Stacking cells for seamless mobility management of high speed users in small cells networks” .

One new grant from Orange Labs on “Quality of Service and Quality of Experience” (July 2010 – June 2011) (see Section ).

A research contract with the Flowxy startup on the joint optimization of compression and transmission activities of a data backup system (September 2010 – September 2011) (see Section ).

The Institute of Electrical and Electronics Engineers (IEEE) awarded Eitan Altman the title of IEEE Fellow (Class of 2010) for contributions to analysis, optimization, and control of telecommunication networks.

The main mathematical tools and formalisms used in Maestroinclude:

theory of stochastic processes: Markov process, point process, Palm measure, large deviations, branching process, mean-field approximation;

theory of dynamical discrete-event systems: queues, fluid approximation;

theory of control and scheduling: dynamic programming, Markov decision process, game theory, deterministic and stochastic scheduling, pathwise comparison;

theory of singular perturbations;

random matrix theory.

Maestro's main application area is networking and in particular, modeling, performance evaluation, optimization and control of protocols and network architectures. It includes:

Internet infrastructure: TCP, high speed congestion control, voice over IP, service differentiation, quality of service;

Internet applications: multicast, content distribution systems, peer-to-peer systems, overlay networks, multimedia traffic;

Wireless (cellular, ad hoc, sensor) networks: Wlan, WiMAX, Umts, Lte, Hspa, delay tolerant networks (DTN), power control, medium access control, transmission rate control, redundancy in source coding, mobility models, coverage, routing, green base stations.

In our previous research we have identified large inefficiencies that occur when one allows one type of provider (e.g. access provider) to impose costs on another type of provider (e.g. content provider). This part in which E. Altman collaborated with P. Bernhard ( Inriaproject-team Biocore), S. Caron and G. Kesidis (both from Pennsylvania State Univ., USA), J. Rojas-Mora (Univ. of Barcelona, Spain), and S. Wong (Univ. of A Coruña, Spain) has now appeared in .

This investigation has been pursued in various directions. In , E. Altman, A. Legout ( Inriaproject-team Planete) and Y. Xu (Univ. Avignon/LIA) have studied a hierarchical structure of ISPs, the economic impact of some cashing placement policies, and more complex demand functions (the demands of users for content). In , E. Altman and the law specialist S. Wong (Univ. of A Coruña, Spain) analyze in cooperation with the economist J. Rojas-Mora (Univ. of Barcelona, Spain) the impact of legislation related to network neutrality on the quality of service for the end users.

The remarkable growth of the Internet infrastructure and the increasing heterogeneity of applications and users' behavior make more complex the manageability and monitoring of ISP networks and raises the cost of any new deployment. The main consequence of this trend is an inherent disagreement between existing monitoring solutions and the increasing needs of management applications. In this context, in K. Avrachenkov, I. Lassoued, A. Krifa and C. Barakat (all three from Inriaproject-team Planete) present the design of an adaptive centralized architecture that provides visibility over the entire network through a network-wide cognitive monitoring system. Practically, given a measurement task and a constraint on the volume of collected information, the proposed architecture drives the sampling rates on the interface of network routers to achieve the maximum possible accuracy, while adapting itself to any change in network traffic conditions. The authors tune the system parameters with the help of FAST sensitivity test.

Size-based scheduling is a promising solution to improve the response time of small flows (mice) that have to share bandwidth with large flows (elephants). To do this, one important task is to track the size of the ongoing flows at the router. However, most of the proposed size-based schedulers either employ the trivial way of tracking the size information of all flows, or require changes at end-hosts. Hence, either they are not scalable or they increase complexity. In , E. Altman, D. Mon Divakaran (IIT Mandi, India) and P. Vicat-Blanc Primet (Lyatiss, France) have proposed a new way of performing size-based scheduling in a practical and scalable fashion, by identifying and `de-prioritizing' elephants only at times of high load. They exploit TCP's behavior by using a mechanism that detects a window of packets - called spikes - when the buffer length exceeds a certain threshold. This spike-detection is used to identify elephant flows and thereafter de-prioritize them. Two-level processor-sharing (TLPS) scheduling is employed to schedule flows in two queues, one with the high-priority flows, and the other with the de-prioritized flows. They show that the proposed mechanism not only improves the response time of mice flows in a scalable way, but also gives better response times to other flows by treating them preferentially as long as they do not overload the high-priority queue.

Optimal control of stochastic bandwidth-sharing networks is typically difficult. In order to facilitate the analysis, deterministic analogues of stochastic bandwidth-sharing networks, the so-called fluid models, are often chosen for analysis, as their optimal control can be found more easily. The tracking policy translates the fluid optimal control policy back into a control policy for the stochastic model, so that the fluid optimality can be achieved asymptotically when the stochastic model is scaled properly. In K. Avrachenkov, A. Piunovsky and Y. Zhang (both from the University of Liverpool, UK) study the efficiency of the tracking policy, that is, how fast the fluid optimality can be achieved in the stochastic model with respect to the scaling parameter. In particular, the result of shows that, under certain conditions, the tracking policy can be as efficient as feedback policies.

Green networking is a new trend in network design that is more aware of the impact of technology on the environment and on humans. Reducing energy has been so far the main concern in that approach, and much of the research has been devoted to understanding the tradeoffs between reducing energy and other performance measures such as coverage and delay.

For several years we have been contributing to this research effort, many of which have been summarized in the survey by E. Altman in collaboration with G. S. Paschos (Center for Research and Technology, Hellas, Greece), P. Mannersalo (VTT, Finland), S. Stanczak (HH-Fraunchofer, Berlin, Germany) and L. Tassiulas (Univ. of Thessaly, Greece). In particular, much of the work involving members of Maestrothat had appeared in previous years in conferences concerning energy saving in WiMax has now appeared in a journal publication by A. P. Azad, S. Alouf, E. Altman, in cooperation with V. Borkar (TATA Inst. of Fundamental Research, Mumbai, India) and G. S. Paschos (Center for Research and Technology, Hellas, Greece).

In 2011 we started investigating policies for switching off base stations using two new tools: multimodularity and stochastic geometry. The latter has been used by E. Altman and M. K. Hanawal (also with Univ. Avignon/LIA), in cooperation with R. El-Azouzi (Univ. Avignon/LIA) and S. Shamai (Technion, Israel) in to study the tradeoffs related to the uplink, and by E. Altman in cooperation with C. Hasan and J. M. Gorce (both from INSA-Lyon and Inriaproject-team Swing) in for the downlink. Optimal policies were obtained within the class of policies that switch off base stations with some fixed probability but independently of each other. To relax this restriction of independence and thus obtain even better policies, S. Ramanath and E. Altman, in collaboration with V. Kavitha (Univ. Avignon/LIA), have used in the theory of multimodularity, which is the discrete counterpart of convexity. Among the most striking points in this research has been the observation in that the conventional energy saving approach can have the opposite effect on the humans in the uplink: when the base station closest to a mobile phone is switched off (for energy saving) then the mobile phone has to transmit with a larger power so as to reach a more remote base station. It turns out that the main source of radiation to the human brain is indeed the uplink transmission, which implies that switching off base stations could cause more exposure to radiation. This is of particular concern in view of the announcement by the World Health Organization (May 31, 2011) that cell phones cause cancer.

In , S. Alouf and V. Mancuso (Institute IMDEA Networks, Madrid, Spain) analyze the power save and its impact on web traffic performance when customers adopt the continuous connectivity paradigm. Considering realistic http traffic, they evaluate the user access delay, the download time and the expected economy of energy in the cell. The model, validated through packet-level simulations, shows that dramatic energy save can be achieved by both mobile users and base stations. In case of Poisson arrivals, the aggregate behavior of a base station's users is studied by means of a processor-shared queueing system . The model can be used to maximize the base station energy savings under a given set of QoS performance constraints. With the participation of N. Choungmo Fofack, the work in has been complemented with a sensitivity analysis . The impact of model parameters on the performance and cost metrics is thoroughly assessed.

Power allocation to satisfy user demands in the presence of large number of interferers in a multicellular network is a challenging task. Further, power to be allocated depends upon the system architecture, for example, upon components like coding, modulation, transmit precoder, rate allocation algorithms, available knowledge of the interfering channels, etc. This calls for an algorithm via which each base station in the network can simultaneously allocate power to their respective users so as to meet their demands (when they are within the achievable limits), using whatever information regarding the other users is available. In , S. Ramanath, V. Kavitha (Univ. Avignon/LIA) and M. Debbah ( Supelec) devise such an algorithm which is in fact universal: the proposed algorithm works from a fully cooperative setting to almost no cooperation and or for any configuration of modulation, rate allocation, etc. schemes. The algorithm asymptotically satisfies the user demands, running simultaneously and independently within a given total power budget at each base station. Further, it requires minimal information to achieve this: every base station needs to know its own users demands, its total power constraint and the transmission rates allocated to its users in every time slot. The authors formulate the power allocation problem in a system specific game theoretic setting, define system specific capacity region and analyze the proposed algorithm using ordinary differential equation (ODE) framework. Simulations confirm the effectiveness of the proposed algorithm.

Fair resource allocation is usually studied in a static context, in which a fixed amount of resources is to be shared. In dynamic resource allocation one usually tries to assign resources instantaneously so that the average share of each user is split fairly. The exact definition of the average share may depend on the application, as different applications may require averaging over different time periods or time scales. Our main contribution is to introduce new refined definitions of fairness that take into account the time over which one averages the performance measures. In E. Altman, K. Avrachenkov and S. Ramanath examine how the constraints on the averaging durations impact the amount of resources that each user gets. The authors apply this new concept in to spectrum allocation and indoor-outdoor femtocells.

Time-slots and frequencies are contended in cellular networks and their allocation is determined by base stations. For scalability purposes the resource allocation is decentralized, so that base stations do not share their information with each other. Actions are often taken based on partial information on the system. In particular, the statistics of the channels are often not available. Scheduling decisions of a base station concerning mobiles in its cell cause interference in other cells and there is thus a need to dynamically adjust to interference and to converge to a satisfactory operation point. This has motivated a large amount of work on self-organization in cellular networks based on OFDMA. E. Altman, Z. Altman, R. Combes (both from Orange Labs, Issy les Moulineaux) and M. Haddad have written a series of papers on self-organization. In and self-organization in interference coordination is studied. In , R. Combes, Z. Altman and E. Altman, further propose and analyze a self-optimization method for coverage-capacity optimization in OFDMA networks with MIMO. Moreover, they study in self-organization when adding relays so as to increase coverage. Static and dynamic resource sharing mechanisms are investigated. In the static case they use a queuing model to calculate the optimal resource sharing strategy and the maximal capacity of the network analytically. The influence of relay planning and number of deployed relays is investigated, and gains resulting from good planning are evaluated analytically. Self-optimizing dynamic resource allocation is tackled using a Markov Decision Process (MDP) model.

Self-organization has also been used in the past to obtain opportunistic scheduling in a way that achieves proportional fair resource sharing. In
, R. Combes, Z. Altman (both from Orange Labs, Issy les
Moulineaux) and E. Altman, have extended this to the general

In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed, static graph, doing so becomes much more challenging in dynamic graphs, in which the state of an edge in one timeslot (i.e., its presence or absence) is random, and may depend on its state in the previous time step. The traversal time is due to both time spent waiting for edges to appear and time spent crossing them once they become available. In , P. Nain in collaboration with A. Bar-Noy (City University of New York), P. Basu (Raytheon BBN Technologies), M. P. Johnson (Pennsylvania State University), F. Yu (City University of New York) and D. Towsley (University of Massachusetts at Amherst) computes the expected traversal time (ETT) for a routing path in a number of special cases of stochastic edge dynamics models, and for three edge failure models, culminating in a surprisingly challenging yet realistic setting in which the initial configuration of edge states for the entire path is known. We show that the ETT for this “initial configuration” setting can be computed in quadratic time, by an algorithm based on probability generating functions. The authors also give several linear-time upper and lower bounds on the ETT.

In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In this case each sensor maintains a local estimate of the global average, and keeps improving it by performing a weighted sum of the estimates of all its neighbors. The number of iterations needed to reach an accurate estimate depends on the weights used at each sensor. K. Avrachenkov, G. Neglia and M. El Chamie have proposed a new average consensus algorithm, where each sensor selects its own weights on the basis of some local information about its neighborhood . In realistic sensor network topologies, the algorithm shows faster convergence than other existing consensus protocols.

When controlling the propagation of a message in DTNs, the objective is often to maximize the successful delivery probability of a message within a given deadline. It takes often the form of the expectation of the exponent of some integral cost. So far, models involving such costs have been solved by interchanging the order of expectation and the exponential function. While reducing the problem to a standard optimal control problem, this interchange is only tight in the mean-field limit obtained as the population tends to infinity. In E. Altman, V. Kavitha (Univ. Avignon/LIA), F. De Pellegrini (Create-Net, Trento, Italy), V. Kamble (UC Berkeley, CA, USA) and V. Borkar (TATA Inst., Mumbai, India), identify a general framework from optimal control in finance, known as risk sensitive control, which allows handling the original (multiplicative) cost and obtaining solutions to several novel control problems in DTNs. New optimal control problems which consider the effect of wireless propagation path loss factor and the power constraints at the source and or the destination are proposed for DTNs within this framework. Optimal policies of non-threshold type are found.

In case the DTN does not deliver a packet within some time

G. Neglia, in collaboration with X. Zhang (Fordham University, New York) and J. Kurose (University of Massachusetts at Amherst), has published a survey on the application of network coding to DTNs .

Polling systems are used to model the Ferry assisted Wireless LANs and thereby to obtain the stationary workload performance. Not much theory is available for calculating the stationary workload of polling systems with arrivals in a continuum. In , V. Kavitha (Univ. Avignon/LIA) and E. Altman propose a discretization approach, by which the so-called “pseudo conservation law” of the discrete polling systems is utilized to derive the stationary performance of continuous polling systems. The continuous polling results are used in deriving optimal ferry routes.

G. Neglia and R. Masiero (University of Padua, Italy) have explored a recently proposed optimization framework that relies on local sub-gradient methods and consensus algorithms. The research is described in Maestro2010 activity report and has appeared in .

G. Neglia, U. Acer (Bell labs Antwerp), P. Giaccone and S. Tarapiah (both from Politecnico di Torino, Italy) and D. Hay (Hebrew University of Jerusalem), have investigated routing in DTNs where the underlying node mobility is known in advance but can be modified by random effects. The research is described in Maestro2010 activity report and has appeared in and .

E. Altman and M. Haddad, in collaboration with S.-E. Elayoubi (Orange Labs, Issy les Moulineaux), R. El-Azouzi, T. Jimenez and Y. Xu (all three from Univ. Avignon/LIA) have been investigating streaming protocols similar to the one used by YouTube. After preparing a survey on the state-of-the-art in , they used Ballot theorems in in order to compute the starvation probabilities (these are the probability that the queue empties before completing to send a streaming application).

This work is carried out in the framework of the Grant with Orange Labs (see Section ) on “Quality of Service and Quality of Experience”.

In the course of the Vooddoproject, the question of assessing the theoretical limits of prefetching information in real-time arose. Given a network bandwidth and a graph of documents, is it possible to download documents in advance, so that the document surfer is never blocked because of missing information? The problem is modeled using a “cops-and-robbers” game and some of its algorithmic properties are derived. This work of A. Jean-Marie and D. Mazauric is joint with F. Fomin (Univ. Bergen) and F. Giroire and N. Nisse (both from Inriaproject-team Mascotte) .

P2P downloads still represent a large portion of today's Internet traffic. More than 100 million users operate BitTorrent and generate more than 30

The success of BitTorrent has fostered the development of variants to its basic components. Some of the variants adopt greedy approaches aiming at exploiting the intrinsic altruism of the original version of BitTorrent in order to maximize the benefit of participating to a torrent. G. Neglia, D. Carra (University of Verona, Italy), P. Michiardi and F. Albanese (both from Institut Eurecom) have studied BitTyrant, a recently proposed strategic client. The research is described in Maestro2008 activity report. Results have been extended and supported by PlanetLab experiments in .

This work is carried out in the framework of the Grant with Orange Labs on “Content-centric networks” (Section ).

There has been a debate between those proposing protocols based on a centralized controller and those favoring decentralized protocols based on non-cooperative game theory. In E. Altman and M. Haddad, together with S.-E. Elayoubi and Z. Altman (both from Orange Labs, Issy les Moulineaux), consider a situation where a base station lets mobiles take power control decisions in some system states and imposes actions in other states. The authors study how best to choose what information to make available and how mobiles should react.

Jamming is a form of a denial of service attack in which an adversary can degrade the quality of the reception by creating interference. One can study jamming both in the purpose of protecting a wireless network against such attack or, on the contrary, in order to efficiently disrupt the communications of some adversary. In both cases jamming is part of a conflict for which game theory is an appropriate tool. In E. Altman, K. Avrachenkov and A. Garnaev (St. Petersburg State University), investigate the effect of partially available information in which the user does not even know whether or not the jammer is indeed present. The problem is formulated as a zero-sum game. The authors find the equilibrium strategies in closed-form and specify the range of sub-carriers where the user can expect the jamming attack.

In WiFi networks, mobile nodes compete for accessing the shared channel by means of a random access protocol called Distributed Coordination Function (DCF), which is long term fair. Selfish nodes could benefit from violating the protocol and increasing their transmission probability. G. Neglia, I. Tinnirello and L. Giarré (University of Palermo, Italy) have been studying the interaction of selfish nodes in the last two years (the research activity is described in Maestro2009 and Maestro2010 activity reports). , further extend the results to a heterogeneous scenario, where nodes have different requirements in terms of uplink/downlink ratios.

The continued growth of computer networks such as the Internet has raised the interest in understanding how networks get formed. The design of such networks is generally carried out by a large number of self-interested actors (users, Internet Service Providers ...), all of whom seek to optimize the quality and cost of their own operation. Previous works have addressed the “Network Formation” problem considering almost exclusively networks designed by selfish users, which can be consistently suboptimal. In K. Avrachenkov and G. Neglia, together with J. Elias (University Paris Descartes), F. Martignon (University Paris-Sud 11), and L. Petrosyan (St. Petersburg State University, Russia), address the network formation issue using cooperative game theory, which permits to study ways to enforce and sustain cooperation among agents. Both the Nash bargaining solution and the Shapley value are investigated. After the comparison of these two approaches, the authors conclude that the Nash bargaining solution is more suitable to enforce cooperation in the network formation game in terms of cost allocation to users and computation time to get the solution.

In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet itself. K. Avrachenkov and G. Neglia, in collaboration with J. Elias (University Paris Descartes) and F. Martignon (University Paris-Sud 11), have proposed two novel socially-aware network design games. The research has been described in Maestro2010 activity reports. extends the results for the case when users' utility functions incorporate a socially-aware component.

Using tools from coalition game theory, E. Altman, in cooperation with C. Singh (IISc Bangalore, India), considers in a wireless framework in which several mobile terminals can receive and decode the same signal of the base station, and where the cost for broadcasting is taken to be the transmission power. They begin by proposing various schemes to share the cost and study their properties. Then, they study the association with partial information: an arriving user knowing its location has to decide without knowledge of the location of the other users and their number whether to join the multicast tree and pay according to a given cost sharing scheme, or to have a unicast connection at a given cost. The unicast alternative that each mobile has, results in a limitation on the coverage (area covered by the multicast session) and on the capacity (number of mobiles connected to the multicast session). The authors derive the expected capacity and coverage as a function of the cost sharing policy. This work is extended in to the case of several base stations by E. Altman in collaboration with C. Hasan and J. M. Gorce (both from INSA Lyon and Inriaproject-team Swing).

Collusion is the situation where several players decide to cooperate and to choose their actions as if they were a single player - each player maximizes the sum of utilities of that group instead of only its own utility. In , E. Altman in collaboration with Y. Hayel (Univ. Avignon/LIA) and H. Kameda (Univ. Tsukuba, Japan), has proposed various concepts that evaluate the impact of collusions. The authors have further studied collusions in routing games and identified situations where collusions are bad for all players: both those that collide loose in performance as well as those who remain independent.

In collaboration with E. Della Vecchia and S. Di Marco (both from National Univ. Rosario, Argentina), A. Jean-Marie has investigated the performance (convergence and error bounds) of the Rolling Horizon heuristic for optimal stochastic control and stochastic games in different modeling situations.

In the case of the long-term average expected gain, they have shown that convergence occurs whenever the value iteration algorithm converges. They have then considered zero-sum semi-Markov games with discounted payoff , , for which they have proved geometric convergence under the usual assumptions of the literature.

Impulse control is a modeling framework of optimal control theory, in which the control actions can provoke instantaneous changes in the value of the state. For modelers, it has the features of both continuous-time and discrete-time models, and it can help understand which one to choose in a given optimization situation. A. Jean-Marie has studied the question in conjunction with K. Erdlenbruch ( Cemagref), M. Tidball ( Inra) and M. Moreaux (Univ. Toulouse 1). In a quite generic single-dimensional model, they show that the optimality of impulse policies with respect to “smooth” control policies is strongly related to a submodularity property of the instantaneous cost function .

Several fundamental results have been obtained in routing games that model finite number of sources of traffic (players) who decide how to split the traffic among various paths. When the number of players is large, the Wardrop equilibrium concept is often used, where the problem is modeled as one with a continuum of decision makers where each has a negligible impact (non atomic game) on other's performance. E. Altman and his co-workers have studied the question of whether Wardrop equilibrium is a good approximation for a problem with finitely many players for which the Nash equilibrium is the solution concept. In , E. Altman, in collaboration with Z. Altman, R. Combes (both from Orange Labs, Issy les Moulineaux) and S. Sorin (Univ. Pierre and Marie Curie (UPMC)) establishes the convergence under mild convexity assumptions on the link costs (or delays). The proof is based on yet another fundamental result derived in that reference and that was later extended in by E. Altman in collaboration with O. Pourtallier ( Inriaproject-team Coprin), T. Jimenez (Univ. Avignon/LIA) and H. Kameda (Univ. Tsukuba, Japan), that states that if there is some symmetry in a network then any Nash equilibrium will inherit the symmetric properties (for example, if two users have the same source and destination and the same demand then at equilibrium, they will send the same amount of traffic over each link).

In all the above work there is an assumption that the link cost (or delay) per packet is class independent (it depends on the flows through the link only through their sum). In the case of
Wardrop equilibrium this assumption implies that the game has an equivalent global optimization problem whose solution coincides with the equilibrium. The link cost evaluated at some

Another difficulty occurs in rouging games when the paths available are not the same for all users. This is the case, in particular, when there are priorities. This problem is addressed in by J. Elias (University Paris Descartes), F. Martignon (University Paris-Sud 11), A. Capone (Politecnico di Milano, Italy) and E. Altman within an application to non-cooperative spectrum access in cognitive radio networks.

For several years now, E. Altman has been developing techniques for dynamic optimal control and games in cooperation with with S. Sarkar's group from the University of Pennsylvania (which used to be part of the DAWN associated team with Maestro). This year this collaboration has resulted in three additional publications co-authored by M.H.R. Khouzani and S. Sarkar (both from Univ. of Pennsylvania, PA, USA) and E. Altman , , . All three papers use the Pontriagin maximal principle to derive the structure of optimal policies applied to a mean-field approximation of the problem. The first two papers do that in a context of optimal control theory while the third one does it in the context of a dynamic game.

Sequential Anonymous Games (SAG) can be viewed as an extension of Markov Decision evolutionary games. In both formalisms there are many players modeled as a continuum number of players. A Markov chain is associated with each player. There are several types of players. The fraction of players in each class is called a global state and the state of the Markov chain of an individual is called the individual state. An individual chooses at some sequential decision opportunities actions. It earns some immediate reward (fitness) at each slot and moves with some probability to another individual state. In SAG, both the transition probabilities and the immediate fitness of an individual depend on its current state and action as well as on the current global system state. The latter evolves according to some function averaged over the fitness of the individuals in each class (the fraction of individuals in a class grows if they do better than those in the other classes). In E. Altman investigates, in collaboration with P. Wiecek (Wroclaw Univ. of Technology, Poland), the case where the objective of an individual is to maximize either its total expected fitness during its life time or its expected average fitness. The authors establish the existence of equilibria and study its properties. Applications to power control have appeared in by E. Altman, in collaboration with P. Wiecek (Wroclaw Univ. of Technology, Poland) and Y. Hayel (Univ. Avignon/LIA).

Since his 2004 Infocom paper, E. Altman has been working on this novel paradigm. The model is similar to that of the previous paragraph (SAG) except that in MDEG both immediate fitness and transition probabilities depend linearly on the global state. This reflects a scenario where the interaction between a player and the rest of the population occurs through pairwise interactions: each player encounters from time to time a randomly chosen other player and it finds itself playing a matrix game with that player. The entries of the matrix corresponding to each player as well as the transition probabilities for each player depend on the individual states of the players. E. Altman has applied this model to the dynamic Hawk and Dove game, in which individuals have to choose the degree of aggressiveness in their behavior as a function of their energy state.

Below are three publications both with biological applications and applications to wireless communications (where depending on one's remaining battery energy, one has to decide at what power to transmit). The first publication in , by E. Altman, H. Tembine ( Supelec), R. El-Azouzi and Y. Hayel (both from Univ. Avignon/LIA), lays the foundations of MDEGs and presents the application to power control in which the individual state is the battery level of energy. The second publication in , by Y. Hayel (Univ. Avignon/LIA), E. V. Belmega ( Supelec) and E. Altman, studies theoretical aspects that arise in case that the global state cannot represent the fractions of different populations but rather their actual size. The third publication in by E. Altman, J. Gaillard, M. Haddad and P. Wiecek (Wroclaw Univ. of Technology, Poland) again studies MDEGs (as in the first paper), but restricts to policies that use static policies: the same mixed strategy is taken by a player at each state. The authors manage to compute explicitly the equilibrium in this game within this class of policies.

Evolutionary game theory includes much theory on the description of the global system state as a function of the fitness of individuals. The models are often described through differential equations (e.g. the “replicator dynamics”). In many scenarios it is realistic to consider delays between the moment that one receives a given fitness till this is translated to a change in the population size. For example, if the lifetime of a computer is three years then an application that performs better with one computer may take more than a year till it is adopted by other users who do not have the same computer. In , H. Tembine ( Supelec), E. Altman, R. El-Azouzi and Y. Hayel (both from Univ. Avignon/LIA) investigate instability phenomena that are introduced by the delay and derive necessary stability conditions.

Maestroparticipates in the ADR (Action de Recherche/Research Action) “Semantic Networking” ( SemNet) and “Self Optimization in Wireless Networks” ( SelfNet), two of the three ADRs of the Inria Alcatel-Lucent Bell Labsjoint laboratory. These ADRs started on January 1st 2008 and will last for four years.

Isabelle Guérin Lassous ( Inriaproject-team Reso) is the coordinator for Inriaof the ADR SemNetand Bruno Gaujal (head of Inriaproject-team Mescal) is the coordinator for Inriaof the ADR SelfNet. Altcatel-Lucentcoordinators of ADRs SemNetand SelfNetare Ludovic Noirie and Laurent Roullet, respectively.

The new paradigm of “semantic networking” for the networks of the future brings together “flow-based networking”, “traffic-awareness” and “self-management” concepts to get “plug-and-play” networks. The natural traffic granularity is the flow. Maestro's task is to elaborate on the scheduling of flows in routers having in mind the fairness among flows with different round-trip times. Three joint Inria Acatel-Lucentpatents have been filed already, one in 2009 (inventors for Inria: S. Alouf, K. Avrachenkov, D. Carra, P. Nain) and two in 2010 (inventors for Inria: S. Alouf, K. Avrachenkov, A. Blanc).

E. Altman is responsible for Inriaof the work package on the “Design of Pico Cell Networks” whose objective is to increase the capacity with lower energy requirements. One joint Inria Acatel-Lucentpatent has been filed and two were submitted in 2011 (inventors for Inria: E. Altman and S. Ramanath).

The objective of this grant (CRE) is to develop mathematical models for the analysis of Content-Centric Networks (CCN). This research focuses on routing and caching policies.

P. Nain is responsible for Inria. This work is done in collaboration with C. Barakat ( Planete, Inria).

The objective of this grant (CRE) is to study the performance and to optimize protocols related to new applications over the Internet such as YouTube. E. Altman is responsible for Inria.

This is a joint contract with University Pierre and Marie Curie (UPMC) and Orange Labs, signed on June 2011 (retroactively), related to a Cifre thesis of R. Combes, whose advisors are E. Altman, S. Sorin (UPMC) and Z. Altman (Orange Labs).

The aim of this research action was to optimize the joint compression/transmission activities of the data backup system developed by the Flowxy company. This work was done in collaboration with A.-E. Baert, V. Boudet, M. Chaumont and W. Puech of the University of Montpellier 2.

Maestrohas a continuing collaboration with St. Petersburg State University. St. Petersburg State University is a partner in InriaInternship International programme. In particular, Maestrohosts every year several intern students from St. Petersburg State University. The collaboration with L. Petrosyan and A. Garnaev is on the application of game theory to resource allocation in networks. The collaboration with V. Dobrynin is on data clustering.

Augustin Chaintreau (from November 4, 2011 until November 9, 2011)

Institution: Columbia University, New York (USA)

Andrey Garnaev (from May 8, 2011 until May 13, 2011)

Institution: St. Petersburg State University (Russian Federation)

Richard Gibbens (from April 4, 2011 until April 10, 2011)

Institution: University of Cambridge (United Kingdom)

Evsey Morozov (from March 23, 2011 until March 28, 2011)

Institution: Russian Academy of Sciences (Russian Federation)

Charles Pearce (from September 25, 2011 until September 30, 2011)

Institution: University of Adelaide (Australia)

Karl Sigman (from March 25, 2011 until March 26, 2011)

Institution: Columbia University, New York (USA)

Don Towsley (from March 28, 2011 until June 27, 2011)

Institution: University of Massachusetts at Amherst (USA)

Uri Yechiali (from March 27, 2011 until April 4, 2011)

Institution: Tel Aviv University (Israel)

Josu Doncel (from July 9, 2011 until July 16, 2011)

Subject: Multiarmed Bandit Problems

Institution: Basque Center for Applied Mathematics (BCAM), Derio (Spain)

Nicolas Gast (from October 23, 2011 until October 25, 2011)

Institution: École Polytechnique Fédérale de Lausanne (Switzerland)

Jasper Goseling (from November 14, 2011 until November 18, 2011)

Institution: University of Twente (The Netherlands)

Peter Jacko (from July 9, 2011 until July 16, 2011)

Subject: Multiarmed Bandit Problems

Institution: Basque Center for Applied Mathematics (BCAM), Derio (Spain)

Eugenio Martin Della Vecchia (from July 11, 2011 until July 19, 2011)

Subject: Rolling Horizon stochastic control

Institution: National University of Rosario (Argentina)

Ana Maria Galindo (from September 15, 2011 until December 15, 2011)

Institution: Centre Tecnològic de Telecomunicacions de Catalunya (CTTC) (Spain)

Naveen K. P. (from October 11, 2011 until October 20, 2011)

Subject: Self Organization in Wireless Networks

Institution: Indian Institute of Science, Bangalore (India)

Sulan Wong (from May 2, 2010 until July 31, 2011)

Subject: Intellectual property and human rights : Patent law interference in the exercise of the scientific research freedom, the right to life and the right to health

Institution: University of A Coruña (Spain)

Tejas Bodas (from October 17, 2011 until October 20, 2011)

Institution: Indian Institute of Technology Bombay (India)

Adam Abeshouse (from June 1, 2011 until July 21, 2011)

Subject: Simulator for visualization of evolutionary games

Institution: Brown University (USA)

Bogdan Augustin Benga (from April 1, 2011 until September 30, 2011)

Subject: Monte Carlo Methods for Centrality Measures in Online Social Networks

Institution: West Timisoara University (Romania)

John Boreiko (from June 1, 2011 until July 21, 2011)

Subject: Simulator for visualization of replicator dynamics in evolutionary games

Institution: Brown University (USA)

Vladimir Fux (from March 17, 2011 until June 15, 2011)

Subject: Framework for crawling and analyzing web and social networking graphs

Institution: St. Petersburg State University (Russia (Russian Federation))

Alexey Mishenin (from February 23, 2011 until March 25, 2011)

Subject: Random walks based clustering techniques

Institution: St. Petersburg State University (Russia (Russian Federation))

Harshil Mittal (from May 30, 2011 until August 26, 2011)

Subject: Study of network capacity sharing in contents distribution networks

Institution: LNM Institute of Information Technology (India)

Larissa Spinelli (from April 18, 2011 until July 15, 2011)

Subject: Consensus algorithms in complex networks

Institution: Universidade Federal do Rio de Janeiro (Brazil)

E. Altman and M. Haddad have been collaborating with I. Mabrouki (Institut Supérieur d'Informatique et des Techniques de Communication, Tunisia) on intelligent jamming in wireless networks, i.e. jamming in which the jammer is aware of the protocol used by the network.

Within project 4000-IT on “Emerging Strategies for Wireless Communication Networks,” E. Altman and M. K. Hanawal (also with Univ. Avignon/LIA) have been collaborating with V. Kavitha (Univ. Avignon/LIA), R. Sundaresan and C. Singh (Indian Institute of Science, India) on evaluating and optimization issues in wireless networks. They also worked on network neutrality issues.

Title: Experimental COgnitive Distributed Engine (ECODE)

Type: COOPERATION (ICT)

Challenge: New paradigms and experimental facilities

Instrument: Specific Targeted Research Project (STREP)

Duration: September 2008 – August 2011

Coordinator: Alcatel Lucent (Belgium)

Other partners:

Universite Catholique de Louvain (UCL), IP Networking Lab (INL) (Belgium)

Universite de Liege (ULg), Research Unit in Networking (Belgium)

Interdisciplinair instituut voor BreedBand Technologie (IBBT), iLab.t (Belgium)

Lancaster University (ULANC), Computing Department (United Kingdom)

Centre National de la Recherche Scientifique (CNRS), Laboratory for Analysis and Architecture of Systems (LAAS) (France)

See also:
http://

Abstract: As part of the Future Internet Research and Experimentation (FIRE) initiative, the ECODE FP7 project designs and experiments machine learning-based control functionality. For this purpose, the project designs, develops, and experiments a distributed machine learning component that augments the capability and functionality of the routing and the forwarding engine of current routers. To evaluate the executability and the performance of the developed machine learning based control functionality, several experiments are conducted at the iLab.t experimental facility, located at IBBT in Ghent, Belgium.

Maestro's task is to design and evaluate flow management schemes that can deal with potentially sampled traffic information. K. Avrachenkov is the coordinator for Maestro.

AnrVersoEcoscells(Efficient Cooperating Small Cells) aims at developing algorithms and solutions which will be required for the deployment of small cell networks. The theoretical studies will define and solve the models needed to understand the behavior of radio channels, and will design the algorithms which will allow the exploitation of the diversity (user, spatial, interference, etc.) in these networks. The consortium gathers two main industrial groups in the telecommunication domain ( Alcatel-Lucent Bell Labs(leader) and Orange Labs), together with three leading SMEs (3 Roam, Sequansand Siradel) and six academic partners (University of Avignon, Inriathrough its project-teams Maestro, Mascotteand Swing, Institut Eurecom, Laas-Cnrsand Laboratoire des Signaux et Systèmes/ Supelec).

http://

AnrVersoModecol(Using mathematical MODeling to improve ECOLogical services of prairial ecosystems) is integrated in the framework of the urgent need for solutions for compensating human deterioration of the environment. New environmental policies point out natural ecosystems as key elements for providing ecological services such as water purification, soil detoxification, climate regulation and advocate for the creation of new ecosystems (as surrogates for the degraded natural systems) for increasing their positive effect on the environment. The design of such new ecosystems needs to be optimized for providing the best ecological services. The project Modecolaims at developing a hybrid model, sufficiently realistic, that will simulate a prairial ecosystem (modelled through IBM) correlated through feedbacks to environmental conditions (modelled through PDEs). This approach aims to provide a virtual laboratory for testing ecological hypothesis on complex ecological systems.

The participants are: UMR Ecobio ( Cnrs/Univ. Rennes 1), University of Houston (USA), University of Berkeley (USA), University of La Rochelle, and Inriathrough its projects and project-teams Maestro, Modemicand Tosca.

The aim of this research project, now terminated, was the development of an innovative visualization interface for video contents, based on a safe, reliable and optimized storage and transport infrastructure. It was coordinated by the VodDnet company, and involved researchers of the Lirmm(University of Montpellier 2 and Cnrs). The last results obtained were on the optimal placement of data and the problem of prefetching data so that users never experience blocking .

The Arc Ocoqs(Optimal threshold policies in COntrolled Queuing Systems) is devoted to the structural analysis of Markov Decision Processes, with the objective to improve the set of formal techniques available to prove that optimal control policies have a particular structure (typically, threshold-type). One of the benchmarks for this project is the extension of the model solved in . This project also involves A. Busic ( Inriaproject-team Trec), E. Hyon (LIP6 and Univ. Paris 10) and I. Vliegen (Univ. Twente).

visited the Basque Center for Applied Mathematics (BCAM) (Derio, Spain) in the period January 10–15, 2011, the University of Liverpool (United Kingdom) in the period March 7–11, 2011, and the University of Twente in the period May 23, 2011 – June 24, 2011.

visited the Groupe d'études et de recherche en analyse des décisions (GERAD) (Montréal, Canada), in the periods May 2–27, 2011, and November 21–30, 2011, as well as the Universidad Nacional de Rosario (Rosario, Argentina), in the period September 3–7, 2011.

visited the Electrical Engineering Department of the University of Palermo (Italy), in the period December 22–23, 2011.

is an Associate Editor of
*Journal of Economics, Dynamics and Control*(JEDC),
*Dynamic Games and Applications*(DGAA) Springer, and
*Computer Communications*(COMCOM) Elsevier.

is an Associate Editor of
*Performance Evaluation*.

has been Associate Editor for
*RAIRO Operations Research*until 2011.

is the Editor-in-Chief of
*Performance Evaluation*and an Associate Editor of
*Operations Research Letters*.

was a program committee member of the following conferences:

9th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2011), Princeton, New Jersey, USA (May 9–13, 2011),

29th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (IFIP Performance 2011), Amsterdam, The Netherlands (October 18–20, 2011),

IEEE 75th Vehicular Technology Conference (VTC2012-Spring), Yokohama, Japan (May 6–9, 2012).

was a program committee member of the following conferences:

2nd International Conference on Game Theory for Networks (GameNets 2011), Shanghai, China (April 16–18, 2011),

5th International Conference on Game Theory and Management (GTM 2011), St. Petersburg, Russia (June 27–29, 2011),

IEEE ICC Workshop on Game Theory and Resource Allocation for 4G (GeT-ReAl 2011), Kyoto, Japan (June 5, 2011).

was a program committee member of the following conferences:

11th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2011), St. Petersburg, Russia (August 23–35, 2011),

3rd International Conference on Advances in Future Internet (AFIN 2011), Nice/Saint Laurent du Var, France (August 21–27, 2011),

4th International Workshop on Multiple Access Communications (MACOM 2011), Trento, Italy (September 11–13, 2011),

International Conference on NETwork Games, COntrol and OPtimization (NETGCOOP 2011), Paris, France (October 12–14, 2011),

2nd Conference on Decision and Game Theory for Security (GameSec 2011), College Park, Maryland, USA (November 14–15, 2011).

was a program committee member of the following conferences:

International Conference on NETwork Games, COntrol and OPtimization (NETGCOOP 2011), Paris, France (October 12–14, 2011),

2nd Conference on Decision and Game Theory for Security (GameSec 2011), College Park, Maryland, USA (November 14–15, 2011).

was a program committee member of the following conferences:

13th Workshop on Mathematical Performance Modeling and Analysis (MAMA 2011), San Jose, California, USA (June 8, 2011),

26th International Symposium on Computer and Information Sciences (ISCIS 2011), London, UK (September 26–28, 2011).

was a program committee member of the following conferences:

13th Workshop on Mathematical Performance Modeling and Analysis (MAMA 2011), San Jose, California, USA (June 8, 2011),

29th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (IFIP Performance 2011), Amsterdam, The Netherlands (October 18–20, 2011).

was a program committee member of the following conferences:

46th IEEE International Conference on Communications – Next Generation Networking and Internet Symposium (IEEE ICC 2011 – NGNI), Tokyo, Japan (June 6–8, 2011),

5th International IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (IEEE AOC 2011), Lucca Italy (June 20, 2011),

20th International Conference on Computer Communications and Networks (ICCCN 2011), Maui, Hawaii, USA (July 31 – August 4, 2011),

6th International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA 2011), Barcelona, Spain (October 26–28, 2011),

31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, Florida, USA (March 25–30, 2012).

was a program committee member of the following conferences:

International Conference on NETwork Games, COntrol and OPtimization (NETGCOOP 2011), Paris, France (October 12–14, 2011),

2nd Conference on Decision and Game Theory for Security (GameSec 2011), College Park, Maryland, USA (November 14–15, 2011).

was a TPC co-chair of the 2nd Conference on Decision and Game Theory for Security (GameSec 2011), College Park, Maryland, USA (November 14–15, 2011), and a co-chair of the 3rd International Workshop on Indoor and Outdoor Femto Cells (IOFC 2011), Princeton, New Jersey, USA (May 13, 2011). He has been the steering committee chair of the 9th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2011), Princeton, New Jersey, USA (May 9–13, 2011) and the International Conference on NETwork Games, COntrol and OPtimization (NETGCOOP 2011), Paris, France (October 12–14, 2011).

was chair and organizer of a special session on “Structured Markov Chains” at the 5th ICST International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2011), Cachan, France (May 16–20, 2011).

participated in the Habilitation (HDR) thesis committee of Rachid El-Azouzi (December 13, 2011, University of Avignon), and the PhD thesis committees of

Van Minh Nguyen (June 20, 2011, Telecom ParisTech),

Semir Medina Perlaza (July 8, 2011, Supelec) as a reviewer,

Gaurav S. Kasbekar (September 29, 2011, University of Pennsylvania, Philadelphia) as a reviewer,

Sreenath Ramanath (October 6, 2011, University of Avignon) as co-advisor,

Anis Jdidi (November 3, 2011, University Pierre and Marie Curie).

participated in the PhD thesis committee of Elena Smirnova (December 15, 2011, Inria).

participated in the PhD thesis committees of

Jean Daligault (July 5, 2011, University of Montpellier 2) as president,

Dorian Mazauric (November 7, 2011, University of Nice-Sophia Antipolis) as president, and

Dalila Goudia (December 6, 2011, University of Montpellier 2) as president.

participated in the PhD thesis committees of

Mohamad Jaber (October 6, 2011, University of Nice-Sophia Antipolis) as co-advisor.

Tuan Minh Pham (December 14, 2011, University Pierre and Marie Curie) as a reviewer.

Dorian Mazauric (November 7, 2011, University of Nice-Sophia Antipolis) as co-advisor.

is a member of the Doctoral Committee of InriaSophia Antipolis - Méditerranée.

is co-responsible of one of the five themes of the SFR (Structure Fédérative de Recherche) AGORANTIC (in which Inriais a founding member) entitled “Digital Culture and Virtual Societies.”

is a member of the Invited Researchers Committee of InriaSophia Antipolis - Méditerranée.

is responsible for validation of activity reports of all teams at InriaSophia Antipolis - Méditerranée.

is the PhD representative at the General Information Commission of InriaSophia Antipolis - Méditerranée.

is the scientific coordinator of Inriaactivities in Montpellier.

is member of the managing sub-committee of the Project-Team Committee of the InriaSophia Antipolis - Méditerranée research center.

was appointed expert for the Recruiting Committee for Professors (Commission d'Évaluation des Appellations) at Telecom ParisTech.

is a member of the Steering Committee of the GDR RO, a national research initiative on Operations Research sponsored by the Cnrs.

is Head of project-team Maestro.

is a member of the Inriasteering group (13 people including 6 researchers) in charge of producing the first version of the Inria2013-2017 strategic plan.

E. Altman is a fellow member of IEEE.

E. Altman, A. Jean-Marie and P. Nain are (elected) members of IFIP WG7.3 on “Computer System Modeling”.

P. Nain is the Vice-Chair of the IFIP WG7.3 working group on “Computer System Modeling” and a Member of the Board of Directors of SIGMETRICS (elected for the period June 30, 2007 – July 1, 2011). This year he has been promoted at the rank of “directeur de recherche de classe exceptionnelle” (DRCE).

gave conferences at the Albert Camus Library, Antibes, France (May 20, 2011), at the International High School of Manosque, France (November 7, 2011) and at the Jean Cocteau High School of Miramas, France (November 24, 2011).

Master : “Network Engineering Games”, 15H (22.5H ETD), M2, University Pierre and Marie Curie (UPMC), France.

Master : “Linear Algebra and Numerical Methods”, 12H (18H ETD), M1 EuroAquae, University of Nice Sophia Antipolis (UNS), France.

Master : “Probability and Statistics”, 18H (27H ETD), M1 EuroAquae, University of Nice Sophia Antipolis (UNS), France.

Licence : “Stochastic processes for Signal Processing”, 64H (64H ETD), 1st year Electronic Engineering degree (L3), University of Nice Sophia Antipolis (UNS), France.

Master : Metrology and Quality of Service for Networks, 12H (18H ETD), M2, University of Montpellier 2, France.

Doctoral module : Advanced Markov Modeling, 18H (18H ETD), University of Montpellier 2, France.

Licence : “Algorithms and Complexity”, 25H (29H ETD), Computer Science Program (L3), University of Nice Sophia Antipolis (UNS), France.

Licence : “Functional Programming (Scheme)”, 18H (18H ETD), Computer Science Program (L1), University of Nice Sophia Antipolis (UNS), France.

Master : “Performance Evaluation of Networks”, 21H (32.5H ETD), M2 IFI Ubinet, University of Nice Sophia Antipolis (UNS), France.

Licence : “Probability and Statistics”, 35H (38.5H ETD), 1st year Applied Mathematics and Modeling Engineering degree (L3), University of Nice Sophia Antipolis (UNS), France.

Master : “Performance Evaluation of Networks”, 15H (22.5H ETD), M2 IFI Ubinet, University of Nice Sophia Antipolis (UNS), France.

Master : “Introduction to Fluid Models”, 6H (9H ETD), M2, University of Palermo, Italy.

Doctoral module : “Introduction to Game Theory”, 4H (6H ETD), PhD school, organized by the Italian Control Theory Society, Italy.

PhD: Dorian Mazauric, “Discrete optimization in telecommunication networks: reconfiguration of the routing, energy efficient routing, link scheduling, and data placement” , University of Nice Sophia Antipolis, November 7 2011, advisors: Jean-Claude Bermond ( Inriaproject-team Mascotte) and Philippe Nain.

PhD: Sreenath Ramanath, “Cell design and resource allocation for small cell networks” , University of Avignon, October 6 2011, advisors: Eitan Altman and Merouane Debbah ( Supelec).

PhD in progress: Nicaise Choungmo Fofack, “Analysis of green strategies in wireless cellular networks,” October 1 2010, advisors: Sara Alouf and Philippe Nain.

PhD in progress: Richard Combes, “Self-organizing functionalities in radio networks,” October 1 2009, advisors: Eitan Altman and Zwi Altman (France Telecom) and Sylvain Sorin (University Pierre and Marie Curie).

PhD in progress: Mahmoud El Chamie, “Belief propagation in complex networks,” October 1 2011, advisors: Konstantin Avrachenkov and Giovanni Neglia.

PhD in progress: Julien Gaillard, “Creation, simulation and multidiscipline evaluation of dynamic mobility models in complex systems,” October 1 2011, advisors: Eitan Altman, Marc El-Bèze (University of Avignon) and Emmanuel Ethis (University of Avignon).

PhD in progress: Manjesh Kumar Hanawal, “Resource allocation and learning algorithms in small cells wireless networks,” January 1 2010, advisors: Eitan Altman and Rachid El-Azouzi (University of Avignon).

PhD in progress: Cengis Hasan, “Optimization of resource allocation for small cells networks,” October 1 2010, advisors: Eitan Altman and Jean-Marie Gorce ( Inriaproject-team Swing).

PhD in progress: Lorenzo Maggi, “Game theory for wireless communications,” November 1 2009, advisors: Konstantin Avrachenkov and Laura Cottatellucci ( Institut Eurecom).

PhD in progress: Marina Sokol, “Clustering and learning tecnhiques for traffic/user classification,” October 1 2009, advisors: Paulo Gonçalves ( Inriaproject-team Reso) and Philippe Nain.

attended the 29th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (IFIP Performance 2011), Amsterdam, The Netherlands (October 18–20, 2011).

gave presentations at:

10th International Conference on Networking (Networking 2011), Valencia, Spain (May 9–13, 2011),

MENEUR Workshop, Paris, France (May 26, 2011),

Bionetic workshop, York, United Kingdom, (December 5–6, 2011).

gave presentations at:

5th ICST International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2011), Cachan, France (May 16–20, 2011),

8th Workshop on Algorithms and Models for the Web Graph (WAW 2011), Atlanta, GA, USA (May 28, 2011),

4th International Conference on Markov and Semi Markov Processes and Related Fields (MSMPRF 2011), Sithonia, Greece (September 20–23, 2011).

gave a presentation at the 5th ICST International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2011), Cachan, France (May 16–20, 2011).

gave a presentation at:

2nd International Conference on Game Theory for Networks (GameNets 2011), Shanghai, China (April 16–18, 2011),

MENEUR Workshop, Paris, France (May 26, 2011).

gave a presentation at the 13th French Meeting on the Algorithmics of Telecommunications (AlgoTel'11), Agay, France (May 23–26, 2011).

gave a presentation at the 5th French-Japanese Symposium “Frontiers of Science”, Tokyo, Japan (January 22, 2011).

gave a presentation at the International Conference on NETwork Games, COntrol and OPtimization (NETGCOOP 2011), Paris, France (October 12–14, 2011).

gave presentations at:

9th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2011), Princeton, New Jersey, USA (May 9–13, 2011),

3rd International Workshop on Indoor and Outdoor Femto Cells (IOFC 2011), Princeton, New Jersey, USA (May 13, 2011),

IEEE Winter School of Information Theory (WSIT), Barcelona, Spain (March 15–19, 2011).

gave invited talks at the STAR-seminar on Stochastic Networks at CWI, The Netherlands (May 24, 2011) and at the TW Colloquium at University of Twente, The Netherlands (May 26, 2011).

gave an invited talk at the Workshop on Stochastic Geometry (GDR ISIS), Paris, France (December 9, 2011).

gave an invited talk at the Workshop on Algorithmic Game Theory: Dynamics and Convergence in Distributed Systems (AlgoGT), Grenoble, France (June 20, 2011).

attended by M. K. Hanawal, S. Ramanath. Course title “Stochastic Geometry for Wireless Networks”.

attended by M. Panda.