Introduction Conclusions References

In this paper, the performance of ATM switches with self-similar input traffic is analyzed. The ATM switch is a non-blocking, output-buffered switch, and input traffic is approximated by a Poisson-Zeta process, which is an asymptotically second-order self-similar process. The upper and lower bounds of the buffer overflow probability of the switch are obtained by stochastically bounding the numb...

Buffer overflow attacks cause serious security problems. Array & pointer bound checking is one of the most effective approaches for defending against buffer overflow attacks when source code is available. However, original array & pointer bound checking causes too much overhead since it is designed to catch memory errors and it puts too many checks. In this paper, we propose an efficient array ...

Annexe A – Exercices sur les buffer overflows 90 Annexe B – Les codes utilisés dans le rapport-4/92

One of the most prominent congestion avoidance schemes in the Internet architecture is the Random Early Detection (RED) algorithm. Several modifications and enhancements have been made to the original RED so as to make it more responsive to congestion avoidance at the gateways. In this paper, we introduced the Dynamic Random Early Detection (DRED) model, which uses a newly introduced parameter ...

Buffer overflow attacks may be today’s single most important security threat. This paper presents a new approach to mitigating buffer overflow vulnerabilities by detecting likely vulnerabilities through an analysis of the program source code. Our approach exploits information provided in semantic comments and uses lightweight and efficient static analyses. This paper describes an implementation...