scientific article; zbMATH DE number 1173684

zbMATH Open0896.90085MaRDI QIDQ4397705FDOQ4397705

Authors: Christian Scheideler 

Publication date: 12 July 1998

Title of this publication is not available (Why is that?)

Recommendations

• Deterministic routing with bounded buffers: turning offline into online protocols
• An optimal time bound for oblivious routing
• Deterministic on-line routing on area-universal networks
• Tight bounds for oblivious routing in the hypercube
• Shortest-Path Routing in Arbitrary Networks

zbMATH Keywords

adaptive routingrandomized routing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)

Cited In (8)

• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• Title not available (Why is that?)
• UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
• Deterministic routing with bounded buffers: turning offline into online protocols
• An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks
• Universal routing schemes
• Shortest-Path Routing in Arbitrary Networks
• A packet routing protocol for arbitrary networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397705)