Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design
- 1 January 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E99.B (3) , 666-674
Abstract
The growth of the size of the routing tables limits the scalability of the conventional IP routing. As scalable routing schemes for large-scale networks are highly demanded, this paper proposes and evaluates an efficient geometric routing scheme and related low-cost node design applicable to large-scale networks. The approach guarantees that greedy forwarding on derived coordinates will result in successful packet delivery to every destination in the network by relying on coordinates deduced from a spanning tree of the network. The efficiency of the proposed scheme is measured in terms of routing quality (stretch) and size of the coordinates. The cost of the proposed router is quantified in terms of area complexity of the hardware design and all the evaluations involve comparison with a state-of-the-art approach with virtual coordinates in the hyperbolic plane. Extensive simulations assess the proposal in large topologies consisting of up to 100K nodes. Experiments show that the scheme has stretch properties comparable to geometric routing in the hyperbolic plane, while enabling a more efficient hardware design, and scaling considerably better in terms of storage requirements for coordinate representation. These attractive properties make the scheme promising for routing in large networks.Keywords
This publication has 15 references indexed in Scilit:
- Experimental validation of resilient tree-based greedy geometric routingComputer Networks, 2015
- Towards Content-Centric Geometric Routing2014
- Experimentation of Geometric Information Routing on Content Locators2014
- Information centric networking in the IoT2014
- Succinct Greedy Geometric Routing Using Hyperbolic GeometryIEEE Transactions on Computers, 2010
- Sustaining the Internet with hyperbolic mappingNature Communications, 2010
- Tree Cover Based Geographic Routing with Guaranteed Delivery2010
- Routing in Wireless Networks with Position Trees2007
- On a conjecture related to geometric routingTheoretical Computer Science, 2005
- GPSR2000