无线接入网络中TCP流的上下行信道公平算法

在无线接入网络中,上行TCP流会极大地压制下行TCP流,导致严重的上下行信道TCP流不公平问题.本文指出TCP流的ACK包在接入节点下行缓存中的侵占性是上下行TCP不公平问题的直接原因,从限制缓存大小的新角度提出了MBA(Maximum Buffer for ACKs)算法.MBA算法基于上下行TCP流的不公平比例和缓存大小的关系,自适应地调节ACK包的最大缓存空间.理论分析和仿真实验结果表明MBA算法不但能通过限制ACK包的缓存空间实现上下行TCP流公平,还能通过减少无线信道ACK包传输概率提高网络总有效吞吐率.     

一种自适应的健壮TCP/IP报头压缩算法

在无线IP网络中，采用报头压缩技术减小TCP／IP协议报头带来的额外开销，提高无线信道的频谱利用率．然而现有的报头压缩方案没有考虑无线信道状态，无法很好地适应无线链路的时变特性．提出并分析了一种自适应的健壮TCP／IP报头压缩算法．该算法通过使用对无线信道状态的精确估计调节报头压缩器中W—LSB编码的可变滑动窗口大小，能够实现压缩率和抗差错健壮性之间较好的平衡，可以很好适应特性经常变化的无线链路．最后，给出了实验结果，证实了该算法在无线链路上的有效性．     

一种自适应的健壮TCP／IP报头压缩算法

本文针对现有的报头压缩方案没有考虑无线信道状态,无法很好地适应无线链路的时变特性。提出了一种自适应的健壮TCP／IP报头压缩算法。该算法通过使用对无线信道状态的精确估计,调节报头压缩器中W—LSB编码的可变滑动窗口大小,能够实现压缩率和抗差错健壮性之间较好的平衡。最后,通过仿真验证了该算法在无线链路上的有效性。     

无线Mesh网络中数据流间竞争研究

CSMA/CA协议与CSMA/CD协议的差异使数据流间的竞争具有与有线网络不同的特性。该文通过在无线Mesh网络实验床上进行的实验对无线数据流间的竞争进行研究。实验结果表明,在共享信道的无线Mesh网络中,UDP数据流在与TCP数据流的竞争中体现出较为明显的优势,而在TCP数据流间的竞争中,下行TCP数据流的吞吐率稍高于上行TCP数据流,2跳TCP数据流的吞吐率高于3跳TCP数据流。     

一种CDMA2000链路层自适应重传算法

TCP协议应用在3G无线网络中时，其传输性能受到了无线网络物理层帧差错率的严重影响。链路层重传技术可以大大改善TCP数据传输性能因无线信道误码率大而下降的情况。主要研究了CDMA2000中链路层重传技术对无线TCP数据传输的影响，并结合TCP层重传超时机制，提出了一种新的自适应链路层重传算法，提高了TCP在无线链路的数据传输性能。最后对该算法进行仿真，验证了此算法可以显著提高TCP吞吐率。     

无线IP网络中一种针对实时流的报头压缩算法

无线IP网中,为了能够有效利用带宽资源,使提供实时业务具有经济上的可行性和现实性,必须采用报头压缩技术减小协议报头带来的额外开销.然而,现有的报头压缩方案在设计时没有考虑无线信道状态.为了能够更好地适应无线链路特性,提出并分析了一种无线IP网络中针对实时流的基于信道状态的健壮报头压缩算法.该算法通过对无线信道状态的精确估计来调节报头压缩器中W-LSB编码的可变滑动窗口的大小,在压缩率和抗差错健壮性之间能够实现好的平衡,并适应特性经常变化的无线链路.最后,通过仿真结果证明该算法在无线链路上的有效性.     

基于非合作博弈的变电站无线网络资源研究

无线资源管理对实现资源的有效利用起着至关重要的作用.针对变电站中无线网络资源分配问题,提出了基于非合作博弈的变电站无线网络资源的优化管理算法,解决了全双工系统的无线电资源分配问题.将下行链路与上行链路的联合速率最大化问题建模成为上下行链路信道之间的非合作博弈,提出了基于非合作博弈的迭代算法.该算法有效的实现最佳上行链路与下行链路的资源分配,直到达到纳什均衡.仿真结果表明,该算法实现了快速收敛,与同等资源分配方法相比,可以显著提高全双工的性能.     

基于链路负载分级的无线Mesh网信道分配算法

由于无线Mesh网络信道分配算法的性能增益与网络的流量负载特点密切相关,在对多射频多信道无线Mesh网络的流量特点进行分析的基础上,提出一种静态信道分配的启发式算法LPFCA。该算法根据无线链路在网络拓扑中的位置信息来估计无线链路的预期负载情况,并对网络中无线链路的预期负载进行量化分级,利用整数线性规划方法对信道分配进行描述并应用目标函数对信道分配进行优化,使网络总的干扰权重最小化。仿真结果表明,相比于现有的算法,该算法在吞吐量上平均提升了18.9%。     

