Quality of Service System Approximation in IP Networks

Goleva, Rossitza; Goleva, Mariya; Atamian, Dimitar; Nikolov, Tashko

Serdica Journal of Computing (2008)

  • Volume: 2, Issue: 1, page 45-56
  • ISSN: 1312-6555

Abstract

top
This paper is sponsored by the Ministry of Education and Research of the Republic of Bulgaria in the framework of project No 105 “Multimedia Packet Switching Networks Planning with Quality of Service and Traffic Management”.This paper presents Quality of Service analyses in wired and wireless IP networks based on the three popular techniques – RSVP, IntServ, and DiffServ. The analyses are based on a quick approximation schema of the traffic system with static and dynamic changes of the system bounds. We offer a simulation approach where a typical leaky bucket model is ap- proximated with a G/D/1/k traffic system with flexible bounds in waiting time, loss and priority. The approach is applied for two cascaded leaky buckets. The derived traffic system is programmed in C++. The simula- tion model is flexible to the dynamic traffic changes and priorities. Student criterion is applied in the simulation program to prove results. The results of the simulation demonstrate the viability of the proposed solution and its applicability for fast system reconfiguration in dynamic environmental circumstances. The simulated services cover a typical range of types of traffic sources like VoIP, LAN emulation and transaction exchange.

How to cite

top

Goleva, Rossitza, et al. "Quality of Service System Approximation in IP Networks." Serdica Journal of Computing 2.1 (2008): 45-56. <http://eudml.org/doc/11452>.

@article{Goleva2008,
abstract = {This paper is sponsored by the Ministry of Education and Research of the Republic of Bulgaria in the framework of project No 105 “Multimedia Packet Switching Networks Planning with Quality of Service and Traffic Management”.This paper presents Quality of Service analyses in wired and wireless IP networks based on the three popular techniques – RSVP, IntServ, and DiffServ. The analyses are based on a quick approximation schema of the traffic system with static and dynamic changes of the system bounds. We offer a simulation approach where a typical leaky bucket model is ap- proximated with a G/D/1/k traffic system with flexible bounds in waiting time, loss and priority. The approach is applied for two cascaded leaky buckets. The derived traffic system is programmed in C++. The simula- tion model is flexible to the dynamic traffic changes and priorities. Student criterion is applied in the simulation program to prove results. The results of the simulation demonstrate the viability of the proposed solution and its applicability for fast system reconfiguration in dynamic environmental circumstances. The simulated services cover a typical range of types of traffic sources like VoIP, LAN emulation and transaction exchange.},
author = {Goleva, Rossitza, Goleva, Mariya, Atamian, Dimitar, Nikolov, Tashko},
journal = {Serdica Journal of Computing},
keywords = {Packet Network; IP; Quality of Service; VoIP; Shaping},
language = {eng},
number = {1},
pages = {45-56},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Quality of Service System Approximation in IP Networks},
url = {http://eudml.org/doc/11452},
volume = {2},
year = {2008},
}

TY - JOUR
AU - Goleva, Rossitza
AU - Goleva, Mariya
AU - Atamian, Dimitar
AU - Nikolov, Tashko
TI - Quality of Service System Approximation in IP Networks
JO - Serdica Journal of Computing
PY - 2008
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 2
IS - 1
SP - 45
EP - 56
AB - This paper is sponsored by the Ministry of Education and Research of the Republic of Bulgaria in the framework of project No 105 “Multimedia Packet Switching Networks Planning with Quality of Service and Traffic Management”.This paper presents Quality of Service analyses in wired and wireless IP networks based on the three popular techniques – RSVP, IntServ, and DiffServ. The analyses are based on a quick approximation schema of the traffic system with static and dynamic changes of the system bounds. We offer a simulation approach where a typical leaky bucket model is ap- proximated with a G/D/1/k traffic system with flexible bounds in waiting time, loss and priority. The approach is applied for two cascaded leaky buckets. The derived traffic system is programmed in C++. The simula- tion model is flexible to the dynamic traffic changes and priorities. Student criterion is applied in the simulation program to prove results. The results of the simulation demonstrate the viability of the proposed solution and its applicability for fast system reconfiguration in dynamic environmental circumstances. The simulated services cover a typical range of types of traffic sources like VoIP, LAN emulation and transaction exchange.
LA - eng
KW - Packet Network; IP; Quality of Service; VoIP; Shaping
UR - http://eudml.org/doc/11452
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.