LEA
Department of Computer Science at the Technische Universität München
Chair for Efficient Algorithms
Postal address: 80290 München; Premises: Arcisstr.21, 80333 München
deutsch

Seminar: Routing in Fast Networks

Time : Thu 14:15 - 16:00, Room S2229
[Summary] [List of Topics] [List of Talks]

Summary

Efficient communication in digital networks is becoming increasingly important. Applications lie in wide-area networks like the Internet as well as in local-area networks that are used for parallel computation and for distributed applications (e.g., multimedia). A basic question that must be addressed in every network is the routing problem, i.e., the determination of paths along which data is transmitted from sender to receiver. In addition, transmission units must be selected: while traditional networks have used store-and-forward packet routing for a long time, more recent routing paradigms like wormhole routing, virtual-cut-through routing, and circuit routing are widely used today.

The individual talks in this seminar will present research results that have been obtained for routing problems in fast networks over the past 5 to 10 years. In addition to new results pertaining to packet routing, the focus is on routing algorithms that have been developed for modern networks like ATM networks or optical networks.

The following topics can be selected for talks:

  1. Deflection Routing
  2. Interval Routing
  3. Wormhole Routing
  4. Routing in Expander Graphs
  5. Universal Packet Routing
  6. Deterministic Permutation Routing with Bounded Buffers
  7. Universal Dynamic Routing
  8. Dynamic Routing with Bounded Buffers
  9. Stability of Dynamic Routing Protocols
  10. Circuit Routing
  11. Optimal Dissemination of Information in Networks with Fast Switches
  12. Path Layout in ATM Networks
  13. Path Layout in ATM Chains
  14. Routing in optical Networks
  15. Routing in optical Networks II

A list of topics with references is available as PostScript file.

List of Talks

5.6.97: Ralf Engelschall
Optimal Dissemination of Information in Networks with Fast Switches (Topic 11)
12.6.97: Daniel Lang
Universal Dynamic Routing (Topic 7)
19.6.97: ??
?? (Topic ??)
26.6.97: ??
?? (Topic ??)
3.7.97: ??
?? (Topic ??)
10.7.97: ??
?? (Topic ??)
17.7.97: ??
?? (Topic ??)
24.7.97: ??
?? (Topic ??)
31.7.97: ??
?? (Topic ??)

For further information contact Thomas Erlebach or Tom Friedetzky.

Thomas Erlebach, 1997-Feb-17
Tobias Knopff, 1997-04-16