Optimization aspects of deadlock prevention in packet-switching networks

DOI10.1016/0377-2217(92)90300-XzbMath0760.90040OpenAlexW2062957438WikidataQ57387904 ScholiaQ57387904MaRDI QIDQ1197951

Giorgio Gambosi, Jerzy Brzeziński, Jacek Błażewicz

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90300-x

zbMATH Keywords

adaptive routingbuffer allocationpacket-switching networksstore-and-forward deadlock prevention

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

Approximating the buffer allocation problem using epochs

Cites Work

• Unnamed Item
• Unnamed Item
• Using Barrier Graphs for Deadlock Prevention in Communication Networks
• Time-Stamp Approach to Store-and-Forward Deadlock Prevention
• Deadlock-Free Packet Switching Networks

This page was built for publication: Optimization aspects of deadlock prevention in packet-switching networks