• Publications
  • Influence
Dimensioning Large Call Centers
TLDR
A framework for asymptotic optimization of a queueing system based on the staffing problem of call centers with 100's of agents is developed, and the square-root safety staffing principle is revisited, which is a long-existing rule-of-thumb for staffing the M/M/N queue.
User-level performance of channel-aware scheduling algorithms in wireless data networks
  • S. Borst
  • Computer Science
    IEEE INFOCOM . Twenty-second Annual Joint…
  • 9 July 2003
TLDR
This paper shows that in certain cases the user-level performance may be evaluated by means of a multiclass Processor-Sharing model where the total service rate varies with the total number of users, and shows that, in the presence of channel variations, greedy, myopic strategies which maximize throughput in a static scenario may result in sub-optimal throughput performance for a dynamic user configuration and cause potential instability effects.
Distributed Caching Algorithms for Content Distribution Networks
TLDR
This paper develops light-weight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost, and establishes that the performance of the proposed algorithms is guaranteed to be within a constant factor from the globally optimal performance.
Dynamic rate control algorithms for HDR throughput optimization
  • S. Borst, P. Whiting
  • Computer Science
    Proceedings IEEE INFOCOM . Conference on Computer…
  • 28 February 2001
TLDR
It is shown that the 'best' user may be identified as the maximum-rate user when the feasible rates are weighed with some appropriately determined coefficients, and the optimal strategy may be viewed as a revenue-based policy.
User-level performance of channel-aware scheduling algorithms in wireless data networks
  • S. Borst
  • Engineering, Computer Science
    IEEE/ACM Transactions on Networking
  • 1 June 2005
TLDR
This paper shows that in certain cases the user-level performance may be evaluated by means of a multiclass Processor-Sharing model where the total service rate varies with the total number of users, and shows that, in the presence of channel variations, greedy, myopic strategies which maximize throughput in a static scenario may result in sub-optimal throughput performance for a dynamic user configuration and cause potential instability effects.
Instability of MaxWeight Scheduling Algorithms
TLDR
A scenario where the population of active sessions varies over time, as sessions eventually end while new sessions occasionally start is examined, and it is shown that MaxWeight policies may fail to provide maximum stability.
Polling Models With and Without Switchover Times
TLDR
This work considers two different single-server cyclic polling models and relates the steady-state queue length distribution at a queue to the queue length distributions at server visit beginning and visit completion instants at that queue, enabling a very efficient numerical computation of the waiting-time moments under different switchover time scenarios.
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
TLDR
Analysis of queueing behavior of long-tailed traffic flows under the Generalized Processor Sharing (GPS) discipline confirms that GPS-based scheduling algorithms provide a potential mechanism for extracting significant multiplexing gains, while isolating individual flows.
Inter-cell scheduling in wireless data networks
TLDR
Numerical experiments demonstrate that inter-cell scheduling may provide significant capacity gains, the relative contribution from interference avoidance vs. load balancing depending on the configuration and the degree of load imbalance in the network.
Stability of Parallel Queueing Systems with Coupled Service Rates
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and
...
1
2
3
4
5
...