This book constitutes the thoroughly refereed post-conference proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007, held in Halifax, Canada, in August 2007, co-located with the 10th Workshop on Algorithms and Data Structures, WADS 2007. The main focus is on strategies for searching in networks, and for cleaning networks of unwanted intruders, on different routing strategies, and on scheduling and load balancing.
|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.
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.
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.
Inhaltsverzeichnis
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.
Klappentext
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.
