检索结果-南通市图书馆

Securing Multicast Route Discovery for Mobile Ad Hoc Networks

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第1期12卷 189-192页

作者： YANG Mingxi li layuan FANG Yiwei School of Computer Science and Technology WuhanUniversity of Technology Wuhan 430070 Hubei China Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074Hubei China

This paper presents SMRAN, a novel securing multicast route discovery scheme for mobile ad hoc networks. The scheme relies entirely on hash chains based one-time signature mechanism, HORSEI, with very efficient signing and verifying, and we do this by improving the HORSE protocol through the introduction of intermediate hash joints. The main purpose of SMRAN is to provide source authentication for multicast routing discovery messages in mobile ad hoc networks. SMRAN will construct multicast tree with authentication constrains in ad hoc networks. The performance measure of SMRAN is evaluated using simulator NS2. The results represent that SMRAN produces less end-to-end packet latency than public key based secure routing scheme, and it is a feasible approach to securing multicast routing for mobile ad hoc networks.

关键词： security multicast route mobile ad hoc

A Heuristic Algorithm for QoS Multicast Routing

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2002年第4期13卷 73-78页

作者： li layuan & li Chunlin Department of Computer Science, Wuhan University of Technology, Wuhan 430063, P. R. China Department of Computer Science Wuhan University of Technology Wuhan 430063 P. R. China

In recent years, QoS multicast routing has continued to be a very important research topic in the areas of networks. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algorithm deals with delay and bandwidth constraints and has low cost. The HAQMR attempts to significantly reduce the overhead for constructing a multicast tree, the proof for correctness of the HAQMR is given, and the performance of the HAQMR is evaluated by simulations. The study shows that HAQMR provides an available approach to QoS multicast routing.

关键词： Heuristic QoS Multicast QoS constraints QoS routing.

A Recovery Algorithm for Self-Stabilizing Communication Protocols

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2000年第1期11卷 38-46页

作者： li layuan & li Chunlin (Department of Computer Science & Technology, Wuhan nansportation University, 430063, P. R. China) Department of Computer Science & Technology Wuhan Transportation University 430063 P. R. China

This paper presents a recovery algorithm for self-stabilizing communication protocols. It first describes some concepts and a formal description method for the algorithm. Then it proposes the algorithm procedures, proves its correctness and analyses its complexity. Finally, it also verifies the availability and efficiency of the algorithm by illustrating an example protocol with multi-processes.

关键词： Computer networks Communication protocols Recovery algorithm Self-stabilization Multimedia communication networks.

A QoS Multicast Routing Algorithm Working with Imprecise State Information

在线全文

学校读者我要写书评

暂无评论

通讯和计算机（中英文版） 2005年第1期2卷 41-48页

作者： YAN Xin li layuan Department of Computer Science Wuhan University of Technology Wuhan Hubei 430063 China

A Routing Algorithm for Distributed Optimal Double Loop Computer Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 1994年第1期5卷 37-43页

作者： li layuan(Department of Electrical Engineering and Computer Science.Wuhan University of Water Transportation, Wuhan 430063, P. R. China) Department of Electrical Engineering and Computer Science Wuhan University of Water Transportation Wuhan 430063 P.R. China

A routing algorithm for distributed optimal double loop computer networks is proposed and analyzed. In this paper, the routing algorithm rule is described, and the procedures realizing the algorithm are given. The proposed algorithm is shown to be optimal and robust for optimal double loop. In the absence of failures,the algorithm can send a packet along the shortest path to destination; when there are failures,the packet can bypasss failed nodes and links.

关键词： Computer networks Double loop Routing algorithm

An Investigation of Formal Techniques of Protocol Based on CFSM

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 1997年第2期8卷 66-72页

作者： li layuanWuhan Jiaotong University, 430063, P. R. China) Wuhan Jiaotong University 430063 P. R. China

This paper investigates formal techniques of protocol based on communicating finite state machines (CFSM). Taking the protocols POLLEND (PE) and ACKNACK (AN) as the examples, the paper discusses the formal description, validation and conversion of protocol with the CFSM, presents a protocol validation method and a protocol conversion algorithm based on the CFSM and demonstrates the applicability of the method and the algorithm using the example protocols PE and AN.

关键词： CFSM Communication protocol Formal techniques.

A Transport Protocol and Its Formal Description for Local Networks

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 1998年第1期9卷 48-55页

作者： li layuan Wuhan Transportation University, 430063, P. R. China

This paper discusses a transport protocol and its formal description techniques for local network. The transport layer function, the transport services and a transport protocol design in a local network architecture model are presented. A transport protocol specification using the finite state automata (FSA) is given. The correctness of the protocol is verified by using the reachability tree technique with respect to the protocol properties of completeness, deadlock and livelock freeness, termination and reachability.

关键词： Local networks Transport protocol Formal description.

The Algorithms for Achieving Global States and Self-Stabilization for Communication Protocols

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 1999年第4期10卷 34-41页

作者： li layuan & li Chunlin(Department of Computer Science & Engineering. Wuhan Transportation University,430063,P . R. China) Department of Computer Science & Engineering. Wuhan Transportation University 430063. P. R. China

This paper discusses the algorithms for achieving global states and self-stabilizationfor communication protocols. It first describes a primary algorithm including its suitability forachieving global states and limitation of self-stabilization for communication protocols, and thenpresents an improved algorithm that can be suitable to achieve global states and can be also usedto self-stabilizing communication protocols. Filially, it gives the proof of correctness and analysis ofcomplexity of the improved algorithm, and verifies its availability and efficiency by illustrating anexample protocol.

关键词： Communication protocols Algorithm for achieving global states Self-stabilization,Computer networks Multimedia communication networks.

在线全文

学校读者我要写书评

暂无评论

协议工程行为模型的研究

计算机科学 1993年第5期20卷 21-26页

作者：李腊元武汉水运工程学院武汉430063

近年,随着计算机网络和分布式系统的不断发展,各类新型通信技术和分布式应用已开始出现,其中主要包括高速光纤网、多介质通信、宽带综合业务数字网(B-ISDN)、智能网,以及综合语音、数据和图象服务等。它们已对计算机通信协议的设计和实... 详细信息

近年,随着计算机网络和分布式系统的不断发展,各类新型通信技术和分布式应用已开始出现,其中主要包括高速光纤网、多介质通信、宽带综合业务数字网(B-ISDN)、智能网,以及综合语音、数据和图象服务等。它们已对计算机通信协议的设计和实现带来了很大影响。为了适应这种形势的发展,一门新兴的高科技学科—协议工程已应运而生。协议工程本质上是计算机硬件工程和软件工程的理论方法在通信协议设计和实现中的具体应用,但由于协议具有实时、互操作和同步性等特点,因而其复杂度又要比一般传统软件大得多。协议工程的主要研究目标是使协议软件的生产怎样更好地实现规范化、工程化和自动化。

关键词：协议工程模型计算机网络