多跳无线 Ad hoc网络的分布式公平调度算法

为兼顾无线Ad hoc网络信道资源的公平利用及网络吞吐量,提出针对多跳无线Ad hoc网络的分布式公平调度算法。该算法采用链路竞争图说明网络中各子流的竞争关系,通过着色算法得到最大无竞争流的集合,通过邻居节点之间的信息交换得到局部(本地)流的信息,而无需全局流的信息交换。实验模拟结果表明,该算法可以在保证Ad hoc网络中各流公平性的同时,有效提高网络资源的利用率。     

无线网络的拥塞控制机制研究

由于有线网络TCP拥塞控制机制是建立在拥塞是网络丢包原因的基础上，所以该机制不能适应无线网络中高误码率造成的无线链路丢包的情况。因此，我们提出了一种改进的TCP拥塞控制机制AED和TCP．WX算法，此机制和算法能有效地降低无线网络中的丢包数，提高信道的利用率。     

面向网络能效优化的动态权重队列管理算法

针对流量传输过程中能效优化的问题,提出一种面向网络能效优化的动态权重队列管理算法DW_WFQ。该算法在加权公平队列(WFQ)的基础上通过动态地分配各类业务流的权重,以更加灵活的方式分配各类业务流的服务速率,进而与连续流速度缩放模型的能效函数相结合,推导出了该调度算法的能耗模型并且对其进行了能效优化。通过Matlab仿真,进行了DW_WFQ、先到先服务(FCFS)和WFQ三种算法的能耗对比,仿真结果表明:所提的流量调度算法在满足业务流服务质量(QoS)约束的基础上,能够有效降低系统能耗。     

Controllable fair queuing for meeting performance goals

Computing and storage utilities must control resource usage to meet contractual performance targets for hosted customers under dynamic conditions, including flash crowds and unexpected resource failures. This paper explores properties of proportional share resource schedulers that are necessary for stability and responsiveness under feedback control. It shows that the fairness properties commonly defined for proportional share schedulers using Weighted Fair Queuing (WFQ) are not preserved across changes to the relative weights of competing request flows. As a result, conventional WFQ schedulers are not controllable by a resource controller that adapts by adjusting the weights. The paper defines controllable fairness properties, presents an algorithm to adjust any WFQ scheduler when the weights change, and proves that the algorithm results in controllable-fair schedulers.

