Single path routing with delay considerations

DOI10.1016/0169-7552(92)90087-7MaRDI QIDQ4017614zbMATHOpenAlexFDO

Authors Rahul Simha, Bhagirath Narahari

Publication date 16 January 1993

Published in Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-7552(92)90087-7

zbMATH Keywords

heuristicbroadcastingoptimal routingring network\({\mathcal NP}\)-completehigh traffic networksminiumum spanning treemultiple source-destination pairs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Efficient delay routing
• Transmissions in a network with capacities and delays
• Minimum-delay schedules in layered networks
• Mathematical models of the delay constrained routing problem
• Routing with delays when storage is costly

Cited in

(9)

• Routing equal-size messages on a slotted ring
• Computational Science - ICCS 2004
• Routing with delays when storage is costly
• Optimal path selection for minimizing the differential delay in Ethernet-over-SONET
• FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
• Mathematical models of the delay constrained routing problem
• The minimum labeling spanning trees
• scientific article; zbMATH DE number 4077133 (Why is no real title available?)
• \(k\)-pair delay constrained minimum cost routing in undirected networks

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)