A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Routing stability in congested networks: experimentation and analysis
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A survey on networking games in telecommunications
Computers and Operations Research
An overview of pricing concepts for broadband IP networks
IEEE Communications Surveys & Tutorials
A survey of QoS multicasting issues
IEEE Communications Magazine
A survey of addressing algorithms for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Hi-index | 0.00 |
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.