SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Load balancing in processor sharing systems · Study

ArticleShelves

ArticleLoad balancing in processor sharing systems

Eitan Altman2010

OA

Articlegreen2010

Load balancing in processor sharing systems

Eitan Altman · Urtzi Ayesta · Balakrishna Prabhu

96 citations·0/0 files stored·Telecommunication Systems

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Game Theory and Applications Optimization and Search Problems

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 96 citations exist upstream.

References

1996Potential Games 1973A class of games possessing pure-strategy Nash equilibria 1999Worst-Case Equilibria 1994The Traffic Assignment Problem: Models and Methods 2006Selfish Routing and the Price of Anarchy 2016Selfish Routing and the Price of Anarchy 2001Potential Games with Continuous Player Sets 1979Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System

Cited by

2022Scalable Load Balancing in Networked Systems: A Survey of Recent Advances 2015Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems 2018On the scheduling of operations in a chat contact center 2015Blocking probabilities of elastic and adaptive calls in the Erlang multirate loss model under the threshold policy 2011M/M/1-PS queue and size-aware task assignment 2016Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2006Exact Price of Anarchy for Polynomial Congestion Gamesother · 5 shared references 2011Wardrop Equilibriaother · 5 shared references 2010On the Performance of Approximate Equilibria in Congestion Gamesarticle · 5 shared references 2014Local smoothness and the price of anarchy in splittable congestion gamesarticle · 5 shared references 2009Computing equilibria: a computational complexity perspectivearticle · 5 shared references 2019Regrets in Routing Networksarticle · 5 shared references

Details

Year2010

Typearticle

Published2010-05-05

VenueTelecommunication Systems

ISSN-L1018-4864

Languageen

Citations96

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1007/s11235-010-9300-8

openalex_workW2023946326

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2021Inefficiency in stochastic queueing systems with strategic customers

2017Line Balancing in Parallel M / M /1 Lines and Loss Systems as Cooperative Games