Quality-of-Service routing with path information aggregation

DOI10.1016/J.COMNET.2007.02.008zbMATH Open1118.68346OpenAlexW2092167872MaRDI QIDQ997190FDOQ997190

Authors: J. Martínez 

Publication date: 23 July 2007

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2007.02.008

Recommendations

• scientific article; zbMATH DE number 1717139
• scientific article; zbMATH DE number 1955773
• Efficient QoS routing.
• Distributed Computing – IWDC 2005
• Maximum delay computation under traffic matrix uncertainty and its application to interdomain path selection

zbMATH Keywords

interdomain routingQoS routingpath selectiondistance vector protocolsQoS parameter representationtopology aggregation

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• On the complexity of quality of service routing
• Title not available (Why is that?)
• Interdomain quality of service negotiation using DEA analysis and Petri nets
• Distributed Computing – IWDC 2005
• Maximum delay computation under traffic matrix uncertainty and its application to interdomain path selection

This page was built for publication: Quality-of-Service routing with path information aggregation

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