检索结果-内蒙古大学图书馆

RETRACTED ARTICLE: An approach to evaluate the effects of virtual topology on in-band crosstalk attack propagation in transparent optical networks

引用

Photonic network Communications 2012年第2期24卷 166-166页

作者： Xiao, Yonghua Peng, Yunfeng Sun, Zeyu Zhao, Changming Long, Keping Key Laboratory of Optical Fiber Sensing and Communications Education Ministry of China University of Electronic Science and Technology of China Chengdu China Institute of Advanced Network Technology and New Services (ANTS) School of Computer and Communication Engineering (CCE) University of Science and Technology Beijing (USTB) Beijing China College of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China

来源：评论

学校读者我要写书评

暂无评论

Threshold-based message copies control in delay tolerant networks

引用

Journal of networks 2011年第1期6卷 96-103页

作者： Yu, Haizheng Bian, Hong College of Mathematics and System Sciences Xinjiang University Urumqi China Key Laboratory of Computer Network and Information Security Xidian University Xi'an China School of Mathematical Sciences Xinjiang Normal University Urumqi Xinjiang China

Delay Tolerant networks (DTN) generally lack end-to-end connectivity and multiple message copies routing protocols are often used to improve the efficiency that messages are delivered successfully, but network load is increased due to a large number of message copies. A new scheme based on threshold is presented to control message copies efficiently in the networks. A contact counter is added in every node for Epidemic routing scheme and the counter of every node records the number of nodes, which it contacts, with the same copy for a message. If the counter value of a node reaches the threshold which was set, then the node drops message copy. We analysis threshold in theory and derive the lower bound of threshold in delay tolerant networks. According to the lower bound of threshold, we can set a proper threshold in the networks. Using the new scheme message copies reduce obviously and are dropped completely in the end. The successful delivery ratio is no less than Epidemic routing and message copies are controlled efficiently. We show that it is validity in our scheme by comparing with the trends of message copies among different thresholds in two mobility scenes. © 2011 ACADEMY PUBLISHER.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Runtime-Based Boot Components Re-measurement Scheme for Trusted Platform

Runtime-Based Boot Components Re-measurement Scheme for Trus...

引用

2011 International Conference on Informatics,Cybernetics,and computer Engineering(ICCE 2011)

作者： Peng Weiping Zhou Yajian Wang Cong Yang Yixian Key Laboratory of Network and Information Attack & Defence Technology of MOE Beijing University of Posts and Telecommunications School of Computer Science and Technology Henan Polytechnic University Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications

Integrity measurement is just one of the most important features in a trusted computing platform to provide evidence of platform configuration and behavior. Each set of software instructions(binary code) is measured and recorded before it is executed. Especially, all of boot components which be recorded in pre-boot stage can't be re-measured until the platform is rebooted. However, the reality is that many components belong to pre-boot stage, such as BIOS, Boot Loader and MBR, are easily modified or updated in runtime environment. If these updated results of components are treated as configuration requirements for a remote server-side to verify the access request, the remote network access connection will fail. It must restart the host to re-measure there components, and the result of the new measure is not guaranteed right absolutely. We solve this problem by embedding Integrity Measurement Agency Component(IMAC) which has the capability of monitoring transformation, verifying credibility, updating Platform Configuration Registers and recording integrity measurement logs in Linux kernel. The result of performance analysis demonstrates that the method is feasible and credible.

关键词： Trusted Computing Boot Components PCR Integrity measurement Agency Component

来源：评论

学校读者我要写书评

暂无评论

An anonymity and authentication mechanism for internet of things

引用

Journal of Convergence information Technology 2011年第3期6卷 98-105页

作者： Wang, Xiaoliang Sun, Xingming Yang, Hengfu Shah, Saeed Arif College of Information Engineering Xiangtan University Xiangtan 411105 China Department of Computer Science and Technology Nanjing University of Information Science and Technology Nanjin 210044 China Department of Information Science and Engineering Hunan First Normal University Changsha 410205 China Hunan Provincial Key Laboratory of Network and Information Security Hunan University Changsha 410082 China

