scientific article; zbMATH DE number 1173684

MaRDI QIDQ4397705zbMATH OpenFDO

Authors Christian Scheideler

Publication date 12 July 1998

zbMATH Keywords

adaptive routingrandomized routing

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Universal continuous routing strategies
• An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks
• UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• Shortest-Path Routing in Arbitrary Networks
• Deterministic on-line routing on area-universal networks
• How much can hardware help routing?
• scientific article; zbMATH DE number 1760011 (Why is no real title available?)
• A packet routing protocol for arbitrary networks
• Universal routing schemes
• Deterministic routing with bounded buffers: turning offline into online protocols

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)