On devising Boolean Routing Schemes

DOI10.1016/S0304-3975(97)86543-7MaRDI QIDQ1389768zbMATH OpenFDO

Authors Michele Flammini, Giorgio Gambosi

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(97)86543-7

zbMATH Keywords

Boolean routing model

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 3940741
• Efficient Message Routing in Planar Networks
• Improved routing strategies with succinct tables
• Space-Efficient Message Routing inc-Decomposable Networks
• Interval routing schemes

Cites work

• Characterization results of all shortest paths interval routing schemes
• Designing networks with compact routing tables
• Efficient Message Routing in Planar Networks
• scientific article; zbMATH DE number 3940741 (Why is no real title available?)
• Interval Routing
• Interval routing schemes
• Labelling and Implicit Routing in Networks
• On Multi-Label Linear Interval Routing Schemes

Cited in

(6)

• Routes enumeration in a Boolean with respect to intersection and nonintersection relations
• The compactness of adaptive routing tables
• Characterization results of all shortest paths interval routing schemes
• Compact and localized distributed data structures
• Interpolative Boolean algebra based multicriteria routing algorithm
• On devising Boolean Routing schemes

This page was built for publication: On devising Boolean Routing Schemes

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