An algorithm is presented which provides an optimal solution to the problem of scheduling non-relocatable time intervals of bandwidth in differentiated services networks. Simulations found an asymmetry between valuing an interval’s length and bandwidth requirement. Longer intervals requiring less resource are favored over shorter intervals requiring more resource. The optimal algorithm is shown to respond appropriately to price as a mechanism of control whereas the offline greedy and the online FCFS algorithms do not. The solution uses integer programming, and it is shown that, except in the general case, the problem can be solved in polynomial time.
By: David Olshefski, Danilo, Florissi, Yechiam Yemini, Li Zhang
Published in: RC21633 in 2000
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .