In Search of the Worst Case Arrivals of Independent Leaky Bucket Constrained Sources revise.pdfVIP

In Search of the Worst Case Arrivals of Indep endent Leaky Bucket Constrained Sources revised version  UCLCS Research Note Philipp e Oechslin Department of Computer Science University College of London poechslincs uclacuk Keywords leaky bucket worst case loss rate statistical multiplexing Abstract In a previous pap er we have shown numerical evidence that there are trac patterns wich generate more loss in a multiplexer than the ono source In this pap er we derive mathematical upp er and lower b ound for two loss measures P the cell loss rate and loss Psat the fraction of time where the multiplexer is saturated in a buered multiplexer fed by homogeneous leaky bucket constrained sources Using these b ounds we prove that the ono source is not the worst case trac pattern We demonstrate that the socalled sym pattern generates b oth higher P and P at least in the domain of validity of the b ounds We loss sat end the pap er by a discussion on the implications of this new nding esp ecially in resp ect to CAC algorithms which are based on the assumption that on o patterns are the worst case Intro duction Much work has b een carried out lately on Connection Acceptance Control algorithms for net works with Quality of Service QoS guarantees see Be it for ATM networks or for the Integrated Services Internet trac ows are describ ed by leaky bucket parameters which in