The throughput (total bit per second per hertz) of a modified Proportional Fair Algorithm (PFA) is analyzed and computed. The modified PFA introduces a dynamic threshold to filter the feedbacks of Channel Quality (CQ)...The throughput (total bit per second per hertz) of a modified Proportional Fair Algorithm (PFA) is analyzed and computed. The modified PFA introduces a dynamic threshold to filter the feedbacks of Channel Quality (CQ) based on which the users' priorities are calculated for scheduling. Only those in good CQs (relative to their own average CQ) can be the candidates for scheduling. The results show that the modified PFA with a low CQ threshold can not only reduce some feedback overhead but also maintain the throughput of traditional PFA. Interestingly, for a certain combination of system parameters, the throughput gain over traditional PFA can be achieved by this modified PFA. Two methods of calculating priority, one based on signal to noise ratio, and the other on information rate, are considered. Their performances are generally similar in terms of throughput.展开更多
A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integrated-services is analyzed. It is shown that the rate of each stream in the in...A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integrated-services is analyzed. It is shown that the rate of each stream in the integrated-services would converge to a stable value if the transmittfing or forwarding rates converge to that of the receiving exponentially.展开更多
Quality of Service (QoS) generally refers to measurable like latency and throughput, things that directly affect the user experience. Queuing (the most popular QoS tool) involves choosing the packets to be sent based ...Quality of Service (QoS) generally refers to measurable like latency and throughput, things that directly affect the user experience. Queuing (the most popular QoS tool) involves choosing the packets to be sent based on something other than arrival time. The Active queue management is important subject to manage this queue to increase the effectiveness of Transmission Control Protocol networks. Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, Random Early Detection (RED), and many of its variants employ queue length as a congestion indicator to trigger packet dropping. One of these enhancements of RED is FRED or Fair Random Early Detection attempts to deal with a fundamental aspect of RED in that it imposes the same loss rate on all flows, regardless of their bandwidths. FRED also uses per-flow active accounting, and tracks the state of active flows. FRED protects fragile flows by deterministically accepting flows from low bandwidth connections and fixes several shortcomings of RED by computing queue length during both arrival and departure of the packet. Unlike FRED, we propose a new scheme that used hazard rate estimated packet dropping function in FRED. We call this new scheme Enhancement Fair Random Early Detection. The key idea is that, with EFRED Scheme change packet dropping function, to get packet dropping less than RED and other AQM algorithms like ARED, REM, RED, etc. Simulations demonstrate that EFRED achieves a more stable throughput and performs better than current active queue management algorithms due to decrease the packets loss percentage and lowest in queuing delay, end to end delay and delay variation (JITTER).展开更多
Two utility-optimization dynamic subcarrier allocation(DSA) algorithms are designed for single carrier frequency division multiple access system(SC-FDMA).The two proposed algorithms aim to support diverse transmission...Two utility-optimization dynamic subcarrier allocation(DSA) algorithms are designed for single carrier frequency division multiple access system(SC-FDMA).The two proposed algorithms aim to support diverse transmission capacity requirements in wireless networks,which consider both the channel state information(CSI) and the capacity requirements of each user by setting appropriate utility functions.Simulation results show that with considerable lower computational complexity,the first utility-optimization algorithm can meet the system capacity requirements of each user effectively.However,the rate-sum capacity performance is poor.Furthermore,the second proposed utility-optimization algorithm can contribute a better trade-off between system rate-sum capacity requirement and the capacity requirements of each user by introducing the signal to noise ratio(SNR) information to the utility function based on the first utility-optimization algorithm,which can improve the user requirements processing capability as well as achieve a better sum-rate capacity.展开更多
The problem of ship hull plate processing surface fairing with constraints based on B-spline is solved in this paper. The algorithm for B-spline curve fairing with constraints is one of the most common methods in plan...The problem of ship hull plate processing surface fairing with constraints based on B-spline is solved in this paper. The algorithm for B-spline curve fairing with constraints is one of the most common methods in plane curve fairing. The algorithm can be applied to global and local curve fairing. It can constrain the perturbation range of the control points and the shape variation of the curve, and get a better fairing result in plane curves. In this paper, a new fairing algorithm with constraints for curves and surfaces in space is presented. Then this method is applied to the experiments of ship hull plate processing surface. Finally numerical results are obtained to show the efficiency of this method.展开更多
To improve and optimize the bandwidth utilization for multi-service packet transporting system, a kind of Dynamic Full Bandwidth Utilized （DFBU） allocation algorithm allowing a single link to use far beyond its fair...To improve and optimize the bandwidth utilization for multi-service packet transporting system, a kind of Dynamic Full Bandwidth Utilized （DFBU） allocation algorithm allowing a single link to use far beyond its fair share bandwidth is presented. Three important parameters as the bound on max and minimum bandwidth, the maximum packet delay and the minimum bandwidth utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system use all the spare bandwidth （up to full-bandwidth） while the performance of fairness and QoS requirement is still guaranteed.展开更多
针对电动垂直起降飞行器(electric Vertical Take-off and Landing,eVTOL)合乘运营场景下的动态请求匹配问题,对合乘匹配及路径规划进行研究.首先,考虑eVTOL垂直起降机场容量、eVTOL载重、电池能耗等限制,以乘客和eVTOL运营商利益最大...针对电动垂直起降飞行器(electric Vertical Take-off and Landing,eVTOL)合乘运营场景下的动态请求匹配问题,对合乘匹配及路径规划进行研究.首先,考虑eVTOL垂直起降机场容量、eVTOL载重、电池能耗等限制,以乘客和eVTOL运营商利益最大化为目标建立基于合乘公平性的动态eVTOL路径规划模型;其次,使用基本插入算法和线性插入算法对问题模型进行求解,并对比分析按照先到先服务和请求优先级将新请求与eVTOL进行匹配的两种处理方式;最后,以T市5个火车站和1个机场作为垂直机场,用其实际地理位置信息进行算例研究.研究结果表明:与基本插入算法相比,线性插入算法的计算时间缩短了60%以上,证明该算法可以有效求解模型;与按照先到先服务处理方式相比,请求优先级处理新请求时乘客的平均支付费用减少了0.87%,运营商合乘收益提升了5.86%,实现了在保障乘客和运营商利益下新请求与eVTOL的较优匹配.所构建的动态路径规划模型为eVTOL共享运营模式提供参考.展开更多
针对NOMA-VLC系统中固定功率分配(Fixed Power Allocation,FPA)方法存在用户间干扰严重问题导致通信可靠性差,迭代注水功率分配(Iterative Water-filling Power Allocation,IWPA)方法存在难以保证用户公平性问题,提出基于信道容量的功...针对NOMA-VLC系统中固定功率分配(Fixed Power Allocation,FPA)方法存在用户间干扰严重问题导致通信可靠性差,迭代注水功率分配(Iterative Water-filling Power Allocation,IWPA)方法存在难以保证用户公平性问题,提出基于信道容量的功率分配方法,首先对多用户场景下的系统模型进行分析;在此基础上,基于迭代优化的方式进行发送端用户功率分配,达到信道容量的目标函数,保证系统可靠性和用户公平性;最后建立实验平台,通过蒙特卡洛实验对系统性能进行分析,实验结果表明:在三种不同的调制格式下,文中方法相较于FPA方法系统平均获得10 dB以上性能增益,相较于IWPA方法系统保证两用户可靠通信;随着前端调制阶次的提高,文中方法有效降低SNR需求,减小用户间的性能差异,使用户公平性得到良好保证。展开更多
文摘The throughput (total bit per second per hertz) of a modified Proportional Fair Algorithm (PFA) is analyzed and computed. The modified PFA introduces a dynamic threshold to filter the feedbacks of Channel Quality (CQ) based on which the users' priorities are calculated for scheduling. Only those in good CQs (relative to their own average CQ) can be the candidates for scheduling. The results show that the modified PFA with a low CQ threshold can not only reduce some feedback overhead but also maintain the throughput of traditional PFA. Interestingly, for a certain combination of system parameters, the throughput gain over traditional PFA can be achieved by this modified PFA. Two methods of calculating priority, one based on signal to noise ratio, and the other on information rate, are considered. Their performances are generally similar in terms of throughput.
文摘A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integrated-services is analyzed. It is shown that the rate of each stream in the integrated-services would converge to a stable value if the transmittfing or forwarding rates converge to that of the receiving exponentially.
文摘Quality of Service (QoS) generally refers to measurable like latency and throughput, things that directly affect the user experience. Queuing (the most popular QoS tool) involves choosing the packets to be sent based on something other than arrival time. The Active queue management is important subject to manage this queue to increase the effectiveness of Transmission Control Protocol networks. Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, Random Early Detection (RED), and many of its variants employ queue length as a congestion indicator to trigger packet dropping. One of these enhancements of RED is FRED or Fair Random Early Detection attempts to deal with a fundamental aspect of RED in that it imposes the same loss rate on all flows, regardless of their bandwidths. FRED also uses per-flow active accounting, and tracks the state of active flows. FRED protects fragile flows by deterministically accepting flows from low bandwidth connections and fixes several shortcomings of RED by computing queue length during both arrival and departure of the packet. Unlike FRED, we propose a new scheme that used hazard rate estimated packet dropping function in FRED. We call this new scheme Enhancement Fair Random Early Detection. The key idea is that, with EFRED Scheme change packet dropping function, to get packet dropping less than RED and other AQM algorithms like ARED, REM, RED, etc. Simulations demonstrate that EFRED achieves a more stable throughput and performs better than current active queue management algorithms due to decrease the packets loss percentage and lowest in queuing delay, end to end delay and delay variation (JITTER).
基金Supported by the National Basic Research Program of China(No.61393010101-1)the Defense-related Science & Technology Pre-Research Project of Shipbuilding Institute(No.10J3.1.6)
文摘Two utility-optimization dynamic subcarrier allocation(DSA) algorithms are designed for single carrier frequency division multiple access system(SC-FDMA).The two proposed algorithms aim to support diverse transmission capacity requirements in wireless networks,which consider both the channel state information(CSI) and the capacity requirements of each user by setting appropriate utility functions.Simulation results show that with considerable lower computational complexity,the first utility-optimization algorithm can meet the system capacity requirements of each user effectively.However,the rate-sum capacity performance is poor.Furthermore,the second proposed utility-optimization algorithm can contribute a better trade-off between system rate-sum capacity requirement and the capacity requirements of each user by introducing the signal to noise ratio(SNR) information to the utility function based on the first utility-optimization algorithm,which can improve the user requirements processing capability as well as achieve a better sum-rate capacity.
基金Supported by Hi -tech Research and Development Program of China(No. 2001AA421200).
文摘The problem of ship hull plate processing surface fairing with constraints based on B-spline is solved in this paper. The algorithm for B-spline curve fairing with constraints is one of the most common methods in plane curve fairing. The algorithm can be applied to global and local curve fairing. It can constrain the perturbation range of the control points and the shape variation of the curve, and get a better fairing result in plane curves. In this paper, a new fairing algorithm with constraints for curves and surfaces in space is presented. Then this method is applied to the experiments of ship hull plate processing surface. Finally numerical results are obtained to show the efficiency of this method.
文摘To improve and optimize the bandwidth utilization for multi-service packet transporting system, a kind of Dynamic Full Bandwidth Utilized （DFBU） allocation algorithm allowing a single link to use far beyond its fair share bandwidth is presented. Three important parameters as the bound on max and minimum bandwidth, the maximum packet delay and the minimum bandwidth utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system use all the spare bandwidth （up to full-bandwidth） while the performance of fairness and QoS requirement is still guaranteed.
文摘针对电动垂直起降飞行器(electric Vertical Take-off and Landing,eVTOL)合乘运营场景下的动态请求匹配问题,对合乘匹配及路径规划进行研究.首先,考虑eVTOL垂直起降机场容量、eVTOL载重、电池能耗等限制,以乘客和eVTOL运营商利益最大化为目标建立基于合乘公平性的动态eVTOL路径规划模型;其次,使用基本插入算法和线性插入算法对问题模型进行求解,并对比分析按照先到先服务和请求优先级将新请求与eVTOL进行匹配的两种处理方式;最后,以T市5个火车站和1个机场作为垂直机场,用其实际地理位置信息进行算例研究.研究结果表明:与基本插入算法相比,线性插入算法的计算时间缩短了60%以上,证明该算法可以有效求解模型;与按照先到先服务处理方式相比,请求优先级处理新请求时乘客的平均支付费用减少了0.87%,运营商合乘收益提升了5.86%,实现了在保障乘客和运营商利益下新请求与eVTOL的较优匹配.所构建的动态路径规划模型为eVTOL共享运营模式提供参考.
文摘针对NOMA-VLC系统中固定功率分配(Fixed Power Allocation,FPA)方法存在用户间干扰严重问题导致通信可靠性差,迭代注水功率分配(Iterative Water-filling Power Allocation,IWPA)方法存在难以保证用户公平性问题,提出基于信道容量的功率分配方法,首先对多用户场景下的系统模型进行分析;在此基础上,基于迭代优化的方式进行发送端用户功率分配,达到信道容量的目标函数,保证系统可靠性和用户公平性;最后建立实验平台,通过蒙特卡洛实验对系统性能进行分析,实验结果表明:在三种不同的调制格式下,文中方法相较于FPA方法系统平均获得10 dB以上性能增益,相较于IWPA方法系统保证两用户可靠通信;随着前端调制阶次的提高,文中方法有效降低SNR需求,减小用户间的性能差异,使用户公平性得到良好保证。
