Routing Number Of A Pyramid
Indranil Banerjee, Dana Richards

TL;DR
This paper determines the routing number of a pyramid graph under the routing via matching model, showing it scales as O(dN^{1/d}) for a d-dimensional pyramid with N nodes.
Contribution
It provides the first explicit routing number for pyramid graphs in the routing via matching model, extending understanding of communication complexity in such networks.
Findings
Routing number of d-dimensional pyramid is O(dN^{1/d})
The result applies to the routing via matching model
Improves understanding of communication schemes in pyramid networks
Abstract
In this short note we give the routing number of pyramid graph under the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph with vertices labeled from and a permutation giving the destination of pebbles on the vertices the problem is to find a minimum step routing scheme. This is denoted as the routing time of given . We show that a -dimensional pyramid with levels has a routing number of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSupply Chain and Inventory Management · Limits and Structures in Graph Theory · Economic theories and models
