UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1953174
- Universal routing schemes
- Universal packet routing with arbitrary bandwidths and transit times
- Distributed routing in a fault-tolerant multistage interconnection network
- Distributed asynchronous optimal routing in data networks
- scientific article; zbMATH DE number 1256753
- Distributed dynamical omnicast routing
- Routing-proofness in congestion-prone networks
- scientific article; zbMATH DE number 1173684
- Distributed fault-tolerant routing in Kautz networks
Cites work
- A compact layout for the three-dimensional tree of meshes
- A framework for solving VLSI graph layout problems
- Adaptive packet routing for bursty adversarial traffic
- Adversarial queuing theory
- Communication-efficient parallel algorithms for distributed random-access machines
- Deterministic on-line routing on area-universal networks
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- scientific article; zbMATH DE number 710624 (Why is no real title available?)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Randomized Routing and Sorting on Fixed-Connection Networks
- Universal-stability results and performance bounds for greedy contention-resolution protocols
Cited in
(2)
This page was built for publication: UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636561)