Abstract
Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks. Presented algorithm DUMBRA, Dynamic Unattended Measurement Based Routing Algorithm allows using k-shortest path mechanism for streaming and elastic traffic classes. It has been verified many different traffic scenarios in many different network topologies by simulation that has been realized using Omnet++ simulation environment. It has been confirmed that for most of analyzed network topologies the algorithm gave the significant gain in the amount of serviced traffic via existing network resources.
Citations
-
0
CrossRef
-
0
Web of Science
-
2
Scopus
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- NETWORKS 2010: 14th International Telecommunications Network Strategy and Planning Symposium, September 27-30, 2010 Warsaw strony 125 - 130
- Language:
- English
- Publication year:
- 2010
- Bibliographic description:
- Czarkowski M., Kaczmarek S.: Dynamic unattended measurement based routing algorithm for diffServ architecture// NETWORKS 2010: 14th International Telecommunications Network Strategy and Planning Symposium, September 27-30, 2010 Warsaw/ ed. eds. Michał Pióro, Krzysztof Szczypiorski, Jacek Rak, Oscar Gonzalez-Soto; IEEE. Warszawa: Politechnika Warszawska, 2010, s.125-130
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/netwks.2010.5624909
- Verified by:
- Gdańsk University of Technology
seen 108 times
Recommended for you
Traffic Type Influence on Performance of OSPF QoS Routing
- M. Czarkowski,
- S. Kaczmarek,
- M. Wolff