共查询到19条相似文献,搜索用时 140 毫秒
1.
2.
杨鹏 《计算机工程与设计》2008,29(11):2776-2778
如何采用有效的机制来保证多播数据的可靠传输是移动Ad Hoc网络中的一个难题.针对IEEE 802.11 MAC层进行改进,提出了一种基于使用NACK消息的可靠多播协议,该协议仅当数据分组传输出错时才发送NACK消息要求重传数据.仿真结果表明使用该协议能提高多播路由传输数据的吞吐量,同时降低了平均时延. 相似文献
3.
4.
目前,由于卫星广播与地面网相结合的天地网平台下的远程教学等类似系统日益增加,针对卫星广播传输可靠性无法保证的问题,结合天地网平台的特点,提出了一种面向天地网的可靠多播传输模型.其中,该模型使用自适应的FEC编码与NACK相结合技术来达到在天地网上可靠多播通信的目的.一方面,该传输模型不但可以实现可靠多播通信,另外,它还可以自适应当前网络状况以提高网络资源的使用效率,进而减少网络负载,这对于天地网下卫星传输误码率易受天气影响如雨衰等现象有针对性的优点. 相似文献
5.
6.
针对短波数据通信的特点,提出了一种可靠多播中反馈信息的信道争用方式,使第二代短波通信实现可靠多播传输。同时将改进的可靠多播协议RMTP应用到短波可靠多播传输中,首次提出“一层发送,逐层补充,分层分步反馈”的思想。通过仿真表明,改进后的RMTP协议满足可靠多播传输要求,与未使用该协议的可靠多播传输相比多播传输延时明显缩短。 相似文献
7.
8.
为了满足片上网络日益丰富的应用要求,多播路由机制被应用到片上网络,以弥补传统单播通信方式的不足。以Mesh和Torus类的片上网络为例,分析了基于路径的3种多播路由算法(即XY路由、UpDown路由和SubPartition路由算法),并研究了相应的拥塞控制策略。通过模拟实验表明,多播较单播通信具有更小的平均传输延时和更高的网络吞吐量,且负载分配均匀;特别是SubPartition路由算法随着规模增大效果更加明显;提出的多播拥塞控制机制,能更有效地利用多播通信,提高片上网络的性能。 相似文献
9.
随着移动AdHoc网络的应用不断扩大,研究其具有QoS约束的多播路由技术已成为网络及分布式系统领域的一个重要研究课题。论文基于作者设计的分层结构多播路由算法MALS,提出了以权重因子方法进行分簇处理的QoS多播路由算法MALS_QoS。和MALS相比,MALS_QoS算法具有QoS的约束功能,能产生具有带宽、剩余能量、延时和延时抖动等约束的QoS多播树。仿真实验表明,MALS_QoS能满足QoS约束的多播要求,具有较好的性能。 相似文献
10.
基于MAODV的移动多播路由协议的改进与仿真 总被引:1,自引:0,他引:1
移动Ad hoc网络是指由一组带有无线收发装置的移动节点组成的一个多跳的、不需要固定中心接入点或者基站支持的自治系统。对移动Ad hoc网络多播路由中的MAODV协议进行理论分析,提出了一种使用转接机制改进MAODV协议的方法,该改进协议使用新的NACK抑制机制来防止NACK风暴,减少了移动Ad hoc网络中大量的路由重构和数据分组的重传。采用OPNET软件进行仿真,仿真结果证明了该改进协议在Ad hoc网络中的可行性和有效性。 相似文献
11.
抑制NACK的定时器设置方法 总被引:1,自引:0,他引:1
FEC can be combined with ARQ to achieve large scalable reliable mutlicast. The NACK im-plosion is a major problem in receiver-initiated reliable multicast when a large, number of receivers sendsNACK to the sender. The method that receivers send NACK to the sender based on timer can avoid theNACK implosion. We propose a method to set timers. The method of time divided unequally and basedon exponential distribution to set timers has the better perfornance. By analysis for up to 10^10 receivers,we show the NACK implosion is avoided and feedback delay due to timers is low. 相似文献
12.
一个适用于广域网的可靠多对多广播通信协议的设计与分析 总被引:1,自引:0,他引:1
提出并实现了一个适用于广域网络环境下允许大量网络节点参加的“多对多”可靠广播通信协议,基于发送方的分组可靠Multicast协议-SIGRMP。该协议能在不影响通信系统传输时延和报文吞吐率前提下,成功地避免应答报文拥塞现象,为Internet网络上参与广播通信的节点提供“可靠”而“有序”的“多对多”广播传输服务,给出了Multicast通信的性能分析和测试结果,编程实现了一个简单的分布式虚拟环境( 相似文献
13.
《Computer Networks》2002,38(5):553-575
We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborative computing, yet non-trivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner, but there is little work on the design and implementation of congestion control schemes for reliable multicast. We propose new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree.Our protocol incorporates several novel features: (1) hierarchical congestion status reports that distribute the load of processing feedback from all receivers across the multicast group, (2) the relative time delay concept which overcomes the difficulty of estimating round-trip times in tree-based multicast environments, (3) window-based control that prevents the sender from transmitting faster than packets leave the bottleneck link on the multicast path through which the sender's traffic flows, (4) a retransmission window that regulates the flow of repair packets to prevent local recovery from causing congestion, and (5) a selective acknowledgment scheme that prevents independent (i.e., non-congestion-related) packet loss from reducing the sender's transmission rate. We have implemented MTCP both on UDP in SunOS 5.6 and on the simulator ns, and we have conducted extensive Internet experiments and simulation to test the scalability and inter-fairness properties of the protocol. The encouraging results we have obtained support our confidence that TCP-like congestion control for large-scale reliable multicast is within our grasp. 相似文献
14.
分析了分层组播拥塞控制协议的基本原理,针对当前存在的拥塞控制算法的不足,提出了使用单向延迟和pathload算法来判断网络拥塞情况,避免了接收端信息反馈给算法带来的复杂性和可扩展性的问题,并实现了一种适应于无线异构网络环境下分层组播拥塞控制策略WALM。仿真实验表明,WALM不但能比较好的适应无线网络环境,而且还具有比较好的TCP友好性。 相似文献
15.
We consider the problem of error control for receiver-driven layered multicast of audio and video over the Internet. The sender injects into the network multiple source layers and multiple channel coding (parity) layers, some of which are delayed relative to the source, Each receiver subscribes to the number of source layers and the number of parity layers that optimizes the receiver's quality for its available bandwidth and packet loss probability. We augment this layered FEC system with layered pseudo-ARQ. Although feedback is normally problematic in broadcast situations, ARQ can be simulated by having the receivers subscribe and unsubscribe to the delayed parity layers to receive missing information. This pseudo-ARQ scheme avoids an implosion of repeat requests at the sender and is scalable to an unlimited number of receivers, We show gains of 4-18 dB on channels with 20% loss over systems without error control and additional gains of 1-13 dB when FEC is augmented by pseudo-ARQ in a hybrid system, Optimal error control in the hybrid system is achieved by an optimal policy for a Markov decision process 相似文献
16.
安全组播通信的主要挑战之一是源认证,而其关键是为组播通信提供可靠的安全机制。然而,现在的组播协议仅提供部分解决办法。鉴于这些原因,作者首先阐述组播通信的主要安全问题——源认证。其次,基于发送方和接收方间初始的不精确时间同步,提出了一个非常有效的方法,此方法能作到数据包一到,就允许接收方认证大部分包。 相似文献
17.
LION: Layered Overlay Multicast With Network Coding 总被引:2,自引:0,他引:2
《Multimedia, IEEE Transactions on》2006,8(5):1021-1032
Recent advances in information theory show that the throughput of a multicast session can be improved using network coding. In overlay networks, the available bandwidth between sender and different receivers are different. In this paper, we propose a solution to improve the throughput of an overlay multicast session with heterogeneous receivers by organizing the receivers into layered data distribution meshes and sending substreams to each mesh using layered coding. Our solutions utilize alternative paths and network coding in each mesh. We first formulate the problem into a mathematical programming, whose optimal solution requires global information. We therefore present a distributed heuristic algorithm. The heuristic progressively organizes the receivers into layered meshes. Each receiver can subscribe to a proper number of meshes to maximize its throughput by fully utilizing its available bandwidth. The benefits of organizing the topology into layered mesh and using network coding are demonstrated through extensive simulations. Numerical results indicate that the average throughput of a multicast session is significantly improved (up to 50% to 60%) with only slightly higher delay and network resource consumption. 相似文献
18.
Reliable multicast, the lossless dissemination of data from one sender to a group of receivers, has a wide range of important applications in wireless networks. In this paper, we are interested in the reliable single-hop wireless multicast. As the wireless channel is inherently error prone, it is challenging to achieve high channel utilization in reliable wireless multicast. Most schemes proposed by now for reliable single-hop wireless multicast share the same weakness in that an entire frame will be retransmitted even if it has single error bit. To alleviate this problem, this paper presents an efficient reliable multicast scheme based on block-level ARQ and network coding technique. The new scheme breaks the data stream into blocks and retransmits only erroneous blocks (rather than the entire corrupted frame), where the novel network coding technique is further adopted to minimize the total number of block retransmissions. The theoretical analysis and simulation are conducted to demonstrate the performance of the new scheme and also some typical available schemes in terms of their bandwidth efficiency. The simulation and theoretical results indicate that new reliable wireless multicast scheme can significantly enhance the channel utilization, especially in the scenarios where bit error rate is high and the number of receivers is large. 相似文献
19.
在分析现有多播路由协议的基础上,本文提出了动态层次小组多播路由。多播数据源可以根据自治系统(AS)中接收者的多少而动态决定发送多播数据的方式。在一个AS中,对于一个特定的多播源,当多播数据接收者的数量较少时,用单播的方式;当自治系统中接收者较多时,用组地址的方式转发多播数据。同样,AS中的分枝节点亦可以根据该策略构造以分枝节点为根的动态管理方式,从而动态地构造层次多播路由体系结构。本文还定义了动态层次多播路由算法的数据结构以及功能模块,并从网络带宽与路由器计算两方面面分析了动态层次小组多播路由协议分发多播数据时的代价。 相似文献