MASCOTTE is a joint team between INRIA SophiaAntipolis and the laboratory I3S (Informatique Signaux et Systèmes SophiaAntipolis) which itself belongs to CNRS (Centre National de la Recherche Scientifique) and UNSA (University of NiceSophia Antipolis).
MASCOTTE is a joint team between INRIA SophiaAntipolis and the laboratory I3S (Informatique Signaux et Systèmes SophiaAntipolis) which itself belongs to CNRS (Centre National de la Recherche Scientifique) and UNSA (University of NiceSophia Antipolis). Furthermore MASCOTTE is strongly associated with the center of research and development of France Telecom at SophiaAntipolis via the CRC CORSO.
Its research fields are Simulation, Algorithmic, Discrete Mathematics and Combinatorial Optimization with applications to telecommunication or transportation networks.
In particular, MASCOTTE has developed in the last four years both theoretical and applied tools for the design of heterogeneous networks of various types (like WDM, SDH, ATM, wireless, satellites, ...).
On the one hand, the project aims to construct or design networks or communication algorithms. On the other hand, it also wants to build software simulators or to implement algorithms, but not to conceive protocols. The theoretical results can be applied to various situations and technologies.
The project uses tools and theory in the following domains: Discrete Mathematics, Algorithmic, Combinatorial Optimization and Simulation. Typically, a telecommunication network (or an interconnection network) is modeled by a graph. A vertex may represent either a processor, a router, a
switch or a person, and an edge (or arc) a connection between the elements represented by the vertices. We can add more information both on the vertices (for example what kind of switch is used, optical or not, number of ports, equipment cost) and on the edges (weights which might correspond
to length, costs, bandwidth, capacities) or colors on paths etc. According to the application, various models can be defined and they have to be specified. This modeling part is an important task. To solve the problems, in some cases we can find polynomial algorithms: for example a maximum
set of disjoint paths between two given vertices is by Menger's theorem equal to the minimum cardinality of a cut and it can be determined in polynomial time using graph theoretic tools or flow theory or linear programming. On the contrary, determining whether in a directed graph there exists
a pair of disjoint paths, one from
s_{1}to
t_{1}and the other from
s_{2}to
t_{2}, is an NPcomplete problem, and so are all the problems which aim to construct or minimize the cost of a network which can realize certain traffic requests. On many problems, the project works with a deterministic hypothesis (for example if a connection fails it is considered as
definitely and not intermittently). The project aims to construct or design networks or communication algorithms or to build software simulators or to implement algorithms but not to conceive protocols. The theoretical results can be applied to various situations and technologies.
For the last five years the project has chosen as main domain of application Telecommunication leaving the domain of parallel computing. The project has also applications in the domain of ''transportation''. However, note that there is some overlap between the two domains; in particular theoretical tools and also communication problems are not really different if one considers transportation or telecommunication networks. Inside the telecommunication domain the applications we consider are strongly dependent on the interest of the industrial partners with whom we collaborate. With France Telecom (and other partners) we have worked on the design of telecommunication backbone networks (either SDH/SONET, WDM, or ATM networks) and on various faulttolerance (protection) problems (in particular in case of link failures) or grooming (grouping) of small traffic containers into bigger ones. We have also used the PROSIT simulation framework developed in the project both for applications to a road traffic simulator (in the OSSA E.U. project) or in the ASIMUT simulation environment for satellite telecommunication in particular with the CNES.
PROSIT
PROSIT is a sequential and distributed application framework for discrete event simulation. PROSIT uses object oriented techniques to allow for efficient development of complex discrete event simulation packages. It has been used as the simulation engine for the European projects HIPERTRANS and OSSA, devoted to high performance simulation of road traffic. It has also been at the heart of the ASIMUT simulation environment developed by CNES (the French National Space Centre) for satellite telecommunication systems evaluation.
Licenses of PROSIT have been sold to CNES and to Dassault Data Systems.
MASCOPT
the main objective of the MASCOPT (Mascotte Optimization) project is to provide a set of tools for network optimization problems. Examples of problems are routing, grooming, survivability, and virtual network design. MASCOPT will help implementing a solution to such problems by providing a data model of the network and the demands, libraries to handle data and ready to use implementation of existing algorithms or linear programs (e.g. integral multicommodity flow).
MASCOPT is Open Source (LGPL) and intends to use the most standard technologies such as Java and XML format providing portability facilities. We finished to implement graph data structure, several basic algorithms working on graph and input/output classes. MASCOPT also provides some graphical tools to display graph results and step by step algorithm demos. We are currently writing network packages and performing experiments on WDM networks . A first application has been released which computes onboard networks with fault tolerance which is described in section 6.3.
A new release of Mascopt has been developed this year in order to provide easy interfacing mechanism with other libraries such as Parego (by Ricardo Correa, Universidade Federal do Ceará, Brazil).
Mascopt has been presented at Club InTech'Sophia.
OSA: an Open Componentbased Architecture for DiscreteEvent Simulations.
Componentbased modeling has many wellknown good properties. Out of these properties is the ability to dispatch the modeling effort amongst several experts each having their own area of system expertise. Clearly, the less experts have to care about areas of expertise of others, the more efficient they are in modeling subsystems in their own area. Furthermore, the process of studying complex systems using discreteevent computer simulations involves several areas of nonsystem expertise, such as discreteevent techniques or experiment planning.
Moreover, the OSA architecture is intended to meet the expectations of a large part of the discreteevent simulation community. This report also describes the way OSA provides an open platform intended to support simulationists in a wide set of their simulation activities, and how it allows the reuse and sharing of system models in the simulation community by means of a flexible component model (Fractal).
Preliminary work had been done on methodologies to estimate road traffic by using instrumented vehicles, in complement of or instead of road sensors. In the framework of the MobiVIP project, in , we have further investigated the estimation of origindestination matrices. She has described some methods that can be used for a urban network, in realtime conditions and in the context of highprecision instrumented vehicles use. The comparisons made on a large references ground enable to propose one approach based on statespace modeling. Two solutions for this model are then described and compared: Kalman filtering and the generalized least squares method.
Designing a backbone network consists in computing paths for each traffic unit and then in assigning resources along these paths. The set of paths is chosen according to the technology, the protocol or the quality of service constraints. For instance, optical backbones use the WDM technology to take better advantage of the capacity of the optical fibers often already installed. This is achieved through multiplexing several wavelength channels onto the same fiber. In WDM networks, the huge bandwidth available on an optical fiber is divided into multiple channels. Each channel carries bandwidth up to several gigabits per second. A minimum unit of resource allocation is an optical channel, which consists of a path and a wavelength assigned on each link along the path and is called a lightpath. If wavelength translation is performed in optical switching, then each channel may be assigned different wavelengths on each link along the path; otherwise the wavelength continuity constraint must be satisfied on all links along the path. Of course, two lightpaths sharing a link must use different wavelengths on that link.
In MASCOTTE we have studied the wavelength routing and coloring problem, the traffic grooming problem and the virtual network embedding problem (with application to ATM networks) and other design problems for backbone telecommunication networks with SDH (Synchronous Digital Hierarchy) technology.
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most
1/
Cof the bandwidth of the wavelength, we will say that the grooming factor is
C. That means that on a given edge of the network we can groom (group) at most
Crequests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers (shortly ADM) used in the network (related to the cost of the
nodes).
We have addressed the problem of traffic grooming in WDM rings or paths with AlltoAll uniform unitary traffic. The goal is to minimize the total number of sonet adddrop multiplexers (ADMs) required. We have shown that this problem corresponds to a partition of the edges of the
complete graph into subgraphs, where each subgraph has at most
Cedges (where
Cis the grooming ratio) and where the total number of vertices has to be minimized. In prior work, using tools of graph and design theory, we optimally solved the problem for rings for practical values and infinite congruence classes of values for a given C. In
we solved the problem for rings and
C= 6.
We have also considered the case where the network is a path on
Nnodes,
P_{N}. Thus the routing is unique. For a given grooming factor
C, minimizing the number of wavelengths is an easy problem, wellknown and related to the load problem. But minimizing the number of ADM's is NPcomplete for a general set of requests and no results are known. Here, we show how to model the problem as a graph
partition problem, and using tools of design theory we completely solve the case where
C= 2, and where we have a static uniform alltoall traffic (one request for each pair of vertices)
,
.
In a WDM network we assign to a new request the best possible route (if it exists) without computing a new routing for all requests. Thus, after several modifications of the set of requests, that is after a sequence of arrivals and terminations of requests, the routing may become inefficient. Furthermore, the probability of rejecting new requests may increase, even if there exists a routing for this set of request. So it is interesting to change the routing from time to time to improve the use of the resources in the network.
Given a set of requests and 2 different routings
R_{1}and
R_{2}for it, we want to find a set of modifications of the routing to go from
R_{1}to
R_{2}, according to the following rules: (i) a request can use its new route if it is available, (ii) we can move the route of a request to a temporary position at any time, (iii) when a request uses a temporary route, it uses it until it can reach its final route. Our objective is thus
to minimize the number of requests that are simultaneously in a temporary position.
A different problem motivated by the design of Asynchronous Transfer Mode (ATM) networks was considered in . Given a physical network and an AlltoAll traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here the problem is solved when the physical network is a ring; an almost optimal solution is given for diameter 2 and bounds for large diameters.
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific devices to links in order to monitor the traffic that passes through the network and the active approach that generates explicit control packets in the network for measurements. One of the key issues in this domain is to minimize the overhead in terms of hardware, software, maintenance cost and additional traffic.
We have studied the problem of assigning tap devices for passive monitoring and beacons for active monitoring. Minimizing the number of devices and finding optimal strategic locations is a key issue, mandatory for deploying scalable monitoring platforms. We present a combinatorial view of the problem from which we derive complexity and approximability results, as well as efficient and versatile Mixed Integer Programming (MIP) formulations , .
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume singlefailure assumption, which is not adequate in present day multilayer networks.
Multiple link failure models, in the form of Shared Risk Link Groups (SRLG's) and Shared Risk Node Groups (SRNG's),are becoming critical in survivable optical network design. We classify both of these forms of failures under a common scenario of shared risk resource groups (SRRG)
failures. We develop techniques for the minimum color path problem to tolerate multiple failures arising from a shared resource group failure. We study the minimum color
stcut problem that we prove NPcomplete and hard to approximate. We also provide efficient MILP formulation and heuristic algorithms for it
.
The problem of interest is to determine the minimum number of edges of a 2connected graph having a diameter equal to
p. This problem deals with telecommunication survivable networks design with constraint of grade of service. In
we prove the bounds of the number of edges for 2connected graphs or for 2edgesconnected graphs with a diameter
p. The bound for 2connected graphs was a conjecture by L. Cacetta.
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node without leaving any trace. The Black Hole Search is the task of locating all black holes in a network, through the exploration of its nodes by a set of mobile agents. In , , we consider the problem of designing the fastest Black Hole Search, given the map of the network, the starting node and, possibly, a subset of nodes of the network initially known to be safe. We study the version of this problem that assumes that there is at most one black hole in the network and there are two agents, which move in synchronized steps. We prove that this problem is not polynomialtime approximable within (unless P=NP). We give a 6approximation algorithm, thus improving on the previous 9.3approximation algorithm. We also prove APXhardness for a restricted version of the problem, in which only the starting node is initially known to be safe.
Another measure of fault tolerance consists in asking each request to be routed via
f+ 1vertex disjoint paths. So, the network can tolerate
ffaults. One can generalize the classical notions of load and optical index and define the
fload and the
foptical index; for example the
foptical index is the minimum number of wavelengths to be assigned to the paths associated to the requests in order that no two paths that share an arc receive the same wavelength. In
, these parameters are determined for the complete graphs and partly for other topologies like tori and bipartite
complete graphs when the set of requests is All to All. The proofs need construction of specific idempotent orthogonal latin squares.
Inside a telecommunication satellite, audio and video signals are routed through a switching network to amplifiers. Since it is impossible to repair a satellite, we choose to multiply the components that may be faulty, that is amplifiers and switches.
The first problem is to build a valid network which allows to route
ninput signals, to
namplifiers (outputs), arbitrarily chosen among
n+
k, and thus supporting
kbroken amplifiers. Each switch has 4 links and the routes followed by the signals must be disjoint. Thus for economical constraints, the objective is to build valid networks having the minimum number of switches.
Within the CRC CORSO with France Telecom, we have studied the problem of designing efficient strategies to provide Internet access using wireless devices. Typically, in one village several houses wish to access a gateway (a satellite antenna) and to use multihop wireless relay routing to do so.
On the one hand,we have modeled the problem as follows: each node (representing a house) is able to communicate to nodes not too far away (at distance at most
d_{T}). On the other hand, there is interference between nodes (at distance at most
d_{I}). The distances can be measured either in terms of Euclidean distances or number of hops. In our first study we have considered the special case where each node has one information (message) that it wants to transmit to (or analogously receive from) the gateway (gathering problem).
We have in particular obtained the results for specific topologies like paths or grids for which optimal algorithms have been obtained in
. In
, we have considered the case where there is permanent demand (systolic algorithms). This leads to the definition
of a
call scheduling problem. In such networks the physical space is a common resource that nodes have to share, since concurrent transmissions cannot interfer. We study how one can satisfy steady bandwidth demands according to this constraint. We show that it can be relaxed into a
simpler problem: the
call weightingproblem, which is almost a usual multicommodity flow problem, but the capacity constraints are replaced by the much more complex notion of non interference. Not surprisingly, this notion involves independent sets, and we prove that the complexity of the call weighting
problem is strongly related to the one of the independent set problem and its variants (maxweight, coloring, fractional coloring). The hardness of approximation follows when the interferences are described by an arbitrary graph. We refine our study by considering some particular cases for
which efficient polynomial algorithms can be provided: the
Gatheringin which all the demand are directed toward the same sink, and specific interference relations: namely those induced by the dimension 1 and 2 Euclidean space, those cases are likely to be the practical ones.
In , we present an algorithm for resource allocation in satellite networks. It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to minimize the size of the frequency plan while ensuring that the different types of demands are satisfied, each type using a different bandwidth. The proposed algorithm relies on two main techniques. The first generates admissible configurations for the interference constraints, whereas the second uses mixed linear/integer programming with column generation. The obtained solution estimates a possible allocation plan with optimality guarantees, and highlights the frequency interferences which degrade the construction of good solutions.
In
we present new results on the performance of the Minimum Spanning Tree heuristic for the
Minimum Energy Broadcast Routing(MEBR) problem. We first prove that, for any number of dimensions
d2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient
, that is the exponent to which the coverage distance must be raised to give the emission power, grows. Moreover, we show that, for any fixed instance, as a limit for
going to infinity, the ratio tends to the lower bound given by the
ddimensional kissing number, thus closing the existing gap between the upper and the lower bound. We establish a
7.45approximation ratio for the 2dimensional case, thus significantly decreasing the previously known 12 upper bound (actually corrected to
12.15). Finally, we extend our analysis to any number of dimensions
d2and any
d, obtaining a general approximation ratio of
3
^{d}1, again independent of
. The improvements of the approximation ratios are specifically significant in comparison with the lower bounds given by the kissing numbers, as these grow at least exponentially with respect to
d. (see
).
Mobile ad hoc network (MANet) are spontaneous topologies of mobile nodes where each of them collaborate. Selforganization propose to structure the MANet in order to provide efficient broadcast, routing protocols, localization, etc. Nevertheless, if selforganization appears to be an interesting approach because of the stability or autonomous properties, some weaknesses remain because selforganization selects privileged nodes and links forming a subMANet where nonprivileged nodes and links are less active. Intuitively, bottleneck can appear in such networks. In this work, we address the issue of capacity of selforganization and the comparison between classical flat MANet and selforganized one. We propose a model of radio resource sharing taking into account local nodes interactions to provide lower and upper bounds. Evaluation functions are given in order to characterize the proposed bounds .
Motivated by the Web graph a study of small world graphs is done in .
New technologies and the deployment of mobile and nomadic services naturally generqte new routediscovery problems under changing conditions over dynamic networks. Unfortunately, the temporal variations in the topology of dynamic networks are hard to be effectively captured in a classical graph model. We used evolving graphs to capture the dynamic characteristics of such networks; we showed that computing different types of strongly connected components in dynamic networks is NPcomplete. We also investigated the concepts of journeys in Evolving Graphs which capture both space and time constraints in routing problems .
We further investigated the connected components problem in dynamic networks with special topologies. In a dynamic setting, the topology of a network derives from the set of all the possible links, past and future. We proved that the strongly connected components problem is still NPcomplete when the topology is composed of unit disc graphs and the nodes are placed on a grid. On the other hand, we also gave a polynomialtime algorithm, by dynamic programming, in order to compute a maximum strongly connected components when the topology is a tree .
One of the new challenges facing research in wireless networks is the design of algorithms and protocols that are energy aware. The minimumenergy broadcast routingproblem, which attracted a great deal of attention these past years, is NPhard, even for a planar static network. The best approximation ratio for it is a solution proved to be within a factor 12 of the optimal. One popular way of achieving this ratio is based on finding a Minimum Spanning Tree of the static planar network. We used the evolving graph combinatorial model to prove that computing a Minimum Spanning Tree of a planar network in the presence of mobilityis NPComplete. We also gave a polynomialtime algorithm to build a rooted spanning tree of a mobile network, that minimizes the maximum energy used by any one node, thus maximizing the lifetime of a wireless communication network .
We studied different aspect of improper colourings of graphs, related to a channel assignment problem proposed by Alcatel. In , we model Alcatel's problem using improper choosability of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalize and to improve previous known results about improper choosability of planar graphs, and graphs of higher genus.
In
,
, we investigate the ratio of the
kimproper· chromatic number to the clique number for unit disk graphs and random unit disk graphs to generalize results of McDiarmid and Reed, and results of McDiarmid and Müller, where only proper colouring was considered.
In
are studied paths with two blocks in
nchromatic digraphs.
With the rapid developments in hardware technologies, distributed computing and the interconnected world has become realities, and the term "communication" has become central in computer science. Solving communication tasks under different circumstances is the topic of this textbook . It provides an introduction to the theory of design and the analysis of algorithms for the dissemination of information in interconnection networks, with a special emphasis on broadcast and gossip. The book starts with the classic telegraph and telephone communication modes, and follows the technology up to optical switches. All ideas, concepts, algorithms, analyses and arguments are first explained in an informal way in order to develop the right intuition, and then they are carefully specified in detail. This makes the content accessible for beginners as well as specialists.
Given a graph
G= (
V,
E)with