Authentication has received increasing attention in the literatures of Internet of Things. At the same time, numerous concerns have been raised about the issue of anonymity due to users' awareness of their privacy nowadays. How to achieve trade-off between anonymity and certification simultaneously? In this paper, we propose a security architecture to ensure anonymity and certification for Internet of Things. We use pseudonym and threshold secret sharing approach to resolve conflict between anonymity and certification. Moreover, the implementation of Bloom filter offers security authentication for remote command. Security analysis shows that the proposed mechanism can perfectly achieve tradeoff between anonymity, certification, and also resist impersonation, tamper as well as compromise attacks.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

SWP2P: P2P anonymous trace system based on superposition watermarking

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2011年第8期5卷 116-126页

A lot of attention has been paid to anonymity due to the users' privacy protection. While peer-topeer (P2P) networks need anonymity capacity, the authority also requires partner traceability to prevent anonymous abuse. So there is a challenge to harmonize the dilemma between the anonymity and authentication in P2P networks. Few P2P protocol provides complete anonymity as well as traceability. In this paper, we propose a security mechanism to ensure anonymity for honest peers and traceability for misbehaving peers in P2P systems. We utilize superposition watermarking based anonymity trace scheme to resolve the conflicts between traceability and anonymity. This scheme uses information processing technology similar to CDMA to superpose path information. Security analysis and simulation result show that the superposition watermarking based P2P anonymity trace scheme (SWP2P) can attain tradeoff between anonymity and traceability perfectly.

关键词： Watermarking

来源：评论

学校读者我要写书评

暂无评论

Genetic Algorithm-Based Power Management in Cloud Platform

Genetic Algorithm-Based Power Management in Cloud Platform

引用

International Conference on Internet Technology and Applications (iTAP)

作者： Zili Xiong Zhang Zhang Huafeng Kong Deqing Zou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Key Laboratory of Information Network Security Ministry of Public Security Third Research Institute of Ministry of Public Security Shanghai China

Cloud computing is a novel computing pattern, and it can provide underlying hardware resource for cloud users on demand. Virtualization is the key technology of cloud computing, and it provides the technical support for cloud computing. In cloud platform, power management is an indispensable function of cloud system administration. Based on genetic algorithm, this paper proposes a power management method based on virtual cluster. The experiments on Xen platform prove the effectiveness of our method.

关键词： Genetic algorithms Entropy Cloud computing Quality of service Security Presses Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Conflict-Free Transmission Schedule Based on network Coding in Wireless networks

Conflict-Free Transmission Schedule Based on Network Coding ...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Jing Wang Xiangyang Liu Xinmei Wang School of Information Engineering Chang'an University Xi'an China Computer Network Teaching Office Xian Communications College Xi'an China State Key Laboratory of Integrated Service Networks Xidian University Xi'an China

In wireless networks, the cross-layer design of joint medium access control and network coding can avoid destructive interferences among concurrent transmissions. Wireless network codes in conjunction with conflict-free network realizations are designed by Sagduyu. Then, this paper proposed a new conflict-free transmission schedule based on network coding to achieve better network performance. We construct sub tree graphs by sub tree decomposition, and based on the achieved sub tree graphs, time slots are assigned from the first sub tree. Nodes of the latter sub trees can be chosen to combine with the front time slots according to whether there exist conflicts or not. Finally, network codes allocation method for network with two sources is presented, which adopts the theory of graph coloring.

关键词： network coding Wireless networks Encoding Color Resource management Schedules Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Resource Allocation Algorithm for Database-as-a-Service

A Dynamic Resource Allocation Algorithm for Database-as-a-Se...

引用

IEEE International Conference on Web Services (ICWS)

作者： Jie Zhu Bo Gao Zhihu Wang Berthold Reinwald Changjie Guo Xiaoping Li Wei Sun School of Computer Science & Engineering South-East University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China IBM Research China Beijing China IBM Almaden Research Center San Jose CA USA