The analytic results are confirmed by experimental evaluation using a three-tier Web service and a prototype controllable-fair scheduler called C-SFQ(D). C-SFQ(D) extends concurrency-controlled Start-time Fair Queuing (SFQ(D), which supports proportional sharing in multi-tasking computing resources. The prototype includes an adaptive control system that adjusts the flow weights in C-SFQ(D) to meet latency and throughput targets under a variety of conditions. The experimental results demonstrate the importance of controllable-fair scheduling for feedback control of computing utilities.     

Embedded fuzzy expert system for Adaptive Weighted Fair Queueing

This paper introduces an embedded fuzzy expert system for Adaptive Weighted Fair Queueing (AWFQ) located in the network traffic router to update weights for output queues. WFQ algorithm allows differentiated service for traffic classes according to Quality of Service (QoS) requirements. Link sharing and packet scheduling methods are the most critical factors when guaranteeing QoS. There are many different scheduling mechanisms but adequate and adaptive QoS aware scheduling solutions are still in a phase of development due to the rapid growth of multimedia in the Internet. The proposed AWFQ model in this work simplifies the link sharing to two service classes: one for UDP and another for TCP. The implementation of the model is based on adaptive change of weight coefficients that determine the amount of allowed bandwidth for the service class. New weight coefficients are calculated periodically on routers according to developed embedded fuzzy expert system. It is shown through simulations that the AWFQ model is more stable and reacts faster to different traffic states than the traditional WFQ scheduler. The embedded expert system adjusts the weights of AWFQ with two parameters that are based on the share of the UDP and TCP input traffic data rate and the change of the share of the UDP and TCP input data rate.     

Shielding TCP from Wireless Link Errors: Retransmission Effort and Fragmentation

A known problem for TCP connections over wireless links is that errors in the wireless channel interfere with the TCP protocol even for minor packet loss. In the first part of this paper we evaluate how the data rate reduction depends on the channel delay. For comparatively short delays in the order of 100 ms, the decrease of the throughout is noticeable but not dramatic. This indicates that the problem is not severe if the communication partners are located in the same WLAN or interact over a fast Internet connection. A significant throughput reduction arises in the case of a large network delay. Simulation results for the uplink transmission are presented as part of an overall strategy in which all improvements are made by optimizing the mobile end device only, an approach which allows performance improvements without any protocol modifications.     

Using traffic asymmetry to enhance TCP performance

A wealth of recent work has gone into optimizing the performance of Transmission Control Protocol (TCP) on the downlink channel of wireless networks such as for example, honing its congestion awareness mechanism so that it is minimally affected by random wireless losses, and optimizing achieved fairness of the end-to-end TCP rates. Other work has gone into balancing the allocation of a shared resource between the downlink and uplink in order to optimize TCP performance. We build on such previous research by proposing a cross-layer algorithm for resource allocation in OFDMA systems aiming not only to achieve optimal throughput for competing TCP flows but also to allocate resources appropriately between the downlink and uplink. This is important due to the increasing number of Internet applications where the mobile terminal is the TCP sender (social networking, peer-to-peer, etc.). Therefore, our scheme makes use of the asymmetry in the traffic and by defining the boundary between downlink and uplink capacity dynamically, enhance the TCP performance. Through numerical investigations we show the performance of the proposed scheme in terms of achieved fairness to the receivers and efficient allocation of downlink to uplink ratios based on the TCP traffic.     

数据中心网络基于优先级拥塞控制的最后期限可感知TCP协议

数据中心对应用服务提出了越来越严格以及多样化的要求,例如,为使用户请求得到更多的反馈应答,大多数应用对传输延迟有最后期限的限制,使得更少的最后期限错过率成为各种协议争相比较的指标,因此出现了基于TCP的最后期限可感知协议.但这类协议存在优先级同步问题,即相似优先级流竞争时总是相继错过最后期限.为此,提出了基于优先级控制的两种降速协议HPD(highest priority deceleration deadline-aware data center TCP)和P²D(priority probability deceleration deadline-aware data center TCP),对具有侵略性的高优先级数据流进行自适应的降速处理.实验结果表明,与已有的D²TCP相比,降速协议在优先级高度同步的情况下能够减少20%的错过率.     

命名数据网络中的一种主动拥塞控制策略

为解决命名数据网络（Named Data Networking,NDN）中的拥塞控制问题,在加权公平排队（Weighted Fair Queuing,WFQ）算法的基础上,提出了基于即时调整兴趣包发送速率的名字加权公平排队（Name Weighted Fair Queuing,NWFQ）算法。当网络拥塞时,利用基于令牌桶算法的速率限制机制对超速流进行降速惩罚,同时更新兴趣包中的拥塞信息域并将其逐跳反馈给下游路由器;利用数据包将拥塞信息反馈给请求端,请求端据此调整兴趣包的发送速率,从而解决网络拥塞。基于ndnSIM的仿真结果表明,该算法能有效提升瓶颈链路利用率并接近95%,同时保证较低的丢包率和平均流完成时间。     

Research into two source-based control algorithms for Internet traffic flows

TCP and UDP are the major applications over the Internet, the characteristics of them lead to different network transmission behaviors. Two source-based mechanisms are proposed in this paper to regulate TCP and UDP flows. One is the congestion control mechanism, which uses TCP flows’ congestion signal to regulate the flows at the source node. The other is the time slot mechanism, which is a time-sharing application to control their flow transmission. Based on the priorities of flows, different bandwidth proportions are allocated and differential services are provided for flows. Several scenarios are simulated to observe the transmission operations of these two mechanisms. Simulation results show some insights into two mechanisms. Moreover, the several simulation parameters that may impact the performance of these two mechanisms are summarized.     

TCP友好速率控制协议的分析及应用

传统的TCP由于采用速率减半的拥塞退避机制而使其在数据传输时易产生过大的速率波动,而UDP不具备拥塞退避机制,在拥塞的网络环境中,UDP流将大量抢占TCP流的网络带宽,同时自身的丢包也迅速增加,并可能带来系统拥塞崩溃的潜在危险,因此TCP和UDP都不能很好地满足实时流媒体业务的需要。文中研究了一个具有拥塞退避机制、网络吞吐量波动小,且能够与TCP协议公平分享带宽的传输协议———TCP友好速率控制协议(TFRC),并将其应用于实时多媒体流传输应用程序。研究测试结果表明采用TFRC后多媒体的实时播放较TCP平滑了许多。     

GE信道下WLAN节能站点传输TCP流功耗分析模型*

针对目前在无线局域网(WLAN)基础服务集(BSS)节能站点功耗分析模型上没有融入错误信道模型的问题,本文有机地结合了Gilbert-Elliot(GE)错误信道模型和WLAN BSS节能模式站点传输TCP流的功耗模型,提出并建立一种新的混合模型,同时给出了GE信道参数影响节能站点传输TCP流功耗的量化表达式,通过网络模拟器(NS2)仿真验证了新模型的正确性和有效性。