Publication

Bounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element

Jean-Yves Le Boudec, Milan Vojnovic
2001
Reports

Abstract

We consider the problem of bounding the probability of buffer overflow in a network node receiving independent inputs that are each constrained by arrival curves, but that are served as an aggregate. Existing results (for example \cite{kesidis-00-b} and \cite{chang-01-a}) assume that the node is a constant rate server. However, in practice, one finds various types of schedulers that do not provide a constant service rate, and thus to which the existing bounds do not apply. Now many schedulers can be adequately abstracted by a service curve property. We extend the results in \cite{kesidis-00-b} and \cite{chang-01-a} to such cases. As a by-product, we also provide a slight improvement to the bound in \cite{chang-01-a}. Our bounds are valid for both discrete and continuous time models.

Official source

https://infoscience.epfl.ch/entities/publication/0ce7d47f-7f62-449b-8b6d-ddc9afd95a7d

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jean-Yves Le Boudec, Milan Vojnovic
2001
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/0ce7d47f-7f62-449b-8b6d-ddc9afd95a7d

About this result

Related concepts (19)

Artificial neural network

Artificial neural networks (ANNs, also shortened to neural networks (NNs) or neural nets) are a branch of machine learning models that are built using principles of neuronal organization discovered by connectionism in the biological neural networks constituting animal brains. An ANN is based on a collection of connected units or nodes called artificial neurons, which loosely model the neurons in a biological brain. Each connection, like the synapses in a biological brain, can transmit a signal to other neurons.

Buffer overflow

In programming and information security, a buffer overflow or buffer overrun is an anomaly whereby a program writes data to a buffer beyond the buffer's allocated memory, overwriting adjacent memory locations. Buffers are areas of memory set aside to hold data, often while moving it from one section of a program to another, or between programs. Buffer overflows can often be triggered by malformed inputs; if one assumes all inputs will be smaller than a certain size and the buffer is created to be that size, then an anomalous transaction that produces more data could cause it to write past the end of the buffer.

Buffer overflow protection

Buffer overflow protection is any of various techniques used during software development to enhance the security of executable programs by detecting buffer overflows on stack-allocated variables, and preventing them from causing program misbehavior or from becoming serious security vulnerabilities. A stack buffer overflow occurs when a program writes to a memory address on the program's call stack outside of the intended data structure, which is usually a fixed-length buffer.

Related publications (2)

Bounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element

Chat with Graph Search

Study and optimization of a linear piezoelectric actuator

Network Calculus viewed as a Min-plus System Theory applied to Communication Networks