The mobile multicast technology has been a research hotspot in the wireless Internet field in recent years.Quite a large part of its applications requires the reliability in a mobile environment to be equivalent to th...The mobile multicast technology has been a research hotspot in the wireless Internet field in recent years.Quite a large part of its applications requires the reliability in a mobile environment to be equivalent to that provided by wireline links.However,the inherent features of a mobile environment,that is,high error rate of links and dynamically changing multicast members’ locations,are great difficulties for mobile multicast,let alone reliable mobile multicast.The IPv4-based reliable mobile multicast algorithms come with two different design philosophies.A part of the algorithms is to be improved for better reliability by solving existing algorithm-related problems;while other algorithms are to implement reliable mobile multicast with new function entities introduced to guarantee reliability.展开更多
Group key distribution is faced with two important problems, i.e. reliability and scalability, to support security multicast for large and dynamic groups. With group member increasing, traditional reliable multicast p...Group key distribution is faced with two important problems, i.e. reliability and scalability, to support security multicast for large and dynamic groups. With group member increasing, traditional reliable multicast protocol can not deal with them fully. Gossip-based group key distribution idea for wide-area dissemination was provided. It is based on an gossip-based loss recovery control mechanism. It can provide a probabilistic reliable guarantee for a information dissemination to reach every group member, which can achieve scalability and reliability. To achieve full reliability, three layers protocol model in group key distribution was provided. One is best effect layer, which provides unreliable dissemination. Other is gossip-based loss recovery layer, which provides probabilistic reliable guarantee. Last is vsync-based layer, which provide deterministic loss recovery. We integrate probabilistic loss recovery method with deterministic one. The model possess scalability that probabilistic method has and full reliability prosthesis by vsync-based. To evaluate the effectiveness of gossip technique in scalable and reliable multicast protocols. We have compared gossip protocol with other reliable multicast protocols. Experimental result shows that gossip protocol has better scalability than other.展开更多
In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put ...In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.展开更多
Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. ...Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.展开更多
基金supported by the National High Technology Research and Development Program ("863" Program) under Grant No.2007AA10Z235
文摘The mobile multicast technology has been a research hotspot in the wireless Internet field in recent years.Quite a large part of its applications requires the reliability in a mobile environment to be equivalent to that provided by wireline links.However,the inherent features of a mobile environment,that is,high error rate of links and dynamically changing multicast members’ locations,are great difficulties for mobile multicast,let alone reliable mobile multicast.The IPv4-based reliable mobile multicast algorithms come with two different design philosophies.A part of the algorithms is to be improved for better reliability by solving existing algorithm-related problems;while other algorithms are to implement reliable mobile multicast with new function entities introduced to guarantee reliability.
文摘Group key distribution is faced with two important problems, i.e. reliability and scalability, to support security multicast for large and dynamic groups. With group member increasing, traditional reliable multicast protocol can not deal with them fully. Gossip-based group key distribution idea for wide-area dissemination was provided. It is based on an gossip-based loss recovery control mechanism. It can provide a probabilistic reliable guarantee for a information dissemination to reach every group member, which can achieve scalability and reliability. To achieve full reliability, three layers protocol model in group key distribution was provided. One is best effect layer, which provides unreliable dissemination. Other is gossip-based loss recovery layer, which provides probabilistic reliable guarantee. Last is vsync-based layer, which provide deterministic loss recovery. We integrate probabilistic loss recovery method with deterministic one. The model possess scalability that probabilistic method has and full reliability prosthesis by vsync-based. To evaluate the effectiveness of gossip technique in scalable and reliable multicast protocols. We have compared gossip protocol with other reliable multicast protocols. Experimental result shows that gossip protocol has better scalability than other.
基金Supported by the National Science and Technology Major Projects(2011ZX03005-004-03)Jiangsu University Natural Science Basic Research Project(10KJA510037)+3 种基金Nanjing University of Posts and Telecommunications (NJUPT)Introduction of Talent Project(NY209002)NJUPT Broadband Wireless Communication and Sensor Network Technology Key Laboratory of the Ministry of Education Research Fund Project(NYKL201108)Jiangsu Provincial Science and Technology Support Program of Industrial Projects(No.BE2013019)Jiangsu Construction Engineering College Dominant Disciplines Funded Projects(Information and Communication Engineering)
文摘In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.
基金supported by the National Natural Science Foundation of China (No.61402529)the Natural Science Basic Research Plan in Shanxi Province of China (No.2020JM-361)+1 种基金the Young and Middle-aged Scientific Research Backbone Projects of Engineering University of PAP (No.KYGG201905)the Basic Researchof Engineering University of PAP (Nos.WJY201920 and WJY202019)。
文摘Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.
