Description: 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path Platform: |
Size: 12632 |
Author: 包海洁 |
Hits:
Description: 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path Platform: |
Size: 12288 |
Author: 包海洁 |
Hits:
Description: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。
开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。
-OSPF is a routing protocol. Routing algorithm and routing protocol in the concept is different. Network hosts, routers, routing algorithm, through the formation of routing table to determine the sending packet transmission path. The routing protocol is a router used to create routing tables and update the routing information of the communication protocol. Open Shortest Path First protocol (Open Shortest Path First, OSPF) is the most important one of the internal gateway protocol. Through the curriculum design, students can establish a routing table and routing information updates such as more intuitive and clear understanding. Platform: |
Size: 1024 |
Author:猪八戒 |
Hits:
Description: 无线传感器网络路由算法，采用最短路径，先搜索节点的一跳范围的距离，再搜索两跳的距离，仿真效果良好。-Wireless sensor network routing algorithm, using the shortest path first jump of the scope of the search node distance, and then search for the two jump distance, simulation results were very good. Platform: |
Size: 14336 |
Author:电信科学 |
Hits:
Description: OSPF- Open shortest path first. which a routing protocol. uses IP version 4-OSPF- Open shortest path first. which a routing protocol. uses IP version 4 Platform: |
Size: 8192 |
Author:Muni |
Hits:
Description: K 最短路径
K 最短路径 代码
-improved routing algorithm used to find from source to destination node of the first k Shortest Path Platform: |
Size: 123904 |
Author:laodu |
Hits:
Description: CCNA菜鸟笔记 2006版
包含以下内容：
第一章 网际互联
第二章 因特网协议
第三章 IP 子网划分和变长子网掩码（VLSM）
第四章 Cisco IOS 简介
第五章 IP 路由
第六章 增强 IGRP（EIGRP）和开放最短路径优先（OSPF）
第七章 虚拟局域网（VLAN）
第八章 管理 Cisco 互联网络
第九章 局域网类故障
第十章 使用访问列表管理流量
第十一章 广域网协议
-Rookie CCNA Notes, 2006 Edition contains the following contents: Chapter I Chapter II internetworking Chapter III of Internet Protocol IP subnetting and variable length subnet mask (VLSM) About Cisco IOS Chapter IV Chapter V Chapter VI IP Routing Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF) Chapter VII of the virtual LAN (VLAN) of Chapter VIII of the management of Cisco LAN Internet Chapter IX Chapter X-type fault management using the access list WAN traffic agreement Chapter XI Platform: |
Size: 2438144 |
Author:申亚囡 |
Hits:
Description: 链路状态路由算法实现。链路状态算法又叫最短路径优先SPF（Short Path First）算法。按照SPF的要求，路由器中路由表依赖于一张能表示整个个网络拓扑结构的无向图G（V，E）。-Link state routing algorithm. Link State algorithm called the shortest path first SPF (Short Path First) algorithm. In accordance with the requirements of SPF, the router relies on a routing table can be said that the entire network topology undirected graph G (V, E). Platform: |
Size: 2048 |
Author:yiyi |
Hits:
Description: 因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables Platform: |
Size: 10240 |
Author:孙彭 |
Hits:
Description: 本文章用OPNET作为工具，建设不同的模拟场景和参数，分析RIP，EIGRP和OSPF这三种路由协议的优缺点。-Performance Analysis of RIP, EIGRP, and OSPF using OPNET.Routing protocols are key elements of modern communication networks. Currently deployed dynamic routing protocols that are used to propagate network topology information to the neighboring routers are Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP), and the Open Shortest Path First (OSPF) protocol. The choice of the right routing protocol depends on a number of parameters. In this paper, we use OPNET Modeler to analyze the performance of RIP, EIGRP, and the OSPF protocols, which are commonly deployed in Internet Protocol (IP) networks. We designed various simulation scenarios to compare their performance. Platform: |
Size: 326656 |
Author:fafan |
Hits:
Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).-For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
Platform: |
Size: 1024 |
Author:yashika |
Hits:
Description: Underwater SUN node configuration.
This code defines the communication between two sender and one receiver using sun node routing.
SUN node module gives first priority to shortest path and then SNR value. Platform: |
Size: 4096 |
Author:kamesh |
Hits:
Description: In this article w ill learn about the OSPF Routing Protocol
Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices
-In this article we will learn about the OSPF Routing Protocol
Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices
Platform: |
Size: 269312 |
Author:osama |
Hits:
Description: 在网络通信中，经常需要求最短路径。但完全采用最短路径传输有这样一个问题：如果最终在两个终端节点之间给出的最短路径只有一条，则在该路径中的任一个节点或链路出现故障时，信号传输将面临中断的危险。因此，对网络路由选择作了以下改进：为任意两节点之间通信提供两条路径供其选择，即第一最短路径、第二最短路径.使用数据结构编程实现，程序=算法+数据结构的很好体现-In network communication, often request the shortest path. But totally shortest path transmission has a problem: If the shortest path between two terminal nodes eventually given only one, then any one node or link in the path fails, the signal transmission will face disruption danger. Therefore, the network routing made the following improvements: two paths for their choice of any communication between two nodes, namely the shortest path first, second shortest path using the data structure programming, program = algorithm+ data structure. the well reflected Platform: |
Size: 274432 |
Author:冉戆 |
Hits:
Description: 任意生成一个M*N的矩阵，并根据深度优先算法和广度优先算法寻找一条或多条最短路径，通过图形化的界面标记输出各个节点的坐标。要求迷宫是随机并且是连通的。-Optionally generate an M* N matrix, and to find one or more shortest path first algorithm according to the depth and breadth-first algorithm, through a graphical interface markup output coordinates of individual nodes. Requirements maze is random and is connected. Platform: |
Size: 137216 |
Author:jonson |
Hits:
Search - shortest path first routing