A simple algorithm for scheduling a fixed size data chunk onto multiple paths available. This scheduler has the property that under the assumption that all the paths have same and consistent parameters (e.g. bandwidth, one-way delay) and no packet loss, this algorithm will finish the transmission on all paths at the same time.
-
Notifications
You must be signed in to change notification settings - Fork 0
A simple algorithm for scheduling a fixed size data chunk onto multiple paths available. This scheduler has the property that under the assumption that all the paths have same and consistent parameters (e.g. bandwidth, one-way delay) and no packet loss, this algorithm will finish the transmission on all paths at the same time.
zaf6862/N-Way-Split-algorithm-for-Packet-Scheduling-in-Multi-Path-Scenarios
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A simple algorithm for scheduling a fixed size data chunk onto multiple paths available. This scheduler has the property that under the assumption that all the paths have same and consistent parameters (e.g. bandwidth, one-way delay) and no packet loss, this algorithm will finish the transmission on all paths at the same time.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published