In Database-as-a-Service (DBaaS), a large number of tenants share DBaaS resources (CPU, I/O and Memory). While the DBaaS provider runs DBaaS to "share" resources across the entire tenant population to maximize resource utilization and minimize cost, the tenants subscribe to DBaaS at a low price point while still having resources conceptually "isolated" according to service level agreements (SLAs). To optimize this dichotomy of goals, we propose a dynamic resource allocation framework that periodically re-allocates resources to tenants to maximize resource utilization while tolerating a low risk of SLA violations. We model the resource allocation problem as a modified unbounded knapsack problem. The model introduces an additional fairness constraint to assign residual resources to active tenants, while avoiding that few tenants consume all residual resources. Performed experiments demonstrate the effectiveness and efficiency of the proposed allocation algorithm for a synthetic workload with burstiness and predicted tenant behavior.

关键词： Resource management Monitoring Dynamic scheduling Heuristic algorithms Servers Noise Time series analysis

来源：评论

学校读者我要写书评

暂无评论

A novel framework for gene selection

引用

International Journal of Advancements in Computing Technology 2011年第3期3卷 184-191页

作者： Zhao, Wei Wang, Gang Wang, Hong-bin Chen, Hui-ling Dong, Hao Zhao, Zheng-dong Network Information Center Changchun University of Science and Technology Changchun 130022 China College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Microarray data are highly redundant and noisy, and most genes are believed to be uninformative with respect to studied classes, as only a fraction of genes may present distinct profiles for different classes of samples. This paper proposed a novel hybrid framework (NHF) for the classification of high dimensional microarray data, which combined information gain(IG), F-score, genetic algorithm(GA), particle swarm optimization(PSO) and support vector machines(SVM). In order to identify a subset of informative genes embedded out of a large dataset which is contaminated with high dimensional noise, the proposed method is divided into three stages. In the first stage, IG is used to construct a ranking list of features, and only 10% features of the ranking list are provided for the second stage. In the second stage, PSO performs the feature selection task combining SVM. F-score is considered as a part of the objective function of PSO. The feature subsets are filtered according to the ranking list from the first stage, and then the results of it are supplied to the initialization of GA. Both the SVM parameter optimization and the feature selection are dynamically executed by PSO. In the third stage, GA initializes the individual of population from the results of the second stage, and an optimal result of feature selection is gained using GA integrating SVM. Both the SVM parameter optimization and the feature selection are dynamically performed by GA. The performance of the proposed method was compared with that of the PSO based, GA based, Ant colony optimization (ACO) based and simulated annealing (SA) based methods on five benchmark data sets, leukemia, colon, breast cancer, lung carcinoma and brain cancer. The numerical results and statistical analysis show that the proposed approach is capable of selecting a subset of predictive genes from a large noisy data set, and can capture the correlated structure in the data. In addition, NHF performs significantly better than th

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Blind Carrier Frequency Offset Estimation for MIMO OFDMA Uplink

Blind Carrier Frequency Offset Estimation for MIMO OFDMA Upl...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Weile Zhang H. Chen Qinye Yin T. Ohtsuki MOE Key Laboratory for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an China The State Key Laboratory of Integrated Services Networks Xidian University China Institute of Industrial Science University of Tokyo Tokyo Japan Department of Information and Computer Science Keio University Yokohama Japan

In this paper, we develop a new subspace based multiuser carrier frequency offset (CFO) estimation scheme for multi-input multi- output (MIMO) orthogonal frequency division multiple access (OFDMA) uplink transmission. We exploit the rank reduction approach by equipping multiple antennas at the receiver, in which the CFO of each user is derived blindly using one dimension (1-D) search individually. The proposed scheme supports the generalized subcarrier assignment scheme and full loaded transmission with all subcarriers being allocated to users. Numerical results are provided to corroborate the proposed studies.

关键词： Estimation OFDM Vectors Frequency estimation Receiving antennas Signal to noise ratio Synthetic aperture sonar

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：