接纳控制算法的好坏直接影响分布式计算中资源提前预留机制的总体性能.针对现有灵活资源预留接纳控制算法的优缺点,提出了一种可分片预留接纳控制算法.当无法实现固定资源预留时,该算法在保证最大分片间隔的前提下,允许对资源进行分片预...接纳控制算法的好坏直接影响分布式计算中资源提前预留机制的总体性能.针对现有灵活资源预留接纳控制算法的优缺点,提出了一种可分片预留接纳控制算法.当无法实现固定资源预留时,该算法在保证最大分片间隔的前提下,允许对资源进行分片预留;在各分片中,若存在剩余资源量小于请求预留资源量的时隙,允许用最小资源量进行预留.通过与3种可拓展预留接纳控制算法(缩短持续时间,增大预留带宽(shorten the duration and increase the reserved bandwidth,SDIB);减小预留带宽,延长持续时间(reduce the reserved bandwidth and extend the duration,RBED);改变预留的开始时间(change the reserved start time,CST))的对比实验,从接纳率和有效资源利用率方面进行了评估.实验结果表明,可分片预留接纳控制算法能有效减少资源碎片,具有更优的综合性能.展开更多
Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the ...Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the logical link, which is simple and effective innetwork with additive and constrained concave parameters. We extend the method to network associatedwith multi-parameters. Furthermore, we propose a modified star aggregation algorithm. Simulationsare used to evaluate the performance. The results show that our algorithm is relatively good.展开更多
In order to evaluate the practicality and effectiveness of the turn-based algorithm for logit loading （TALL）, the TALL is implemented using C＋＋, and it is compared with a combination of the network-expanding metho...In order to evaluate the practicality and effectiveness of the turn-based algorithm for logit loading （TALL）, the TALL is implemented using C＋＋, and it is compared with a combination of the network-expanding method and the Dial algorithm based on the analysis of algorithm procedures. The TALL uses the arc-labeling shortest path searching, bidirectional star and the deque structure to directly assign the traffic flow, while the Dial algorithm should be used in an expanded network. The test results over realistic networks of eight cities show the superior performance of the TALL algorithm over the combination of the network-expanding method and the Dial algorithm, and the average processing time is reduced by 55. 4%. Furthermore, it is found that the operational efficiency of the TALL relates to the original densities of the cities. The average processing time is reduced by 65. 1% when the original density is about 14%, but the advantage of the TALL is not obvious with the increase in the original density.展开更多
文摘接纳控制算法的好坏直接影响分布式计算中资源提前预留机制的总体性能.针对现有灵活资源预留接纳控制算法的优缺点,提出了一种可分片预留接纳控制算法.当无法实现固定资源预留时,该算法在保证最大分片间隔的前提下,允许对资源进行分片预留;在各分片中,若存在剩余资源量小于请求预留资源量的时隙,允许用最小资源量进行预留.通过与3种可拓展预留接纳控制算法(缩短持续时间,增大预留带宽(shorten the duration and increase the reserved bandwidth,SDIB);减小预留带宽,延长持续时间(reduce the reserved bandwidth and extend the duration,RBED);改变预留的开始时间(change the reserved start time,CST))的对比实验,从接纳率和有效资源利用率方面进行了评估.实验结果表明,可分片预留接纳控制算法能有效减少资源碎片,具有更优的综合性能.
文摘Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the logical link, which is simple and effective innetwork with additive and constrained concave parameters. We extend the method to network associatedwith multi-parameters. Furthermore, we propose a modified star aggregation algorithm. Simulationsare used to evaluate the performance. The results show that our algorithm is relatively good.
基金National Science and Technology Action Program for Road Traffic Safety (No. 2009BAG13A05)the National Natural Science Foundation of China (No. 51078086)
文摘In order to evaluate the practicality and effectiveness of the turn-based algorithm for logit loading （TALL）, the TALL is implemented using C＋＋, and it is compared with a combination of the network-expanding method and the Dial algorithm based on the analysis of algorithm procedures. The TALL uses the arc-labeling shortest path searching, bidirectional star and the deque structure to directly assign the traffic flow, while the Dial algorithm should be used in an expanded network. The test results over realistic networks of eight cities show the superior performance of the TALL algorithm over the combination of the network-expanding method and the Dial algorithm, and the average processing time is reduced by 55. 4%. Furthermore, it is found that the operational efficiency of the TALL relates to the original densities of the cities. The average processing time is reduced by 65. 1% when the original density is about 14%, but the advantage of the TALL is not obvious with the increase in the original density.
