检索结果-南通市图书馆

qos routing based on mobile agent for LEO satellite IP networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2009年第6期16卷 57-63页

作者： RAO Yuan,WANG Ru-chuan College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 230001,China College of Computer Nanjing University of Posts and Telecommunications Nanjing 230001 China

Current quality of service（qos） routing schemes for low earth orbit（LEO） satellites IP networks either neglect the varying population density or fail to guarantee end-to-end *** a remedy,qos routing protocol based on mobile agent（qosRP-MA） is ***-MA is a source-based routing *** connection requests arrive,qos mobile agents are dispatched from ingress satellite to explore routes,which migrate using satellite routing *** arriving in egress satellite,qos mobile agents migrate back towards ingress satellite to reserve *** construct satellite routing tables,load balancing routing algorithm based on mobile agent（LBRA-MA） is *** LBRP-MA,at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing ***,path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link（ISL） ***,ISL congestion index is considered to update routing *** simulations on a Courier-like constellation,it shows that qosRP-MA can achieve guaranteed end-to-end delay bound with higher throughput,lower connection failing ratio and signaling overhead compared to high performance satellite routing（HPSR） scheme.

关键词： qos routing load balancing mobile agent satellite IP networks

Optimized qos routing Algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Donghua University(English Edition) 2004年第2期21卷 112-115页

作者：石明洪王思兵白英彩 Computer Science Department Shanghai Jiao Tong University Shanghai 200030 China Dr Electronic Engineering Department Shanghai Jiao Tong University Shanghai 20030 China

qos routing is one of the key technologies for providing guaranteed service in IP networks. The paper focuses on the optimization problem for bandwidth constrained qos routing, and proposes an optimal algorithm based on the global optimization of path bandwidth and hop counts. The main goal of the algorithm is to minimize the consumption of network resource, and at the same time to minimize the network congestion caused by irrational path selection. The simulation results show that our algorithm has lower call blocking rate and higher throughput than traditional algorithms.

关键词： qos routing NP-Complete routing optimization

qos routing Algorithm with Multi-Dimensions for Overlay Networks

在线全文

学校读者我要写书评

暂无评论

China Communications 2013年第10期10卷 167-176页

作者：戴慧珺曲桦赵季红 School of Electronic Information Xi'an Jiaotong University Department of Communication Engineering Xi'an University of Posts and Telecommunications

Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network *** routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service(qos). While the former has recently been investigated, the conflict of qos restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional qos objective model based on the analysis of multiple qos constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then *** fact, the algorithm obtained multiple qos values using probability theory to achieve the routing according to the multi-dimensional qos objective vector of the qos objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent qos requirements could be run.

关键词： overlays qos routing multi-di- mensional qos objective model multi-dimensional qos objective vector

Combining Single (Mixed) Metric Approach and Genetic Algorithm for qos routing Problem

在线全文

学校读者我要写书评

暂无评论

Journal of Southwest Jiaotong University(English Edition) 2004年第1期12卷 20-24页

作者：胡世余谢剑英 Automation Research Institute

A hybrid algorithm for the delay constrained least cost path problem is proposed through combination of single (mixed) metric approach and genetic algorithm. Compared with the known genetic algorithm for the same problem, the new algorithm adopts integral coding scheme and new genetic operator, which reduces the search space and improves the efficiency of genetic operation. Meanwhile, the single (mixed) approach accelerates the convergence speed. Simulation results indicate that the proposed algorithm can find near-optimal even optimal solutions within moderate numbers of generations.

关键词： qos qos routing Genetic algorithm

Distributed qos routing algorithm based on partheno-GA with binary coding

在线全文

学校读者我要写书评

暂无评论

Distributed QoS routing algorithm based on partheno-GA with ...

Research on the Basis of qos routing Protocol of Ad Hoc Network

2007年中国智能自动化会议

作者：冯杰姜宁杨既春 Department of Mathematics Dalian University of Technology Operation Research Room Dalian Naval Academy

routing is a critical issue in networking *** basic problem of qos routing is to satisfy some network parameters constrained of many conditions which is a NP-complete problem and qos parameters are nondeterministic even *** practical heuristic algorithms are researched to solve such a *** on partheno-GA with binary coding,the network model and mathematical model of qos routing are constructed,and the distributed qos routing algorithm is put *** algorithm can be easily implemented through dividing the giant and complex network into some *** simulation result shows that the algorithm can meet increasing daily qos requirements on Internet,and improve performance more 10 times in time and space complexity compared with the source routing algorithms.

关键词： binary coding partheno-GA qos routing distributed algorithm simulation

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Research on the Basis of QoS Routing Protocol of Ad Hoc Netw...

Multiple constraints-based qos multicast routing: model and algorithms

2004 International Symposium on Distributed Computing and Applications to Business, Engineering and Science

作者： Chen Niansheng~(1 2) Li Layuan~1 1 School of Computer Science Wuhan University of Technology Wuhan 430063 China 2 Department of Computer Science Hubei Normal University Huangshi 435002 China

＜正＞Ad Hoc network is an ideal technology to set up a fast communication system for military use and civil *** is an important problem it faces of how to offer different qos for them;and qos routing technology is the key technology and a hot issue in *** article has analyzed and studied several kinds of qos routing algorithms that different researchers put *** has also compared and analyzed them from unidirectional link supports,multicast functions and qos parameter *** study helps to improve and perfect the qos routing technology ofAd Hoc network.

关键词： Ad Hoc network qos routing routing protocol

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2005年第1期16卷 187-193页

作者： SunBaolin LiLayuan DepartmentofComputerScienceandTechnology WuhanUniversityofTechnologyWuhan430063P.R.China//DepartmentofMathematicsandPhysicsWuhanUnivereityofScienceandEngineeringWuhan430073P.R.China DepartmentofComputerScienceandTechnology WuhanUniversityofTechnologyWuhan430063P.R.China

Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (qos) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact qos algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based qos multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.

关键词： multicast routing algorithm multiple constraints qos routing NP-complete.

Genetic Simulated Annealing Algorithm for qos routing

在线全文

学校读者我要写书评

暂无评论

Genetic Simulated Annealing Algorithm for QoS Routing

qos multicast routing protocol in hierarchical wireless MANET

2012年计算机应用与系统建模国际会议

作者： Zhang Hui Huang Jihai Information Engineering College Zhongzhou University

This paper proposes the math model of qos routing. Then we present a genetic simulated annealing algorithm is proposed of qos routing. The results show that the new method to enhance the search ratio and the speed of ... 详细信息

关键词： qos routing delay constraint search ratio genetic simulated annealing algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Science in China(Series F) 2008年第2期51卷 196-212页

作者： LI LaYuan LI ChunLin Department of Computer Science Wuhan University of Technology Wuhan 430063 China

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 presents 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 information of other clusters （or domains） but does not require any global ad hoc network 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 analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.

关键词： wireless ad hoc networks qos routing multicast hierarchical routing mobile wireless networks