Logo Institute of Communication Networks (E-4)
Institute of Communication Networks (E-4)
Logo Institute of Communication Networks (E-4)
Institute of Communication Networks (E-4)
EN
DE
Search
EN
DE
Search
ET6 > Publications

Publications

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

[117063]
Title: On the Reduction of the Complexity of Realistic Large Scale Network Simulations.
Written by: Kai Below and Ulrich Killat
in: <em>AEU - International Journal of Electronics and Communications</em>. (2004).
Volume: <strong>58</strong>. Number: (6),
on pages: 371 - 381
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI: https://doi.org/10.1078/1434-8411-54100258
URL: http://www.sciencedirect.com/science/article/pii/S1434841104702587
ARXIVID:
PMID:

[www]

Note:

Abstract: Summary Current computer systems allow a realistic simulation with more than 100,000 HTTP/TCP clients, as shown in this paper. However, the complexity of such simulations is high: the required memory and the simulation duration touches reasonable limits. Reducing the complexity by using a smaller number of clients as compared to reality is evaluated in this study. The reduction is performed with increasing the activity of each client keeping the load approx. constant. Further, it is shown that the average number of active clients remains approx. constant. The reduction has two targets: (i) the optimisation of the considered simulation scenario and (ii) to allow for simulations with larger simulation scenarios. It is evaluated how the reduction affects the following parameters: average traffic load, coefficient of variation, Hurst parameter, end-to-end delay and loss probability. It is shown that only the loss probability is affected by the reduction. The simulation results show that the required memory can be reduced by a factor of 4–8, depending on the error bound, and the simulation speed increased by up to 33%. The gain allows to simulate an equivalent of 1,200,000 instead of 150,000 clients.

TU Hamburg
Institute of Communication Networks (E-4)
Prof. Dr.-Ing. Andreas Timm-Giel
Am Schwarzenberg-Campus 3, Room E1.058
21073 Hamburg
E-mail : comnets@tuhh.de
Phone : +49 40 42878-3049/3249
Links
Imprint
Data Privacy
Sitemap
ComNetsHH at GitHub