一种新的分层多播拥塞控制协议

提出了一种新的自适应分层多播拥塞控制方案(ALM)。ALM是发送方与接收方共同驱动、由路由器辅助流量控制的拥塞控制方案,通过把发送方的动态分层和接收方的自适应速率调整有机结合,不仅增强了分层多播的适应能力,提高了系统的吞吐量,而且较好地满足了TCP友好性。仿真实验表明,ALM能有效地利用网络带宽,解决网络带宽的异构性问题,并能通过接收端计算TCP友好速率,使接收端达到与TCP流公平竞争网络资源的目的。     

Congestion control for multimedia applications in the wireless internet

This paper provides a parallel review of two important issues for the next‐generation multimedia networking. Firstly, the emerging multimedia applications require a fresh approach to congestion control in the Internet. Currently, congestion control is performed by TCP; it is optimised for data traffic flows, which are inherently elastic. Audio and video traffic do not find the sudden rate fluctuations imposed by the TCP multiplicative‐decrease control algorithm optimal. The second important issue is the mobility support for multimedia applications. Wireless networks are characterized by a substantial packet loss due to the imperfection of the radio medium. This increased packet loss disturbs the foundation of TCP's loss‐based congestion control. This paper contributes to the ongoing discussion about the Internet congestion control by providing a parallel analysis of these two issues. The paper describes the main challenges, design guidelines, and existing proposals for the Internet congestion control, optimised for the multimedia traffic in the wireless network environment. Copyright © 2004 John Wiley & Sons, Ltd.     

TFRC friendliness and the case of ECN

The TFRC protocol has been proposed as a TCP‐friendly protocol to transport streaming media over the Internet. However, its deployment is still questionable because it has not been compared to other important protocols, analysed in the presence of important mechanisms, such as the explicit congestion notification (ECN), and studied under more realistic network conditions. In this paper, we address these three aspects, including other congestion control protocols not considered before in the same investigation, such as TCP Tahoe, Reno, Newreno, Vegas, Sack, GAIMD, and the Binomial algorithms, the effect of using ECN in the friendliness of the protocols, and the fairness of the protocols under static and dynamic network conditions. We found that TFRC can be safely deployed in the Internet if competing with TCP Tahoe, New Reno and SACK since fairness is achieved under all scenarios considered. We also found that ECN actually helps in achieving better fairness. However, fairness problems arise when TFRC competes with TCP Reno, GAIMD, SQRT or IIAD in static or dynamic conditions, or both. We used normalized throughput, fairness index, and convergence time as the main performance metrics for comparison. Copyright © 2004 John Wiley & Sons, Ltd.     

基于覆盖网络的灾后通信网络恢复策略

为解决灾后通信网络损毁故障恢复问题,基于覆盖网络提出了通信网络恢复新策略,应用覆盖网络与源路由实现了通信网络路径的多样性,系统恢复中选取最佳landmark,为网络流量重新确定传输路径,保证节点传输中可有效绕过灾后故障区域.同时考虑到灾后区域通信故障中极容易出现的信息爆炸情况,加入了拥塞感知恢复系统,构建了一种灾后通信...     

基于消息优先级的 OppIoV拥塞控制策略

针对机会车联网的网络拥塞问题,提出了一种基于所传输消息优先级的车辆节点拥塞控制策略。当车辆节点存储空间不足而又需要存储新的消息时,该车辆节点内的所有消息按照其优先级由高到低排列,丢弃优先级最低的消息,直至有存储空间来接收新的消息。通过大量的仿真实验与传统的丢弃策略对比,该拥塞控制策略能显著提高消息的递交率,减小开销,并对网络拥塞状况有更好的自适应能力。     

VANET 中一种安全消息拥塞控制机制

针对车辆无线自组织网络在车流量密度大的情况下,周期性安全消息产生的Beacons可能占据整个信道带宽,从而导致信道拥塞的问题,提出了一种基于调整Beacon频率和车辆通信半径的拥塞控制机制。该机制首先为周期性安全消息和突发事件安全消息提出了一个信道分配算法,将周期性安全消息在信道中占用的带宽资源限定在一定的门限以下,保证有足够的信道资源传输突发事件安全消息。然后,在保证车辆用户安全的条件下,根据精确性要求和成功接收率,动态地调整Beacon频率和车辆通信半径,来控制信道中能够容纳的用户数,避免信道拥塞。     

ATXOP：一种传输机会自适应分配算法

在无线局域网(W LAN)中,由于各个站点竞争信道引起的数据帧冲突严重损害了整个网络的性能。首先分析了目前提高无线局域网性能的算法及存在的问题,在此基础上提出了一种自适应分配传输机会(TXOP)的算法ATXOP。该算法根据当前信道隙利用率,动态地调整连续传输数据帧的数目。不仅减少了由传统竞争算法引起的网络拥塞,而且避免了固定分配传输机会带来的不公平性。算法简单易行。仿真结果表明,在保证公平性的同时,该算法能够有效地提高网络的吞吐量和降低数据帧传输平均延时。     

智能动态网络资源分配系统

通过对解决GSM移动通信网络热点区域话务拥塞问题的研究，提出了利用可控功分器实现智能动态网络资源的分配，解决不同种类的话务拥塞问题，并着重讨论了该系统目前的成功运用及前景。     

适于ATM的分层视频编码

ＡＴＭ的统计复用特性，使信道资源得到充分利用；同时又要求其上的业务必须具备抗信元丢失的能力。在视频编码领域，可以通过分层编码减少信元丢失所造成的影响，保证在恶劣条件下实现正常的通信。对一种通用的视频编码器进行了改进，提高了视频编码器的压缩比，并且改善了其信元丢失性能。     

在ATM网络中业务流分布的自适应路由优化控制

根据ＡＴＭ网络中所有信道上业务流的分布情况，采用业务流自适应的优化算法，动态地调整各节点的路由，达到防止拥塞，保证服务质量的目的。