A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case

Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inherent exibility of the service discipline is exploited to analyze broad classes of networks. When only a subset of the sessions are leaky bucket constrained, we give succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology. However, these bounds are only shown to hold for each session that is guaranteed a backlog clearing rate that exceeds the token arrival rate of its leaky bucket. A much broader class of networks, called Consistent Relative Session Treatment (CRST) networks is analyzed for the case in which all of the sessions are leaky bucket constrained. First, an algorithm is presented that characterizes the internal tra c in terms of average rate and burstiness, and it is shown that all CRST networks are stable. Next, a method is presented th...

• Type: Conference
• Year: 1993
• Where: INFOCOM
• Authors: Abhay K. Parekh, Robert G. Gallager
• Keywords: Bucket Constrained Sessions, Communications, INFOCOM 1993, Leaky Bucket, Session Delay