In this paper, we study the use of continuous-time hidden Markov models for network protocol and application performance evaluation. We develop an algorithm to infer the continuous-time hidden Markov model from a series of end-to-end delay and loss observations of probe packets. This model can then be used to simulate network environments for network performance evaluation. We validate the simulation method by a series of experiments both in ns and over the Internet. Our experimental results show that this simulation method can represent a wide range of real network scenarios. It is easy to use, accurate, and time efficient. I
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
Performance of real-time applications on network communication channels is strongly related to loss...
Abstract-Performance of real-time applications on end-toend packet channels are strongly related to ...
Performance of real-time applications on network communication channels is strongly related to loss...
Part 3: ModelingInternational audienceThe use of hidden Markov models (HMMs) has found widespread us...
Part 3: ModelingInternational audienceThe use of hidden Markov models (HMMs) has found widespread us...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
Abstract—We consider a model of congestion for computer networks based on a continuous-time finite-s...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
Performance of real-time applications on network communication channels is strongly related to loss...
Abstract-Performance of real-time applications on end-toend packet channels are strongly related to ...
Performance of real-time applications on network communication channels is strongly related to loss...
Part 3: ModelingInternational audienceThe use of hidden Markov models (HMMs) has found widespread us...
Part 3: ModelingInternational audienceThe use of hidden Markov models (HMMs) has found widespread us...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
In this work, we propose a Hidden Markov Model for Internet traffic sources at packet level, jointly...
Abstract—We consider a model of congestion for computer networks based on a continuous-time finite-s...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...
International audienceRound-Trip Times are one of the most commonly collected performance metrics in...