@INPROCEEDINGS{comito06,
  AUTHOR = {Carmela Comito and Simon Patarin and Domenico Talia},
  TITLE = {A Semantic Overlay Network for {P2P} Schema-Based
                  Data Integration},
  BOOKTITLE = {Proceedings of the 11th IEEE Symposium on Computers
                  and Communications (ISCC'06)},
  YEAR = 2006,
  ADDRESS = {Pula-Cagliari, Italy},
  MONTH = JUN,
  PAGES = {88--94},
  ABSTRACT = {Today data sources are pervasive and their number is
                  growing tremendously. Current tools are not prepared
                  to exploit this unprecedented amount of information
                  and to cope with this highly heterogeneous,
                  autonomous and dynamic environment. In this paper,
                  we propose a novel semantic overlay network
                  architecture, PARIS, aimed at addressing these
                  issues. In PARIS, the combination of decentralized
                  semantic data integration with gossip-based
                  (unstructured) overlay topology management and
                  (structured) distributed hash tables provides the
                  required level of flexibility, adaptability and
                  scalability, and still allows to perform rich
                  queries on a number of autonomous data sources. We
                  describe the logical model that supports the
                  architecture and show how its original topology is
                  constructed. We present the usage of the system in
                  detail, in particular, the algorithms used to let
                  new peers join the network and to execute queries on
                  top of it and show simulation results that assess
                  the scalability and robustness of the architecture.},
  PDF = {http://patarin.info/pub/paris_iscc06.pdf},
  DOI = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.19}
}

@INPROCEEDINGS{handurukande06,
  AUTHOR = {Sidath Handurukande and Anne-Marie Kermarrec and
                  Fabrice Le Fessant and Laurent Massoulié and Simon
                  Patarin},
  TITLE = {Peer Sharing Behaviour in the eDonkey Network, and
                  Implications for the Design of Server-less File
                  Sharing Systems},
  BOOKTITLE = {Proceedings of the First EuroSys Conference
                  (EuroSys 2006)},
  YEAR = 2006,
  MONTH = APR,
  ADDRESS = {Leuwen, Belgium},
  PAGES = {359--371},
  ABSTRACT = {In this paper we present an empirical study of a
                  workload gathered by crawling the eDonkey network
                  --- a dominant peer-to-peer file sharing system ---
                  for over 50 days. We first confirm the presence of
                  some known features, in particular the prevalence of
                  free-riding and the Zipflike distribution of file
                  popularity. We also analyze the evolution of
                  document popularity. We then provide an in-depth
                  analysis of several clustering properties of such
                  workloads. We measure the geographical clustering of
                  peers offering a given file. We find that most files
                  are offered mostly by peers of a single country,
                  although popular files don't have such a clear home
                  country. We then analyze the overlap between
                  contents offered by different peers. We find that
                  peer contents are highly clustered according to
                  several metrics of interest. We propose to leverage
                  this property by allowing peers to search for
                  content without server support, by querying suitably
                  identified semantic neighbours. We find via
                  trace-driven simulations that this approach is
                  generally effective, and is even more effective for
                  rare files. If we further allow peers to query both
                  their semantic neighbours, and in turn their
                  neighbours' neighbours, we attain hit rates as high
                  as over 55\% for neighbour lists of size 20.},
  PDF = {http://www.cs.kuleuven.ac.be/conference/EuroSys2006/papers/p359-handurukande.pdf}
}

@INPROCEEDINGS{wu05,
  AUTHOR = {Huaigu Wu and Bettina Kemme and Alberto Bartoli and
                  Simon Patarin},
  TITLE = {A Replication Toolkit for {J2EE} Application
                  Servers},
  BOOKTITLE = {Proceedings of the ACM/IFIP/USENIX 6th International
                  Middleware Conference (MiddleWare '05) --
                  Demonstrators Track},
  YEAR = 2005,
  ADDRESS = {Grenoble, France},
  MONTH = NOV,
  ABSTRACT = {Web service technology allows organizations to
                  provide programmatic interfaces to the services they
                  export. In most cases, these services are
                  implemented with a multi-tier architecture
                  consisting of a client external to the organization,
                  a middle-tier and a back-end tier. The middle-tier
                  typically uses the infrastructure of an application
                  server (AS) whereas the back-end tier consists of a
                  database system. In this demo we present our work
                  for enhancing current AS technology with exible and
                  transparent failure management. We consider
                  multi-tiered services based on the J2EE architecture
                  and replicate the middle-tier for
                  fault-tolerance. The novelty of our contribution
                  consists in the guarantees we provide with respect
                  to failures.},
  PDF = {http://middleware05.objectweb.org/WSProceedings/demos/d5_Wu.pdf}
}

@INPROCEEDINGS{comito05,
  AUTHOR = {Carmela Comito and Simon Patarin and Domenico Talia},
  TITLE = {{PARIS}: A Peer-to-Peer Architecture for Large-Scale
                  Semantic Data Integration},
  BOOKTITLE = {Proceedings of the Third International Workshop on
                  Databases, Information Systems, and Peer-to-Peer
                  Computing (DBISP2P 2005)},
  YEAR = 2005,
  ADDRESS = {Trondheim, Norway},
  MONTH = AUG,
  VOLUME = 4125,
  SERIES = {Lecture Notes in Computer Science}
}

@ARTICLE{bartoli05,
  AUTHOR = {Alberto Bartoli and Ricardo {Jiménez-Peris} and
                  Bettina Kemme and Cesare Pautasso and Simon Patarin
                  and Stuart Wheater and Simon Woodman},
  TITLE = {The {ADAPT} Framework for Adaptable and Composable
                  Web Services},
  JOURNAL = {IEEE Distributed Systems Online},
  YEAR = 2005,
  VOLUME = 6,
  NUMBER = 9,
  MONTH = SEP,
  ABSTRACT = {Organizations are increasingly using the Web not
                  only to sell products and deliver information, but
                  also for providing their services to businesses and
                  individual customers. Typically, the provision of
                  such services by organizations requires the
                  construction of applications that integrate existing
                  enterprise information systems to offer new business
                  functions. Organizations need to ensure that these
                  services are available, scalable and also autonomic
                  to guarantee that user interactions are promptly
                  processed even under highly volatile conditions. In
                  most cases, organizations deliver these services by
                  means of application servers with a multi-tier
                  architecture whose functionalities are accessed as
                  web services. We refer to services not relying on
                  other web services as Basic Services (BSs). The
                  presence of a wide variety of BSs over the Internet
                  has created an exciting new business opportunity of
                  providing value added, inter-organizational services
                  by composing multiple BSs into new Composite
                  Services (CSs).},
  URL = {http://dsonline.computer.org/portal/site/dsonline/menuitem.9ed3d9924aeb0dcd82ccc6716bbe36ec/index.jsp?&pName=dso_level1&path=dsonline/topics/was/papers&file=bartoli.xml&xsl=article.xsl&}
}

@INPROCEEDINGS{hachichi05,
  AUTHOR = {Assia Hachichi and Cyril Martin and Gaël Thomas and
                  Bertil Folliot and Simon Patarin },
  TITLE = {A Generic Language for Dynamic Adaptation},
  BOOKTITLE = {Proceedings of the 11th International Euro-Par
                  Conference (Euro-Par 2005)},
  YEAR = 2005,
  MONTH = AUG,
  ADDRESS = {Lisboa, Portugal},
  ABSTRACT = {Today, component oriented middlewares are used to
                  design, develop and deploy distributed applications
                  easily. They ensure the heterogeneity,
                  interoperability, and reuse of software
                  modules. Several standards address this issue: CCM
                  (CORBA Component Model), EJB (Enterprise Java Beans)
                  and .Net. However they offer a limited and fixed
                  number of system services, and their deployment and
                  configuration mechanisms cannot be used by any
                  language nor API dynamically. As a solution, we
                  present a generic high-level language to adapt
                  system services dynamically in existing
                  middlewares. This solution is based on a highly
                  adaptable platform which enforces adaptive
                  behaviours, and offers a means to specify and adapt
                  system services dynamically. A first prototype was
                  achieved for the OpenCCM platform, and good
                  performance results were obtained. },
  PAGES = {40--49},
  PDF = {http://patarin.info/pub/cvm_europar2005.pdf},
  DOI = {http://dx.doi.org/10.1007/11549468_8}
}

@ARTICLE{hales05b,
  AUTHOR = {David Hales and Simon Patarin},
  TITLE = {Computational Sociology for Systems ``in the Wild'':
                  the case of {BitTorrent}},
  JOURNAL = {IEEE Distributed Systems Online},
  VOLUME = 6,
  NUMBER = 7,
  MONTH = JUL,
  YEAR = 2005,
  ABSTRACT = {It is generally agreed that future software systems
                  should be open, distributed, self-organizing,
                  scalable and robust. Fully distributed systems
                  cannot rely on centralized control and open systems
                  cannot ensure that malicious and / or selfish
                  components do not invade the system. The requirement
                  for high scalability means that systems should run
                  at least as well, and ideally better, when scaled to
                  millions of units. How does one begin to formulate
                  methods, techniques and protocols that can deliver
                  on these tough demands? One approach, often adopted
                  within the Multi-Agent Systems (MAS) community is to
                  start from scratch, designing agents and platforms
                  with provable properties using specialized logics
                  and / or sophisticated simulation models. However,
                  this approach is particularly difficult when dealing
                  with open systems containing adaptive agents. This
                  is because the designer cannot be sure how other
                  agents will behave in future states of the
                  system. Worse, much of the desirable behavior of the
                  system as a whole, such as high levels of altruism
                  or cooperation for example, often result from
                  emergent properties which are little understood and
                  not easily reducible to individual
                  behaviors. However, progress is being made.},
  URL = {http://dsonline.computer.org/portal/pages/dsonline/0507/o7002.html},
  PDF = {http://patarin.info/pub/bittorrent_dsonline2005.pdf},
  DOI = {http://dx.doi.org/10.1109/MDSO.2005.34}
}

@INPROCEEDINGS{patarin05a,
  AUTHOR = {Simon Patarin and Mesaac Makpangou},
  TITLE = {Pandora: an Efficient Platform for the Construction
                  of Autonomic Applications},
  BOOKTITLE = {Self-Star Properties in Complex Information Systems},
  YEAR = 2005,
  MONTH = MAY,
  VOLUME = 3460,
  SERIES = {Lecture Notes in Computer Science},
  PAGES = {291--306},
  ABSTRACT = {Autonomic computing has been proposed recently as a
                  way to address the difficult management of
                  applications whose complexity is constantly
                  increasing. Autonomic systems will have to diagnose
                  the problems they face themselves, devise solutions
                  and act accordingly. In consequence, they require a
                  very high level of flexibility and the ability to
                  constantly monitor themselves. This work presents a
                  framework, Pandora, which eases the construction of
                  applications that satisfy this double goal. Pandora
                  relies on an original application programming
                  pattern --- based on stackable layers and message
                  passing --- to obtain a minimalist model and
                  architecture that allows control of the overhead
                  imposed by the full reflexivity of the framework. A
                  prototype of the framework has been implemented in
                  C++, freely available for download on the
                  Internet. A detailed performance study is given,
                  together with examples of use, to assess the
                  usability of the platform in real usage conditions.},
  PDF = {http://patarin.info/pub/pandora_lncs.pdf},
  DOI = {http://dx.doi.org/10.1007/11428589_19}
}

@TECHREPORT{hales05a,
  AUTHOR = {David Hales and Simon Patarin},
  TITLE = {How to cheat BitTorrent and why nobody does},
  INSTITUTION = {University of Bologna},
  YEAR = 2005,
  NUMBER = {UBLCS-2005-12},
  MONTH = MAY,
  ABSTRACT = {The BitTorrent peer-to-peer file-sharing system
                  attempts to build robustness to free-riding by
                  implementing a tit-for-tat-like strategy within its
                  protocol. It is often believed that this strategy
                  alone is responsible for the the high-levels of
                  cooperation found within the BitTorrent
                  system. However, we highlight some of the weaknesses
                  of the approach and indicate where it would be easy
                  to cheat and free-ride. Given that cheating of this
                  kind currently appears rare, this motivates the
                  question: \emph{why is the system not dominated by
                  free-riders?} We advance a hypothesis which argues
                  that BitTorrent may resist free-riders in a way that
                  has not been previously fully
                  comprehended. Ironically, this process relies on
                  what is commonly believed to be a \emph{weakness} of
                  BitTorrent - the lack of meta-data search. One
                  consequence of this is to partition the BitTorrent
                  network into numerous isolated swarms - often with
                  several independent swarms for an identical file -
                  which is one of the necessary conditions for a kind
                  of evolutionary group selective process, a process
                  that has been recently identified in similar
                  simulated systems. A further implication of the
                  hypothesis is that, given the choice, users may
                  choose unconditional altruism rather than the more
                  restrictive reciprocal tit-for-tat approach as a
                  result of the same group selective process.},
  PDF = {http://www.cs.unibo.it/pub/techreports/2005/2005-12.pdf}
}

@INPROCEEDINGS{babaoglu04,
  AUTHOR = {Ozalp Babaoglu and Alberto Bartoli and Vance
                  Maverick and Simon Patarin and Jaksa Vuckovic and
                  Huaigu Wu},
  TITLE = {{A Framework for Prototyping J2EE Replication
                  Algorithms}},
  BOOKTITLE = {Proceedings of the International Symposium on
                  Distributed Objects and Applications (DOA 2004)},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = 3291,
  YEAR = 2004,
  ADDRESS = {Larnaca, Cyprus},
  MONTH = OCT,
  ABSTRACT = {In application server systems, such as J2EE,
                  replication is an essential strategy for reliability
                  and efficiency. Many J2EE implementations, both
                  commercial and open-source, provide some replication
                  support. However, the range of possible strategies
                  is wide, and the choice of the best one, depending
                  on the expected application profile, remains an open
                  research question. To support research in this area,
                  we introduce a framework for prototyping J2EE
                  replication algorithms. In effect, it divides
                  replication code into two layers: the framework
                  itself, which is common to all replication
                  algorithms, and a specific replication algorithm,
                  which is ``plugged in'' to the framework. The
                  division is defined by an API. The framework
                  simplifies development in two ways. First, it keeps
                  much of the complexity of modifying a J2EE
                  implementation within the framework layer, which is
                  implemented only once. Second, through the API, the
                  replication algorithm sees a highly abstracted view
                  of the components in the server. This frees the
                  designer to concentrate on the important issues that
                  are specific to a replication algorithm, such as
                  communication. We have implemented the framework by
                  extending the open-source J2EE server. Compared to
                  an unmodified server, the framework adds a
                  performance cost of about 22\%. Thus, it is quite
                  practical for the initial development and evaluation
                  of replication algorithms. Several algorithms have
                  already been implemented within the framework.},
  KEYWORDS = {J2EE, replication, pluggable framework},
  PDF = {http://patarin.info/pub/framework_doa2004.pdf},
  PAGES = {1413--1426},
  DOI = {http://dx.doi.org/10.1007/b102176}
}

@INPROCEEDINGS{hachichi04,
  AUTHOR = {Assia Hachichi and Cyril Martin and Gaël Thomas and
                  Simon Patarin and Bertil Folliot},
  TITLE = {{Reconfigurations dynamiques de services dans un
                  intergiciel à composants CORBA CCM}},
  BOOKTITLE = {Actes de la 1ère Conférence Francophone sur le
                  Déploiement et la (Re) Configuration de Logiciels
                  (DECOR'04)},
  YEAR = 2004,
  ADDRESS = {Grenoble, France},
  MONTH = OCT,
  ABSTRACT = {De nos jours, les intergiciels à composants sont
                  utilisés pour concevoir, développer, et déployer
                  facilement les applications réparties, et assurer l
                  hétérogénéité, et l interopérabilité, ainsi que la
                  réutilisation des modules logiciels, et la
                  séparation entre le code métier encapsulé dans des
                  composants et le code système géré par les
                  conteneurs. De nombreux standards répondent à cette
                  définition tels : CCM (CORBA Component Model), EJB
                  (Entreprise Java Beans) et .NET. Cependant ces
                  standards offrent un nombre limité et figé de
                  services systèmes, supprimant ainsi toute
                  possibilité d ajout de services systèmes ou de
                  reconfiguration dynamiques de l intergciel. Nos
                  travaux proposent des mécanismes d ajout et d
                  adaptation dynamique des services systèmes, basés
                  sur un langage de reconfiguration adaptable
                  dynamiquement aux besoins de la reconfiguration et
                  sur un outil de reconfiguration dynamique. Un
                  prototype a été réalisé pour la plateforme OpenCCM
                  de LIFL.},
  KEYWORDS = {adaptation et reconfiguration dynamique, conteneurs
                  adaptable, CCM, MVV},
  NOTE = {In French},
  PDF = {http://hal.ccsd.cnrs.fr/docs/00/02/75/55/PDF/main.pdf},
  PS = {http://hal.ccsd.cnrs.fr/docs/00/02/75/55/PS/main.ps},
  PAGES = {159--170}
}

@INPROCEEDINGS{patarin04a,
  AUTHOR = {Simon Patarin and Mesaac Makpangou},
  TITLE = {{Pandora: une plate-forme efficace pour la
                  construction d'applications autonomes}},
  BOOKTITLE = {Actes de la 1ère Conférence Francophone sur le
                  Déploiement et la (Re) Configuration de Logiciels
                  (DECOR'04)},
  YEAR = 2004,
  ADDRESS = {Grenoble, France},
  MONTH = OCT,
  ABSTRACT = {L'informatique autonome a récemment été proposée
                  comme une réponse à la difficulté de gérer au
                  quotidien des applications dont la complexité ne
                  cesse d'augmenter. Les applications autonomes
                  devront être particulièrement flexibles et pouvoir
                  se surveiller en permanence. Cette étude présente
                  une plate-forme, Pandora, qui facilite la
                  construction d'applications qui satisfont ce double
                  objectif. Pandora s'appuie sur un mode de
                  programmation original des applications --- fondé
                  sur la composition de couches et le passage de
                  messages --- pour aboutir à un modèle et une
                  architecture minimalistes qui lui permettent de
                  contrôler les surcoûts imposés par la complète
                  réflexivité de la plate-forme. Un prototype
                  fonctionnel de la plate-forme a par ailleurs été
                  développé en C++. Une étude détaillée des
                  performances, ainsi que des exemples d'utilisation,
                  complètent cette présentation.},
  KEYWORDS = {informatique autonome, modèle de composants,
                  reconfiguration dynamique},
  NOTE = {In French},
  PDF = {http://hal.ccsd.cnrs.fr/docs/00/02/75/31/PDF/decor04.pdf},
  PS = {http://hal.ccsd.cnrs.fr/docs/00/02/75/31/PS/decor04.ps},
  PAGES = {15--26}
}

@PHDTHESIS{patarin03c,
  AUTHOR = {Simon Patarin},
  TITLE = {Pandora: support pour des services de métrologie à
                  l'échelle d'{I}nternet},
  SCHOOL = {{Université Pierre et Marie Curie - Paris 6}},
  YEAR = 2003,
  MONTH = JUN,
  ABSTRACT = {Cette thèse présente un modèle d'architecture pour
                  la conception de moniteurs qui collectent, de
                  manière distribuée, les informations nécessaire à
                  l'adaptation des applications réparties sur Internet
                  aux conditions toujours changeantes de leur
                  environnement. Les moniteurs flexibles, déployés sur
                  les différents sites participants, sont coordonnés à
                  travers un service de contrôle et de dissémination
                  distribué. Cette architecture est fondée sur la
                  notion de composants hautement flexibles, assemblés
                  sous la forme de piles qui définissent les
                  traitements à effectuer pour capturer une métrique
                  donnée. Un prototype (Pandora) qui met en {\oe}uvre
                  cette architecture a été développé et utilisé comme
                  support d'exécution de plusieurs applications\,;
                  une, en particulier, s'appuie sur Pandora pour
                  effectuer une surveillance détaillée du protocole
                  HTTP fondée sur la capture passive de paquets
                  réseau.},
  KEYWORDS = {métrologie, composants, flexibilité, Internet},
  PS = {http://patarin.info/pub/patarin_these.ps.gz},
  PDF = {http://patarin.info/pub/patarin_these.pdf}
}

@TECHREPORT{lefessant03,
  AUTHOR = {Fabrice Le Fessant and Simon Patarin},
  TITLE = {{MLdonkey, a Multi-Network Peer-to-Peer File-Sharing
                  Program}},
  INSTITUTION = {INRIA},
  YEAR = 2003,
  TYPE = {Research Report},
  NUMBER = {RR-4797},
  MONTH = APR,
  ABSTRACT = {A lot of designers of functional languages have one
                  dream: finding a killer application, outside of the
                  world of symbolic programming (compilers, theorem
                  provers, DSLs), that would make their language
                  spread in the open-source community. One year ago,
                  we tackled this problem, and decided to use
                  Objective Caml to program a network application in
                  the emerging world of peer-to-peer systems. The
                  result of our work, MLdonkey, has superseded our
                  hopes: it is currently the most popular peer-to-peer
                  file-sharing client on the well-known
                  'freshmeat.net' site, with about 10,000 daily
                  users. Moreover, MLdonkey is the only client able to
                  connect to several peer-to-peer networks, to
                  download and share files. It works as a daemon,
                  running unattended on the computer, and can be
                  controlled remotely using three different kind of
                  interfaces. In this paper, we present the lessons we
                  learnt from its design and implementation.},
  KEYWORDS = {peer-to-peer, file sharing, functional programming},
  PS = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4797.ps.gz},
  PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-4797.pdf}
}

@INPROCEEDINGS{ogel03,
  AUTHOR = {Frédéric Ogel and Simon Patarin and Ian Piumarta and
                  Bertil Folliot},
  TITLE = {{C/SPAN: a Self-Adapting Web Proxy Cache}},
  BOOKTITLE = {Proceedings of the Autonomic Computing Workshop
                  (AMS 2003)},
  YEAR = 2003,
  ADDRESS = {Seattle, WA},
  MONTH = JUN,
  ABSTRACT = {In response to the exponential growth of Internet
                  traffic, web proxy caches are deployed
                  everywhere. Nonetheless, their efficiency relies on
                  a large number of intrinsically dynamic parameters,
                  most of which can not be predicted
                  statically. Furthermore, in order to react to
                  changing execution conditions~--- such as network
                  resources, user behavior or flash crowds, or to
                  update the web proxy with new protocols, services or
                  even algorithms ---~the entire system must be
                  dynamically adapted. Our response to this problem is
                  a self-adapting Web proxy cache, C/SPAN, that
                  applies administrative strategies to adapt itself
                  and react to external events. Because it is
                  completely flexible, even these adaptation policies
                  can be dynamically adapted.},
  PDF = {http://csdl.computer.org/dl/proceedings/ams/2003/1983/00/19830178.pdf},
  PAGES = {178--185}
}

@TECHREPORT{patarin03a,
  AUTHOR = {Simon Patarin and Mesaac Makpangou},
  TITLE = {{On-line Measurement of Web Proxy Cache Efficiency}},
  INSTITUTION = {INRIA},
  YEAR = 2003,
  TYPE = {Research Report},
  NUMBER = {RR-4782},
  MONTH = MAR,
  ABSTRACT = {This report presents how Pandora, our flexible
                  monitoring platform, can be used to continuously
                  measure the efficiency of a system of cooperating
                  proxy caches. It circumvents many of the drawbacks
                  of existing tools: Pandora integrates all stages
                  involved in the evaluation process, it operates in
                  real-time, it does not depend on specific cache
                  software, and it can be adapted to any specific
                  system configuration. We detail how this can be
                  achieved using the flexibility offered by
                  Pandora. We also present two experiments that
                  illustrate the utilisation of these techniques: the
                  first one evaluates the proxy cache deployed at
                  INRIA Rocquencourt, the second one measures the
                  efficiency of cooperating caches in an artificial
                  environment. Finally, we describe how we plan to
                  integrate these measurements inside an
                  auto-adaptative Web proxy cache.},
  KEYWORDS = {network monitoring, Web proxy cache, measurement,
                  efficiency},
  PS = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4782.ps.gz},
  PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-4782.pdf}
}

@INPROCEEDINGS{patarin03b,
  AUTHOR = {Simon Patarin and Mesaac Makpangou},
  TITLE = {{Continuous Measurement of Web Proxy Cache
                  Efficiency}},
  BOOKTITLE = {Eletronic Proceedings of the 12th International
                  World Wide Web Conference (WWW2003)},
  YEAR = 2003,
  ADDRESS = {Budapest, Hungary},
  MONTH = MAY,
  ABSTRACT = {This abstract presents how Pandora, our flexible
                  monitoring platform, can be used to continuously
                  measure the efficiency of a system of cooperating
                  proxy caches.},
  KEYWORDS = {network monitoring, World-Wide Web, proxy cache,
                  evaluation},
  URL = {http://patarin.info/pub/cache_www2003.html},
  PS = {http://patarin.info/pub/cache_www2003.ps.gz},
  PDF = {http://patarin.info/pub/cache_www2003.pdf}
}

@INPROCEEDINGS{patarin00a,
  AUTHOR = {Simon Patarin and Mesaac Makpangou},
  TITLE = {{Pandora: A Flexible Network Monitoring Platform}},
  BOOKTITLE = {Proceedings of the USENIX 2000 Annual Technical
                  Conference},
  ADDRESS = {San Diego, CA},
  YEAR = 2000,
  MONTH = JUN,
  ABSTRACT = {This paper presents Pandora, a network monitoring
                  platform that captures packets using purely passive
                  techniques. Pandora addresses current needs for
                  improving Internet middleware and infrastructure by
                  providing both in-depth understanding of network
                  usage and metrics to compare existing
                  protocols. Pandora is flexible and easy to use and
                  deploy. The elementary monitoring tasks are
                  encapsulated as independent entities we call
                  monitoring components. The actual packet analysis is
                  performed by stacking the appropriate
                  components. Pandora also preserves user privacy by
                  allowing control of the ``anonymization''
                  policy. Finally, the evaluation we conducted shows
                  that overheads due to Pandora's flexibility do not
                  significantly affect performance. Pandora is fully
                  functional and has already been used to collect Web
                  traffic traces at INRIA Rocquencourt. },
  KEYWORDS = {network monitoring, passive capture, flexibility,
                  components},
  URL = {http://www.usenix.org/events/usenix2000/general/full_papers/patarin/patarin_html/index.html},
  PS = {http://patarin.info/pub/pandora_usenix2000.ps.gz},
  PDF = {http://patarin.info/pub/pandora_usenix2000.pdf},
  PAGES = {27--40}
}

@TECHREPORT{patarin99a,
  AUTHOR = {Simon Patarin},
  TITLE = {{Pandora : un système de collecte de traces du
                  trafic Web de communautés d'utilisateurs réparties}},
  INSTITUTION = {INRIA},
  YEAR = 1999,
  TYPE = {Rapport de Recherche},
  NUMBER = {RR-3743},
  MONTH = JUL,
  ABSTRACT = {Pandora permet de collecter les informations
                  nécessaires pour caractériser le trafic Web d'une
                  communauté d'utilisateurs répartie. Les informations
                  sont obtenues en reconstituant le trafic HTTP
                  directement à partir des paquets réseau. Sur le plan
                  architectural, Pandora est constitué de trois
                  composants logiciels coopérants : un collecteur, un
                  observateur et un coordinateur, qui peuvent être
                  déployés en différents points du réseau. En interne,
                  chaque composant est implémenté par une série de
                  filtres. Cette architecture autorise une grande
                  souplesse d'utilisation et de déploiement. Les
                  traces fournies par Pandora donnent des informations
                  détaillées sur les profils des utilisateurs, les
                  serveurs, les documents accédés, le réseau et les
                  caches. Elles peuvent être utilisées pour déterminer
                  la politique de cache ou de réplication qui offre la
                  meilleure qualité de service possible aux
                  utilisateurs.},
  KEYWORDS = {trace, capture de paquets, cache, Web,
                  caractérisation},
  NOTE = {In French},
  PS = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-3743.ps.gz},
  PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-3743.pdf}
}