From Static To Dynamic Routing: Efficient Transformations Of Store-and-Forward Protocols.pdf

STOC-99.pdf
Preview of From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
🔗 Source: ris.uni-paderborn.de
📊 Size: 221 KB
📄 Pages: 29 pages
⬇️ Downloads: 66

Summary

- Objective: Transform static store-and-forward routing algorithms into efficient dynamic ones, adapting them to realistic scenarios with continuous packet injections.
- Approach:
- Describe specific transformations for known static algorithms (e.g., ghost packet protocol, growing rank protocol).
- Present a black-box transformation scheme applicable to any static, oblivious routing algorithm.
- Results:
- First dynamic routing algorithm for leveled networks, stable for arbitrary admissible injection rates, with buffers of size depending only on injection rate and node degree, not network size. Packets have strong delay bounds, e.g., 99% throughput on an input butterfly network with constant-sized buffers.
- Black-box transformation ensures stability up to a maximum possible injection rate if the static algorithm is pure. In stochastic model, routing time depends on local parameters; in adversarial model, delay bound is related to the static algorithm's time bound.
- Publication Details: Department of Mathematics and Computer Science, Paderborn University, Germany. Supported by DFG-Sonderforschungsbereich 376 and EU ESPRIT Long Term Research Project 20244 (ALCOM-IT).

Description

We transform static store-and-forward routing algorithms into efficient dynamic algorithms. This allows static algorithms to adapt to realistic scenarios with continuous packet injections. Our transformations are applicable to various static routing algorithms.

Technical Information

  • File Format: PDF
  • File Size: 221 KB
  • Pages: 29
  • Language: EN
  • Total Downloads: 66
  • Last Updated: 2 weeks ago

Document Overview

This PDF document about From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols provides comprehensive information and guidance. Whether you're a beginner or advanced user, this resource offers valuable insights into From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.

Related Topics

If you're interested in From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols, you might also want to explore:

Download From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols eBooks for free and learn more about From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. These books contain exercises and tutorials to improve your practical skills, at all levels!

Not satisfied with this document? We have related documents to From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols, try searching with similar keywords: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols, Static Routing Vs Dynamic Routing, Routed Protocols And Routing Protocols, Introduction To Dynamic Routing Protocols Pdf, Introduction To Dynamic Routing Protocols Study Guide, M IGCSE 2014 099 Transformations Transformations A, static and dynamic beer and johnston, Routing Protocols And Concepts Ccna Exploration Labs And Study Guide

You can download PDF versions of the user's guide, manuals and ebooks about From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols, you can also find and download for free A free online manual (notices) with beginner and intermediate, Downloads Documentation, You can download PDF files (or DOC and PPT) about From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols for free, but please respect copyrighted ebooks.