Advanced search
1 file | 1.93 MB

Efficient geometric routing in large-scale complex networks with low-cost node design

Seyedeh Sahel Sahhaf (UGent) , Wouter Tavernier (UGent) , Didier Colle (UGent) , Mario Pickavet (UGent) and Piet Demeester (UGent)
Author
Organization
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
geometric routing, IBCN, greedy forwarding, greedy embedding, spanning tree, large-scale topology, scale-free networks

Downloads

  • 6557.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 1.93 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Sahhaf, Seyedeh Sahel, Wouter Tavernier, Didier Colle, Mario Pickavet, and Piet Demeester. 2016. “Efficient Geometric Routing in Large-scale Complex Networks with Low-cost Node Design.” Ieice Transactions on Communications E99B (3): 666–674.
APA
Sahhaf, S. S., Tavernier, W., Colle, D., Pickavet, M., & Demeester, P. (2016). Efficient geometric routing in large-scale complex networks with low-cost node design. IEICE TRANSACTIONS ON COMMUNICATIONS, E99B(3), 666–674.
Vancouver
1.
Sahhaf SS, Tavernier W, Colle D, Pickavet M, Demeester P. Efficient geometric routing in large-scale complex networks with low-cost node design. IEICE TRANSACTIONS ON COMMUNICATIONS. 2016;E99B(3):666–74.
MLA
Sahhaf, Seyedeh Sahel, Wouter Tavernier, Didier Colle, et al. “Efficient Geometric Routing in Large-scale Complex Networks with Low-cost Node Design.” IEICE TRANSACTIONS ON COMMUNICATIONS E99B.3 (2016): 666–674. Print.
@article{7221214,
  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.},
  author       = {Sahhaf, Seyedeh Sahel and Tavernier, Wouter and Colle, Didier and Pickavet, Mario and Demeester, Piet},
  issn         = {0916-8516},
  journal      = {IEICE TRANSACTIONS ON COMMUNICATIONS},
  keyword      = {geometric routing,IBCN,greedy forwarding,greedy embedding,spanning tree,large-scale topology,scale-free networks},
  language     = {eng},
  number       = {3},
  pages        = {666--674},
  title        = {Efficient geometric routing in large-scale complex networks with low-cost node design},
  url          = {http://dx.doi.org/10.1587/transcom.2015EBP3268},
  volume       = {E99B},
  year         = {2016},
}

Altmetric
View in Altmetric
Web of Science
Times cited: