New Routing Strategies for RSP Problems with Concave Cost

DOI10.1007/978-3-540-89985-3_51MaRDI QIDQ3628492zbMATH OpenOpenAlexFDO

Authors Marjan Momtazpour, Pejman Khadivi

Publication date 20 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89985-3_51

zbMATH Keywords

ad hoc networkingquality of serviceroutingRSP

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
• On the complexity of quality of service routing
• scientific article; zbMATH DE number 1670670
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL

Cited in

(2)

• New inequalities for the general routing problem
• A survey on multi-constrained optimal path computation: exact and approximate algorithms

This page was built for publication: New Routing Strategies for RSP Problems with Concave Cost

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