A Heuristic Routing Mechanism Using a New Addressing Scheme

Simple item page
dc.creatorRavanbakhsh, Mohsen
dc.creatorAbbasi-Yadkori, Yasin
dc.creatorAbbaspour, Maghsoud
dc.creatorSarbazi-Azad, Hamid
dc.date2007-10-10
dc.date.accessioned2026-07-07T08:35:22Z
dc.date.available2026-07-07T08:35:22Z
dc.descriptionCurrent 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.
dc.description8 pages, because of lack of space journal reference just contains the reference to the proceeding
dc.identifierhttps://arxiv.org/abs/0710.1924
dc.identifierhttp://arxiv.org/abs/0710.1924
dc.identifierProceedings of First International Conference on Bio Inspired models of Networks, Information and Computing Systems (BIONETICS), Cavalese, Italy, December 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139723
dc.subjectNetworking and Internet Architecture
dc.subjectArtificial Intelligence
dc.titleA Heuristic Routing Mechanism Using a New Addressing Scheme
dc.typetext

Files

Collections

arXiv