Abstract
Bandwidth reservation has been increasingly used in high-performance networks to provide quality of service for various applications ranging from real-time multimedia communication in early years to big data transfer more recently. In this paper, we consider multiple bandwidth reservation requests in a batch awaiting to be scheduled in a dedicated network, and formulate two scheduling maximization problems: 1) maximize the amount of data to be transferred and 2) maximize the number of requests to be scheduled. We prove both problems are NP-complete and very difficult to approximate. We then design two heuristic algorithms and evaluate their performance against a scheduling algorithm widely used in real production networks through extensive simulation-based experiments. The experimental results show that the proposed heuristic algorithms achieve significantly better overall scheduling performance than the existing algorithm.
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 callMore From: IEEE Transactions on Network and Service Management
Disclaimer: 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.
