Single path routing with delay considerations
From MaRDI portal
(Redirected from Publication:4017614)
\({\mathcal NP}\)-completebroadcastingheuristichigh traffic networksminiumum spanning treemultiple source-destination pairsoptimal routingring network
Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(13)- Efficient delay routing
- The minimum labeling spanning trees
- Minimum-delay schedules in layered networks
- Routing equal-size messages on a slotted ring
- k-pair delay constrained minimum cost routing in undirected networks
- FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
- scientific article; zbMATH DE number 4077133 (Why is no real title available?)
- A minimax approach to a simple routing problem
- Adaptive Source Routing in High-Speed Networks
- Routing with delays when storage is costly
- Computational Science - ICCS 2004
- Mathematical models of the delay constrained routing problem
- Optimal path selection for minimizing the differential delay in Ethernet-over-SONET
This page was built for publication: Single path routing with delay considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017614)