Abstract
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix Λ = ( λ ij ) , Birkhoff-von Neumann decomposition offers a quasi-offline scheduling strategy that can provide a service rate of at least λ ij for each flow ( i , j ) without internal speedup. This paper extends the Birkhoff-von Neumann switching strategy to consider traffic profiles in which the traffic demands are specified as statistical distributions rather than fixed rates.
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.
