Swipe to navigate through the articles of this issue
The authors declare that they have no competing interests.
The quality of service (QoS) requirements do not define a marker algorithm for service classes and managing network traffic to provide fair bandwidth sharing among aggregate flows. Additionally, the assured service is designed for applications relying on the Transmission Control Protocol (TCP). This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). The new design of the OtswTCM algorithm depends on the adaptability of the gamma (γ) concept in the Improved time sliding window Three Colour Marker (ItswTCM), the Double Improved time sliding window Three Colour Marker (I2tswTCM) and the Double Modified Double Improved time sliding window Three Colour Marker (M2I2tswTCM) algorithms to affect fairness and multiple protocols in classifying network traffic. This is achieved through separating marker TCP and User Datagram Protocol (UDP) and extending the marking probability for injecting more green and yellow traffic into the network. The marking probability mechanism was also studied to check how parameters in the traffic rate affect fairness. Extensive simulations were carried out to implement the algorithm using the NS2 simulator and compare the proposed marker algorithm with several other algorithms. The results show that the proposed marker algorithm is not affected by the number of flows and outperforms the previous marker algorithms in terms of fairness.
Our product recommendations
H Su, M Atiquzzaman, Comprehensive performance model of differentiated service with token bucket marker. IEE Proceedings - Communications. 150(5), 347–53- (2003). doi: 10.1049/ip-com:20030588.
AM Alkharasani, M Othman, M 2I 2tswTCM: a new efficient optimization marker algorithm to improve fairness bandwidth in DiffServ networks. J. Netw. Comput. Appl. 35(4), 1361–1366 (2012). CrossRef
P Li, S Guo, S Yu, AV Vasilakos, in INFOCOM, 2012 Proceedings IEEE. CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding, (2012), pp. 100–108. doi: 10.1109/INFCOM.2012.6195456.
D Satoh, H Ueno, Marking algorithm of distinguishing three traffic load states with two encoding states for pre-congestion notification. Comput. Commun. 36(10), 1209–1224 (2013). CrossRef
P Li, S Guo, S Yu, AV Vasilakos, Reliable multicast with pipelined network coding using opportunistic feeding and routing. Parallel Distributed Syst. IEEE Trans. 25(12), 3264–3273 (2014). CrossRef
J Zhang, C Chen, Y Xiang, W Zhou, AV Vasilakos, An effective network traffic classification method with unknown flow detection. Netw. Serv. Manag. IEEE Trans. 10(2), 133–147 (2013). CrossRef
S Adibi, Advances in wireless technologies and telecommunication. Information Science Reference (2010). https://books.google.com.my/books?id=YUyswy1Q19kC. Accessed 24 Feb 2016.
Y Chen, M Xu, Y Gu, P Li, L Shi, X Xiao, Empirical study on spatial and temporal features for vehicular wireless communications. EURASIP J. Wireless Commun. Netw. 2014(1), 1–12 (2014). CrossRef
X Wang, AV Vasilakos, M Chen, Y Liu, TT Kwon, A survey of green mobile networks: opportunities and challenges. Mobile Netw. Appl. 17(1), 4–20 (2012). CrossRef
Y Zeng, K Xiang, D Li, AV Vasilakos, Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Netw. 19(2), 161–173 (2013). CrossRef
J Liu, Y Li, H Wang, D Jin, L Su, L Zeng, T Vasilakos, Leveraging software-defined networking for security policy enforcement. Inform. Sci. 327:, 288–299 (2016). CrossRef
ZM Fadlullah, T Taleb, AV Vasilakos, M Guizani, N Kato, DTRAB: combating against attacks on encrypted protocols through traffic-feature analysis. IEEE/ACM Trans. Netw. (TON). 18(4), 1234–1247 (2010). CrossRef
G Wei, AV Vasilakos, Y Zheng, N Xiong, A game-theoretic method of fair resource allocation for cloud computing services. J. Supercomput. 54(2), 252–269 (2010). CrossRef
Y Song, L Liu, H Ma, AV Vasilakos, A biology-based algorithm to minimal exposure problem of wireless sensor networks. Netw. Serv. Manag. IEEE Trans. 11(3), 417–430 (2014). CrossRef
M Loudini, S Rezig, Y Salhi, Incorporate intelligence into the differentiated services strategies of a web server: an advanced feedback control approach. J. Internet Serv. Appl. 4(1), 1–16 (2013). CrossRef
W-H Hsu, Y-P Shieh, DiffServ-aware multicasting in a mobile IPv6 network. Telecommun. Syst. 54(4), 373–386 (2013). CrossRef
A Varela, T Vazão, G Arroz, Providing service differentiation in pure IP-based networks. Comput. Commun. 35(1), 33–46 (2012). CrossRef
Y Liu, N Xiong, Y Zhao, AV Vasilakos, J Gao, Y Jia, Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Commun. 4(7), 810–816 (2010). CrossRef
DD Clark, W Fang, Explicit allocation of best-effort packet delivery service. Netw. IEEE/ACM Trans. 6(4), 362–373 (1998). CrossRef
S Sudha, N Ammasaigounden, An aggregate marker for bandwidth fairness in DiffServ. J. Netw. Comput. Appl. 35(6), 1973–1978 (2012). CrossRef
M Looney, O Gough, A provision aware proportional fair sharing three colour marker. J. Netw. Comput. Appl. 36(1), 476–483 (2013). CrossRef
T Meng, F Wu, Z Yang, G Chen, A Vasilakos, Spatial reusability-aware routing in multi-hop wireless networks. Comput. IEEE Trans. 65(1), 244–255 (2015). CrossRef
C Li, L Wang, Y He, C Zhao, H Lin, L Zhu, A link state aware geographic routing protocol for vehicular ad hoc networks. EURASIP J. Wireless Commun. Netw. 2014(1), 1–13 (2014). CrossRef
H Su, M Atiquzzaman, ItswTCM: a new aggregate marker to improve fairness in DiffServ. Comput. Commun. 26(9), 1018–1027 (2003). CrossRef
M Elshaikh, M Othman, S Shamala, JM Desa, A new fair marker algorithm for DiffServ networks. Comput. Commun. 31(14), 3064–3070 (2008). CrossRef
R Stankiewicz, A Jajszczyk, Performance modeling of DiffServ meter/markers. Int. J. Commun. Syst. 23(12), 1554–1580 (2010). CrossRef
K Fall, K Varadhan, The NS manual (formerly NS notes and documentation). The VINT project. 47: (2005).
P Pieda, J Ethridge, M Baines, F Shallwani, A network simulator differentiated services implementation open IP, Nortel Networks (2000). https://www-sop.inria.fr/members/Eitan.Altman/COURS-NS/DOC/DSnortel.pdf. Accessed 24 Feb 2016.
PND Bukh, R Jain, The art of computer systems performance analysis, techniques for experimental design, measurement, simulation and modeling (JSTOR, 1992).
S Sudha, BS Rao, N Ammasaigounden, in Industrial and Information Systems, 2008. ICIIS 2008. IEEE Region 10 and the Third international Conference on. A modified I 2TSWTCM to improve bandwidth fairness in DiffServ, (2008), pp. 1–4. doi: 10.1109/ICIINFS.2008.4798430.
Y Sani, M Othman, A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks. J. Netw. Comput. Appl. 34(2), 715–721 (2011). CrossRef
- An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks
Ameen M. Alkharasani
Kweh Yeah Lun
- Publication date
- Springer International Publishing
EURASIP Journal on Wireless Communications and Networking
Electronic ISSN: 1687-1499
Neuer Inhalt/© ITandMEDIA