Optimal Node Routing

DOI10.1007/11672142_49MaRDI QIDQ5449834zbMATH OpenOpenAlexFDO

Authors Yoel Chaiutin, Yossi Azar

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Online packet-routing in grids with bounded buffers
• Packet Routing: Complexity and Algorithms
• Algorithms – ESA 2004
• The network as a storage device: dynamic routing with bounded buffers
• scientific article; zbMATH DE number 1754634

Cited in

(9)

• Optimum watchman routes
• Deferred on-line bipartite matching
• Competitive router scheduling with structured data
• Competitive router scheduling with structured data
• On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
• Packet forwarding algorithms in a line network
• scientific article; zbMATH DE number 6469145 (Why is no real title available?)
• A new impossibility result for online bipartite matching problems
• On-line maximum matching in complete multi-partite graphs with an application to optical networks

This page was built for publication: Optimal Node Routing

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