Network routing on regular digraphs and their line graphs

Vance Faber () and Noah Streib
Additional contact information
Vance Faber: Center for Computing Sciences
Noah Streib: Center for Computing Sciences

Journal of Scheduling, 2024, vol. 27, issue 6, No 3, 557-564

Abstract: Abstract This paper concerns all-to-all network routing on regular digraphs. In previous work, we focused on efficient routing in highly symmetric digraphs with low diameter for fixed degree. Here, we show that every connected regular digraph has an all-to-all routing scheme and associated schedule with no waiting. In fact, this routing scheme becomes more efficient as the diameter goes down with respect to the degree and number of vertices. Lastly, we examine the simple scheduling algorithm called “farthest-distance-first” and prove that it yields optimal schedules for all-to-all communication in networks of interest, including Kautz graphs.

Keywords: Network routing; Digraphs; Scheduling all-to-all communication (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-024-00823-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:27:y:2024:i:6:d:10.1007_s10951-024-00823-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-024-00823-y

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().