Combinatorial and Algorithmic Aspects of Networking : 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers / edited by Pawel Pralat, Jeannette Janssen.

Format:

Book

Contributor:

Prałat, Paweł, editor.

Janssen, Jeannette, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Computer communication networks and telecommunications ; SL 5, 4852.

Computer Communication Networks and Telecommunications ; 4852

Language:

English

Subjects (All):

Computer networks.

Application software.

Computer organization.

Algorithms.

Game theory.

Computer Communication Networks.

Information Systems Applications (incl. Internet).

Computer Systems Organization and Communication Networks.

Algorithm Analysis and Problem Complexity.

Game Theory, Economics, Social and Behav. Sciences.

Local Subjects:

Computer Communication Networks.

Information Systems Applications (incl. Internet).

Computer Systems Organization and Communication Networks.

Algorithm Analysis and Problem Complexity.

Game Theory, Economics, Social and Behav. Sciences.

Physical Description:

1 online resource (VIII, 152 pages).

Edition:

First edition 2007.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.

System Details:

text file PDF

Summary:

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.

Contents:

Invited Lectures (Abstracts)

Luck vs. Skill

Valiant Load Balancing, Benes Networks and Resilient Backbone Design

Contributed Papers

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

Nonadaptive Selfish Routing with Online Demands

Vertex Pursuit Games in Stochastic Network Models

Preemptive Scheduling on Selfish Machines

Selfish Routing and Path Coloring in All-Optical Networks

A Worst-Case Time Upper Bound for Counting the Number of Independent Sets

Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP

Combinatorial Algorithms for Listing Paths in Minimal Change Order

Improving Topological Routing in N2R Networks.

Other Format:

Printed edition:

ISBN:

978-3-540-77294-1

9783540772941

Access Restriction:

Restricted for use by site license.