Abstract
The packet routing problem plays an essential role in communication networks. It consists in transferring data from some origins to some destinations within a reasonable amount of time. In the (l, k)-routing problem, each node can send at most l packets and receive at most k packets. Permutation routing is the particular case l = k = 1. In the r-central routing problem, all nodes at distance at most r from a fixed node v want to send a packet to v. Here, we survey the results on permutation routing, the r-central routing, and the general (l, k)-routing problems on regular plane grids, that is, square grids, triangular grids, and hexagonal grids. We assume the store-and-forward Δ-port model with synchronous transmission, and we consider both full and half-duplex networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
