Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals
verfasst von : H. Castel-Taleb, J. M. Fourneau, N. Pekergin
Erschienen in: Computer and Information Sciences - ISCIS 2005
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We apply stochastic bounding methods with a partial order on the state space to the analysis of memory overflow in a router. Usually, stochastic bounds are associated to a total order implying useless constraints and decreasing the tightness of bounds. Here we present the basic methodology of sample path comparison with a partial order and some numerical results to show the accuracy of the results. We analyze the probability of a buffer overflow with two types of packets, a Pushout access mechanism and Markov modulated batch arrivals. This problem is strongly related to the memory rejection out a Fiber Delay Loop in an all optical router using deflection routing.