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

Dynamics of substrate resource selection in network virtualization environment - An evolutionary game approach

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 25-34页

作者： Yang, Yu Chen, Shan-Zhi Li, Xin State Key Lab. of Switching and Networking Technology Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab. of Wireless Mobile Communication China Academy of Telecommunication Technology Beijing 100083 China

The substrate network path selection problem of virtual network was modeled as an evolutionary game. In the process of evolutionary game, virtual networks adjusted the strategies through the iterated game. The replicator dynamics were leveraged equation to analyze the dynamic variation of strategies selection and demonstrates that this dynamics equation is the admissible dynamic to the evolutionary game. The potential game theory was used to analyze the evolutionary process and demonstrates the evolutionary result will converge to the evolutionary equilibrium. At the evolutionary equilibrium, all the virtual networks could get the best selection strategies. Finally, an evolutionary algorithm based on replicator dynamics was proposed. The experiments simulate the process of virtual network selecting the substrate paths in different initial state and reach the evolutionary equilibrium. Simulation results are coincided with the theoretical analysis results.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

AGP: An anchor-geography based routing protocol with mobility prediction for VANET in city scenarios

引用

Journal of China Universities of Posts and Telecommunications 2011年第SUPPL. 1期18卷 112-117页

作者： Shi, Yan Jin, Xiao-Ye Chen, Shan-Zhi State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab of Wireless Mobile Communications China Academy of Telecommunication Technology Beijing 100083 China

Vehicular ad-hoc networks (VANET) routing is a key technology for efficient data forwarding in intelligent transport system (ITS). A novel routing scheme, Anchor-Geography based routing protocol (AGP), designed specifically for VANET communication in city environment is proposed in this paper. The reactive broadcasting is used for both getting destination location and routing discovery. Connectivity status and load balancing is considered in routing decision. In addition, the map information and the kinematics parameters are used for the vehicle trajectory prediction. Such a mobility prediction can provide a solution for the situation in which the destination moves away from the location in the routing discovery procedure. In simulation, VanetMobiSim is used as the traffic generator for more realistic traffic scenarios in VANETs than simple mobility model definition. Simulation results in NS2 show that AGP protocol gains obvious improvement in packet delivery ratio and average hops. © 2011 The Journal of China Universities of Posts and Telecommunications.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Model for cascading network failures based on the nodes with different tolerance parameter

引用

The Journal of China Universities of Posts and Telecommunications 2011年第5期18卷 95-101页

作者： LIU Yuan-ni LI Xin CHEN Shan-zhi QIN Zhen State key Lab of Switching and Networking Technology Beijing University of Posts and Telecommunications Beijing 100876 China State key Lab of W1reless Mobile Communication China Academy of Telecommunication Technology Beijing 100083 China School of Lifesciences and Technology Xidian University Xi＇an 710126 China

Cascading failures are common in most of the networks, where traffic is rerouted to bypass malfunctioning routers, eventually leading to an avalanche of overloads on other routers that are not equipped to handle extra traffic, which can result in a congestion regime with degradation in the network performance. In order to investigate how a small shock can trigger avalanches mechanisms affecting a considerable fraction of the network, lots of failure models have been constructed, but they have focused only on the static properties of the network that can not reflect the performance affected by the avalanche exactly. In this paper, we proposed a simple model for cascading failures in the network to explore how the failures can have a great impact on the network performance, and we allocated every node a capacity by tolerance parameter based on the node importance, which is determined by node degree, the number of the shortest paths through a node, and the number of the shortest paths through the neighbors of a node, then we fixed every element a weight to compute the node importance by analytic hierarchy process （AHP） theory. Based on our model, we analyzed the influence of different types of attacks to the network performance, and also tabled some proposals for reducing the damage that the networks suffered from the cascading failures.

关键词： cascading failure power-law tolerance parameter network efficiency

来源：评论

学校读者我要写书评

暂无评论

Cost-conscious scheduling for large graph processing in the cloud

Cost-conscious scheduling for large graph processing in the ...

引用

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Li, Jian Su, Sen Cheng, Xiang Huang, Qingjia Zhang, Zhongbao State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9780769545387

In recent years large graph processing has emerged to be a popular application for companies because of the increasing large Web graph and social networks. The ever growing scale of graphs and recent emergence of cloud computing poses challenges to their efficient and cost-conscious scheduling approach for processing tasks. In this paper, we focus on the use of cloud resources for dispatching large graph processing tasks. We design a novel framework EComer that can be easily integrated into existing cloud infrastructure. The key component of this framework is a cost-conscious scheduling heuristic, called CCSH, which is an extension of Heterogeneous Earliest Finish Time (HEFT). Our algorithm CCSH first constructs a priority list of tasks and then assigns the task with the highest priority value to the cost-efficient virtual machine in a cloud setting. The comparison study, based on randomly generated large graphs and a real-life astronomy application model, demonstrates that our algorithm outperforms HEFT by exhibiting significant monetary cost savings at a reasonable increase in overall execution time. © 2011 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in network virtualization environment based on Stackelberg game

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and technology (Natural Science Edition) 2012年第SUPPL.1期40卷 311-315页

作者： Yang, Yu Chen, Shanzhi Li, Xin Wang, Yan State Key Lab of Switching and Networking Technology Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab of Wireless Mobile Communication China Academy of Telecommunication Technology Beijing 100083 China Henan Electronic Power Company Xinyang Power Supply Company Xinyang 464000 China

