Source Routing and Scheduling in Packet Networks: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:2304:23, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,600 bytes 0‎ No edit summary undo
  • curprev 04:2304:23, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,600 bytes +1,600‎ Created page with "Title: Source Routing and Scheduling in Packet Networks Research Question: How can we design an efficient routing and scheduling system for packet-switched networks, especially when dealing with an adversary that controls the injection time, source, and destination for each packet? Methodology: The researchers proposed a source routing algorithm that finds a set of admissible paths for packets. This algorithm calculates a path for each packet as soon as it is injected..."
Retrieved from "https://simplesci.org/wiki/Source_Routing_and_Scheduling_in_Packet_Networks"