IFIPINRIAPerformance 2005

HOME

CFP

ORGANIZERS

COMMITTEE

SUBMISSION

REGISTRATION

PROGRAM

TUTORIALS

POSTERS

TRAVEL GRANTS

VENUE

LINKS

The conference will last 3 full days, from Wednesday 5 until Friday 7 at the end of the afternoon. There will be a welcome reception on Tuesday 4, from 7pm to 8pm.

TECHNICAL PROGRAM

Tuesday, October 4, 2005
Welcome reception
Wednesday, October 5, 2005
Welcome Session 1 Coffee break Session 2 Lunch Posters Session 3 Coffee break Work in progress
Thursday, October 6, 2005
Session 4 Coffee break Session 5 Lunch Keynote Session 6 Coffee break Session 6 Banquet
Friday, October 7, 2005
Session 7 Coffee break Session 8 Lunch Keynote Session 9 Coffee break Session 9

Tuesday, October 4, 2005

19:00 – 20:00 : Welcome reception

Wednesday, October 5, 2005

08:00 : Registration desk opens

08:40 – 09:00 : Welcome (General chair and PC chairs)

09:00 – 10:30 : Session 1 : Peer-to-Peer Networks
Session chair : Edmundo de Souza e Silva

  • A Simple Analytical Framework to Analyze Search Strategies in Large-Scale Peer-to-Peer Network (slides)
    Rossano Gaeta, Dipartimento di Informatica, UniversitÓ di Torino
    Gianfranco Balbo, Dipartimento di Informatica, UniversitÓ di Torino
    Steve Bruell, Computer Science Department, University of Iowa
    Marco Gribaudo, Dipartimento di Informatica, UniversitÓ di Torino
    Matteo Sereno, Dipartimento di Informatica, UniversitÓ di Torino
  • Statistical Modelling of Information Sharing: Community, Membership and Content (slides)
    Wai Yin Ng, The Chinese University of Hong Kong
    Wing Kai Lin, The Chinese University of Hong Kong
    Dah Ming Chiu, The Chinese University of Hong Kong
  • Multiclass P2P Networks: Static Resource Allocation for Service Differentiation and Bandwidth Diversity (slides)
    Florence ClÚvenot-Perronnin, INRIA Sophia Antipolis
    Philippe Nain, INRIA Sophia Antipolis
    Keith Ross, Polytechnic University, New York

10:30 – 11:00 : Coffee break

11:00 – 12:30 : Session 2 : CDMA Networks
Session chair : Leana Golubchik

  • Conservative Estimates on Blocking and Outage Probabilities in CDMA Networks
    Thomas Bonald, France Telecom
    Alexandre ProutiŔre, France Telecom
  • Delay Analysis of Downlink IP Traffic on UMTS Mobile Networks
    Jesse Landman, University of Cape Town
    Pieter Kritzinger, University of Cape Town
  • Impacts of Data Call Characteristics on Multi-Service CDMA System Capacity
    Yujing Wu, Department of Computer Science, University of Calgary
    Carey Williamson, Department of Computer Science, University of Calgary

12:30 – 14:15 : Lunch

14:15 – 15:15 : Posters presentations : list of accepted posters

15:15 – 16:45 : Session 3 : Queueing Analysis (I)
Session chair : Rudesindo N˙˝ez-Queija

  • Decomposing the Queue Length Distribution of Processor-Sharing Models into Queue Lengths of Permanent Customer Queues (slides)
    Sing-Kong Cheung, University of Twente
    Hans van den Berg, TNO Information and Communication Technology & University of Twente
    Richard J. Boucherie, University of Twente
  • Approximate Solutions for Heavily Loaded Markov-Modulated Queues
    Isi Mitrani, University of Newcastle
  • Fluid Queues to Solve Jump Processes (slides)
    Tessa Dzial, UniversitÚ Libre de Bruxelles
    Lothar Breuer, University of Trier
    Ana da Silva Soares, UniversitÚ Libre de Bruxelles
    Guy Latouche, UniversitÚ Libre de Bruxelles
    Marie-Ange Remiche, UniversitÚ Libre de Bruxelles

16:45 – 17:15 : Coffee break

17:15 – 18:30 : Work-in-Progress Session
Session chair : Konstantin Avrachenkov

Thursday, October 6, 2005

09:00 – 10:30 : Session 4 : Statistical Analysis of Internet Traffic
Session chair : Vishal Misra

  • Network Tomography from Aggregate Loss Reports
    Nick Duffield, AT&T Labs – Research, NJ, USA
    Vijay Arya, INRIA, Sophia Antipolis, France
    Remy Bellino, U. P. & M. Curie, Laboratoire LiP6-CNRS, Paris, France
    Timur Friedman, U. P. & M. Curie, Laboratoire LiP6-CNRS, Paris, France
    Joseph Horowitz, University of Massachusetts
    Don Towsley, University of Massachusetts
    Thierry Turletti, INRIA, Sophia Antipolis, France
  • Splitting and Merging of Packet Traffic: Measurement and Modelling (slides)
    Nicolas Hohn, University of Melbourne
    Darryl Veitch, University of Melbourne
    Tao Ye, Sprint
  • High Quantile Estimation for Heavy-Tailed Distributions
    Natalia Markovich, Institute of Control Sciences, Russian Academy of Sciences

10:30 – 11:00 : Coffee break

11:00 – 12:30 : Session 5 : Routing in Ad Hoc and Overlay Networks
Session chair : Daniel MenascÚ

  • Scalability of Routing Methods in Ad Hoc Networks
    Valery Naumov, ETH Zentrum
    Thomas Gross, ETH Zentrum
  • The Message Delay in Mobile Ad Hoc Networks (slides)
    Robin Groenevelt, INRIA
    Philippe Nain, INRIA
    Ger Koole, Vrije Universiteit
  • On the Interaction of Multiple Overlay Routing (slides) Best student paper
    Joe Wenjie Jiang, Department of Computer Science & Engineering, The Chinese University of Hong Kong
    Dah-Ming Chiu, Information Engineering Department, The Chinese University of Hong Kong
    John C.S. Lui, Computer Science & Engineering Department, The Chinese University of Hong Kong

12:30 – 14:15 : Lunch

14:15 – 15:15 : Keynote lecture : Performance Challenges in Secure Vehicular Networks (slides)
Chairman : Don Towsley

    Keynote speaker : Jean-Pierre Hubaux, EPFL

    Abstract : Vehicular networks bring the promise of increased safety and efficiency of road traffic; they are likely to become the most important incarnation of mobile ad hoc networks. Yet, a number of technical issues still need to be solved, owing to the stringent constraints of system response time and node velocity. In addition, it appears that securing this family of networks is both mandatory and very challenging; each node must perform a high number of cryptographic and communication operations in order to protect the network against possible attacks (see e.g. http://ivc.epfl.ch). In this talk, we will first explain the overall context of vehicular networks and then focus on their security, an issue that has been (surprisingly) overlooked by the research community. We will then describe the related performance challenges and sketch how they could be tackled. The understanding of this talk does not require any specific expertise in security or in cryptography, as we will introduce the (few) necessary concepts.

    Speaker's biography : http://people.epfl.ch/jean-pierre.hubaux

15:15 – 16:15 : Session 6 : Bandwidth Sharing
Session chair : Thomas Bonald

  • Stability of Size-Based Scheduling Disciplines in Resource-Sharing Networks (slides)
    Maaike Verloop, CWI
    Sem Borst, CWI
    Rudesindo N˙˝ez-Queija, CWI
  • Integration of Streaming Services and TCP Data Transmission in the Internet (slides)
    Nelson Antunes, INRIA/University of Algarve
    Christine Fricker, INRIA
    Fabrice Guillemin, France Telecom
    Philippe Robert, INRIA

16:15 – 16:45 : Coffee break

16:45 – 17:45 : Session 6 (continued) : Bandwidth Sharing

  • Controllable Fair Queuing for Meeting Performance Goals (slides)
    Magnus Karlsson, HP Labs
    Christos Karamanolis, HP Labs
    Jeff Chase, Duke University
  • An Evolutionary Game-Theoretic Approach to Congestion Control (slides)
    Daniel MenaschÚ, Federal University of Rio de Janeiro
    Daniel Figueiredo, University of Massachusetts
    Edmundo de Souza e Silva, Federal University of Rio de Janeiro

Friday, October 7, 2005

09:00 – 10:30 : Session 7 : Queueing Analysis (II)
Session chair : William Stewart

  • A Performance Model for an Asynchronous Optical Buffer (slides)
    Wouter Rogiest, SMACS Research Group, Ghent University (UGent)
    Koenraad Laevens, SMACS Research Group, Ghent University (UGent)
    Dieter Fiems, SMACS Research Group, Ghent University (UGent)
    Herwig Bruneel, SMACS Research Group, Ghent University (UGent)
  • Bridging ETAQA and Ramaswami's Formula for the Solution of M/G/1-type Processes (slides)
    Andreas Stathopoulos, College of William and Mary
    Alma Riska, Seagate Research
    Zhili Hua, College of William and Mary
    Evgenia Smirni, College of William and Mary
  • An Improved Method for Bounding Stationary Measures of Finite Markov Processes (slides)
    Peter Buchholz, Informatik IV, Universitńt Dortmund

10:30 – 11:00 : Coffee break

11:00 – 12:30 : Session 8 : Performance Guarantees
Session chair : John C.S. Lui

  • "Pay Bursts Only Once" Does not Hold for Non-FIFO Guaranteed Rate Nodes (slides)
    Jean-Yves Le Boudec, EPFL, Switzerland
    Gianluca Rizzo, EPFL, Switzerland
  • On the Compromise between Burstiness and Frequency of Events (slides)
    Alain Jean-Marie, INRIA and LIRMM
    Yvan Calas, ID-IMAG
    Tigist Alemu, INRIA and LIRMM
  • Optimal Capacity Allocation for Web Systems with End-to-End Delay Guarantees
    Wuqin Lin, Georgia Institute of Technology
    Zhen Liu, IBM Research
    Cathy H. Xia, IBM Research
    Li Zhang, IBM Research

12:30 – 14:15 : Lunch

14:15 – 15:15 : Keynote lecture : A Virtual Collocation Layer for Control over Networks
Chairman : Guy Latouche

    Keynote speaker : P.R. Kumar, University of Illinois at Urbana-Champaign

    Abstract : We are on the threshold of an era of building large automated systems, e.g., smart highways or air transportation management systems. We expect control, i.e., both sensing and actuation, over networks to represent an important aspect of the next phase of the information technology revolution. In order to facilitate its proliferation we believe that it is important to elucidate what are appropriate abstractions and what is a matching architecture. Also important are performance analysis, and a theoretical framework for design and operation. We describe our efforts in this direction. We propose a virtual collocation layer that is supported by a middleware called Etherware. We illustrate several applications running in a laboratory testbed in our Convergence Laboratory. Finally, we sketch an outline for addressing overall performance. (Joint work with Girish Baliga, Scott Graham, Craig Robinson and Hans-Joerg Schuetz).

    Speaker's biography : http://black1.csl.uiuc.edu/~prkumar/

15:15 – 16:15 : Session 9 : Load Balancing and Content Distribution
Session chair : Evgenia Smirni

  • Multi-path Streaming: Optimization of Load Distribution
    Alix L.H. Chow, University of Southern California
    Leana Golubchik, University of Southern California
    John C.S. Lui, The Chinese University of Hong Kong
    Adam W.-J. Lee, University of Maryland
  • Measuring Consistency in TTL-based Caches
    Omri Bahat, The University of Maryland at College Park
    Armand Makowski, The University of Maryland at College Park

16:15 – 16:45 : Coffee break

16:45 – 17:45 : Session 9 (continued) : Load Balancing and Content Distribution

  • Systems with Multiple Servers under Heavy-Tailed Workloads
    Konstantinos Psounis, University of Southern California
    Pablo Pablo Molinero-Fernandez, Stanford University
    Balaji Prabhakar, Stanford University
    Fragkiskos Papadopoulos, University of Southern California
  • Optimal State-Free, Size-Aware Dispatching for Heterogeneous M/G/-type Systems (slides)
    Hanhua Feng, Computer Science, Columbia University
    Vishal Misra, Computer Science, Columbia University
    Dan Rubenstein, Electrical Engineering, Columbia University

POSTERS

  • Extinction probability in peer-to-peer file diffusion
    S. Hautphenne, UniversitÚ Libre de Bruxelles
    K. Leibnitz, Osaka University
    M.A. Remiche, UniversitÚ Libre de Bruxelles
  • Analysis of peer-to-peer file dissemination amongst users of different upload capacities
    J. Mundinger, University of Cambridge
    R. Weber, University of Cambridge
    G. Weiss, University of Haifa
  • Improving distributed system performance using machine availability prediction
    J.W. Mickens, University of Michigan
    B.D. Noble, University of Michigan
  • On checkpointing and heavy-tails in unreliable computing environments
    C. Bossie, University of Southern Maine
    P.M. Fiorini, University of Southern Maine
  • Evaluating caching policies for online auctions
    D.A. Menasce, George Mason University
    V. Akula, George Mason University
  • The GAIA sensor: an early DDoS detection tool
    E. Besson, France Telecom
    A. Gouget, France Telecom
    H. Sibert, France Telecom
  • From switching theory to "queueing" theory
    C.S. Chang, National Tsing Hua University
    Y.T. Chen, National Tsing Hua University
    J. Cheng, National Tsing Hua University
    P.K Huang, National Tsing Hua University
    D.S. Lee, National Tsing Hua University
  • Buffer overflow calculations in a batch arrival queue
    A. Chydzinski, Silesian University of Technology
  • Perfect simulation of index based routing queueing networks
    J.M. Vincent, IMAG
    J. Vienne, IMAG
  • Bounding transient and steady-state dependability measures through algorithmic stochastic comparison approach
    A. Busic, UniversitÚ de Versailles Saint-Quentin
    J.M. Fourneau, UniversitÚ de Versailles Saint-Quentin
  • Probability of connection in regular stochastic networks
    G. Hardy, LARIA
    C. Lucet, LARIA
    N. Limnios, UniversitÚ de Technologie de CompiŔgne
  • Cross-layer power control in wireless networks
    A. Giannoulis, University of Thessaly
    K.P. Tsoukatos, University of Thessaly
    L. Tassioulas, University of Thessaly