• DocumentCode
    2004725
  • Title

    A Trading System for Fairly Scheduling Fixed-Sized Delay Tolerant Jobs at a Shared Link

  • Author

    Londoño, Jorge ; Bestavros, Azer ; Laoutaris, Nikolaos

  • Author_Institution
    Comput. Sci. Dept, Boston Univ., Boston, MA, USA
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Scheduling of delay-tolerant jobs has been proposed as a mechanism to alleviate pressure on congested network resources. However, when multiple competing users share these resources, they may not be willing to reveal how flexible is the schedule for their jobs. This work presents a trading system that enables the users to trade their finite allowances in an scenario where they have fixed-size atomic jobs. The trading system makes it possible that tasks with strict timing requirements are completed on time, and flexibility is rewarded with either a larger share of the off-peak capacity or a lower total cost for their owners. The trading system is proven to always converge. Simulation on real traces show significant reductions on the peak-to-valley ratio on the link utilization.
  • Keywords
    scheduling; telecommunication congestion control; telecommunication traffic; congested network resources; fixed-sized delay tolerant job scheduling; peak-to-valley ratio; trading system; Cost accounting; Games; IEEE Communications Society; Optimal scheduling; Pricing; Resource management; Schedules;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5684255
  • Filename
    5684255