V =
n, we consider the following problem: place
npoints on the vertices of
Gindependently and uniformly at random. Once the points are placed, relocate them using a bijection from the points to the vertices that minimizes the maximum distance between the random place of the points and their target vertices.
We look for an upper bound on this maximum relocation distance that holds with high probability (over the initial placements of the points).
Contrat de recherche externalisé, CRE with France Telecom R&D, 20032005, on matching constraints for the design of telecommunication networks. This contract covers mainly the PhD grant of S. Petat.
Contrat de recherche collaborative (CRC) with France Telecom R&D, 20032005.
As mentioned earlier, we have a strong collaboration with France Telecom R&D inside the CRC CORSO. This means that some researchers of MASCOTTE on one side and engineers of France Telecom R&D on the other side work together on specified subjects approved by a ''Comité de pilotage''. Among these subjects we can mention the design of telecommunication networks, the study of fault tolerance and the use of radio networks for bringing Internet in places where there is no ADSL.
MobiVIP is a PREDIT project funded by Ministries of Research, Transportation, Industry and Environment, together with ANVAR and ADEME. In this program, 5 research laboratories and 7 SMEs work in collaboration to experiment, demonstrate and evaluate a new transportation system for cities, based on intelligent small urban vehicles. Mascotte will develop methods for traffic estimation based on instrumentation of those vehicles.
ANR jeunes chercheurs: ``OSERA'', 20052008, on optimization and simulation of ambient networks.
ACI sécurité ``PRESTO'', 2003 2006, on survivability of communication networks, in collaboration with the ENST (Paris) and the LIMOS (ClermontFerrand).
European project IST : ``CRESCCO'', 20022005, on critical resource sharing for cooperation in complex systems, in collaboration with the universities of Salerno and Roma (Italy), Patras (Greece, coordinator), Geneva (Switzerland) and Kiel (Germany). Mascotte works essentially on the efficient use of bandwidth in WDM networks (Workpackage 4).
European project IST : ``AEOLUS'', 20052009, on algorithmic principles for building efficient overlay computers, in collaboration with 21 European universities and coordinated by University of Patras, Greece.
MASCOTTE is the leader of SubProject 2 on resource management.
European COST Action: "COST 293, Graal", 20042008. The main objective of this COST action is to elaborate global and solid advances in the design of communication networks by letting experts and researchers with strong mathematical background meet peers specialized in communication networks, and share their mutual experience by forming a multidisciplinary scientific cooperation community. This action has more than 25 academic and 4 industrial partners from 18 European countries. Mascotte works essentially on the design and efficient use of optical backbone network.
D. Coudert for INRIA and J. Galtier for France Telecom R&D are in the management committee of this action.
P. Mussi has joined COST Action 355 "Changing behavior towards a more sustainable transport system". The main objective of this COST Action is to develop a more rigorous understanding of the conditions under which the process of growing unsustainable transport demand could be reversed, by changing travelers , shippers and carriers behavior.
( http://www.cost.esf.org/index.php?id=240&action_number=355)
Cooperation CNRS–Oxford, 20032005, on frequency allocation problems in wireless networks, in collaboration with the Mathematical Institute of Oxford University.
Funded by the PACA province.
Bilateral Cooperation, 04/200403/2006, on ``Web Graphs and Web Algorithms'', in collaboration with the Department of Computer Science, King's College London.
Funded by the Royal Society, U.K.
Cooperation INRIA–Brazil: ``REGAL'', 200320 06, on algorithmic problems for telecommunication networks, in collaboration with the Federal University of Ceara (Fortaleza, Brazil); also funded by the Pacaprovince (06/0406/06).
Cooperation with the university of Sao Paolo (resp A. Goldman) projet commun Mobidyn INRIAFAPESP on combinatorial models for dynamic networks.
One of the main objectives is to strengthen our collaboration with SFU. Many reciprocal visits have been performed.
( http://wwwsop.inria.fr/mascotte/David.Coudert/EquipeAssociee/)
Louigi AddarioBerry, McGill University, Montreal, Canada, FebruaryMarch 2005.
Yannick Brehon, ENST, Paris, France, July 2005.
Colin Cooper, King's College London, England, December 2005.
Ricardo Correa, Universidade Federal do Ceará, Brazil, April 2005.
Ross Kang, Oxford,England, June 2005.
ZviLotker, CWI Amsterdam, Netherlands, October 2005.
Tobias Muller, Oxford, England, June 2005.
Alfredo Navarra, University of L'Aquila, Italy, October 2005.
Joseph Peters, Simon Fraser University, Vancouver, Canada. Januarymay 2005 .
Tomasz Radzik, King's College London, England, March June and December 2005.
Fabiano Sarracco, La Sapienza, Rome, Italy, JanuaryMarch 2005 and MayJune 2005.
Fabrice Theoleyre, CITI/ARES INSA Lyon/INRIA RhoneAlpes, Lyon, France. Novemberdecember 2005.
Stéphane Thomassé,University de Lyon, France, February 2005.
Marcelo Luis Vinagreiro, University of Sao Paulo, Brazil, July 2005.
Joseph Yu, Simon Fraser University, Vancouver, Canada. JanuaryApril 2005.
J.C. Bermond: Greece (230/06/05) and Brazil (University of Fortaleza) 29/10/05  21/11/05.
D. Coudert: Montreal University, Montreal Canada, April 0916 2005.
A. Ferreira: University of Fortaleza Brésil (28/04/05 07/05/05) and Sao Paulo, Brazil, October 29  November 7 2005.
F. Havet: McGill University, Montreal Canada, October 0620, 2005.
L. AddarioBerry, F. Havet and JS. Sereni: Oxford, England, 14/03/0525/03/05
G. Huiban and ME. Voge: LIMOS, Clermont Ferrand, France, 08/03/0509/03/05.
A. Jarry: IME, University of Sao Paulo, Brazil, February 12  march 12 2005.
R. Klasing: LaBRI, Bordeaux, 30/01/05  06/02/05, King's College London, 15/03/2005  19/03/2005, ETH Zurich, 16/05/05  21/05/05, King's College London, 10/10/2005  14/10/2005, Simon Fraser University, Burnaby, Canada, 13/11/2005  30/11/2005
F. Huc: Cambridge University, Cambridge UK, October 712 2005.
G. Huiban: Federal University of Minas Gerais, June 01December 31 2005.
S. Pérennes: S.F.U. Vancouver, Canada, 06/11/05  30/11/05.
H. Rivano: Montreal University, Montreal Canada, April 0916 2005, CITI, INRIA/INSA de Lyon, several weeks, year 2005.
J.S. Sereni: Charles University, Praha Czech Republic, 09/2610/01 2005
JC. Bermond: expert for RNRT; expert for DRTT ; member of the scientific committee of LIRMM (Montpellier); member of the "Commission de Spécialistes de la 27 ^{e}section" of UNSA; substitute member of the "Commissions de Spécialistes de la 27 ^{e}section" of UTC (université de Technologie de Compiègne) and Université de la Méditerranée (AixMarseille II); member of the I3S Project Committee; nominated member of the RTP (réseaux thématiques) Committee of STIC department " Réseaux " and " Mathématiques de l'Informatique "; member of the PhD committee of Marseille and of the "Conseil Scientifique" of the Ecole Doctorale STIC of NiceSophia Antipolis.
M. Cosnard: members of a lot of committees mainly in relation with its direction of UR INRIA of Sophia Antipolis
D. Coudert: member of the COST Action 293 Management Committee.
O. Dalle: member of working group "Vers une théorie de la Simulation" ( http://www.lsis.org/versim/), member of the "Commission de Spécialistes de la 27 ^{e}section" of University of NiceSophia Antipolis, member of the ``Commission du Développement Logiciel'' de l'INRIA Sophia Antipolis, member of the ``Commission Informatique'' of I3S.
A. Ferreira: nominated member of the I3S laboratory Committee; member of the "Commission d'évaluation" of the INRIA; member of the RNRT commission 3; member of the CNRT Telius board.
J. Galtier: member of the COST Action 293 Management Committee.
F. Havet: member of the I3S laboratory Committee, of the "Commission de Spécialistes de la 25 ^{e}et 26 ^{e}section" of the University of Lyon 1, and of the "Commission de Spécialistes de la 27 ^{e}section" of the University of Montpellier II.
R. Klasing: substitute member of the I3S laboratory Committee.
A. Laugier: referee for ACI "Nouvelles interfaces des mathématiques".
P. Mussi: head of the ReV department (public relations, international and industrial partnerships) of INRIA Sophia Antipolis, member of working group "Modélisation Multiple et Simulation" (GdR MACS, http://mad3.univbpclermont.fr/), and working group "Vers une théorie de la Simulation" ( http://www.lsis.org/versim/).
M. Syska: nominated member of the I3S laboratory Committee as president of "Commission informatique".
JC. Bermond: Combinatorics Probability and Computing, Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, Journal of Interconnection Networks (Advisory Board), Mathématiques et Sciences Humaines, Networks, Parallel Processing Letters, Computer SCience Reviews and the SIAM book series on Discrete Mathematics.
M. Cosnard: EditorinChief of Parallel Processing Letters. Member of the Editorial Board of Parallel Computing, of Theory of Computational Systems (TOCS) and of IEEE TPDS.
A. Ferreira: Journal of Parallel and Distributed Computing (Academic Press), Parallel Processing Letters (World Scientific), Parallel Algorithms and Applications (Elsevier), Journal of Interconnection Networks (World Scientific).
M. Cosnard: is member of the IPDPS (International Parallel and Distributed Processing Symposium) and of the PACT (Parallel Architecture and Compilation Techniques) Steering Committees.
A. Ferreira: AlgoTel, Ecotel.
M. Cosnard, D. Coudert, F. Havet, A. Laugier, P. Mussi, S. Pérennes and M. Syskaorganized the Symposium in Honour of JeanClaude Bermond, Sophia Antipolis, France, December 89, 2005.
D. Coudertorganized the 3rd Workshop of European Action COST 293 Graal, ENST Paris, May 2728, 2005.
A. Ferreiraorganized COST Strategic Workshop on Algorithmic Challenges in FP7, Brussels, Belgium, August 31  September 1 2005
F. Havetwas chairman of the organizing committee of ICGT'05.
H. Rivanoorganized AlgoTel, Presqu'ile de Giens, France, may 1113 2005.
H. Rivanoorganized the ReCap and ResCom workshop, Nice, France, November 810 2005.
JC. Bermond: ICGT'05.
D. Coudert: AlgoTel 05.
D. Coudert, F. Havet, A. Laugier, S. Perennes and M. Syska: JCB 60.
A. Ferreira: LATIN 2006, MobiWac 2005, CLADE 2005, ICW'05, ParCo2005, WiMob05, WWAN 2005.
J. Galtier: Networking 05.
P. Mussi: The 2nd Conference on Conceptual Modeling and Simulation (CMS 2005), part of the 2005 International Mediterranean Modeling Multiconference, Marseilles, France, October 2022 2005; ESM2005, Riga, Latvia, 14 June 2005; MESM2006 will be held in Alexandria, Egypt in September 2006; 2005 High Performance Computing & Simulation (HPC&S 05) Conference, June 1  4, 2005, Riga, Latvia; MAJECSTIC 2005 Troisième congrès francophone de doctorants en STIC Rennes, France. nov 1618 2005; MOSIM 06: Conférence Francophone de Modélisation et Simulation Rabat, Morocco, april 35 2006
The following theses have been defended in 2005:
A. Jarry: Connexité dans les réseaux de télécommunications. PhD thesis, École doctorale STIC, Université de NiceSophia Antipolis, March 2005.
The following theses are in preparation:
O. Amini: Problèmes de théorie des graphes.
F. Huc: Conception de réseaux dynamiques tolérants aux pannes;
G. Huiban: La reconfiguration dans les réseaux optiques multifibres;
N. Morales: Méthodes d'approximation pour les problèmes de réseaux de télécommunications avec de contraintes économiques et de traffic incertain;
S. Petat: Contraintes de couplages pour la conception de réseaux de télécommunications;
JS. Sereni: Coloration par listes appliquée à l'allocation de fréquences;
ME. Voge: Protection et groupage dans les réseaux de télécommunications.
JC. Bermond: Member of PhD thesis committees of R. Groonevelt (07/04/05), and Paul Ghobril (ENST 28/04/05), and Member of HDR thesis committee of Y. Vaxes (Marseille,29/11/05); referee for the PhD thesis of M. Montassier Bordeaux O2/11/05).
M. Cosnard: Member of so many Ph.D. and HDR thesis Committees that he does not remember them.
F. Havet: Member of PhD thesis committee of M. Montassier, University of Bordeaux, November 2, 2005.
A. Laugier: Member of HDR thesis committee of Mourad Bayou, University de ClermontFerrand, December 2005.
JC. Bermond and S. Bessysupervised the internship of Clement Lepelletier (DEA MDFI Marseille)
JC. Bermond and D. Coudertsupervised the internship of Florian Huc (Centrale Paris)
M. Cosnardsupervised the internship of Amar Patel (Master Sveden)
D. Coudertsupervised the internship of Foued BenHfaiedh (INSAT Tunis)
D. Coudertsupervised the internship of Ignasi SauValls (UPC Barcelone)
D. Coudertsupervised the internship of MarieLaure Gnemmi (ENSEA CergyPontoise)
P. Mussisupervised the internship of Christelle Savio (ENTPE)
H. Rivanosupervised the internship of Faouzi Kaabi (INSAT Tunis)
H. Rivanosupervised the internship of Cristiana Gomes (UFMG, Brazil)
H. Rivanosupervised the internship of Vincent Siles (ENS Lyon)
M. Syskasupervised the internship of Yves Baumes (Project ESSI)
M. Syskasupervised the internship of Benjamin Nosenzo (Project ESSI)
The members of MASCOTTE are heavily involved in teaching activities at undergraduate level (DEUG, IUT, Master 1 and 2, Engineering Schools like ESSI). The teaching is carried out by members of the University as part of their teaching duties, and for INRIA CNRS or PhD's as extra work. It represents more than 1000 hours per year.
For graduate studies, MASCOTTE was strongly involved in the creation of the DEA RSD (Réseaux and Systèmes Distribués) and now members of MASCOTTE teach both in the mandatory lectures and in 3 options of the Master STIC RSD. Members of MASCOTTE are also involved in teaching in other Master's like the master MDFI of Marseille or in Master pro like the Master Telecoms or in the 3rd year of engineering schools. Altogether that represents around 200 hours per year.
The members of MASCOTTE supervise on the average severals internships each year at all levels (Master 1 and 2, Engineering Schools). The students come from various places in France as well as from abroad (e.g. Europe, Chile, United States, India,...). Some of the internship reports are listed in the bibliography under the heading miscellaneous.
D. Coudert: 2nd Workshop on Optimization of Optical Networks (OON 05), Montreal Canada, April 1415.
F. Havet and A. Ferreira: Workshop on Fundamental Aspects in Networks Problems, Fortaleza, Brazil, May 17 2005.
F. Havet and S. Thomassé: Graph Theory Conference Nyborg, Denmark, December 14 2005
F. Havet: Symposium in Honour of JeanClaude Bermond, Sophia Antipolis, France, December 89, 2005.
A. Jarry: "Modèles combinatoires pour les réseaux dynamiques." CNRT Télius, Mobilité dans les Télécoms et Internet : Usages et Technologie. June 15, 2005. CICA, Sophia Antipolis, France.
R. Klasing: "Bringing Internet into Villages using Wireless Communication". COST293 2nd Discussion Workshop, Barcelona (31/09/200501/10/2005).
R. Klasing: "Bringing Internet into Villages using Wireless Communication". Seminar Network Modeling Group, Simon Fraser University, Burnaby, Canada. (21/11/2005)
P. Mussi: Forum simulation et transport, Paris, France, January 1920
H. Rivano: 2nd Workshop on Optimization of Optical Networks (OON 05), Montreal Canada, April 1415.
H. Rivano: Séminaire du LAMI, Evry, France, December 12 2005.
J.S. Sereni: Noon Seminars, Institute for Theoretical Computer Science (ITI) and Department of Applied Mathematics (KAM), Charles University, Prague, Sept. 29 2005
M. Syska: has presented the Mascopt library at the club Intech'Sophia seminar (dec 14th).
JC. Bermond, D. Coudert and H. Rivanoattended the meeting of ACISI PRESTO, Paris, July 5.
JC. Bermond, D. Coudert, O. Dalle, N. Morales, P. Musssi, S. Perennes, H. Rivano, JS. Sereni and ME. Vogeattended AlgoTel'05, Presqu'ile de Giens, May 1113.
D. Coudert and M. Syskaattended the final review meeting of European project IST FET CRESCCO, Edinbourg, April 46.
D. Coudert, G. Huiban, JF. Lalande, H. Rivano and ME. Vogeattended the TAROT meeting, Paris, March 1819.
D. Coudert and J. Galtierattended the 3rd Management Committee meeting, European Action COST 293 Graal, Paris, May 2728.
D. Coudert, J. Galtier and R. Klasingattended the 4rd Management Committee meeting, European Action COST 293 Graal, UPC Barcelone, September 29 to October 1st.
D. Coudert, N. Morales, H. Rivano and ME. Vogeattended the ResCom meeting, Nice, November 910.
D. Coudert and H. Rivanoattended PaRISTIC, Labri, Bordeaux, November 2123.
D. Coudert, H. Rivano and M. Syskaattended the kickoff meeting of European project IST FET AEOLUS, Athens, Greece, November 2829.
O. Dalle and P. Mussiattended the VERSIM workshop held at ONERA, Toulouse, May 10, 2005.
O. Dalle, P. Mussi and C. Mrabetattended the FRACTAL workshop held in Grenoble, Nov 28, 2005.
A. Jarryattended the 3rd Workshop COST 295 Dynamo, Paris, France, May 2021.
P. Mussiattended MobiVIP project review meeting, Nancy, France, Jun. 17, 2005.
P. Mussiattended action meeting, European Action COST 355, Berlin, Germany, Nov 2325, 2005.
H. Rivanoattended the ReCap meeting, Nice, November 8.
H. Rivanoattended the FET Infoday, Brussels, February 13th 2005.
H. Rivanoattended the COST 295 Dynamo Kickoff meeting, Brussels, February 27th 2005.
Members of Mascotteattended JCB'60, Sophia Antipolis, December 89.
J.C. Bermond, D. Coudert, F. Havet, S. Pérennes, J.S. Sereni and S. Thomasséattended the 7th International Colloquium in Graph Theory (ICGT'05), Hyères, France, September 1116.
JC. Bermond, D. Coudert, O. Dalle, N. Morales, P. Mussi, H. Rivano, JS. Sereni and ME. Vogeattended AlgoTel'05, Presqu'ile de Giens, May 1113.
S. Bessyattended Graph Theory, workshop in Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, 1622 January 2005.
M. Cosnardattended IPDPS 2005, Denver, USA
M. Cosnardattended PACT 2005, Saint Louis, USA.
D. Coudertattended ONDM'05, Milano, Italy, February 0709.
D. Coudert and H. Rivanoattended OON'05, Montreal, Canada, April 1415.
D. Coudert, R. Klasing and F. Sarraccoattended SIROCCO 2005, Mont SaintMichel, France, May 2426.
J. Galtierattended Performance 2005, JuanlesPins, October 37 2005.
J. Galtier and A. Laugierattended DRCN 2005, Island of Ishia (Naples), October 1619 2005.
J. Galtier and A. Laugierattended the 50th anniversary of the Hungarian method, Budapest, October 31st 2005.
F. Havetattended GRACCO 2005, Angra dos Reis, Brazil, April 2729 2005.
F. Havetattended the Workshop on Fundamental Aspects in Networks Problems, Fortaleza, Brazil, May 17 2005.
F. Havet, R. Klasing, N. Morales, J.S. Sereni and S. Thomasséattended the Journées Graphes et Algorithmes (JGA05), Bordeaux, France, Nov. 3  4 2005.
F. Havet: Graph Theory Conference Nyborg, Denmark, December 14 2005
G. Huibanattended ICT 2005, Cape Town, South Africa, May 0306, 2005
J.F. Lalande, A. Laugier, S. Petat and M.E.Vogeattended ROADEF 2005, Tours, France, February 141516 2005.
J.F. Lalandeattended IEEE INFOCOM 2005, March 1317, Miami, US.
P. Mussiattended ObjectWeb workshop, Grenoble, France, Nov. 2829, 2005.
J.S. Sereniattended WG 2005, Metz, France, June 2325 2005.
J.S. Sereniattended EuroComb 2005, Berlin, Germany, Sept. 59 2005.
D. Coudert, P. Mussi and H. Rivanoattended the 9th summer school Internet Nouvelle Génération, ING 05, Cote d'Opale, June 1317, 2005.