Search - routing table

Search - routing table - List

[Program doc] ijns-2007-v5-n2-p158-166 DL : 0: Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless network. Due to absence of any ﬁ xed node, each node acts as a router, providing routing capability for the MANET. Various protocols for discovery of routes be- tween any two MANET nodes have been designed. These protocols are broadly categorized as on-demand proto- cols and table driven protocols. Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (AODV) are the two most matured on-demand routing protocols, while Optimized Link State Routing Protocol (OLSR) and Topology Dissemination Based on Reverse-Path For- warding (TBRPF) are the two most matured table driven routing protocols. This paper proposes enhancements in DSR to provide secured route discovery and improved
Date : Size : 172kb User : payal
[Program doc] 4Vol4No9 DL : 0: Zone Routing Protocol (ZRP) is a most promising and widely accepted and well proved hybrid routing protocol in Mobile Ad-hoc Networks (MANETs) for its performance when compared with table-driven and on-demand protocols. Our study is based on using the concept of genetic algorithms to provide a set of available paths to the destination in order to load balance the network. This gives us the reduction in overhead and better delivery of packets. We call this new routing protocol as Genetic Zone Routing Protocol (GZRP).
Date : Size : 117kb User : Nguyen Kim Thuan
[Software Engineering] Cpp1 DL : 0: dijkstra最短路径寻径算法之邻接表加堆排序的优化方法-adjacent table and heap sort Dijkstra shortest path routing algorithm optimization method
Date : Size : 1kb User : lihk
[Linux-Unix] LINUX DL : 0: 1. 在Linux系统中，以文件方式访问设备。 2. Linux内核引导时，从文件 /etc/fstab 中读取要加载的文件系统。 3. Linux文件系统中每个文件用 i节点来标识。 4. 全部磁盘块由四个部分组成，分别为引导块、专用块、 i节点表块和数据存储块。 5. 链接分为：硬链接和符号链接。 6. 超级块包含了i节点表和空闲块表等重要的文件系统信息。 7. 某文件的权限为：d-rw-_r--_r--，用数值形式表示该权限，则该八进制数为： 644 ，该文件属性是目录。 8. 前台起动的进程使用 Ctrl+c 终止。 9. 静态路由设定后，若网络拓扑结构发生变化，需由系统管理员修改 -1 papers on a Linux system to access the device. Linux kernel boot time, is read from the file/etc/fstab file to load system. Linux file system, each file i-node to identify. Disk block consists of four parts, namely boot block, a dedicated block, i-node table block and data storage block. 5 links divided into: hard links and symbolic links. Superblock contains the i-node table and free block table file system information. 7. Permissions of a file: d-rw-_r- _r- A numeric representation of the permissions, the octal number: 644 the attributes of the file is a directory. 8. The reception starting process use Ctrl+c termination. Static routing, network topology changes need to be modified by the system administrator
Date : Size : 18kb User : 刘涛
[Editor] dsdv DL : 0: Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm
Date : Size : 1kb User : KARTHIKEYAN
[JSP/Java] jxta-meteor DL : 0: 基于jxta平台的分布式哈希表（DHT)子项目，路由寻址均基于jxta的地址机制，实现了经典的chord,can协议，项目属于jxta的子项目，尚在开发中，还不是很稳定，但基本功能已经实现了-Based on a distributed hash table jxta platform (DHT) subprojects, addressing both routing mechanism based on the address jxta achieve a classic chord, can the agreement, the project belongs jxta subprojects, under development, is not very stable However, the basic function has been achieved
Date : Size : 2.36mb User : 王礼坊
[Other Embeded program] mintRoute DL : 0: WSN多跳路由，使用最短路径，定时器，队列，邻居表管理等，核心策略是邻居表的周期更新和父节点的定期选举-WSN multi-hop routing，Using the shortest path, timer, queue, the neighbor table management etc.core strategy is the regular election cycle update the neighbor table and the parent node
Date : Size : 9kb User : weimingjuan
[TCP/IP stack] dsdv DL : 0: 同样用于无线自组织网络的路由协议，AODV协议时源驱动协议，而DSDV是表驱动协议-The same routing protocol for wireless ad-hoc network, when AODV protocol source-driven protocol, while DSDV is a table-driven protocol
Date : Size : 122kb User : 窦丽丽
[CAD] TinyCAD_2.80.04 DL : 0: TinyCAD 是一个易于使用的程序，能够绘制电路图俗称原理图。能够输出网络表用于PCB布线。VS2010下测试可以编译。编译时根据BuildIDTemplate.h文件创建BuildID.h文件。VS2010不使用预先生成事件。-TinyCAD is an easy to use program, can draw circuit diagram or schematic diagram. Can output table for PCB routing network. You can compile test VS2010. Compile time according to create BuildID.h file BuildIDTemplate.h file. VS2010 does not use the pre build event.
Date : Size : 22.01mb User : seawave
[Linux-Unix] socrates_fpga_pic DL : 0: Interrupt routing and type table.
Date : Size : 3kb User : dengwrhun
[Other] 111 DL : 0: 本研究开发一种混合自动进化模糊学习算法决定了最优路径旅行附近大规模旅行商问题 (LSTSPs)。LSTSPs识别解决方案是一种最复杂的主题全球的组合优化问题。提出的混合进化模糊学习计划的优点结合自适应模糊c均值(FCM),简单不等式性质合并的概念,模拟退火(SA)算法和一种有效的学习表transform-based粒子群优化(TPSO)。本研究使用方法来处理大型TSP路由系统。应用进化TPSO学习算法-This study develops a hybrid evolutionary fuzzy learning algorithm that automatically determines the near optimal traveling path in large-scale traveling salesman problems (LSTSPs). Identifying solutions for LSTSPs is one of the most complicated topics in the field of global combinatorial optimization problems. The proposed hybrid evolutionary fuzzy learning scheme combines the advantages of the adaptive fuzzy C-means (FCM), simple MAX–MIN merging concept, simulated annealing (SA) learning algorithm and an efficient table transform-based particle swarm optimization (TPSO). This study uses the proposed method to deal with the large-size TSP routing system.
Date : Size : 1.87mb User : qi
[Internet-Network] Zigbee DL : 0: Neighbor Table Based Shortcut Tree Routing
Date : Size : 5.72mb User : achutkiran
[Software Engineering] COMPLETE-DOCUMENT DL : 0: document explaning method of Neighbor Table Based Shortcut Tree Routing
Date : Size : 1.31mb User : achutkiran
[Other] timophp DL : 0: 1, PHP5.6+ (support PHP7) 2, PSR standard 3, lightweight, flexible expansion 4, custom exception handling, such as 404 5, the original template parsing 6, the expenditure view component 7, templates support multiple themes, layout (layout) 8, writing app interface is pretty cool 9, join the CLI model expenditure, used to write services, timing scripts, very good 10, increasing dependency injection into service containers to implement loose coupling between components 11, support the database read and write separation settings, can be specific to a table 12, support the controller packet routing to reduce the controller complexity
Date : Size : 91kb User : 高手111
[Other] OASystem DL : 0: angular前端架构，实现表格分页，模糊搜索，表格统计，表格排序，各页面路由，消息提示，表单验证等基础功能(Angular front-end architecture, implementation of table paging, fuzzy search, table statistics, table sorting, page routing, message prompting, form validation, and other basic functions)
Date : Size : 6.21mb User : 入梦
[Other] 概率论 (1) DL : 0: Routing aggregation (also called summary) is out of the way by choosing protocols can use an address notice many networks, the size of the path selection aims to narrow the router table to save memory
Date : Size : 8.77mb User : mmalik
[Other] olsrd-predictive-olsr-smavnet DL : 0: 是olsr协议的改进版本,用于更好实现路由(Optimized Link State Routing (OLSR) protocol is a table-driven proactive routing protocol for wireless mobile ad hoc networks. The key idea behind this protocol is to reduce the control message overheads by marking subset of neighbors as Multi-Point Relays (MPRs). In this paper, we discuss problems of OLSR or other routing protocols that are due to mobility of nodes. We integrate our solutions to OLSR protocol and call it as Position-based OLSR (P-OLSR). Performance evaluation of OLSR and P-OLSR is done through NS simulation. Simulation results show that P-OLSR outperforms OLSR with respect to packet delivery, throughput, latency and normalized overheads)
Date : Size : 20.38mb User : 随便起的名字

« 1 2 ... 5 6 7 8 9 10»