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.展开更多
On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in ...On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand,and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integratedservices would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.展开更多
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).展开更多
A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the pote...A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the potential fairness issue that may arise from the maximum sum-rate based objective function and the optical power constraints are set considering the non-negativity of the transmit signal, the requirement of the human eyes safety and all users' quality of service(Qo S). Then, the SSA is utilized to solve this optimization problem. Moreover, to demonstrate the superiority of the proposed strategy, it is compared with the fixed power allocation(FPA) and the gain ratio power allocation(GRPA) schemes. Results show that regardless of the number of users considered, the sum-rate achieved by SSA consistently outperforms that of FPA and GRPA schemes. Specifically, compared to FPA and GRPA schemes, the sum-rate obtained by SSA is increased by 40.45% and 53.44% when the number of users is 7, respectively. The proposed SSA also has better performance in terms of user fairness. This work will benefit the design and development of the NOMA-visible light communication(VLC) systems.展开更多
The excessive use of artificial intelligence(AI)algorithms has caused the problem of errors in AI algorithms,which has challenged the fairness of decision-making,and has intensified people’s inequality.Therefore,it i...The excessive use of artificial intelligence(AI)algorithms has caused the problem of errors in AI algorithms,which has challenged the fairness of decision-making,and has intensified people’s inequality.Therefore,it is necessary to conduct in-depth research and propose corresponding error detection and error elimination methods.This paper first proposes the root causes and threats of bias in AI algorithms,then summarizes the existing bias detection and error elimination methods,and proposes a bias processing framework in three-level dimensions of data,models,and conclusions,aiming to provide a framework for a comprehensive solution to errors in algorithms.At the same time,it also summarizes the problems and challenges in existing research and makes a prospect for future research trends.It is hoped that it will be helpful for us to build fairer AI.展开更多
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.展开更多
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.展开更多
Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performanc...Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performances of efficiency, fairness and complexity into consideration, the proposed algorithm enhances the efficiency of air interface resource at the expense of the short-time unfairness, but ensures the long-time fairness. Moreover, the proposed algorithm introduces an efficient QoS assurance mechanism, which implements the functions of congestion control, queuing management and traffic management. The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. Especially on the occasion of heavy-traffic requirement, the performance of efficiency and fairness can be improved by 50% at most.展开更多
In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule...In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule algorithm (DS-OCS) and distributed proportional fairness schedule algorithm (DPFS-OCS) based on orthogonal complement space (OCS) were proposed. The first right and left singular vectors of the channel that the user experienced were selected as the transmitting and receiving beamforming vectors. An interference space was spanned by the left singular vectors of the entire interference users in the same channel. The most suitable user lay in the OCS of the interference space was scheduled to avoid suffering interference from neighboring cells based on the criterion of system capacity maximizing and proportional fairness. The simulation results show that the average system capacity can be improved by 2%-4% compared with the DS-OCS algorithm with the Max C/I algorithm,by 6%-10% compared with the DPFS-OCS algorithm with the PF algorithm.展开更多
A kind of Dynamic Full Bandwidth Utilized (DFBU) allocation algorithm is introduced. This algorithm allows a single link to use bandwidth far beyond its fair share bandwidth in a multi-service packet transporting syst...A kind of Dynamic Full Bandwidth Utilized (DFBU) allocation algorithm is introduced. This algorithm allows a single link to use bandwidth far beyond its fair share bandwidth in a multi-service packet transporting system. Three important parameters as the bound on maximum and minimum bandwidth, the maximum packet delay and the minimum band width utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system to use all the spare bandwidth (up to full-bandwidth) while the performance of fairness and QoS requirement is still guaranteed.展开更多
The problem of distributed proportional fair inter-cell frequency allocation for flat-structured cellular systems is studied in this paper. We firstly propose a framework of the frequency allocation in which the whole...The problem of distributed proportional fair inter-cell frequency allocation for flat-structured cellular systems is studied in this paper. We firstly propose a framework of the frequency allocation in which the whole frequency allocation process is decomposed into many consecutive stages, then identify that for each stage the key is to find the Maximum Weight Independent Set (MWIS) in a given weighted conflict graph in the distributed manner. A new distributed algorithm for MWIS is described in which each node iteratively exchanges messages with neighbors. With this distributed MWIS algorithm, a new distributed proportional fair frequency allocation scheme is presented. The performance of the proposed algorithm is tested in computer experiments simulating the Long Term Evolution (LTE) cellular systems. Simulation results show the performance of the proposed distributed proportional fair frequency allocation scheme is comparable with the centralized ones.展开更多
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.展开更多
针对电动垂直起降飞行器(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需求,减小用户间的性能差异,使用户公平性得到良好保证。展开更多
Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible t...Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible traffic based on the total amount of uncommitted bandwidth. RPR draft employs distributed bandwidth control algorithm in order to assure global fairness. In this paper, we suggest a new fairness control algorithm termed Congestion Distributed Fairness Algorithm (CDFA) that exhibits better pe...展开更多
文摘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.
文摘On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand,and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integratedservices would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.
文摘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 Cooperative Research Project between China Coal Energy Research Institute Co.,Ltd. and Xidian University (No.N-KY-HX-1101-202302-00725)the Key Research and Development Program of Shaanxi Province (No.2017ZDCXL-GY-06-02)。
文摘A non-orthogonal multiple access(NOMA) power allocation scheme on the basis of the sparrow search algorithm(SSA) is proposed in this work. Specifically, the logarithmic utility function is utilized to address the potential fairness issue that may arise from the maximum sum-rate based objective function and the optical power constraints are set considering the non-negativity of the transmit signal, the requirement of the human eyes safety and all users' quality of service(Qo S). Then, the SSA is utilized to solve this optimization problem. Moreover, to demonstrate the superiority of the proposed strategy, it is compared with the fixed power allocation(FPA) and the gain ratio power allocation(GRPA) schemes. Results show that regardless of the number of users considered, the sum-rate achieved by SSA consistently outperforms that of FPA and GRPA schemes. Specifically, compared to FPA and GRPA schemes, the sum-rate obtained by SSA is increased by 40.45% and 53.44% when the number of users is 7, respectively. The proposed SSA also has better performance in terms of user fairness. This work will benefit the design and development of the NOMA-visible light communication(VLC) systems.
文摘The excessive use of artificial intelligence(AI)algorithms has caused the problem of errors in AI algorithms,which has challenged the fairness of decision-making,and has intensified people’s inequality.Therefore,it is necessary to conduct in-depth research and propose corresponding error detection and error elimination methods.This paper first proposes the root causes and threats of bias in AI algorithms,then summarizes the existing bias detection and error elimination methods,and proposes a bias processing framework in three-level dimensions of data,models,and conclusions,aiming to provide a framework for a comprehensive solution to errors in algorithms.At the same time,it also summarizes the problems and challenges in existing research and makes a prospect for future research trends.It is hoped that it will be helpful for us to build fairer AI.
文摘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.
基金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.
基金DONG Guojun, born in 1976,male, doctorate student,E-mail:zjrobindong@163.com.
文摘Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performances of efficiency, fairness and complexity into consideration, the proposed algorithm enhances the efficiency of air interface resource at the expense of the short-time unfairness, but ensures the long-time fairness. Moreover, the proposed algorithm introduces an efficient QoS assurance mechanism, which implements the functions of congestion control, queuing management and traffic management. The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. Especially on the occasion of heavy-traffic requirement, the performance of efficiency and fairness can be improved by 50% at most.
基金Projects(2009ZX03003-003, 2009ZX03003-004) supported by the Major National Science & Technology ProgramProject(B08038) supported by the "111" Project+1 种基金Project(HX0109012417) supported by Huawei Technologies Co., Ltd, ChinaProject(IRT0852) supported by Program for Changjiang Scholars and Innovative Research Team in Chinese University
文摘In order to avoid severe performance degradation led by the inter-cell interference (ICI) in orthogonal frequency division multiple access (OFDMA) systems with a frequency reused factor (FRF) of 1,distributed schedule algorithm (DS-OCS) and distributed proportional fairness schedule algorithm (DPFS-OCS) based on orthogonal complement space (OCS) were proposed. The first right and left singular vectors of the channel that the user experienced were selected as the transmitting and receiving beamforming vectors. An interference space was spanned by the left singular vectors of the entire interference users in the same channel. The most suitable user lay in the OCS of the interference space was scheduled to avoid suffering interference from neighboring cells based on the criterion of system capacity maximizing and proportional fairness. The simulation results show that the average system capacity can be improved by 2%-4% compared with the DS-OCS algorithm with the Max C/I algorithm,by 6%-10% compared with the DPFS-OCS algorithm with the PF algorithm.
文摘A kind of Dynamic Full Bandwidth Utilized (DFBU) allocation algorithm is introduced. This algorithm allows a single link to use bandwidth far beyond its fair share bandwidth in a multi-service packet transporting system. Three important parameters as the bound on maximum and minimum bandwidth, the maximum packet delay and the minimum band width utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system to use all the spare bandwidth (up to full-bandwidth) while the performance of fairness and QoS requirement is still guaranteed.
基金Supported by the National Mobile Communications Research Laboratory, Southeast University (No. 2011D17)the Nanjing University of Posts and Telecommunications Program (No. NY208049)
文摘The problem of distributed proportional fair inter-cell frequency allocation for flat-structured cellular systems is studied in this paper. We firstly propose a framework of the frequency allocation in which the whole frequency allocation process is decomposed into many consecutive stages, then identify that for each stage the key is to find the Maximum Weight Independent Set (MWIS) in a given weighted conflict graph in the distributed manner. A new distributed algorithm for MWIS is described in which each node iteratively exchanges messages with neighbors. With this distributed MWIS algorithm, a new distributed proportional fair frequency allocation scheme is presented. The performance of the proposed algorithm is tested in computer experiments simulating the Long Term Evolution (LTE) cellular systems. Simulation results show the performance of the proposed distributed proportional fair frequency allocation scheme is comparable with the centralized ones.
基金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.
文摘针对电动垂直起降飞行器(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需求,减小用户间的性能差异,使用户公平性得到良好保证。
文摘Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible traffic based on the total amount of uncommitted bandwidth. RPR draft employs distributed bandwidth control algorithm in order to assure global fairness. In this paper, we suggest a new fairness control algorithm termed Congestion Distributed Fairness Algorithm (CDFA) that exhibits better pe...
