Multicast Tree Construction with User-Experienced Quality for Multimedia Mobile Networks
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.
Abstract
The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.
참고문헌 (22)
- "Cisco VNI Forecast Widget"[URL]
- L. H. Sahasrabuddhe, "Multicast routing algorithms and protocols : a tutorial", IEEE Network, 14(1), pp.90~102 (2000)
- C. A. C. Marcondes, "CastFlow: clean-slate multicast approach using in-advance path processing in programmable networks", Proceedings of IEEE Symposium on Computers & Communications (ISCC), pp.94~101 (2012)
- S. Xu, "Software defined mobile multicast", Proceedings of 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems (MASS), pp.208~216 (2015)
- N. Xue, "Demonstration of OpenFlow-controlled network orchestration for adaptive SVC video manycast", IEEE Transactions on Multimedia, 17(9), pp.1617~1629 (2015)
- J. R. Jiang, "Constructing multiple Steiner trees for software-defined networking multicast", Proceedings of the 11th International Conference on Future Internet Technologies, pp.1~6 (2016)
- M. Sun, "A multiple multicast tree optimization solution based on software defined network", Proceedings of 2016 7th International Conference on Information and Communication Systems, pp.168~173 (2016)
- P. Winter, "Steiner problem in networks : a survey", Networks, 17(2), pp.129~167 (1987)
- F. K. Hwang, "Steiner tree problems", Networks, 22(1), pp.55~89 (1992)
- H. Takahashi, "An approximate solution for the Steiner problem in graphs", Mathematica Japonica, 24(6), pp.573~577 (1980)
- L. Kou, "A fast algorithm for Steiner trees", Acta Informatica, 15(2), pp.141~145 (1981)
- C. P Low, "An efficient algorithm for group multicast routing with bandwidth reservation", Computer Communications, 23(18), pp.1740~1746 (2000)
- P. Brooks, "User measures of quality of experience : why being objective and quantitative is important", IEEE Network, 24(2), pp.8~13 (2010)
- C. Banse, "A secure northbound interface for SDN applications", Proceedings of 2015 IEEE Trustcom, ISPA, pp.2015[DOI]
- "OpenFlow Switch Specification" (2015)[URL]
- A. Medina, "BRITE: an approach to universal topology generation", Proceedings of 9th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), pp.346~353 (2001)
- R. C. Prim, "Shortest connection networks and some generalizations", Bell Labs Technical Journal, 36(6), pp.1389~1401 (1957)
- X. Jia, "A group multicast routing algorithm by using multiple minimum Steiner trees", Computer Communications, 20(9), pp.750~758 (1997)
- C. P. Low, "On finding feasible solutions for the delay constrained group multicast routing problem", IEEE Transactions on Computers, 51(5), pp.581~588 (2002)
- Y. L. Wang, "Based QoS constrained group multicast routing for multimedia communication", Proceedings of 2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering, pp.296~299 (2010)
- E. W. Dijkstra, "A note on two problems in connexion with graphs", Numerische Mathematik, 1(1), pp.269~271 (1959)
- B. M. Waxman, "Routing of multipoint connections", IEEE Journal on Selected Areas in Communications, 6(9), pp.1617~1622 (2002)