Advertisement

Combinatorial and Algorithmic Aspects of Networking

4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers

  • Editors
  • Jeannette Janssen
  • Paweł Prałat
Conference proceedings CAAN 2007

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4852)

Table of contents

  1. Front Matter
  2. Invited Lectures (Abstracts)

    1. Peter Winkler
      Pages 1-1
  3. Contributed Papers

    1. Margaret-Ellen Messinger, Paweł Prałat, Richard J. Nowakowski, Nicholas Wormald
      Pages 13-26
    2. Tobias Harks, László A. Végh
      Pages 27-45
    3. Anthony Bonato, Paweł Prałat, Changping Wang
      Pages 46-56
    4. Leah Epstein, Rob van Stee
      Pages 57-70
    5. Ioannis Milis, Aris Pagourtzis, Katerina Potika
      Pages 71-84
    6. Guillermo De Ita, Aurelio López-López
      Pages 85-98
    7. Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
      Pages 99-111
    8. Zareen Alamgir, Sarmad Abbasi
      Pages 112-130
    9. Jose M. Gutierrez Lopez, Ruben Cuevas Rumin, Jens M. Pedersen, Ole B. Madsen
      Pages 131-148
  4. Back Matter

About these proceedings

Introduction

The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to - citing new research directions in mathematics and theoretical computer science, especially in the areas of combinatorics and algorithms. The Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007) was organized to be a place where the latest research developments on all aspects of networking could be presented. The topics covered were diverse, with talks on strategies for searching in networks, for cleaning networks of unwanted - truders, on di?erent routing strategies, and on scheduling and load balancing. The workshop started with an invited lecture by Peter Winkler of Dartmouth College, who gave a general talk on a topic related to probability, a concept central to network modeling and managing. The afternoon opened with a short invited talk by Alejandro Lop ´ ez-Ortiz, who gave an overview of various issues in designing resilient backbone networks. CAAN 2007 took place on August 14, 2007, at Dalhousie University in Halifax, Nova Scotia, Canada, co-located with the Workshop on Algorithms and Data Structures (WADS 2007). Three previous CAAN workshops were held in Chester, UK (CAAN 2006), Waterloo, Ontario, Canada (CAAN 2005), and in Ban?, Alberta, Canada (CAAN 2004), respectively.

Keywords

Online Routing algorithms approximation algorithms combinatorial algorithms communication networks complete graph complex networks data stream analysis exact counting game theory generation of paths load balancing network dynamics stochastic network

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-77294-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-77293-4
  • Online ISBN 978-3-540-77294-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site