|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Distributed QoS multicast routing in networks with imprecise state information显示文摘The goal of qualityofservice (QoS) multicast routing is to establish a multicast tree which satisfies certain constraints on bandwidth, delay and other metrics. The network state information maintained at every node is often imprecise in a dynamic environment because of nonnegligible propagation delay of state messages, periodic updates due to overhead concern, and hierarchical state aggregation. The existing QoS multicast routing algorithms do not provide satisfactory performance with imprecise state information. We propose a distributed QoS multicast routing scheme based on traffic lights, called QMRI algorithm, which can probe multiple feasible tree branches, and select the optimal or nearoptimal branch through the UR or TL mode for constructing a multicast tree with QoS guarantees if it exists. The scheme is designed to work with imprecise state information. The proposed algorithm considers not only the QoS requirements but also the cost optimality of the multicast tree. The correctness proof and the complexity analysis about the QMRI algorithm are also given. In addition, we develop NS2 so that it is able to simulate the imprecise network state information. Extensive simulations show that our algorithm achieves high calladmission ratio and lowcost multicast trees with modest message overhead. | Yan Xin Li Layuan | 2005 | Journal of Systems Engineering and Electronics2005，16，4： | 4 |
| 2 | Multicast routing algorithm of multiple QoS based on widest-bandwidth显示文摘A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth (MRQW) which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available | Chen Niansheng Li Layuan Dong Wushi | 2006 | Journal of Systems Engineering and Electronics2006，17，3： | 4 |
| 3 | Securing Multicast Route Discovery for Mobile Ad Hoc Networks显示文摘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 interme- diate 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 authentica- tion 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. | YANG Mingxi LI Layuan FANG Yiwei | 2007 | Wuhan University Journal of Natural Sciences2007，12，1： | 3 |
| 4 | Reliable adaptive multicast protocol in wireless Ad hoc networks显示文摘In wireless ad hoc network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoc network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoc network environment. In this paper, we propose and evaluate Reliable Adaptive Multicast Protocol (RAMP) based on a relay node concept. Relay nodes are placed along the multicast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoc network by reducing the number of packet retransmissions. We compare RAMP with SRM (Scalable Reliable Multicast). Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmission. | Sun Baolin Li Layuan | 2006 | Journal of Systems Engineering and Electronics2006，17，1： | 3 |
| 5 | Apply agent to build grid service management显示文摘 | Li Chunlin Li Layuan | 2003 | Journal of Network and Computer Applications2003，26，4： | 2 |
| 6 | A routing protocol for dynamic and large computer networks with clustering topology显示文摘 | Li Layuan Li Chunlin | 2000 | Coputer Communications2000，23，2： | 2 |
| 7 | Dynamic Routing Protocol for Computer Networkswith Clustering Topology显示文摘This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology. | Li, Layuan Li, Chunlin | 1999 | Journal of Systems Engineering and Electronics1999，10，1： | 2 |
| 8 | QoS multicast routing protocol in hierarchical wireless MANET显示文摘A wireless MANET is a self-configurable network in which mobile,battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support.It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits,including QoS routing,multicasting,and mobility management. Specifically,an efficient QoS multicast routing protocol is needed.This paper pre- sents a hierarchical QoS multicast routing protocol(QMRP)for mobile ad hoc networks.It can provide QoS-sensitive routes in a scalable and flexible way,in the network environment with mobility.In the proposed QMRP scheme,each local node only needs to maintain local multicast routing information and/or summary infor- mation of other clusters(or domains)but does not require any global ad hoc net- work states to be maintained.The QMRP also allows any ad hoc group member to join/leave the multicast group dynamically and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRP and the proof of correctness and complexity analy- sis of the protocol.The performance measures of QMRP are evaluated using simulation.The simulation results verify the efficiency and availability of QMRP. | LI LaYuan LI ChunLin | 2008 | Science in China(Series F)2008，51，2： | 2 |
| 9 | A combination of genetic algorithm and ant algorithm and its application to QoS multicast routing显示文摘 | Qu Jianwei Li Layuan | 2005 | Journal of Wuhan University of Technology: Transportation Science & Engineering2005，29，6： | 1 |
| 10 | A QoS-guaranteed multicast routing protocol显示文摘 | Li Layuan Li Chunlin | 2004 | Computer Communications2004，27，1： | 1 |
| 11 | A distributed QoS-Aware multicast routing protocol显示文摘 | Li Layuan Li Chunlin | 2003 | Acta Informatica2003，，3： | 1 |
| 12 | Context aware service provisioning in mobile grid显示文摘 | Chunlin Li Layuan Li | 2011 | Journal of Network and Computer Applications2011，34，2： | 1 |
| 13 | A QoS-guaranteed muhicast routing protocol显示文摘 | Li Layuan Li Chunlin | | Computer Communications 200d- 27( 1 ) :590，69，： | 1 |
| 14 | Utility-based scheduling for grid computing under constraints of energy budget and deadline显示文摘 | Chunlin L Layuan L | 2009 | Computer Standards & Interfaces2009，31，6： | 1 |
| 15 | A Recovery Algorithm for Self-Stabilizing Communication Protocols显示文摘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. | Li Layuan & Li Chunlin (Department of Computer Science & Technology, Wuhan nansportation University, 430063, P. R. China) | 2000 | Journal of Systems Engineering and Electronics2000，11，1： | 1 |
| 16 | Resource scheduling with conflicting objectives in grid environments:Model and evaluation显示文摘 | Chunlin L Xiu Z J Layuan L | 2009 | Journal of Network and Computer Applications2009，32，3： | 1 |
| 17 | Agent framework to support computational grid显示文摘 | Li Chunlin Li Layuan | 2004 | Journal of Systems and Software Elsevier2004，70，12： | 1 |
| 18 | A QoS multicast routing optimization algorithms based on genetic algorithm显示文摘 | Sun Baolin Li Layuan | 2006 | Journal of Communications and Networks2006，8，1： | 1 |
| 19 | Competitive proportional resource allocation policy for computational grid显示文摘 | Li Chunlin Li Layuan | 2004 | Future Generation Computer Systems Elsevier2004，20，6： | 1 |
| 20 | Apply Market Mechanism to Agent-based Grid Resource Management显示文摘 | Li Chunlin Lu Zhengding Li Layuan | 2003 | Internation Journal of Software Engineering & Knowledge Engineering World Scientific Publishing2003，12，3： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员