A Heuristic Routing Mechanism Using a New Addressing Scheme

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, because of lack of space journal reference just contains the reference to the proceeding

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Heuristic Routing Mechanism Using a New Addressing Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Heuristic Routing Mechanism Using a New Addressing Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Heuristic Routing Mechanism Using a New Addressing Scheme will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-462490

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.