期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
An Optimum Free-Table Routing Algorithms of Modified and Traditional Chordal Ring Networks of Degree Four
1
作者 Raja Noor Farah Azura bt Raja Maamor Shah Mohamed Othman Mohd. Hasan Selamat 《材料科学与工程(中英文版)》 2010年第10期78-89,共12页
关键词 路由算法 路由表 自由 传统 环网 修改 最短路径 节点选择
下载PDF
Increase Throughput of CCM Security Mode Using MKP
2
作者 Zuriati Ahmad Zukarnain 《Applied Mathematics》 2014年第4期581-592,共12页
A security protocol is used to ensure the messages transferred over a network free from attack. The CCM security operation mode adopts CTR, and CBC-MAC schemes to implement message ciphering and authentication respect... A security protocol is used to ensure the messages transferred over a network free from attack. The CCM security operation mode adopts CTR, and CBC-MAC schemes to implement message ciphering and authentication respectively. There are two limitations of CCM including the secret key which should refresh for each 264 blocks in CTR mode and the authentication operation of CBC-MAC works in sequential fashion on multi-processor system. In this paper, we have proved that the Multiple Key Protocol (MKP) can be used within CTR mode to increase the size of the transferred message. Also, we have showed that the DMAC algorithm is able to decrease the time of authentication operation on multi-processing units system. 展开更多
关键词 CBC-MAC CCM CTR MESSAGE AUTHENTICATION THROUGHPUT Parallel MESSAGE AUTHENTICATION
下载PDF
Weighted-adaptive Inertia Strategy for Multi-objective Scheduling in Multi-clouds
3
作者 Mazen Farid Rohaya Latip +1 位作者 Masnida Hussin Nor Asilah Wati Abdul Hamid 《Computers, Materials & Continua》 SCIE EI 2022年第7期1529-1560,共32页
One of the fundamental problems associated with scheduling workflows on virtual machines in a multi-cloud environment is how to find a near-optimum permutation.The workflow scheduling involves assigning independent co... One of the fundamental problems associated with scheduling workflows on virtual machines in a multi-cloud environment is how to find a near-optimum permutation.The workflow scheduling involves assigning independent computational jobs with conflicting objectives to a set of virtual machines.Most optimization methods for solving non-deterministic polynomial-time hardness(NP-hard)problems deploy multi-objective algorithms.As such,Pareto dominance is one of the most efficient criteria for determining the best solutions within the Pareto front.However,the main drawback of this method is that it requires a reasonably long time to provide an optimum solution.In this paper,a new multi-objective minimum weight algorithm is used to derive the Pareto front.The conflicting objectives considered are reliability,cost,resource utilization,risk probability and makespan.Because multi-objective algorithms select a number of permutations with an optimal trade-off between conflicting objectives,we propose a new decisionmaking approach named the minimum weight optimization(MWO).MWO produces alternative weight to determine the inertia weight by using an adaptive strategy to provide an appropriate alternative for all optimal solutions.This way,consumers’needs and service providers’interests are taken into account.Using standard scientific workflows with conflicting objectives,we compare our proposed multi-objective scheduling algorithm using minimum weigh optimization(MOS-MWO)with multi-objective scheduling algorithm(MOS).Results show that MOS-MWO outperforms MOS in term of QoS satisfaction rate. 展开更多
关键词 Multi-cloud environment multi-objective optimization Pareto optimization workflow scheduling
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部