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

Reasonable routing in delay/disruption tolerant networks

Frontiers of Materials Science 2011年第3期5卷 327-334页

作者： Haizheng YU Jianfeng MA Hong BIAN College of Mathematics and System Sciences Xinjiang University Urumqi 830046 China Key Laboratory of Computer Network and Information Security Xidian University Xi＇an 710071 China School of Mathematical Sciences Xinjiang Normal University Urumqi 830054 China

Delay/disruption tolerant networking （DTN） is an approach to networking where intermittent connectivity exists： it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live （TTL） and antipacket methods, in both redundancy and delivery success efficiency.

关键词： delay/disruption tolerant networks （DTN） routing algorithm Markov chain message redundancy

来源：评论

学校读者我要写书评

暂无评论

A clustering scheme in application layer multicast

A clustering scheme in application layer multicast

引用

作者： Zhang, Xinchang Li, Xiaodong Luo, Wanming Yan, Baoping Shandong Key Laboratory of Computer Networks Shandong Computer Science Center No. 19 Keyuan Road Lixia Distric Jinan 250014 China Computer Network Information Center Chinese Academy of Sciences 4 South 4th Street Zhongguancun Beijing 100049 China

In application layer multicast (ALM), member hosts lack direct knowledge of underlying network topology, which brings some performance penalty. This paper investigates an effective way to rapidly obtain some related topology knowledge, i.e. getting topology hints from existing IP registered resources - WHOIS database. We further propose a clustering scheme, which can be integrated into the existing ALM solutions. Our proposed scheme can cluster some nearby member hosts no matter when these hosts join the group. Therefore the scheme also solves the join sequences problem in some degree. We also present an application framework of the clustering scheme, and give an application example named HMTP-E that integrates the scheme into HMTP protocol. The experiment results show that the clustering scheme plays a positive role on improving the performance of existing ALM solutions.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Koblitz Elliptic Curves Generating Based on Evolutionary Cryptography Theory and Verifying Parameters Recommended by NIST

引用

China Communications 2011年第4期8卷 41-49页

作者：王潮张焕国刘礼黎 Key Lab of Specialty Fiber Optics and Optical Access Network Ministry of Education Shanghai University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Computer School Wuhan University Huawei Technologies Co. Ltd

Elliptic curve cryptography is one of the most important public-key *** Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base *** on Evolutionary Cryptography theory,which becomes a principal concept for cryptography design and cryptanalysis,we propose a new algorithm for secure EC generation based on Ant Colony Optimization(ACO)to accelerate the search process of safe base *** preliminarily deal with secure Koblitz curve selecting over the field F(2800).Experiments show that the base field and base point of secure curves generated by ant colony algorithm have gone beyond the parameter range of Koblitz curves recommended by *** can present many new secure Koblitz curves,including base field and base point,which are not recommended by *** maximum size of our secure Koblitz curve has gone beyond *** algorithm in this paper follows the same cryptography criteria recommended by the ***,it can resist current *** analysis and experimental results prove that the new algorithm is effective and successful,and it is the first successful practice of Evolutionary Cryptography theory in public cryptography research.

关键词： evolutionary cryptography ECC secure curves ACO

来源：评论

学校读者我要写书评

暂无评论

Based on Ajax technology's online time functional analysis and implementation

Based on Ajax technology's online time functional analysis a...

引用

2011 International Conference on computer Science and Service System, CSSS 2011

作者： Xia, Lei Zhang, Shujun School of Computer and Information Technology Beijing Jiaotong University Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China

ISBN: (纸本)9781424497638

With the continuous development of Internet technology and Page Content's Diversity form, Traditional page model Shows its drawbacks. Ajax technology can transfer important information between client and Server-side, that increases the speed of transmission and make the page responsed more timely. This technology is widely used in online examination system's design. Text starts from Ajax technology, and that compares with traditional page model, finally, examination timing function is analyzed, and design implementation. © 2011 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Strong security enabled certificateless aggregate signatures applicable to mobile computation

Strong security enabled certificateless aggregate signatures...

引用

3rd IEEE International Conference on Intelligent networking and CollaborativeSystems, INCoS 2011

