Optimal Capacity Provisioning for Online Job Allocation With Hard Allocation Ratio Requirement

No abstract is available for this paper.

• Publication year

  2016

• Venue

  IEEE/ACM Transactions on Networking

• Publication date

  2016-04-10

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/INFOCOM.2016.7524610
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Online load balancing and correlated randomness

  2012cited by this paper
• Online bipartite matching with unknown distributions

  2011cited by this paper
• A First Step Towards Understanding Popularity in YouTube

  2010cited by this paper
• Online Stochastic Matching: Beating 1-1/e

  2009cited by this paper
• Analyzing the Video Popularity Characteristics of Large-Scale User Generated Content Systems

  2009cited by this paper
• Statistics and Social Network of YouTube Videos

  2008cited by this paper
• Online budgeted matching in random input models with applications to Adwords

  2008cited by this paper
• Can internet video-on-demand be profitable?

  2007cited by this paper
• Prediction, learning, and games

  2006cited by this paper
• On the Foundations of Universal Sequence Prediction

  2006cited by this paper
• Understanding user behavior in large-scale video-on-demand systems

  2006cited by this paper
• AdWords and generalized on-line matching

  2005cited by this paper
• Characterizing user access to videos on the World Wide Web

  1999cited by this paper
• Introduction to linear optimization

  1997cited by this paper
• An optimal deterministic algorithm for online b-matching

  1996cited by this paper
• WebWatcher : A Learning Apprentice for the World Wide Web

  1995cited by this paper
• Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow

  1991cited by this paper
• An optimal algorithm for on-line bipartite matching

  1990influential reference
• The weighted majority algorithm

  1989cited by this paper
• Learning probabilistic prediction functions

  1988cited by this paper
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987cited by this paper

• Competitive Online Optimization with Multiple Inventories

  2022cites this paper
• Online Routing and Scheduling With Capacity Redundancy for Timely Delivery Guarantees in Multihop Networks

  2019cites this paper
• Online job allocation with hard allocation ratio requirement

  2016cites this paper