期刊文献+
共找到530篇文章
< 1 2 27 >
每页显示 20 50 100
QoS Routing Algorithm with Multi-Dimensions for Overlay Networks 被引量:1
1
作者 戴慧珺 曲桦 赵季红 《China Communications》 SCIE CSCD 2013年第10期167-176,共10页
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 infrastructure.Overl... 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 infrastructure.Overlay 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 proposed.In 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
下载PDF
Research on Neural Network Based QoS Routing
2
作者 费翔 罗军舟 +1 位作者 吴介一 顾冠群 《Journal of Southeast University(English Edition)》 EI CAS 1999年第2期30-36,共7页
In this paper, the requirements of routing due to the multimedia applications are briefly discussed. In order to solve the QoS constrained routing effectively and efficiently, the scheme of routing based on Hopfield n... In this paper, the requirements of routing due to the multimedia applications are briefly discussed. In order to solve the QoS constrained routing effectively and efficiently, the scheme of routing based on Hopfield neural network is proposed after the analysis of related work. Then the QoS routing algorithm for unicast based on Hopfield NN is described and the result of emulation is given. At last, multicast QoS routing considerations based on Hopfield NN are proposed. 展开更多
关键词 qos routing UNICAST MULTICAST Hopfield neural network
下载PDF
A DISTRIBUTED QOS ROUTING BASED ON ANT ALGORITHM FOR LEO SATELLITE NETWORK 被引量:7
3
作者 Xu Hui Huang Fei Wu Shiqi 《Journal of Electronics(China)》 2007年第6期765-771,共7页
Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algor... Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound. 展开更多
关键词 Low Earth Orbit (LEO) satellite network routing Ant algorithm qos
下载PDF
Study on QOS Routing in Network Centric Warfare
4
作者 梁永生 张乃通 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2005年第3期250-255,共6页
The concept of network centric warfare (NCW) and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis ... The concept of network centric warfare (NCW) and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS (Quality of Service) parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade (regiment) level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points. 展开更多
关键词 network centric warfare (NCW) quality of service qos routing network latency latency algorithm optimal path
下载PDF
Simulation &Performance Evaluation of QoS Routing Protocol for Adhoc Networks Using Directional Communication
5
作者 Arvind Kumar Rajeev Tripathi 《International Journal of Communications, Network and System Sciences》 2012年第12期825-833,共9页
A wireless ad-hoc network is a self-organized wireless network without fixed or backbone infrastructure. All nodes have routing capability and use peer-to-peer packet transmission or forward packets to other node usin... A wireless ad-hoc network is a self-organized wireless network without fixed or backbone infrastructure. All nodes have routing capability and use peer-to-peer packet transmission or forward packets to other node using multi hop communication. Now days mobile ad-hoc networks are being used for different applications and traffics, so it require quality of service (QoS) support in routing protocol. In this paper, a modified QoS routing protocol using directional antenna has been proposed. High and normal priority can be assigned based on type of traffic. All the nodes in the path used by high priority flow are reserved as high priority flow for that flow and normal priority flow will avoid the paths used by high priority flows. If no disjoint paths are available, there may be two possibilities: Normal priority flows are blocked and other is, normal priority flows are allow using the coupled path with high priority flow. Blocking the normal priority flow, QoS routing protocol improves the performance of high priority flow. This concept may be use in emergency communication. Simulation results show that by assigning the priorities to flows, performance of high priority flows are improved and it will further improved by blocking the normal priority flow. 展开更多
关键词 AD-HOC networks Directional ANTENNA routing PROTOCOL qos routing Protocols
下载PDF
基于Overlay Network的QoS机制研究
6
作者 邱春荣 王湘渝 《电脑知识与技术(过刊)》 2009年第1X期316-318,共3页
重叠网服务质量(OverQoS)是一个崭新的研究课题。该文从应用的角度出发,根据OverQoS的驱动者不同,将基于重叠网的QoS架构分为主机系统驱动型和Overlay ISP驱动型,并剖析了两种OverQoS模型的内在特点,最后提出了相应的技术实现方案。
关键词 重叠网 服务质量 qos架构
下载PDF
基于Overlay Network的网格虚拟端到端带宽分配问题研究
7
作者 曹怀虎 余镇危 +1 位作者 沙嘉祥 王银燕 《计算机科学》 CSCD 北大核心 2006年第3期54-57,共4页
提出了基于 Overlay Network 的服务网格(SGON)的概念,以此来生成和部署网络增值服务。带宽分配问题是在 Overlay Grid 上部署和运行增值服务的关键问题,为了解决这个问题,Overlay Grid 在已存在的数据传输网络的上部建立了一个逻辑的... 提出了基于 Overlay Network 的服务网格(SGON)的概念,以此来生成和部署网络增值服务。带宽分配问题是在 Overlay Grid 上部署和运行增值服务的关键问题,为了解决这个问题,Overlay Grid 在已存在的数据传输网络的上部建立了一个逻辑的端到端的服务传输基础,通过双边的服务水平协议(SLA),提供 QoS 约束的带宽。给出了包含 SLA、服务 QoS、流量需求分布、开销等因素的带宽分配问题的模型,同时提供了静态和动态带宽分配问题的分析模型和近似解,最后设计了一种启发式自适应在线动态带宽分配算法。实验仿真结果袁明,该算法是可行的。 展开更多
关键词 服务网格 overlay network 端到端qos 带宽分配算法
下载PDF
SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN
8
作者 黄如 朱煜 +1 位作者 苗澎 朱杰 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2011年第2期192-198,共7页
A heuristic theoretical optimal routing algorithm (TORA) is presented to achieve the data-gathering structure of location-aided quality of service (QoS) in wireless sensor networks (WSNs). The construction of TO... A heuristic theoretical optimal routing algorithm (TORA) is presented to achieve the data-gathering structure of location-aided quality of service (QoS) in wireless sensor networks (WSNs). The construction of TORA is based on a kind of swarm intelligence (SI) mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition. 展开更多
关键词 wireless sensor networks (WSNs) swarm intelligence (SI) routing energy aware quality of service(qos
下载PDF
Anycast service model and its QoS routing algorithm 被引量:11
9
作者 WANG Jian xin, CHEN Song qiao, CHEN Jian er (College of Information Science and Engineering, Central South University, Changsha 410083, China) 《Journal of Central South University of Technology》 2001年第2期135-139,共5页
In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify ... In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, the authors described a simple anycast service model in the Internet without significant affecting the routing and protocol processing infrastructure that was already in place, and proposed an anycast QoS routing algorithm for this model. The algorithm used randomized method to balance network load and improve its performance. Several new techniques are proposed in the algorithm, first, theminimum hops for each node are used in the algorithm, which are used as metric for computing the probability of possible out links. The metric is pre computed for each node in the network, which can simplify the network complexity and provide the routing process with useful information. Second, randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the delay of the routing path. the authors assess the quality of QoS algorithm in terms of the acceptance ratio on anycast QoS requests, and the simulation results on a variety of network topologies and on various parameters show that the algorithm has good performances and can balance network load effectively. 展开更多
关键词 qos anycast service network routing randomized algorithm
下载PDF
Study on the performance of the A*Prune QoS routing algorithm for intelligent optical networks and its improvements 被引量:3
10
作者 SUN Quan WANG Gong-pu 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2006年第3期65-70,共6页
The A'Prune quality of service (QoS) routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A'Prune is considered to be one of the practical routing algorithms for inte... The A'Prune quality of service (QoS) routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A'Prune is considered to be one of the practical routing algorithms for intelligent optical networks because of its flexibility in handling many practical constraints, This article gives detailed performance studies of the algorithm through extensive simulation experiments. We found that both the running time and the memory space requirements of the algorithm are large, especially when the network size increases, in this article, we also propose an approach to improving the performance of the A'Prune algorithm. The improvements should make the A'Prune algorithm more attractive for practical use in intelligent optical networks. 展开更多
关键词 constrained paths K-shortest paths qos routing intelligent optical networks
原文传递
Distributed QoS multicast routing protocol in ad hoc networks 被引量:1
11
作者 Sun Baolin Li Layuan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第3期692-698,共7页
Quality of service (QoS) routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology ch... Quality of service (QoS) routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol (DQMRP). The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints. 展开更多
关键词 ad hoc network multicast routing routing protocol qos.
下载PDF
Void Aware Position Based Opportunistic Routing for QoS in Mobile Ad Hoc Networks
12
作者 V. Raji N. Mohan Kumar 《Circuits and Systems》 2016年第8期1504-1521,共18页
The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever deman... The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever demanding task of wireless communication to satisfy the application requirements. Geographical routing employs a greedy forwarding technique to deliver the packets to the destination and to owe the communication void, it fails to render the expected level of QoS. Opportunistic routing technique effectively utilizes the advantages of broadcasting nature of the wireless medium and selects a set of forwarding candidates instead of relying on a greedy node. To improve the efficiency of QoS routing in sparse and highly dynamic network topology, this paper proposes the Void-Aware Position based Opportunistic Routing (VAPOR). The VAPOR maintains 2-hop neighbor information to take a routing decision, but it is limited to 1-hop information when the node density is high. It efficiently balances the storage overhead and communication delay due to void and it increases the network throughput even under a sparse network. To provide a certain assurance level for packet reachability, VAPOR decides the potential forwarders based on the forwarding probability that measures link stability, capacity, and connectivity factor. It adaptively favors a path that avoids frequent link failure and unreliable link usage. By limiting the propagation area of duplicate packets, VAPOR reduces wastage of network resources, and ittakes the advantage of concurrent batch forwarding to avoid further duplication and unnecessary delay. 展开更多
关键词 Mobile Ad Hoc network Opportunistic Forwarding qos routing Void Alleviation
下载PDF
A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks 被引量:1
13
作者 余燕平 倪玲玲 郑元琰 《Journal of Southeast University(English Edition)》 EI CAS 2015年第1期5-11,共7页
To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing (BCMR) protocol for wireless ad hoc networks is proposed. With th... To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing (BCMR) protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks. 展开更多
关键词 wireless ad hoc networks multicast routing bandwidth satisfaction on-demand multicast routing distributed multicast routing qos multicast routing
下载PDF
一个提供Overlay QOS的端到端接纳控制系统 被引量:2
14
作者 邱春荣 杨贯中 《计算机工程与应用》 CSCD 北大核心 2005年第29期151-153,173,共4页
叠置网络也必须与IP一样,为其扩展业务提供QOS支持。论文提出了一个提供OverlayQOS的端到端接纳控制系统———EAC接纳控制系统,并从叠置网的概念、叠置QOS节点的形成、EAC接纳控制技术、系统架构、模型实现和模拟性能评价等角度出发,对... 叠置网络也必须与IP一样,为其扩展业务提供QOS支持。论文提出了一个提供OverlayQOS的端到端接纳控制系统———EAC接纳控制系统,并从叠置网的概念、叠置QOS节点的形成、EAC接纳控制技术、系统架构、模型实现和模拟性能评价等角度出发,对EAC接纳控制系统进行了较为全面的分析和阐述。 展开更多
关键词 叠置网 叠置qos 端到端接纳控制系统 EAC接纳控制
下载PDF
Overlay组播网络上带QoS约束的路由算法
15
作者 潘耘 张丽 +1 位作者 王励成 余镇危 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第A01期339-343,共5页
为了保证多媒体应用的服务质量,本文在追求最大组播延迟极小化的同时考虑了网络节点的度约束条件,采用一种统一的方式来处理传输延迟和节点处理延迟,并基于此方法定义了带有QoS约束的Overlay组播路由选择优化模型,进而设计了一个求解该... 为了保证多媒体应用的服务质量,本文在追求最大组播延迟极小化的同时考虑了网络节点的度约束条件,采用一种统一的方式来处理传输延迟和节点处理延迟,并基于此方法定义了带有QoS约束的Overlay组播路由选择优化模型,进而设计了一个求解该模型的启发式算法.该算法的时间复杂性为O(|V|3),优于许多求解该问题的同类算法,这些算法的时间复杂性多为O(|V|4),V为给定网络的节点集合.仿真结果也表明,本文算法解的质量也更优,即延迟更小. 展开更多
关键词 overlay网络 qos 组播
下载PDF
主动Overlay物联网QoS服务路由算法研究
16
作者 曹怀虎 朱建明 《计算机科学》 CSCD 北大核心 2012年第8期75-78,共4页
在物联网环境中,服务可能由任意多个结点汇聚而成,而传统的尽力而为的通信服务不能保证服务质量(QoS)。为此,首先提出了主动Overlay物联网服务路由逻辑拓扑结构,然后对物联网服务路由问题进行了建模。在此基础上,设计了基于Agent和蚁群... 在物联网环境中,服务可能由任意多个结点汇聚而成,而传统的尽力而为的通信服务不能保证服务质量(QoS)。为此,首先提出了主动Overlay物联网服务路由逻辑拓扑结构,然后对物联网服务路由问题进行了建模。在此基础上,设计了基于Agent和蚁群优化(ACO)的主动Overlay物联网QoS蚁群服务路由算法。该算法结合移动A-gent对ACO进行了改进,实现了保证QoS的服务路径选择。最后从理论上证明了该算法的正确性和收敛性,同时通过仿真实验对该算法的实际性能进行了验证和比较。 展开更多
关键词 物联网 服务路由 蚁群算法 主动overlay qos
下载PDF
QUANTIFIED COST-BALANCED ROUTING SCHEME FOR OVERLAY MULTICAST
17
作者 Lu Jun Ruan Qiuqi 《Journal of Electronics(China)》 2006年第6期882-887,共6页
This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme (QCost-Balanced) to the metric tradeoff problem b... This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme (QCost-Balanced) to the metric tradeoff problem between overlay path delay and access bandwidth at Multicast Server Nodes (MSN) for real-time ap-plications over Internet. Besides implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, QCost-Balanced tradeoffs these two metrics by a unified tradeoff metric based on quantitative analysis. Simulation experiments demonstrate that the scheme achieves a better tradeoff gain in both two metrics, and effective performance in metric quantitative control. 展开更多
关键词 Multicast routing overlay network Quantified analysis
下载PDF
QoS multicast routing algorithm based on GA 被引量:10
18
作者 李腊元 李春林 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2004年第1期90-97,共8页
The multicast routing problem with multiple QoS constraints in networks with uncertain parameters is discussed, and a network model that is suitable to research such QoS multicast routing problem is described. The QMR... The multicast routing problem with multiple QoS constraints in networks with uncertain parameters is discussed, and a network model that is suitable to research such QoS multicast routing problem is described. The QMRGA, a multicast routing policy for Internet, mobile network or other highperformance networks is mainly presented, which is based on the genetic algorithm(GA), and can provide QoSsensitive paths in a scalable and flexible way in the network environment with uncertain parameters. The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or nearoptimal solution within few iterations, even for the network environment with uncertain parameters. The incremental rate of computational cost can be close to a polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated by using simulations. The results show that QMRGA provides an available approach to QoS multicast routing in network environment with uncertain parameters. 展开更多
关键词 multicast routing qos genetic algorithm network with uncertain parameters
下载PDF
A quality of service routing protocol based on mobility prediction in mobile ad hoc networks 被引量:5
19
作者 王建新 邓曙光 +1 位作者 陈松乔 陈建二 《Journal of Central South University of Technology》 2003年第1期53-57,共5页
A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the ... A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the protocol as follows. (1) Each node just broadcasts its own information, so the packet is very small and can get to the destination in a very short time. (2) When another path is built for the same QoS requirements, the original path has higher priority. (3) The update messages are reduced by using mobility prediction. (4) Data packets carry the information of link change using piggyback, which is helpful for forecasting the link status more accurately. (5) When source node gets Resource Reserve and reconnect packets at the same time, it selects reconnect packet over Resource Reserve packet. The results of simulation show that the protocol has good network performance with low control overload, and efficiently supports transmitting multimedia with QoS requirements in mobile ad hoc networks. 展开更多
关键词 mobile ad HOC networks PREDICTION qos routing
下载PDF
Multi-constraint quality of service routing algorithm for dynamic topology networks 被引量:3
20
作者 Wang Ping Chen Bingcai +1 位作者 Gu Xuemai Liu Gongliang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第1期58-64,共7页
An adaptive multi-QoS routing algorithm called AMQRA is proposed for dynamic topology networks, such as satellite networks and Ad-hoc networks. The AMQRA is a distributed and mobile-agents-based routing algorithm, whi... An adaptive multi-QoS routing algorithm called AMQRA is proposed for dynamic topology networks, such as satellite networks and Ad-hoc networks. The AMQRA is a distributed and mobile-agents-based routing algorithm, which combines ant quantity system (AQS) with ant colony optimization (ACO) that is used in AntNet routing algorithm. In dynamic topology networks, the AMQRA achieves timely optimization for concave metric QoS constraint and fast convergence. The proposed routing algorithm is simulated in Iridium satellite constellation on OPNET. The results show that AMQRA not only outperforms the AntNet in convergence rate in dynamic topology networks but also can optimize concave metric QoS constraint and reasonably allot bandwidth to the load to avoid networks congestion. 展开更多
关键词 routing qos dynamic topology networks
下载PDF
上一页 1 2 27 下一页 到第
使用帮助 返回顶部