Skip to content

zaf6862/N-Way-Split-algorithm-for-Packet-Scheduling-in-Multi-Path-Scenarios

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

N-Way-Split-algorithm-for-Packet-Scheduling-in-Multi-Path-Scenarios

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.

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

 
 
 

Contributors

Languages