作者： Hu, Xiong Wu, Qianhong Chen, Zhong Key Laboratory of Network and Software Security Assurance of the Ministry of Education School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan University Ministry of Education China Universitat Rovira i Virgili Department of Computer Engineering and Mathematics UNESCO Av. Països Catalans 26 E-43007 Tarragona Spain

ISBN: (纸本)9780769545790

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identitybased cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme. Compared with up-todate certificateless aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model;(2) the security is proven in the strongest security model so far;(3) the signers do not need to be synchronized;and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized. © 2011 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

On quasi-orthogonal space-time block codes for dual-polarized MIMO channels

On quasi-orthogonal space-time block codes for dual-polarize...

引用

2011 International Conference on Wireless Communications and Signal Processing, WCSP 2011

作者： Li, Yabo Huang, Zhike Wang, Haiquan Xia, Xiang-Gen Department of Information Science and Electrical Engineering Zhejiang Provincial Key Laboratory of Information Network Technology Zhejiang University Hangzhou Zhejiang China College of Communications Engineering Hangzhou Dianzi University Hangzhou Zhejiang China Department of Electrical and Computer Engineering University of Delaware Newark DE 19716 United States

ISBN: (纸本)9781457710100

As a space and cost-efficient antenna configuration, dual-polarized antennas are widely deployed in real field MIMO wireless communication systems. The Quasi-Orthogonal Space-Time Code (QOSTBC), due to its advantages in the transmission rate and the decoding complexity, is an important transmit diversity scheme for more than 2 transmit antennas. In this paper, we investigate the performance of QOSTBC for dual-polarized MIMO channels. We show that when QOSTBC is used with dual-polarized antennas, we need to connect the power amplifier (PA) outputs to the differently polarized antennas carefully, in order to avoid more than 1dB performance loss at high cross-polar discrimination (XPD). Also, we show that, if the QOSTBC with constellation rotations, which achieves full diversity in uni-polarized MIMO channels, is used, the performance loss due to the bad PA to antenna connections is mitigated. However, when the XPD is high, the QOSTBC without full diversity, if connected properly, can achieve better performance than the QOSTBC with full diversity but connected badly, which shows the importance of proper connection at high XPD. So, to guarantee robust performance of QOSTBC at any XPD, besides designing codes to have full diversity and good diversity product, connecting properly between the PA outputs to the antennas is also important. © 2011 IEEE.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Runtime-based boot components re-measurement scheme for trusted platform

Runtime-based boot components re-measurement scheme for trus...

引用

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

ISBN: (纸本)9783642251849

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. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

Research on privacy-preserving keyword retrieval technology in cloud storage

引用

Tongxin Xuebao/Journal on Communications 2011年第9 A期32卷 59-63+69页

作者： Huang, Ru-Wei Gui, Xiao-Lin Yu, Si Zhuang, Wei Department of Electronics and Information Engineering Xi'an Jiaotong University Xi'an 710049 China Shaanxi Province Key Laboratory of Computer Network Xi'an Jiaotong University Xi'an 710049 China School of Computer Electronics and Information Guangxi University Nanning 530004 China

Cloud storage provides scalable storage resources which are available everywhere. Privacy has become the key problem of cloud storage. Encryption is a well established technology for protecting sensitive data. But it makes effective data utilization and sharing a very challenging task. To solve the problem, a privacy-preserving framework of cloud storage was proposed, and a bilinear map-based search scheme on encrypted keyword (BMSEK) was constructed. The performance evaluation and security analysis show that the running overhead of BMSEK is smaller, and BMSEK is se-mantic security and can support privacy protection and data sharing well while realizing encypted keywords retrieval.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

Optimal transmission power allocation for two-way relay channel using analog network coding

Optimal transmission power allocation for two-way relay chan...

引用

International Conference on Consumer Electronics, Communications and networks

作者： Yuan, Quan Zhou, Yajian Zhao, Mingfeng Yang, Yixian Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing China National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781612844572

Considering a system model of three nodes two-way relay channel with analog network coding, this paper discusses the optimal transmission power allocation problem to maximize the system achievable sum-rate. We propose an optimal transmission power allocation solution and show that our solution performs better than the uniform power allocation by numerical results. © 2011 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：