摘要翻译:
目前的路由方法都是基于网络信息的路由表,路由协议决定如何根据网络的变化来更新路由表。尽管路由表中的数据具有可变性,但节点地址是不变的。在本文中,我们首先引入了可变地址的新概念,从而产生了一个新的框架来处理路由问题的启发式解决方案。在此基础上,我们提出了一种基于基因的启发式路由机制来确定可变地址网络中的网络地址,并描述了该方法如何灵活地解决不同的问题,为解决各种问题提供了新的思路。在ad-hoc网络中,仿真结果更具有支持性,并且针对移动性等问题提出了独创性的解决方案。
---
英文标题:
《A Heuristic Routing Mechanism Using a New Addressing Scheme》
---
作者:
Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud Abbaspour, Hamid
Sarbazi-Azad
---
最新提交年份:
2007
---
分类信息:
一级分类:Computer Science 计算机科学
二级分类:Networking and Internet Architecture 网络和因特网体系结构
分类描述:Covers all aspects of computer communication networks, including network architecture and design, network protocols, and internetwork standards (like TCP/IP). Also includes topics, such as web caching, that are directly relevant to Internet architecture and performance. Roughly includes all of ACM Subject Class C.2 except C.2.4, which is more likely to have Distributed, Parallel, and Cluster Computing as the primary subject area.
涵盖计算机通信网络的所有方面,包括网络体系结构和设计、网络协议和网络间标准(如TCP/IP)。还包括与Internet体系结构和性能直接相关的主题,如web缓存。大致包括除C.2.4以外的所有ACM主题类C.2,后者更有可能将分布式、并行和集群计算作为主要主题领域。
--
一级分类:Computer Science 计算机科学
二级分类:Artificial Intelligence 人工智能
分类描述:Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域,除了视觉、机器人、机器学习、多智能体系统以及计算和语言(自然语言处理),这些领域有独立的学科领域。特别地,包括专家系统,定理证明(尽管这可能与计算机科学中的逻辑重叠),知识表示,规划,和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要:
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network changes. Despite the variability of data in routing tables, node addresses are constant. In this paper, we first introduce the new concept of variable addresses, which results in a novel framework to cope with routing problems using heuristic solutions. Then we propose a heuristic routing mechanism based on the application of genes for determination of network addresses in a variable address network and describe how this method flexibly solves different problems and induces new ideas in providing integral solutions for variety of problems. The case of ad-hoc networks is where simulation results are more supportive and original solutions have been proposed for issues like mobility.
---
PDF链接:
https://arxiv.org/pdf/0710.1924