Universal bufferless routing

DOI10.1007/978-3-540-31833-0_20MaRDI QIDQ5713441zbMATH OpenOpenAlexFDO

Authors Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106130

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Universal Bufferless Packet Switching
• scientific article; zbMATH DE number 1256753
• Direct routing: Algorithms and complexity
• Direct routing: Algorithms and complexity
• Efficient bufferless packet switching on trees and leveled networks

Cited in

(7)

• Universal continuous routing strategies
• Efficient bufferless packet switching on trees and leveled networks
• Universal Bufferless Packet Switching
• scientific article; zbMATH DE number 1256753 (Why is no real title available?)
• On bufferless routing of variable length messages in leveled networks
• A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing
• Universal routing schemes

This page was built for publication: Universal bufferless routing

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