@inproceedings{3f828c10e35e40b19b1cac8ee5a7a8ab,
title = "Stochastic bounds on partial ordering: Application to memory overflows due to bursty arrivals",
abstract = "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.",
author = "H. Castel-Taleb and Fourneau, \{J. M.\} and N. Pekergin",
year = "2005",
month = dec,
day = "1",
doi = "10.1007/11569596\_27",
language = "English",
isbn = "3540294147",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "244--253",
booktitle = "Computer and Information Sciences - ISCIS 2005 - 20th International Symposium, Proceedings",
note = "20th International Symposium on Computer and Information Sciences, ISCIS 2005 ; Conference date: 26-10-2005 Through 28-10-2005",
}