In order to investigate the enhancement of data privacy by distributing data packets via multiple paths, this paper fommlates a security model and analyzes the privacy problem in mul- tipath scenarios leveraging infor...In order to investigate the enhancement of data privacy by distributing data packets via multiple paths, this paper fommlates a security model and analyzes the privacy problem in mul- tipath scenarios leveraging inforrmtion theoretic concept. Based on proposed model, a privacy function related to the path number is discussed. We heuristically recommend the optin^al path num- ber and analyze the tradeoff among the perform- ance, resource consumption and privacy. For re- ducing the inforlmtion leakage, the data schedule algorithms are also proposed. The analytical model can provide guidelines for the multipath protocol design.展开更多
Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,...Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications.展开更多
Resource scheduling algorithm for ForCES(Forwarding and Control Element Separation) networks need to meet the flexibility,programmability and scalability of node resources.DBC(Deadline Budget Constrain) algorithm reli...Resource scheduling algorithm for ForCES(Forwarding and Control Element Separation) networks need to meet the flexibility,programmability and scalability of node resources.DBC(Deadline Budget Constrain) algorithm relies on users select cost or time priority,then scheduling to meet the requirements of users.However,this priority strategy of users is relatively simple,and cannot adapt to dynamic change of resources,it is inevitable to reduce the QoS.In order to improve QoS,we refer to the economic model and resource scheduling model of cloud computing,use SAL(Service Level Agreement) as pricing strategy,on the basis of DBC algorithm,propose an DABP(Deadline And Budget Priority based on DBC) algorithm for ForCES networks,DABP combines both budget and time priority to scheduling.In simulation and test,we compare the task finish time and cost of DABP algorithm with DP(Deadline Priority) algorithm and BP(Budget Priority) algorithm,the analysis results show that DABP algorithm make the task complete with less cost within deadline,benifical to load balancing of ForCES networks.展开更多
基金This paper was partially supported by the National Basic Re-search Program of China under Grant No. 2007CB307100 the National Natural Science Foundation of China under Crant No 60972010 the Fundamental Research Funds for the Central U- niversities under Grant No. 2011JBM018.
文摘In order to investigate the enhancement of data privacy by distributing data packets via multiple paths, this paper fommlates a security model and analyzes the privacy problem in mul- tipath scenarios leveraging inforrmtion theoretic concept. Based on proposed model, a privacy function related to the path number is discussed. We heuristically recommend the optin^al path num- ber and analyze the tradeoff among the perform- ance, resource consumption and privacy. For re- ducing the inforlmtion leakage, the data schedule algorithms are also proposed. The analytical model can provide guidelines for the multipath protocol design.
基金ACKNOWLEDGEMENTS The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper. The research has been partly supported by National Natural Science Foundation of China No. 61272528 and No. 61034005, and the Central University Fund （ID-ZYGX2013J073）.
文摘Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications.
基金This work was supported in part by a grant from the National Basic Research Program of China(973 Program) under Grant No.2012CB315902,the National Natural Science Foundation of China under Grant No.61379120,61170215,the Program for Zhejiang Leading Team of Science and Technology Innovation under Grant No.2011R50010-12,2011R50010-18.Zhejiang Provincial Key Laboratory of New Network Standards and Technologies (NNST)
文摘Resource scheduling algorithm for ForCES(Forwarding and Control Element Separation) networks need to meet the flexibility,programmability and scalability of node resources.DBC(Deadline Budget Constrain) algorithm relies on users select cost or time priority,then scheduling to meet the requirements of users.However,this priority strategy of users is relatively simple,and cannot adapt to dynamic change of resources,it is inevitable to reduce the QoS.In order to improve QoS,we refer to the economic model and resource scheduling model of cloud computing,use SAL(Service Level Agreement) as pricing strategy,on the basis of DBC algorithm,propose an DABP(Deadline And Budget Priority based on DBC) algorithm for ForCES networks,DABP combines both budget and time priority to scheduling.In simulation and test,we compare the task finish time and cost of DABP algorithm with DP(Deadline Priority) algorithm and BP(Budget Priority) algorithm,the analysis results show that DABP algorithm make the task complete with less cost within deadline,benifical to load balancing of ForCES networks.
