Contents

• Introduction
• The Model of Interval Routing
  • Definition of Interval Routing
  • Compactness, Linearity and Strictness of Interval Routing
  • Coding of Interval Routing
  • Characterizations
  • Efficiency of Interval Routing: Dilation and Stretch Factor
  • Complexity of Characterization
• Specific Class of Graphs
  • Extremal Compactness
  • Interconnection Networks
  • Chordal Rings
  • Planar Graphs
  • Treewidth Bounded Graphs
  • Random Graphs
  • Other Classes of Graphs
  • Graph Operators
  • Summary
• Variations on the Interval Routing Model
  • Fixed and Dynamic Link-Cost Models
  • Hierarchy of the IRS Classes
  • Non-Deterministic Interval Routing Schemes
  • Deadlock-Free Interval Routing Schemes
  • Congestion of Interval Routing
  • Interval Routing for Distributed Problems
• Bibliography
• Contents