Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networ...Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB.展开更多
The 3-stage Clos network C（n, m, r） is considered as the most basic and popular multistage interconnection network which has been widely employed for data communications and parallel computing systems. Quite a lot o...The 3-stage Clos network C（n, m, r） is considered as the most basic and popular multistage interconnection network which has been widely employed for data communications and parallel computing systems. Quite a lot of efforts has been put on the research of the 3- stage Clos network. Unfortunately, very little is known for the multirate multicast Clos network which is the most complicated case. Firstly a sufficient condition for 1-rate multicast networks to be SNB is given, from which a result for 2-rate multicast networks to be WSNB can easily be gotten. Furthermore, by using a reservation-scheme routing, more specific result for 2-rate multicast networks to be WSNB can be obtained for the case of one of them exceeding 1/2.展开更多
This paper is concerned with two important issues in multicast routing problem with network coding for the first time, namely the load balancing and the transmission delay. A bi-objective optimization problem is formu...This paper is concerned with two important issues in multicast routing problem with network coding for the first time, namely the load balancing and the transmission delay. A bi-objective optimization problem is formulated, where the average bandwidth utilization ratio and the average transmission delay are both to be minimized. To address the problem, we propose a novel multiobjective artificial bee colony algorithm, with two performance enhancing schemes integrated. The first scheme is an elitism-based food source generation scheme for scout bees, where for each scout bee, a new food source is generated by either recombining two elite solutions randomly selected from an archive or sampling the probabilistic distribution model built from all elite solutions in this archive. This scheme provides scouts with high-quality and diversified food sources and thus helps to strengthen the global exploration. The second one is a Pareto local search operator with the concept of path relinking integrated. This scheme is incorporated into the onlooker bee phase for exploring neighboring areas of promising food sources and hence enhances the local exploitation. Experimental results show that the proposed algorithm performs better than a number of state-of-the-art multiobjective evolutionary algorithms in terms of the approximated Pareto-optimal front.展开更多
A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste...A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.展开更多
Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology ch...Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.展开更多
Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite netwo...Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including Geostationary Earth Orbit (GEO), Highly Elliptical Orbit (HEO), and Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of the hierarchical architecture, we propose a QoS-guaranteed secure multicast routing protocol (QGSMRP) for satellite IP networks using the logical location concept to isolate the mobility of LEO and HEO satellites. In QGSMRP, we employ the asymmetric cryptography to secure the control messages via the pairwise key pre-distribution, and present a least cost tree (LCT) strategy to construct the multicast tree under the condition that the QoS constraints are guaranteed, aiming to minimize the tree cost. Simulation results show that the performance benefits of the proposed QGSMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional shortest path tree (SPT) strategy.展开更多
In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multi...In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.展开更多
Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,n...Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,network coding requires large coding buffers and a high computational cost on encoding and decoding.In this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained buffers.Moreover,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and coding.Therefore,we significantly reduce requirements on buffer space,while also sustaining high throughputs.We confirm the superior advantages of our contributions using empirical studies.展开更多
To reduce the feedbacks between access point and all nodes in lossy wireless networks, a clustered system model consisting of a cluster head and multiple common nodes is investigated. Network coding has been proposed ...To reduce the feedbacks between access point and all nodes in lossy wireless networks, a clustered system model consisting of a cluster head and multiple common nodes is investigated. Network coding has been proposed for more efficient retransmissions in reliable multicast. However, in existing schemes the access point retransmits coded packets, which causes severe delay and considerable feedbacks. In this paper, an XOR scheme based on clustered model is presented. For this scheme, the cluster head broadcasts combined packets by XORing lost packets appropriately to recover lost packets locally. We also analyze the performance in terms of expected number of transmissions. Simulation results verify theoretic analysis. And our results show that proposed XOR offers a compromise between ARQ and random linear network coding.展开更多
Currently,multicast survivability in optical network obtains more attention.This paper focuses on the field of multicast grooming shared protection in green optical network and designs a novel auxiliary graph and a sh...Currently,multicast survivability in optical network obtains more attention.This paper focuses on the field of multicast grooming shared protection in green optical network and designs a novel auxiliary graph and a shared matrix to address the survivable multicast resource consumption.This paper also proposes a new heuristic called Green Multicast Grooming algorithm based on spanning path Cross-Shared protection(GMGCSP),in which network reliability,energy efficiency and resource utilization are jointly considered.Simulation results testify that,compared to other algorithms,the proposed GMG-CSP not only has lower blocking probability and higher bandwidth utilization ratio,but also saves more energy.展开更多
In this paper, we propose a new multicast wavelength assignment algorithm called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree. The whole procedure of NGWA algorithm is separated int...In this paper, we propose a new multicast wavelength assignment algorithm called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree. The whole procedure of NGWA algorithm is separated into two phases: the partial wavelength assignment phase and the complete wavelength assignment phase. It tries to minimize the total number of wavelength conversions of the multicast tree. Meanwhile, the number of different wavelengths used is minimized locally. Through illustrative example and simulation experiments, it is proved that the NGWA algorithm works well and achieves satisfactory performance in terms of the average number of wavelength conversions and the average blocking probability.展开更多
Wireless devicetodevice （D2D） communications sharing the spectrum of cellular networks is important for improving spec trum efficiency. Furthermore, introducing multicast and multi hop communications to D2D networks...Wireless devicetodevice （D2D） communications sharing the spectrum of cellular networks is important for improving spec trum efficiency. Furthermore, introducing multicast and multi hop communications to D2D networks can expand D2D ser vice functions. In this paper, we propose an anglebased inter ferenceaware routing algorithm for D2D multicast communica tions. This algorithm reuses the uplink cellular spectrum. Our proposed algorithm aims to reduce the outage probability and minimize the average hop count over all multicast destina tions （i.e., multicast receivers）, while limiting interference to cellular users to a tolerable level. In particular, our algorithm integrates two design principles for hopbyhop route selec tion. First, we minimize the distance ratio of the candidateto destination link to the candidatetobasestation link, such that the selected route advances closer to a subset of multi cast receivers. Second, we design the anglethreshold based merging strategy to divide multicast receivers into subsets with geographically close destinations. By applying the two principles for selection of each hop and further deriving an adaptive powerallocation strategy, the message can be more effieiently delivered to destinations with fewer branches when constructing the multicast tree. This means fewer duplicated data transmissions. Analyses and simulations are presented to show the impact of system parameters on the routing perfor mances. Simulation results also demonstrate the superiority of our algorithm over baseline schemes in terms of outage proba bility and average hop count.展开更多
Providing reliable multicast service is very challenging in Ad Hoc networks. In this paper, we propose an efficient loss recovery scheme for reliable multicast (CoreRM). Our basic idea is to apply the notion of cooper...Providing reliable multicast service is very challenging in Ad Hoc networks. In this paper, we propose an efficient loss recovery scheme for reliable multicast (CoreRM). Our basic idea is to apply the notion of cooperative communications to support local loss recovery in multicast. A receiver node experiencing a packet loss tries to recover the lost packet through progressively cooperating with neighboring nodes, upstream nodes or even source node. In order to reduce recovery latency and retransmission overhead, CoreRM caches not only data packets but also the path which could be used for future possible use to expedite the loss recovery process. Both analytical and simulation results reveal that CoreRM significantly improves the reliable multicast performance in terms of delivery ratio, throughput and recovery latency compared with UDP and PGM.展开更多
The multimedia broadcast and multicast services (MBMS) in 3GPP LTE is characterized by multicast broadcast single frequency network (MBSFN) operation. The multicast services are transmitted by single frequency network...The multimedia broadcast and multicast services (MBMS) in 3GPP LTE is characterized by multicast broadcast single frequency network (MBSFN) operation. The multicast services are transmitted by single frequency network (SFN) mode, and the unicast services are delivered with point-to-point (PTP) mode. To minimize the demanded radio resources for multicast services in the LTE, a novel mode switch (MS) between SFN and PTP for multicast services is proposed. MS takes into account PTP mode for multicast services and the switch is based on the handover threshold. To solve the minimization problem, MS adapts the handover threshold with the difference in the demanded radio resources between SFN mode and PTP mode for multicast services. The simulation results show that the proposed MS achieves less demanded radio resources than SFN mode for all the multicast services.展开更多
The number of Internet users has increased very rapidly due to the scalability of the network. The users demand for higher bandwidth and better throughput in the case of on demand video, or video conference or any rea...The number of Internet users has increased very rapidly due to the scalability of the network. The users demand for higher bandwidth and better throughput in the case of on demand video, or video conference or any real time distributed network system. Performance is a great issue in any distributed networks. In this paper we have shown the performance of the multicast groups or clusters in the distributed network system. In this paper we have shown the performance of different users or receivers belongs to the multicast group or cluster in the distributed network, transfer data from the source node with multirate multicast or unirate multicast by considering packet level forwarding procedure in different sessions. In this work we have shown that how the throughput was effected when the number of receiver increase. In this work we have considered the different types of queue such as RED, Fair queue at the junction node for maintaining the end to end packet transmission. In this work we have used various congestion control protocol at the sender nodes. This paper we have shown the performance of the distributed cluster network by multirate multicast.展开更多
With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communicati...With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communication. The transmission efficiency, capacity and robustness of optical multicast network can be further improved by introducing network coding technology into optical multicast networks. Meanwhile, facing to demand of emerging rate-variable multi-granularity multicast service, a multi-path transmission scheme based on network coding for routing and spectrum allocation (RSA) is proposed. It can not only allocate spectrum resources effectively and flexibly for various-rate multicast traffic, but also balance the network load, improve network throughput and reduce transmission blocking rate. In this paper, RSA problem is decomposed into two subproblems, namely routing allocation based on network coding and spectrum allocation based on maximum spectrum first (MSF) strategy, which are solved sequentially. Simulation experiments are carried out to analyze transmission performance with proposed RSA scheme. The simulation results show that the proposed RSA mechanism can allocate spectrum resources efficiently and flexibly for multi-granularity multicast traffic. Compared with RSA schemes based on shortest path tree (SPT) and minimal spanning tree (MST), the proposed RSA scheme is more efficient for spectrum resource utilization and load balancing, and spectrum resource is saved more than 20%.展开更多
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.展开更多
针对众核CPU芯片中缓存一致性片上网络(Network-on-Chip,NoC)缓存一致性监听及监听响应过程耗时过长的问题,提出多播和自适应路由两种技术来加速该过程。根据这两种技术的需求,设计了片上网络监听请求、监听响应数据包格式,并进一步设...针对众核CPU芯片中缓存一致性片上网络(Network-on-Chip,NoC)缓存一致性监听及监听响应过程耗时过长的问题,提出多播和自适应路由两种技术来加速该过程。根据这两种技术的需求,设计了片上网络监听请求、监听响应数据包格式,并进一步设计实现了监听请求通道和监听响应通道的NoC路由器和8×8网络。设计实践表明,按照文中所提的NoC路由器在22 nm工艺下大小为85940.3μm 2或103518.5μm 2,8×8的监听请求及监听响应网络大小为5.57 mm 2,复杂度可接受。通过仿真实验比较了单播和多播、确定性路由和自适应路由4种配置下监听及监听响应过程的耗时。结果表明,在监听请求消息需要监听全部252个处理器核心时,所提技术可使1个监听请求消息的监听及监听响应过程耗时减少45%,且远小于DDR/HBM的访问延迟。若进一步在一致性节点(Point of Coherency,PoC)处采用Outstanding技术,所提技术可使32个监听请求消息的监听及监听响应过程耗时减少73%。仿真结果证实了所提多播和自适应路由技术的有效性。展开更多
基金supported by the National Science and Technology Major Project of China(2013ZX03005007-004)the National Natural Science Foundation of China(6120101361671179)
文摘Device to device(D2 D) multi-hop communication in multicast networks solves the contradiction between high speed requirements and limited bandwidth in regional data sharing communication services. However, most networking models demand a large control overhead in eNodeB. Moreover, the topology should be calculated again due to the mobility of terminals, which causes the long delay. In this work, we model multicast network construction in D2 D communication through a fuzzy mathematics and game theory based algorithm. In resource allocation, we assume that user equipment(UE) can detect the available frequency and the fuzzy mathematics is introduced to describe an uncertain relationship between the resource and UE distributedly, which diminishes the time delay. For forming structure, a distributed myopic best response dynamics formation algorithm derived from a novel concept from the coalitional game theory is proposed, in which every UE can self-organize into stable structure without the control from eNodeB to improve its utilities in terms of rate and bit error rate(BER) while accounting for a link maintenance cost, and adapt this topology to environmental changes such as mobility while converging to a Nash equilibrium fast. Simulation results show that the proposed architecture converges to a tree network quickly and presents significant gains in terms of average rate utility reaching up to 50% compared to the star topology where all of the UE is directly connected to eNodeB.
基金Supported by the National Natural Science Foundation of China(10371028)Specialized Research Fund for Outstanding Young Teachers in Shanghai Higher Education Institutions (RYQ307013)
文摘The 3-stage Clos network C（n, m, r） is considered as the most basic and popular multistage interconnection network which has been widely employed for data communications and parallel computing systems. Quite a lot of efforts has been put on the research of the 3- stage Clos network. Unfortunately, very little is known for the multirate multicast Clos network which is the most complicated case. Firstly a sufficient condition for 1-rate multicast networks to be SNB is given, from which a result for 2-rate multicast networks to be WSNB can easily be gotten. Furthermore, by using a reservation-scheme routing, more specific result for 2-rate multicast networks to be WSNB can be obtained for the case of one of them exceeding 1/2.
基金supported in part by National Natural Science Foundation of China (No.61505168, No. 61802319) the Fundamental Research Funds for the Central Universities, P. R. China
文摘This paper is concerned with two important issues in multicast routing problem with network coding for the first time, namely the load balancing and the transmission delay. A bi-objective optimization problem is formulated, where the average bandwidth utilization ratio and the average transmission delay are both to be minimized. To address the problem, we propose a novel multiobjective artificial bee colony algorithm, with two performance enhancing schemes integrated. The first scheme is an elitism-based food source generation scheme for scout bees, where for each scout bee, a new food source is generated by either recombining two elite solutions randomly selected from an archive or sampling the probabilistic distribution model built from all elite solutions in this archive. This scheme provides scouts with high-quality and diversified food sources and thus helps to strengthen the global exploration. The second one is a Pareto local search operator with the concept of path relinking integrated. This scheme is incorporated into the onlooker bee phase for exploring neighboring areas of promising food sources and hence enhances the local exploitation. Experimental results show that the proposed algorithm performs better than a number of state-of-the-art multiobjective evolutionary algorithms in terms of the approximated Pareto-optimal front.
基金National Natural Science Foundation of China （60532030, 10577005, 60625102） Innovation Foundation of Aerospace Science and Technology of China
文摘A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.
基金This project was supported by the National Natural Science Foundation of China (60172035 ,90304018) NSF of HubeiProvince (2004ABA014) and Teaching Research Project of Higher Educational Institutions of Hubei Province (20040231)
文摘Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.
文摘Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including Geostationary Earth Orbit (GEO), Highly Elliptical Orbit (HEO), and Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of the hierarchical architecture, we propose a QoS-guaranteed secure multicast routing protocol (QGSMRP) for satellite IP networks using the logical location concept to isolate the mobility of LEO and HEO satellites. In QGSMRP, we employ the asymmetric cryptography to secure the control messages via the pairwise key pre-distribution, and present a least cost tree (LCT) strategy to construct the multicast tree under the condition that the QoS constraints are guaranteed, aiming to minimize the tree cost. Simulation results show that the performance benefits of the proposed QGSMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional shortest path tree (SPT) strategy.
文摘In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.
基金Supported by the National 863 Projects of China(2009AA01Z205)the Fund of National Laboratory(P080010)+2 种基金the Natural Science Foundation of China(60872010,60972016)the Program for New Century Excellent Talents in University (NCET070339)the Funds for Distinguished Young Scientists of Hubei,China(2009 CDA150)
文摘Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,network coding requires large coding buffers and a high computational cost on encoding and decoding.In this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained buffers.Moreover,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and coding.Therefore,we significantly reduce requirements on buffer space,while also sustaining high throughputs.We confirm the superior advantages of our contributions using empirical studies.
文摘To reduce the feedbacks between access point and all nodes in lossy wireless networks, a clustered system model consisting of a cluster head and multiple common nodes is investigated. Network coding has been proposed for more efficient retransmissions in reliable multicast. However, in existing schemes the access point retransmits coded packets, which causes severe delay and considerable feedbacks. In this paper, an XOR scheme based on clustered model is presented. For this scheme, the cluster head broadcasts combined packets by XORing lost packets appropriately to recover lost packets locally. We also analyze the performance in terms of expected number of transmissions. Simulation results verify theoretic analysis. And our results show that proposed XOR offers a compromise between ARQ and random linear network coding.
基金supported in part by the National Natural Science Foundation of China （61172051,61302070,61302071,61302072） the Specialized Research Fund for the Doctoral Program of Higher Education（20110042110023） the Fundamental Research Funds for the Central Universities（N110204001, N120804002,N110604008）
文摘Currently,multicast survivability in optical network obtains more attention.This paper focuses on the field of multicast grooming shared protection in green optical network and designs a novel auxiliary graph and a shared matrix to address the survivable multicast resource consumption.This paper also proposes a new heuristic called Green Multicast Grooming algorithm based on spanning path Cross-Shared protection(GMGCSP),in which network reliability,energy efficiency and resource utilization are jointly considered.Simulation results testify that,compared to other algorithms,the proposed GMG-CSP not only has lower blocking probability and higher bandwidth utilization ratio,but also saves more energy.
文摘In this paper, we propose a new multicast wavelength assignment algorithm called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree. The whole procedure of NGWA algorithm is separated into two phases: the partial wavelength assignment phase and the complete wavelength assignment phase. It tries to minimize the total number of wavelength conversions of the multicast tree. Meanwhile, the number of different wavelengths used is minimized locally. Through illustrative example and simulation experiments, it is proved that the NGWA algorithm works well and achieves satisfactory performance in terms of the average number of wavelength conversions and the average blocking probability.
基金supported by National Natural Science Foundation of China under Grant No.61102078ZTE Industry-Academic-Research Cooperation Fundsthe Fundamental Research Funds for the Central Universities
文摘Wireless devicetodevice （D2D） communications sharing the spectrum of cellular networks is important for improving spec trum efficiency. Furthermore, introducing multicast and multi hop communications to D2D networks can expand D2D ser vice functions. In this paper, we propose an anglebased inter ferenceaware routing algorithm for D2D multicast communica tions. This algorithm reuses the uplink cellular spectrum. Our proposed algorithm aims to reduce the outage probability and minimize the average hop count over all multicast destina tions （i.e., multicast receivers）, while limiting interference to cellular users to a tolerable level. In particular, our algorithm integrates two design principles for hopbyhop route selec tion. First, we minimize the distance ratio of the candidateto destination link to the candidatetobasestation link, such that the selected route advances closer to a subset of multi cast receivers. Second, we design the anglethreshold based merging strategy to divide multicast receivers into subsets with geographically close destinations. By applying the two principles for selection of each hop and further deriving an adaptive powerallocation strategy, the message can be more effieiently delivered to destinations with fewer branches when constructing the multicast tree. This means fewer duplicated data transmissions. Analyses and simulations are presented to show the impact of system parameters on the routing perfor mances. Simulation results also demonstrate the superiority of our algorithm over baseline schemes in terms of outage proba bility and average hop count.
文摘Providing reliable multicast service is very challenging in Ad Hoc networks. In this paper, we propose an efficient loss recovery scheme for reliable multicast (CoreRM). Our basic idea is to apply the notion of cooperative communications to support local loss recovery in multicast. A receiver node experiencing a packet loss tries to recover the lost packet through progressively cooperating with neighboring nodes, upstream nodes or even source node. In order to reduce recovery latency and retransmission overhead, CoreRM caches not only data packets but also the path which could be used for future possible use to expedite the loss recovery process. Both analytical and simulation results reveal that CoreRM significantly improves the reliable multicast performance in terms of delivery ratio, throughput and recovery latency compared with UDP and PGM.
基金Sponsored by the National Key Technology R&D Program of China ( Grant No. 2010ZX03003-001-01)Fundamental Research Funds for the Central Universities
文摘The multimedia broadcast and multicast services (MBMS) in 3GPP LTE is characterized by multicast broadcast single frequency network (MBSFN) operation. The multicast services are transmitted by single frequency network (SFN) mode, and the unicast services are delivered with point-to-point (PTP) mode. To minimize the demanded radio resources for multicast services in the LTE, a novel mode switch (MS) between SFN and PTP for multicast services is proposed. MS takes into account PTP mode for multicast services and the switch is based on the handover threshold. To solve the minimization problem, MS adapts the handover threshold with the difference in the demanded radio resources between SFN mode and PTP mode for multicast services. The simulation results show that the proposed MS achieves less demanded radio resources than SFN mode for all the multicast services.
文摘The number of Internet users has increased very rapidly due to the scalability of the network. The users demand for higher bandwidth and better throughput in the case of on demand video, or video conference or any real time distributed network system. Performance is a great issue in any distributed networks. In this paper we have shown the performance of the multicast groups or clusters in the distributed network system. In this paper we have shown the performance of different users or receivers belongs to the multicast group or cluster in the distributed network, transfer data from the source node with multirate multicast or unirate multicast by considering packet level forwarding procedure in different sessions. In this work we have shown that how the throughput was effected when the number of receiver increase. In this work we have considered the different types of queue such as RED, Fair queue at the junction node for maintaining the end to end packet transmission. In this work we have used various congestion control protocol at the sender nodes. This paper we have shown the performance of the distributed cluster network by multirate multicast.
文摘With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communication. The transmission efficiency, capacity and robustness of optical multicast network can be further improved by introducing network coding technology into optical multicast networks. Meanwhile, facing to demand of emerging rate-variable multi-granularity multicast service, a multi-path transmission scheme based on network coding for routing and spectrum allocation (RSA) is proposed. It can not only allocate spectrum resources effectively and flexibly for various-rate multicast traffic, but also balance the network load, improve network throughput and reduce transmission blocking rate. In this paper, RSA problem is decomposed into two subproblems, namely routing allocation based on network coding and spectrum allocation based on maximum spectrum first (MSF) strategy, which are solved sequentially. Simulation experiments are carried out to analyze transmission performance with proposed RSA scheme. The simulation results show that the proposed RSA mechanism can allocate spectrum resources efficiently and flexibly for multi-granularity multicast traffic. Compared with RSA schemes based on shortest path tree (SPT) and minimal spanning tree (MST), the proposed RSA scheme is more efficient for spectrum resource utilization and load balancing, and spectrum resource is saved more than 20%.
基金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.
文摘针对众核CPU芯片中缓存一致性片上网络(Network-on-Chip,NoC)缓存一致性监听及监听响应过程耗时过长的问题,提出多播和自适应路由两种技术来加速该过程。根据这两种技术的需求,设计了片上网络监听请求、监听响应数据包格式,并进一步设计实现了监听请求通道和监听响应通道的NoC路由器和8×8网络。设计实践表明,按照文中所提的NoC路由器在22 nm工艺下大小为85940.3μm 2或103518.5μm 2,8×8的监听请求及监听响应网络大小为5.57 mm 2,复杂度可接受。通过仿真实验比较了单播和多播、确定性路由和自适应路由4种配置下监听及监听响应过程的耗时。结果表明,在监听请求消息需要监听全部252个处理器核心时,所提技术可使1个监听请求消息的监听及监听响应过程耗时减少45%,且远小于DDR/HBM的访问延迟。若进一步在一致性节点(Point of Coherency,PoC)处采用Outstanding技术,所提技术可使32个监听请求消息的监听及监听响应过程耗时减少73%。仿真结果证实了所提多播和自适应路由技术的有效性。
