Generalized processor sharing

Known as: GPS (disambiguation), Generalized processor-sharing 
Generalized processor sharing (GPS) is an ideal scheduling algorithm for network schedulers. It is related to the Fair queuing principle, that groups… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
End-hosts are increasingly equipped with multiple network interfaces, ranging from smartphones with multiple radios to servers… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2003
Review
2003
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important… (More)
  • figure 1.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
2003
2003
We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2001
2001
Generalized Processor Sharing(GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
2001
2001
For Internet service providers (ISPs) the proper dimensioning of Internet access lines is essential. Under-dimensioning generally… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance… (More)
Is this relevant?
1997
1997
Provision of Quality-of-Service (QoS) guarantees is an important and challenging issue in the design of integrated-services… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We consider virtual circuit packet switching communication networks that employ processor sharing type service disciplines and… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of… (More)
  • table I
  • figure 1
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An analysis is given of multiple phase service facilities of which queueing networks are special models, for the case of a… (More)
Is this relevant?