Simulation model for evaluation of packet sequence changed order of stream in DiffServ network

• Autorzy: Czarkowski M. , Kaczmarek S.
• Języki publikacji: EN

Abstrakty

EN

Current packet networks use a large variety of mechanisms which should support QoS (Quality of Service). One of those mechanisms is routing (calculating connection paths for incoming service requests). The most effective mechanism in QoS context is dynamic routing, based on the current network state described by the offered traffic matrix and link states. After switching between calculated available paths, connection path changes may cause received packets to change order within a single stream. This paper includes the problem definition and the analysis of all additional effects. A combined simulation/analytic model was proposed in order to answer whether the number of changed-order packets is significant and if it should be considered when calculating the end-to-end delay balance in analytical models for packet networks with differentiated services. Furthermore, the proposed model gave the answer on how often calculated paths may be switched to avoid the network beingout of tune.

Słowa kluczowe

EN

IP; QoS; DiffServ; QoS routing

• Wydawca: Publishing House of Poznan University of Technology
• Czasopismo: Advances in Electronics and Telecommunications
• Rocznik: 2010
• Tom: Vol. 1, no. 2
• Strony: 30--34
• Opis fizyczny: Bibliogr. 6 poz., rys.

Twórcy

autor

Czarkowski M.

• Gdansk University of Technology, Faculty Electronics, Telecommunications and Informatics, Gdansk, Poland

autor

Kaczmarek S.

• Gdansk University of Technology, Faculty Electronics, Telecommunications and Informatics, Gdansk, Poland

Bibliografia

• [1] S. Chen and K. Nahrstedt, “An Overview – of – Service Routing for the Next Generation High – Speed Networks: Problems and Solutions,” IEEE Network Magazine, vol. 12, no. 6, pp. 64–79, Dec. 1998.
• [2] G. Feng, K. Makki, N. Pissinou, and C. Douligeris, “Heuristic and Exact Algorithms for QoS Routing with Multiple Constraints,” IEICE Trans. Commun., no. 12, pp. 2838–2850, Dec. 2002.
• [3] J. T. Moy, OSPF Anatomy of an Internet Routing Protocol, 2001.
• [4] —, OSPF Complete Implementation, 2001.
• [5] J. N. Daigle, Queuing Theory with Applications to Packet Telecommunication, 2005.
• [6] [online], http://www.omnetpp.org.