Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

There is no optimal routing policy for the torus.

From MaRDI portal
Publication:1853093
Jump to:navigation, search

DOI10.1016/S0020-0190(02)00217-XzbMath1043.68011MaRDI QIDQ1853093

Loren Schwiebert

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

Interconnection networksTorusOptimal routing policyRouting policy


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10)


Related Items (3)

The number of shortest paths in the (n, k)-star graph ⋮ The number of shortest paths in the arrangement graph ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs



Cites Work

  • Unnamed Item
  • An optimal shortest-path routing policy for network computers with regular mesh-connected topologies


This page was built for publication: There is no optimal routing policy for the torus.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853093&oldid=14237126"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki