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

International Conference on Computational Intelligence and Security

作者： Peng Wu Guoxin Wu Key Laboratory of Computer Network and Information Integration Ministry of Education School of Computer Science and Engineering South-East University Nanjing China

ISBN: (纸本)9781424454112

One of the fundamental challenges for Peer to Peer (P2P) systems is the ability to manage risks involved in interacting and collaborating with prior unknown and potentially malicious parties. Reputation-based trust management systems have proven to be essential to enforcing cooperative behavior in P2P networks. However, in many existing reputation-based trust models, the validity of peers' trust valuation is seriously affected by peers' malicious behaviors, such as strategic cheating, dishonest recommending and collusion. In this paper, we propose a novel reputation-based trust model for P2P systems. In our approach, the trustworthiness of peers consists of the experience-based and recommendation-based trust. To provide adequate reaction to peers' malicious behaviors, some factors are introduced to distinguish these experiences about peers' behaviors. Simulation shows that the proposed model has advantages in countering peers' malicious behaviors over the existing trust models.

关键词： Peer to peer computing computer network management Feedback Predictive models Computational intelligence computer security information security Laboratories computer science education Systems engineering education

来源：评论

学校读者我要写书评

暂无评论

Reputation Mechanism in Peer-to-Peer network

Reputation Mechanism in Peer-to-Peer Network

引用

International Conference on information Science and Engineering (ICISE)

作者： Peng Wu Guoxin Wu Key Laboratory of Computer Network and Information Integration Ministry of Education School of Computer Science and Engineering South-East University Nanjing China

ISBN: (纸本)9781424449095

Peer-to-Peer (P2P) technology has been widely used in file-sharing, distributed computing, e-market and information management. However, one of the critical challenges for P2P systems is the ability to manage risks involved in interacting and collaborating with prior unknown and potentially malicious peers. Reputation systems can successfully minimize the potential damages to the P2P systems by computing the trustworthiness of a certain peer from that peer's behavior history. In this paper, we give a brief survey of researches on reputation mechanism in P2P network. Firstly the fundamentals of reputation mechanism are introduced. By investigating the reputation systems in P2P network, we outline several key technologies of reputation mechanism. Finally we put forward the essential design principles of the ideal reputation mechanism.

关键词： Peer to peer computing Collaboration information management Risk management information science Laboratories computer network management computer science education computer science Educational technology

来源：评论

学校读者我要写书评

暂无评论

Statistical Analysis of Trust Overlay network

Statistical Analysis of Trust Overlay Network

引用

International Seminar on Future information Technology and Management Engineering, FITME

作者： Zhong Zhu Guoxin Wu Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education South-East University Nanjing China

A TON (trust overlay network) is a virtual network on top of the underlying distributed application network, which is a directed and weighted complex network. A detailed understanding of the structural properties of TON topology will benefit the accurate grasp of the trust formation mechanism and management model and the effect on underlying distributed application network, in order to make better use of trust relationships (also called "soft security") to solve security issues of large-scale distributed application system. Based on P2P service network model with the property of small world, two algorithms for generating TON were proposed, which was implemented on the Repast simulation system. The simulation results and analysis suggest the TON fits power-law distribution ( ¿ ¿ (1,4)) in in-degree, outdegree, global trust value and local trust value, which shows a TON has a scale-free networks characteristics.

关键词： Statistical analysis Peer to peer computing Application software computer network management network topology Power system security Analytical models Distributed computing information technology Conference management

来源：评论

学校读者我要写书评

暂无评论

Non-blocking message total ordering protocol

引用

Science in China(Series F) 2008年第12期51卷 1919-1934页

作者： WANG Yun & WANG JunLing School of computer Science & Engineering, Southeast University key Lab of computer network & information integration, MOE, Nanjing 210096, China 1. School of Computer Science & Engineering Southeast University Key Lab of Computer Network & Information Integration MOE Nanjing 210096 China

Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism （RR） to obtain their lost decisions. Forward acknowledgement mechanism （FA） is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.

关键词： total ordering protocol non-blocking active replication fault tolerance token ring

来源：评论

学校读者我要写书评

暂无评论

Novel one-hop transmission algorithm in wireless network based on network coding

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 213-216页

作者： Lu, Yifei Ju, Xi Tao, Jun Xia, Qin Wang, Cuihan School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Library of Computer Network and Information Integration Nanjing 210096 China

To solve the problem of the efficient transmission in error-prone wireless network, an ideal transmission model based on coding group (ITCG) is proposed in this paper. Furthermore, a retransmission model based on coding group (RTCG) is introduced due to the error-prone channel in wireless network. Also, a novel transmission algorithm of retransmission model is proposed based on coding group (ARTCG). At last, through the experiment, the transmission delay and throughput of the unicast and ARTCG are separately analyzed. Simulation results show that ARTCG can improve the transmission efficiency and solve the sharp decrement of performance with the condition of node's burst error. ARTCG can keep the transmission fairness of the different data.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

引用

Science in China(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2 & WU Cheng3 1 School of computer Science & Engineering, Southeast University, Nanjing 210096, China 2 key Laboratory of computer network and information integration (Southeast University), Ministry of Education, Nanjing 210096, China 3 Department of Automation, Tsinghua University, Beijing 100084, China 1. School of Computer Science & Engineering Southeast University Nanjing 210096 China 2. Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 China 3. Department of Automation Tsinghua University Beijing 100084 China

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

来源：评论

学校读者我要写书评

暂无评论

Task scheduling in real-time CORBA for emergency passage

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 154-159页

作者： Zhang, Chao Wang, Yun School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Nanjing 210096 China

In order to ensure the tasks of emergency passage are scheduled first and avoid priority inversion by the switches of system states in CORBA (common object request broker architecture) system, a real-time scheduling scheme is proposed and analyzed which adopts an adaptive dynamic priority scheduling algorithm. The scheme considers the switches of system states. It also takes account of connection management and thread pool management. Analysis shows that the tasks of emergency passage can take priority over others, and the probability is negligible that inconsistent system states result in low-priority tasks blocking high-priority ones. Besides, tasks of emergency passage will never wait under this algorithm, so their execution is ensured on each node, which meets the needs of application.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Resource allocation model based on non-cooperative bidding game in P2P network

Resource allocation model based on non-cooperative bidding g...

引用

International Symposium on Advances in computer and Sensor networks and Systems, 2008

作者： Jun, Tao Hang, Chen JiaGao, Wu School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing 210096 China College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

ISBN: (纸本)9781427629807

Game theory is applied to studying the P2P resource allocation technologies further in this paper. The mechanism of P2P resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in P2P resource allocation game. At last, we present a P2P resource allocation algorithm (PRANG) based on the resource allocation game model. The results of experiment and simulation show that PRANG algorithm can provide references for the quantity of resource that users demand and regularize the users' bids. Consequently, the allocation of the whole P2P resource tends to be more reasonable.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of efficient adaptive CORBA-based load balancing framework

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 139-144页

作者： Li, Dili Wang, Yun School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

The design and implementation of a CORBA (common object request broker architecture)-based load balancing middleware are described. key features of this middleware are its ability to tolerate faults by means of GCS (group communication service), make load balancing decisions based on various workload metrics, and support servers to join and leave dynamically. In order to support the processing of state-dependent client requests, the middleware provides state-dependent service by replication technique. Further, the state-dependent service based on replication is compared with the one based on CORBA PSS (persistent state service of CORBA) on the performance. Experimental results show that the performance of the two methods varies with state-dependent client requests load and state-dependent client requests ratio.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Study on new members' joining in fault-tolerant group

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 160-164页

作者： Lu, Jun Wang, Yun School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

This paper researches on the action of new members joining a fault-tolerant group and the issue of synchronizing data between new member and old members, including increased "failure window", blocked "heart beat" messages, and synchronization redirection to new coordinator in face of the crash of old coordinator. The paper proposes a novel pre-join mode for new members to join a fault-tolerant group and redirect the synchronization processing to the new selected coordinator if the old coordinator crashes in order to accomplish the synchronization. The corresponding algorithms are put forward and the validity of the algorithms is discussed. Furthermore several synchronization strategies are given in terms of the number of members in a group. Test results show that the algorithms help to reduce the misjudgment rate and hence improve system efficiency and robustness.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：