To solve the resource allocation and pricing in network virtualization environment, a pricing decision and resource allocation model was proposed to maximize the revenue of substrate network and virtual network simultaneously based on Stackelberg game. In this model, the revenue function of the substrate network and the virtual network which was contained the utility function and the cost function were introduced. Then, the optimal strategies of both players in complete information state were given. Whereas, in the incomplete information state, the existence of Nash equilibrium point of the noncooperative game among the virtual networks was proved. To obtain the optimal strategies of virtual network bandwidth allocation and physical network pricing, a distribution iteration algorithm was presented. Finally, the simulation results demonstrate the effectiveness of the algorithm, which can reach the subgame perfect Nash equilibrium and ensure the stability of network in the optimal state.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Quantum Secure Direct Communication with Five-Qubit Entangled state

引用

Chinese Physics Letters 2011年第3期28卷 17-20页

作者： LIN Song GAO Fei LIU Xiao-Fen School of Mathematics and Computer Science Fujian Normal UniversityFuzhou 350007 Key Lab of Network Security and Cryptography Fujian Normal UniversityFuzhou 350007 State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876

Recently,a genuine five-qubit entangled state has been achieved by Brown et al.[***.A 38(2005)1119].Later it was indicated that this state can be used for quantum teleportation and quantum state *** we build a quantum secure direct communication protocol with this state,and prove that it is secure in ideal *** the protocol,the sender performs unitary transformations to encode a secret message on his/her particles and sends them to the *** receiver then performs projective determinate measurement to decode the secret message ***,this protocol utilizes superdense coding to achieve a high intrinsic efficiency and source capacity.

关键词： conditions capacity quantum

来源：评论

学校读者我要写书评

暂无评论

A revised mapping system design for host identity procotol

A revised mapping system design for host identity procotol

引用

International Conference on Network Computing and Information Security

作者： Hu, Zhangfeng Hu, Bo Chen, Shanzhi He, Jianwei State Key Lab of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China State Key Lab of Wireless Mobile Communications China Academy of Telecommunication and Technology Beijing China

ISBN: (纸本)9780769543550

Legacy mapping system for HIP (Host Identity Protocol) is designed based on the traditional DNS (Domain Name System). In addition HIP introduces a new RVS (Rendezvous Server) to maintain the location information for mobile hosts and forward I1 packets to mobile responders. However this design has at least two defects. The first one is that a fixed host may not be approachable for a fairly long period of time if it changes its IP address, because of the existence of deprecated cached entries in DNS. The other is that the load of RVS will be aggravated if a mobile responder is not active or not approachable, because the I1 packets whose destination are mobile responders are forwarded through RVS and will be retransmitted several times. To overcome these defects, in this paper we propose a revised mapping system design for HIP by introducing a new entity called MS (Mapping Server) to store the mappings from HIT to IP address for HIP hosts. In the new mapping system, RVS is not needed any more, and DNS keeps only the mappings from FQDN to HIT for all HIP hosts. With this design, the information stored in DNS is very stable and does not need to be updated frequently, so the TTL of cached entries can be set much longer thus to promote the lookup performance of DNS. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Finding critical multiple paths for demands to avoid network congestion

Finding critical multiple paths for demands to avoid network...

引用

2011 2nd International Conference on Theoretical and Mathematical Foundations of Computer Science, ICTMF 2011

作者： Yang, Huawei Wang, Hongbo Cheng, Shiduan Chen, Shanzhi Lin, Yu State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab. of Wireless Mobile Communication China Academy of Telecommunication Technology Beijing 100083 China

ISBN: (纸本)9783642249983

Multi-path routing schemes have the inherent ability of balancing load between paths, and thus play a major role in traffic engineering for optimizing network distribution. The article proposes an algorithm of finding critical multiple paths, which determines paths between each pair of network nodes. The algorithm selects a small number of decisive paths, besides which few benefits can be obtained to balance load. Experiments on backbone networks with real traffic matrixes show the effectiveness of our algorithm in avoiding network congestion in terms of minimizing maximum link load. © 2011 Springer-Verlag.

关键词： Multipath propagation

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional resource integrated scheduling in a shared data center

Multi-dimensional resource integrated scheduling in a shared...

引用

International Workshop on Specialized Ad Hoc Networks and Systems

作者： Sun, Xin Su, Sen Xu, Peng Chi, Shuang Luo, Yan State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Dept. of Electrical and Computer Engineering University of Massachusetts Lowell Lowell MA United States

ISBN: (纸本)9780769543864

Resource scheduling is crucial to data centers. However, most existing resource scheduling algorithms focus only on one-dimensional resource models, ignoring the fact that multiple resources (e.g. CPU, memory, storage, and network bandwidth) are consumed simultaneously. Competition for multiple resources has become increasingly severe as cloud computing allows uncoordinated and heterogeneous users to share a data center. In this paper, we map such a resource scheduling problem to a bounded multi-dimensional scheduling problem (B-MDKP), taking into account the requirement dependency among multi-dimensional resources. Due to the NP hardness of B-MDKP, we present Multi-dimensional Resource Integrated Scheduling (MRIS), a novel heuristic algorithm to obtain the approximate optimal solution. To demonstrate the advantage of our scheduling scheme, we have implemented MRIS in Haizea, a resource management architecture and made a detailed comparison with existing studies. Our evaluation results show that MRIS achieves high efficiency and high performance for a diverse set of workloads. © 2011 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

NRCF: A novel collaborative filtering method for service recommendation

NRCF: A novel collaborative filtering method for service rec...

引用

2011 IEEE 9th International Conference on Web Services, ICWS 2011

作者： Sun, Huifeng Zheng, Zibin Chen, Junliang Lyu, Michael R. State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780769544632

Since there are many Web services on the Internet, personalized Web service selection and recommendation is very important. In this paper, we present a new similarity measure for Web service similarity computation and propose a normal recovery collaborative filtering (NRCF) method for personalized Web service recommendation. © 2011 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：