Location:
Search - routing metric
Search list
Description: 保证服务质量的QoS 路由(Quality of Service Routing) 是网络中解决QoS 问题的一项关键技术. QoS 路由
的主要目标是为接入的业务选择满足服务质量要求的传输路径,同时保证整个网络资源的有效利用. 度量参数选择问
题、寻路问题和路由信息不准确问题是QoS 路由中的几个主要研究内容. 本文围绕这三个方面,介绍了QoS 路由中的
主要问题及相关的解决办法,并探讨了今后QoS 路由可能的研究方向.-To ensure the quality of service QoS routing (Quality of Service Routing) is a network address QoS issues a key technology. QoS routing the main objective is to access business options to meet the requirements of the transmission path quality of service, while ensuring that the entire network efficient use of resources. metric parameters of choice, look for road and routing information is not accurate QoS routing problem is that several major research contents. This paper focus on three aspects, introduced the main issues in QoS routing and related solution, and to explore possible future research directions QoS routing.
Platform: |
Size: 445440 |
Author: ivon |
Hits:
Description: This metric will also be based on multi channel creation methods and Hop-by-hop routing
techniques for an effective multi hop transmission with no loops. sht-This metric will also be based on multi channel creation methods and Hop-by-hop routing
techniques for an effective multi hop transmission with no loops. sht11
Platform: |
Size: 340992 |
Author: cclab |
Hits:
Description: propose a new routing technique called Security-Aware
ad hoc Routing (SAR) that incorporates security attributes as parameters
into ad hoc route discovery. SAR enables the use of security as a negotiable
metric to improve the relevance of the routes discovered by ad hoc
routing protocols. We develop a two-tier classification of routing protocol
security metrics, and propose a framework to measure and enforce security
attributes on ad hoc routing paths. Our framework enables applications to
adapt their behavior according to the level of protection available on communicating
nodes in an ad hoc network.
Platform: |
Size: 53248 |
Author: zipzap |
Hits:
Description: Kademlia协议（以下简称Kad）是美国纽约大学的PetarP. Maymounkov和David Mazieres.
在2002年发布的一项研究结果《Kademlia: A peerto -peer information system based on the XOR metric》。
简单的说，Kad 是一种分布式哈希表（DHT）技术，不过和其他 DHT 实现技术比较，如 Chord、CAN、Pastry 等，Kad 通过独特的以异或算法（XOR）为距离度量基础，建立了一种 全新的 DHT 拓扑结构，相比于其他算法，大大提高了路由查询速度。-Kademlia Agreement (Kad) is a New York University' s PetarP. Maymounkov and David Mazieres. In 2002, a study released " Kademlia: A peerto-peer information system based on the XOR metric" . Simply put, Kad is a distributed hash table (DHT) technology, but compared with other DHT implementation technologies, such as Chord, CAN, Pastry, etc., Kad through a unique algorithm to different or (XOR) as a distance measure based on DHT established a new topology, compared to other algorithms, which greatly improves the speed of routing queries.
Platform: |
Size: 221184 |
Author: MeterCai |
Hits:
Description: gpsr路由协议c++实现，添加了除了距离因素以外的链路质量因素作为选路判据。-gpsr rouintg protocol, which added a new routing metric called etx in the original code.
Platform: |
Size: 294912 |
Author: 姜丽君 |
Hits:
Description: Optimized Link State Routing Protocol with estimating ETX metric.
Platform: |
Size: 322560 |
Author: LongNT |
Hits:
Description: In this work, performance evaluation of LEACH
and LEACH-C protocols based on NS2 is depicted, which
helps to reveal the regularity how performances of these
two routing protocols change with the sink locations. For a
more accurate description of this regularity, two novel
concepts are proposed, i.e., Sensor Node Distribution
Gravity and Distance Metric between sink and Gravity.
Simulation results show that a distance threshold area,
which is a key factor for choosing between LEACH and
LEACH-C protocols, can be achieved.
Platform: |
Size: 338944 |
Author: mihir |
Hits:
Description: 以前在游戏工作室上班时写的一个小工具，功能：在虚拟机上同时拨10条adsl获得10个不同的IP，同时设置路由表，然后把10个IP发送到指定的数据库中。每个IP的跃点数设置成一样，这样就是10个不同的IP出口，然后做成s5代理给挂机的电脑使用。-A small tool, written in the previous game studio to work function: on the same virtual machine to allocate 10 adsl 10 different IP, set the routing table at the same time 10 IP, and then sent to the specified database. Each IP metric set to the same, so that 10 different IP exports, then made the s5 agent to hang up the computer use.
Platform: |
Size: 57344 |
Author: 王俊 |
Hits:
Description: 802.11s无线Mesh网络中协作多样性感知的路由度量和协作路由协议-802.11s Wireless Mesh Network-aware routing metric cooperative diversity and collaborative routing protocols
Platform: |
Size: 536576 |
Author: 王力宏 |
Hits:
Description: the network lifetime based on a new Energy-Aware Objective Function used to design a Routing Protocol for Low-Power and Lossy Networks. The proposed Objective Function uses the Expected Transmission Count Metric and the Remaining Energy on each sensor node to compute the best paths to route data packets across the network.So EAOF prolongs the network lifetime and reduces the need for human intervention on battery changing, thereby enhancing the system wearability and reducing operational costs.
Platform: |
Size: 2048 |
Author: Kayal |
Hits:
Description: Producing the quality of service in wireless network is a complex subject because of constraints related to the ad hoc mode as limited bandwidth, sharing medium...etc. The traditional routing based on hop count metric doesn’t take in its consideration
the quality of the wireless link which causes the rate reduction in the network. In an effort to improve the performance of Mobile Ad hoc Network (MANET), cross-layer technique is implemented. It aimed to
resolve QOS problems in manet and permit to share information about network status between different layers.
Platform: |
Size: 230400 |
Author: NIRDESH |
Hits:
Description: Static routing is very simple. Each node has a routing table where each entry has the destination and the next node. On receiving a packet, a node find the entry corresponding to the packet s destination, and forwards it to the next node. If there is no entry, the node drops the packet. That s it.
While writing the static routing protocol in ns2 is easy, we have to set a routing tables at every node. This can be done by writing an external program. For example, when you generate a topology, you can set up routing table with the shortest path metric.
Source codes
In this project, we are going to write new source codes (static_routing_pkt.h, static_routing.h, and static_routing.cc) and new script (static.tcl), and modify existing codes (packet.h, queue.cc, ns-lib.tcl, ns-mobilenode.tcl, and ns-packet.tcl)
The source codes of this project is available here.
Platform: |
Size: 37888 |
Author: ameur |
Hits:
Description: matlab实现图上的Florid算法，最终结果为路径长度度量矩阵和路由矩阵-Floyd algorithm matlab implementation on the graph, the end result is the path length metric matrix and routing matrix
Platform: |
Size: 1024 |
Author: Lancy Green |
Hits:
Description: matlab实现图上需找最短路径的迪杰斯特拉算法，寻找任一点和其他点之间的最短距离，最终结果为最短路径度量矩阵和正序路由矩阵-matlab implementation on the map to find the shortest path Dijkstra algorithm to find the shortest distance between any point and other points, the final result is the shortest path metric matrix and positive sequence routing matrix
Platform: |
Size: 1024 |
Author: Lancy Green |
Hits:
Description: OPERA Optimal Routing Metric for Cognitive Radio Ad Hoc Networks -OPERA.pdf
Platform: |
Size: 463872 |
Author: azarakhsh |
Hits: