共查询到19条相似文献,搜索用时 187 毫秒
1.
2.
3.
4.
5.
网内缓存功能是信息中心网络ICN(Information-Centric Networking)最重要的特性之一,大大减小了信息请求的响应时间和网内流量。合理地分配每个路由器的缓存空间大小,对网络性能有较大影响,也可以节约网络成本。为了使路由器的缓存大小配置合理,首先综合考虑路由器的度数权重、紧密度、网络的中心度、请求影响度等度量指标,定义了一个新的度量指标,称为节点权重;然后,提出一种基于节点权重的缓存大小分配方案,将网络所需的容量按比例分配给路由器。仿真结果表明,与均匀分配相比,路由器的缓存空间利用率至少提升了8%,命中率至少提高了6%;与基于请求影响度的分配方案相比,路由器的缓存空间利用率至少提升3%,命中率至少提高了3%。 相似文献
6.
太耀佳 《计算机光盘软件与应用》2013,(1):131-132
基于可重构路由器上缓存的流媒体协作分发目前出现了一种新的策略,用以加速流媒体。主要就是利用网络存储通过多个路由器节点进行合作,对于一些热点的视频数据实现了缓存,能够为范围较小的用户服务,大大降低了流媒体服务器的带宽和性能要求,降低了网络传输流量与用户的相应延迟时间。本文利用新型的原型系统对基于可重构路由器上缓存的流媒体协作分发策略进行性能评价,事实证明这种方法在各个方面都有所提高。 相似文献
7.
8.
缓存管理是高性能路由器需要解决的技术难题之一,一个好的缓存管理算法可提高路由器的缓存资源利用率并降低分组丢失率.简要介绍了路由器中缓存管理的发展过程,列举了缓存管理一些最主流的算法,并对它们的性质、优缺点作了较为深刻的比较研究.最后利用试验仿真对四种缓存管理算法进行了缓存利用率和分组丢失率方面的评价,并对缓存管理算法的发展作了展望. 相似文献
9.
内容中心网络(content-centric networking,CCN)的一个主要特点就是利用网络内部存储提高网络性能和缩减网络冗余流量.但由于当前路由器存储技术的限制,使得CCN路由器的内容存储器(CS)空间大小十分有限,这造成了路由器缓存的命中率很低,导致CCN的网络性能优势和冗余流量缩减的作用无法得到体现.为了有效地解决这个问题,提出了一种新颖的存储系统AS-BOOST,该系统可以避免当前存储技术的限制,使得CCN的优势得到充分发挥,同时可以防止针对CCN的缓存污染攻击.通过仿真来验证AS-BOOST的有效性,仿真结果表明,只要付出少量的存储开销,AS-BOOST就可以有效地提高用户请求的命中率和明显降低AS域间流量,并且不易受到缓存污染攻击. 相似文献
10.
11.
We address a recently introduced static dataflow model: the Static Dataflow with Access Patterns (SDF-AP) model. For this model we present (1) a generalization of an existing regular periodic scheduling scheme to regular 1-periodic scheduling for flexibility to achieve a smaller schedule period and additional room for optimization on communication storage; (2) a method based on Integer Linear Programming (ILP) to minimize communication buffers under periodic scheduling and user-specified throughput constraints. Experimental results on a set of test cases show that buffer sizes using this approach can be reduced dramatically when compared to the traditional SDF models. The optimal sizing result may serve as an important criterion to evaluate and fine-tune any heuristics-based buffer sizing approach for the SDF-AP model of computation. 相似文献
12.
The general problem of buffers sizing for mean work in process/inventory minimization in a particular class of single part unreliable manufacturing flow lines, subjected to a constant rate of demand for finished parts, is analyzed. Two variants of the problem are considered: buffers sizing for average work in process minimization when there is a fixed requirement on parts availability in the buffer next to last; minimization of an aggregate measure of average work in process and demand backlog when the complete flow line is considered. A fluid model of part production is employed. The production control policies of interest are suboptimal, strictly decentralized, and are unambiguously parameterized by the size of buffer levels. Optimization of policy parameters is based on the analysis of the structural properties of an associated dynamic program. The latter is built around an approximate, flow line decomposition based, buffer levels dependent theoretical expression of the policy performance measure. The nature of the related flow line approximations is discussed and numerical results of the dynamic programming procedure are reported. Scalability of the computations is demonstrated. The numerical results suggest that when parameters are optimal, both a form of flow line balancing and a just in time internal production principle, are in place. 相似文献
13.
Sizing and grading are widely used to create products to fit selected populations. Currently, the sizing and grading rules are derived from anthropometric measures; however past researches have indicated that it is not very accurate. This study proposes a new technique to use principal component analysis (PCA) on 3D surface points for sizing and grading wearable products. The accuracy of the proposed method is illustrated by developing a sizing and grading rule for the feet. After developing a model using the feet data of 60 participants and validating using the feet data of 10 different participants, results showed that sizing and grading using PCA is more accurate than traditional techniques. Compared with traditional foot sizing, PCA based sizing and grading showed an improvement of about 25% in accuracy. In addition, results also indicated that the grading rule derived from PCA loading was better than the proportional grading. This research provides a new direction to consider when developing the sizing and grading rules. It can be extended to calculate the number of sizes and the size increment for various wearable products. 相似文献
14.
数据过时是影响数据质量的重要因素,因此判定数据时效性对于提高数据质量至关重要.当前判定数据时效性的方法可分为两类:基于时间戳的方法和基于规则的方法.基于时间戳的方法要求精确完整的时间戳,但这样的时间戳在很多应用中不存在.基于规则的方法不要求时间戳,但现有方法均依赖于冗余元组,且不能对数据时效性做出定量判定.同时,这些方法均基于确定规则,无法表达不确定的领域知识.针对上述问题,提出不确定时效规则及相应的数据时效性模型.基于该模型,进一步给出了两个可定量地判定数据时效性的算法.同时,还给出了时效规则的学习算法.真实数据上的实验结果验证了算法的有效性. 相似文献
15.
This paper presents a simulation study aimed at evaluating the performances of a flexible manufacturing system (FMS) in terms of makespan, average flow time, average delay time at local buffers and average machine utilization, subject to different control strategies which include routing flexibilities and dispatching rules. The routing strategies under evaluation are ‘no alternative routings’; ‘alternative routings dynamic’; and ‘alternative routings planned’. Above routing strategies are combined with seven dispatching rules, and studied in different production volume which varies from 50 to 500 parts. In addition, impacts of both infinite and finite local buffer capacities are analyzed. Since an FMS usually deals with a variety of products, effects of changing the part mix ratio are also discussed. Finally, machine failure is also introduced in this research to study the effects of machine reliability on the system. Simulation results indicate that the ‘alternative routings planned’ strategy outperforms other routing strategies if the local buffer size is infinity. However, there is no particular dispatching rule that performs well in all buffer size settings but infinity buffer size is not the best choice with respect to the four performance measures. In addition, the four performance measures, except machine utilization, under different control strategies seem quite insensitive to the variation in part mix ratios. 相似文献
16.
TCP流竞争拥塞及拥塞链路的缓存需求研究 总被引:1,自引:0,他引:1
针对流竞争拥塞,提出了一种拥塞分析模型FCCM(flow-competing congestion model),给出了TCP竞争流在拥塞链路上的分布特性,推导了流竞争拥塞发生的条件,进而分析了在流竞争拥塞发生时,路由器为维持拥塞链路100%利用率所需的最小缓存.分析结果表明,当流数目不确定时,应对流竞争拥塞所需的缓存将不大于流数目确定时经典BSCL(buffer sizing for congested interact links)方案中的最小缓存需求. 相似文献
17.
18.
Ray-Yaung Chang Podgurski A. Jiong Yang 《IEEE transactions on pattern analysis and machine intelligence》2008,34(5):579-596
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach to revealing neglected conditions that integrates static program analysis and advanced data mining techniques to discover implicit conditional rules in a code base and to discover rule violations that indicate neglected conditions. The approach requires the user to indicate minimal constraints on the context of the rules to be sought, rather than specific rule templates. To permit this generality, rules are modeled as graph minors of enhanced procedure dependence graphs (EPDGs), in which control and data dependence edges are augmented by edges representing shared data dependences. A heuristic maximal frequent subgraph mining algorithm is used to extract candidate rules from EPDGs, and a heuristic graph matching algorithm is used to identify rule violations. We also report the results of an empirical study in which the approach was applied to four open source projects (openssl, make, procmail, amaya). These results indicate that the approach is effective and reasonably efficient. 相似文献
19.
In this paper, we present a novel method for the classification of mammograms using a unique weighted association rule based classifier. Images are preprocessed to reveal regions of interest. Texture components are extracted from segmented parts of the image and discretized for rule discovery. Association rules are derived between various texture components extracted from segments of images and employed for classification based on their intra- and inter-class dependencies. These rules are then employed for the classification of a commonly used mammography dataset, and rigorous experimentation is performed to evaluate the rules’ efficacy under different classification scenarios. The experimental results show that this method works well for such datasets, incurring accuracies as high as 89%, which surpasses the accuracy rates of other rule based classification techniques. 相似文献